{
  "journal": "Mathematics of Operations Research",
  "date_from": "2023-01-01",
  "date_to": "2026-07-13",
  "screening_rule": "Include only source-explicit, precisely normalizable unresolved questions, conjectures, unknown complexity classifications, or exact open cases. Inaccessible full text is never a negative screen.",
  "summary": {
    "inventory_items": 515,
    "research_articles": 501,
    "non_research_items": 14,
    "screen_statuses": {
      "inaccessible": 326,
      "not_applicable": 14,
      "screened_full_text": 59,
      "screened_primary_text_extract": 116
    },
    "confirmed_problem_papers": 142,
    "confirmed_problems": 144
  },
  "articles": [
    {
      "doi": "10.1287/moor.2018.0330",
      "title": "The Online Saddle Point Problem and Online Convex Optimization with Knapsacks",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2019.0129",
      "title": "Satiation in Fisher Markets and Approximation of Nash Social Welfare",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W2965273013_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "In addition to deciding existence, can we efficiently find exact equilibria in general (if they exist) or in money-clearing markets?",
          "location": "Section 5 (Future Directions), page 32.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2019.0248",
      "title": "Solving Strong-Substitutes Product-Mix Auctions",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/1909.07313",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 44,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2020.0094",
      "title": "Sample-Path Large Deviations for Unbounded Additive Functionals of the Reflected Random Walk",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2020.0096",
      "title": "Thompson Sampling for the Multinomial Logit Bandit",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2020.0161",
      "title": "Estimating a Function and Its Derivatives Under a Smoothness Condition",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2405.10126",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We conjecture that the conclusions of Corollary 2 hold under a more natural condition that \\(S_n \\to \\sigma^2\\) as \\(n \\to \\infty\\).",
          "location": "Section 7.3 (page 15 of 27 in the provided text) and Remark 4 (page 10 of 27)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2020.0274",
      "title": "Worst-Case Iteration Bounds for Log Barrier Methods on Problems with Nonconvex Constraints",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2020.0282",
      "title": "Invariant States of Hydrodynamic Limits of Randomized Load-Balancing Networks",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4411787576_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Whereas this is a non-trivial problem that is relegated to future work, it is encouraging that analogous results have been recently established for a related",
          "location": "Section 1.1 (Introduction), page 3.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2020.0299",
      "title": "Probabilistic Analysis of Edge Elimination for Euclidean TSP",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2020.0334",
      "title": "Dynamic Resource Allocation: The Geometry and Robustness of Constant Regret",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2020.0388",
      "title": "A Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://escholarship.org/content/qt3083d90j/qt3083d90j.pdf",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "A question arising from Theorem 8 is whether there is a linear time implementation of \\(\\mathrm{bud}^*\\) in the pointer model.",
          "location": "Section 9.3, Remark 9 (page 2044), and Section 10, final open question (page 2046).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2020.0393",
      "title": "Difference-of-Convex Algorithm with Extrapolation for Nonconvex, Nonsmooth Optimization Problems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0051",
      "title": "Diffusion-Based Staffing for Multitasking Service Systems with Many Servers",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://pure.tue.nl/ws/files/353472757/storm-et-al-2023-diffusion-based-staffing-for-multitasking-service-systems-with-many-servers.pdf",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "remains_to"
          ],
          "page": 35,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "open_problem"
          ],
          "page": 40,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.0068",
      "title": "Variance-Reduced Accelerated First-Order Methods: Central Limit Theorems and Confidence Statements",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0076",
      "title": "Towards Optimal Problem Dependent Generalization Error Bounds in Statistical Learning Theory",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0082",
      "title": "Stationary Points of a Shallow Neural Network with Quadratic Activations and the Global Optimality of the Gradient Descent Algorithm",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0097",
      "title": "Parametric Semidefinite Programming: Geometry of the Trajectory of Solutions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0117",
      "title": "Online Learning of Independent Cascade Models with Node-Level Feedback",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0129",
      "title": "Binary Extended Formulations and Sequential Convexification",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://www.research.unipd.it/bitstream/11577/3515481/3/Submitted_BinaryExtendedFormulationsSequentialConvexification.pdf",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We do not know whether \\(B_U(d)\\) is optimal with respect to all binarizations that are isomorphic to a \\(d\\)-simplex.",
          "location": "Section 5 (Conclusion), page 17.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.0133",
      "title": "Many-Server Asymptotics for Join-the-Shortest-Queue in the Super-Halfin-Whitt Scaling Window",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0148",
      "title": "Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0154",
      "title": "A Stochastic Sequential Quadratic Optimization Algorithm for Nonlinear-Equality-Constrained Optimization with Rank-Deficient Jacobians",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W3176856692_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "However, it remains an open question whether it is possible to obtain a similar guarantee if/when a subsequence of stochastic gradient estimates diverges.",
          "location": "Section 4.4 (Complementary Events), page 25.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.0157",
      "title": "Exploration Noise for Learning Linear-Quadratic Mean Field Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0160",
      "title": "Weak Approachability of Convex Sets in Absorbing Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0161",
      "title": "Asymptotically Optimal Control of Make-to-Stock Systems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0167",
      "title": "Fast Rates for the Regret of Offline Reinforcement Learning",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0173",
      "title": "Minimization Fractional Prophet Inequalities for Sequential Procurement",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0179",
      "title": "Managing Customer Churn via Service Mode Control",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0186",
      "title": "Quickest Detection Problems for Ornstein–Uhlenbeck Processes",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://pure.manchester.ac.uk/ws/files/282166957/Manuscript.pdf",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "conjecture"
          ],
          "page": 3,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 6,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 7,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.0194",
      "title": "Stochastic Subgradient Descent Escapes Active Strict Saddles on Weakly Convex Functions",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://hal.science/hal-03442137v3/file/tame.pdf",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Thus, the question of the generic convergence of SGD toward local minimizers remains open in the non-weakly convex setting.",
          "location": "Section 5.2 (Further Topics), pages 14–16; see also Remark 4 on pages 16–17.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.0199",
      "title": "Fair-Share Allocations for Agents with Arbitrary Entitlements",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W3135365769_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Finding the best approximation is open even for the case of equal entitlements.",
          "location": "Page 5, Introduction (paragraph after Theorem 1.3); reiterated page 5 (after Theorem 1.4) and page 23, Section 6.3 (Open Questions, items 2–3).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.0202",
      "title": "Corruption-Robust Exploration in Episodic Reinforcement Learning",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0212",
      "title": "Learning and Balancing Unknown Loads in Large-Scale Systems",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4396625954_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "In particular, the arguments used in Section 5.3 to establish this property in the case of exponentially distributed service times cannot be easily extended to",
          "location": "Page 21, Section 4.3 (Extensions)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.0237",
      "title": "Robust Multiple Stopping—A Duality Approach",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0241",
      "title": "An Approximation to the Invariant Measure of the Limiting Diffusion of G/Ph/n + GI Queues in the Halfin–Whitt Regime and Related Asymptotics",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0243",
      "title": "Multilevel Langevin Pathwise Average for Gibbs Approximation",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2109.07753",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 2,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 8,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 11,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "open_problem"
          ],
          "page": 14,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.0252",
      "title": "Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4388912937_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "better upper bounds on \\(R(d)\\) is a natural combinatorial question, and better upper bounds to \\(R(d)\\) imply the existence of better relaxations of EFX allocations.",
          "location": "Page 5, end of Section 1.2 (immediately after the discussion of \\(R(2)\\le 2\\)); reiterated on page 16 right after Theorem 6 in Section 5.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.0258",
      "title": "Minimizing Compositions of Differences-of-Convex Functions with Smooth Mappings",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0269",
      "title": "Oriented Calmness and Sweeping Process Dynamics",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0281",
      "title": "Compact Extended Formulations for Low-Rank Functions with Indicator Variables",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0283",
      "title": "Limit Theorems for Default Contagion and Systemic Risk",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://inria.hal.science/hal-03429191/document",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.0286",
      "title": "Probabilistic Bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4385350470_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "A natural question is whether this constant \\(\\beta_{\\mathrm{TSP}}\\) is tight.",
          "location": "Page 29, Section 6 (Conclusion).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.0293",
      "title": "Convergence Analysis of Accelerated Stochastic Gradient Descent Under the Growth Condition",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4389389242_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "bound analysis on \\(\\delta\\), it is unclear whether the condition of having a small \\(\\delta\\) for different methods is necessary for acceleration; and how sharp",
          "location": "Page 27, Section 7 (Conclusion)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.0302",
      "title": "Submodular Functions and Perfect Graphs",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0317",
      "title": "V-Learning—A Simple, Efficient, Decentralized Algorithm for Multiagent Reinforcement Learning",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0320",
      "title": "Zero-One Composite Optimization: Lyapunov Exact Penalty and a Globally Convergent Inexact Augmented Lagrangian Method",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0338",
      "title": "Inner Moreau Envelope of Nonsmooth Conic Chance-Constrained Optimization Problems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.0345",
      "title": "On the Simplex Method for 0/1-Polytopes",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W3217714619_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Question 2.",
          "location": "Page 28, Section 4 (Conclusions, Connections, and Comparisons)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2021.1176",
      "title": "Bridging Bayesian and Minimax Mean Square Error Estimation via Wasserstein Distributionally Robust Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.148",
      "title": "Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.161",
      "title": "Asymptotically Optimal Control of Make-to-Stock Systems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2021.173",
      "title": "Minimization Fractional Prophet Inequalities for Sequential Procurement",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4379646686_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We leave it as an open question to analytically resolve the competitive ratio.",
          "location": "Page 6, Section 1.3 (Our results) and reiterated Page 18, Section 4.2 (More than two sellers)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0009",
      "title": "The Complexity of Pacing for Second-Price Auctions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0011",
      "title": "Rate-Optimal Bayesian Simple Regret in Best Arm Identification",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0016",
      "title": "On the Impossibility of Convergence of Mixed Strategies with Optimal No-Regret Learning",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4404109711_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We conjecture below that last-iterate oscillations will continue to hold for mean-based strategies that are not monotonic.",
          "location": "Section 3.5 (\"Beyond the monotonicity assumption: A conjecture\"), page 24-25; Conjecture 3.12. Also reiterated as a main future-work question in Section 5 (Conclusion), page 29.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0017",
      "title": "A Localized Progressive Hedging Algorithm for Solving Nonmonotone Stochastic Variational Inequalities",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0022",
      "title": "Investment Timing and Technological Breakthroughs",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0031",
      "title": "The Secretary Problem with Predictions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0044",
      "title": "Extension of Additive Valuations to General Valuations on the Existence of EFX",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W3186360956_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It is not known whether EFX allocations always exist even when \\(n = 3\\) for general valuations.",
          "location": "Page 2, Introduction (discussion of prior work and open status of EFX existence for general valuations)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0055",
      "title": "Mean-Field Multiagent Reinforcement Learning: A Decentralized Network Approach",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0057",
      "title": "The Iterates of the Frank–Wolfe Algorithm May Not Converge",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://hal.science/hal-03579585/document",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 2,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0058",
      "title": "Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4389193896_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Theorems 4.5 and 4.7 leave an open question on the MMS guarantee that the equilibria of mechanisms that always have PNE and these are EFX.",
          "location": "Page 22, Section 5 (Discussion)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0080",
      "title": "Zero-Sum Mean-Field Dynkin Games: Characterization and Convergence",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2202.02126",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0085",
      "title": "Procuring Unverifiable Information",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0086",
      "title": "Network Revenue Management with Nonparametric Demand Learning: T-Regret and Polynomial Dimension Dependency",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0092",
      "title": "Shapley–Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2102.00167",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "As the main open question we left open whether the respecting improvement property with regard to the best allotment holds for a) the core for",
          "location": "Conclusion, page 34, Section 6",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0097",
      "title": "Improved Approximations for a CVRP with Unsplittable Demands",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2111.08138",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0100",
      "title": "Scheduling in the High-Uncertainty Heavy Traffic Regime",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0101",
      "title": "Linear Program-Based Policies for Restless Bandits: Necessary and Sufficient Conditions for (Exponentially Fast) Asymptotic Optimality",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://inria.hal.science/hal-03262307v4/file/LP_finite_infinite.pdf",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We actually conjecture that for “essentially all” degenerate RBs, if \\(\\pi\\) is a LP-compatible policy, then there exists constants \\(C, C>0\\) independent of \\(N\\) such",
          "location": "Section 4.3.2 (page 16–18, around the end of the section containing 'We actually conjecture that ...')",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0104",
      "title": "Bounds on the Optimal Radius When Covering a Set with Minimum Radius Identical Disks",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0121",
      "title": "Joint Mixability and Notions of Negative Dependence",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4391315199_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "These observations seem to hint at the possible optimality of some exchangeable joint mix for general convex cost under uncertainty, but we do not have",
          "location": "Section 6 (Conclusion), page 19 (in the provided parsed text; labeled page 19/32).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0122",
      "title": "Rockafellian Relaxation and Stochastic Optimization Under Perturbations",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0131",
      "title": "Simple and Explicit Bounds for Multiserver Queues with 1/1−ρ Scaling",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4393423947_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Conjecture 1.",
          "location": "Page 22, Section 3 (\"Towards bounds with no large prefactors\"), immediately after Theorem 9 (Conjecture 1).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0134",
      "title": "Robustness of Stochastic Optimal Control to Approximate Diffusion Models Under Several Cost Evaluation Criteria",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4387578519_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It would be an interesting problem to investigate if such results can be proved in the cases when the limiting system (actual system) is a",
          "location": "Page 31, Section 8 (Conclusion)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0135",
      "title": "Optimal Error Bounds in the Absence of Constraint Qualifications with Applications to p-Cones and Beyond",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0136",
      "title": "A Retrospective Approximation Approach for Smooth Stochastic Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0139",
      "title": "A Policy Gradient Algorithm for the Risk-Sensitive Exponential Cost MDP",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4392646050_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "An interesting open question is to show that this sequence satisfies the conditions provided in our main theorem.",
          "location": "Page 12, Section 7 (Conclusion).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0145",
      "title": "Exact Characterization of the Jointly Optimal Restocking and Auditing Policy in Inventory Systems with Record Inaccuracy",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0149",
      "title": "Zero-Sum Games and Linear Programming Duality",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://researchonline.lse.ac.uk/id/eprint/120779/1/Zero_Sum_Games_and_Linear_Programming.pdf",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "conjecture"
          ],
          "page": 2,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0153",
      "title": "Strongly Convergent Homogeneous Approximations to Inhomogeneous Markov Jump Processes and Applications",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://curis.ku.dk/ws/files/384353006/Strongly_convergent.pdf",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 21,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0156",
      "title": "Extreme-Case Distortion Risk Measures: A Unification and Generalization of Closed-Form Solutions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0161",
      "title": "Convergence and Stability of Coupled Belief-Strategy Learning Dynamics in Continuous Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0162",
      "title": "An Stochastic Differential Equation Perspective on Stochastic Convex Optimization",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4405639491_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Which leads us to make the following conjecture: Conjecture 4.11.",
          "location": "Page 23, Section 4.2 (Remark 4.10 and Conjecture 4.11).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0163",
      "title": "Dynamic Pricing Provides Robust Equilibria in Stochastic Ridesharing Networks",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0171",
      "title": "Persistency in Multilinear Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0172",
      "title": "Combining a Smart Pricing Policy with a Simple Replenishment Policy: Managing Uncertainties in the Presence of Stochastic Purchase Returns",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0174",
      "title": "A Mean-Field Control Problem of Optimal Portfolio Liquidation with Semimartingale Strategies",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0179",
      "title": "Finite-Time High-Probability Bounds for Polyak–Ruppert Averaged Iterates of Linear Stochastic Approximation",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0180",
      "title": "A Perturbation Framework for Convex Minimization and Monotone Inclusion Problems with Nonlinear Compositions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0188",
      "title": "On Strategic Measures and Optimality Properties in Discrete-Time Stochastic Control with Universally Measurable Policies",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0193",
      "title": "A Momentum-Based Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0198",
      "title": "Finding Hall Blockers by Matrix Scaling",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4387738269_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It is a natural question whether the operator Sinkhorn algorithm can find a Hall blocker for nonscalable case.",
          "location": "Page 3, Introduction (discussion of operator scaling extension and problem raised in prior work)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0200",
      "title": "Asymptotic Consistency for Nonconvex Risk-Averse Stochastic Optimization with Infinite-Dimensional Decision Spaces",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0201",
      "title": "Rank-One Boolean Tensor Factorization and the Multilinear Polytope",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4400454886_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We believe that obtaining recovery guarantees for the complete LP is an interesting open question.",
          "location": "Page 4, Section 1.4 (Our contribution).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0202",
      "title": "Interim Rationalizable Implementation of Functions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0206",
      "title": "Tight Bounds for Secretary Matching in General Graphs",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4404717018_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It remains an interesting problem whether there is a poly-time online algorithm that matches this bound of 1{4.",
          "location": "Page 6, Section 1.1 (Edge arrival techniques discussion); and reiterated Page 23, Remark after Theorem 5.2.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0215",
      "title": "Large Independent Sets in Recursive Markov Random Graphs",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4400583097_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Question 1.",
          "location": "Section 2.2 Discussion, page 7",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0216",
      "title": "Is Pessimism Provably Efficient for Offline Reinforcement Learning?",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0223",
      "title": "A Dynamic Principal-Agent Problem with One-Sided Commitment",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0225",
      "title": "Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0226",
      "title": "Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0230",
      "title": "The Competition Complexity of Dynamic Pricing",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0241",
      "title": "Stochastic First-Order Methods for Average-Reward Markov Decision Processes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0242",
      "title": "Online Bipartite Matching with Reusable Resources",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4387615605_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "The main problem left unanswered in our paper is whether one can obtain the competitive ratio of \\(1 - 1/e\\) for OBMRR.",
          "location": "Page 27, Section 5 (Conclusion), paragraph titled “problems”",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0245",
      "title": "Convergence Rates for Regularized Optimal Transport via Quantization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0246",
      "title": "Fluctuation Theory of Continuous-Time, Skip-Free Downward Markov Chains with Applications to Branching Processes with Immigration",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0250",
      "title": "Opinion Dynamics on Directed Complex Networks",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0251",
      "title": "On a Network Centrality Maximization Game",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0254",
      "title": "Finite Approximations of the Sion–Wolfe Game",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0256",
      "title": "Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W3171990983_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We leave it as an open question whether a \\((1 - 1/e)\\)-selectable Random-order Contention Resolution Scheme is possible under property (2).",
          "location": "Page 6, end of Subsection 1.2 (\"Reinterpretation as contention resolution under negative correlation\")",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0257",
      "title": "Fair Shares: Feasibility, Domination, and Incentives",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4401117667_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Finally, we note that we leave open the problem of finding (for additive valuations, and also beyond this class), the largest value of \\(\\rho\\) for",
          "location": "Page 7, Section 1.2 (Our Results), end of paragraph discussing [GT20] and Theorem 3; reiterated Page 26, Section 7 (Discussion), final paragraph.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0259",
      "title": "Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4389673940_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Resolving the complexity of this variant of the hypergraph k-partitioning problem for \\(k \\ge 5\\) remains open.",
          "location": "Page 24, Section 7 (Conclusion)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0266",
      "title": "Online Estimation and Optimization of Utility-Based Shortfall Risk",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W3214544052_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Third, it remains open to extend our finite sample bounds to the estimator of multivariate shortfall risk measure (MSRM) [2].",
          "location": "Page 33, Section 9 (Concluding Remarks and Future Work).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0270",
      "title": "Dual Solutions in Convex Stochastic Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0275",
      "title": "Minimal-Access Rights in School Choice and the Deferred Acceptance Mechanism",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://iris.unil.ch/bitstreams/724c9016-c02f-4573-a542-652a6c5d6bf5/download",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0280",
      "title": "Steiner Cut Dominants",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4393233856_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Therefore, one might ask the question whether every irreducible facet defining Steiner cut inequality for \\(\\mathrm{CUT}^+(G, T)\\) in fact is valid (and thus facet defining)",
          "location": "Section 9 (Conclusion), paragraph titled 'Upwards validity', page 22 (of 24 in the provided text)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0283",
      "title": "Square-Root Regret Bounds for Continuous-Time Episodic Markov Decision Processes",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4407408247_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "of learning algorithms, it remains a significant open question whether one can improve the dependence of these bounds on \\(S\\), \\(H\\) and \\(\\lambda_{\\max}\\) to narrow",
          "location": "Page 14, Section 4 (Main Results), discussion immediately after Theorem 2.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0284",
      "title": "On the Convex Formulations of Robust Markov Decision Processes",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4400685310_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "First, it may be possible to obtain exact formulations for RMDPs, not based on regularization, for specific uncertainty sets such as \\(\\ell_p\\)-balls or \\(\\phi\\)-divergence balls",
          "location": "Section 1 (Introduction), page 2; reiterated in Section 7 (Conclusion), page 22.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0285",
      "title": "Exit Game with Private Information",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0286",
      "title": "A Riemannian Smoothing Steepest Descent Method for Non-Lipschitz Optimization on Embedded Submanifolds of Rn",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0289",
      "title": "The Cost of Nonconvexity in Deterministic Nonsmooth Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0294",
      "title": "Alternating and Parallel Proximal Gradient Methods for Nonsmooth, Nonconvex Minimax: A Unified Convergence Analysis",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0298",
      "title": "Analysis of the Primal-Dual Central Path for Nonlinear Semidefinite Optimization Without the Nondegeneracy Condition",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4411957271_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We have the following conjecture: \\[\\lim_{\\mu\\to 0} \\dot{x}(\\mu) = \\xi^{\\ast},\\] where \\(\\xi^{\\ast}\\) was defined in Proposition 5.",
          "location": "Section 4 (Concluding remarks and future work), page 19.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0304",
      "title": "O’Neill’s Theorem for Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0305",
      "title": "Is There a Golden Parachute in Sannikov’s Principal–Agent Problem?",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4226226337_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "> 1\\), it is unclear in general whether \\(y_{gp}\\) is finite or not, and we do not have sufficient conditions under which it is (though",
          "location": "Page 9, Remark 3.5(iii) (end of Section 3.1, before Section 3.2).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0306",
      "title": "A Polynomial-Time Algorithm for the Probabilistic Profitable Tour Problem on a Tree",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0307",
      "title": "Langevin Dynamics Based Algorithm e-THεO POULA for Stochastic Optimization Problems with Discontinuous Stochastic Gradient",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0312",
      "title": "Cash-Subadditive Risk Measures Without Quasi-Convexity",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0317",
      "title": "(No-)Betting Pareto Optima Under Rank-Dependent Utility",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0320",
      "title": "On Constrained Mixed-Integer DR-Submodular Minimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0324",
      "title": "Strategy-Proof Multidimensional Mechanism Design",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0326",
      "title": "Unbiased Time-Average Estimators for Markov Chains",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0328",
      "title": "Robust Faber–Schauder Approximation Based on Discrete Observations of an Antiderivative",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0330",
      "title": "Certainty-Equivalent Pricing with Dependent Demand and Limited Price-Changing Opportunities",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0331",
      "title": "Comparison Between Mean-Variance and Monotone Mean-Variance Preferences Under Jump Diffusion and Stochastic Factor Model",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0332",
      "title": "Value-Positivity for Matrix Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0334",
      "title": "Nash Equilibrium Problems of Polynomials",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4384342505_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "However, the convergence property of Algorithm 3.1 is not known when there are infinitely many KKT points.",
          "location": "Section 6 (Conclusions and Discussions), page 26 (arXiv v2 pdf pagination), near the end of the section beginning 'There is much interesting future work to do.'",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0335",
      "title": "Proximity and Flatness Bounds for Linear Integer Optimization",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4389224571_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It is open whether the lattice width of lattice-free polytopes can be bounded solely by \\(\\Delta_n(A)\\).",
          "location": "Page 3, Introduction (discussion following Theorem 4)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0342",
      "title": "Order Independence in Sequential, Issue-by-Issue Voting",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4400583084_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We conjecture that the outcome of sequential issue-by-issue voting is then necessarily order dependent.",
          "location": "Page 23, Section 5 (end of the proof of Proposition 3, immediately before Proposition 4).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0345",
      "title": "The I.I.D. Prophet Inequality with Limited Flexibility",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0350",
      "title": "Envy-Free Division of Multilayered Cakes",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4402128674_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "However, it is still an open question whether or not a counterexample exists for some natural valuation functions.",
          "location": "Page 25, Section 6 (Concluding remarks), paragraph beginning “Limitation of the approach based on Volovikov’s theorem.”",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0351",
      "title": "A Class of Dissimilarity Semimetrics for Preference Relations",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4388047886_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "+ 2 - 2^{\\lfloor n/2 \\rfloor} - 2^{\\lceil n/2 \\rceil}.\\) We do not presently know whether or not either of these inequalities hold as equalities.",
          "location": "Section 4, page 25 (end of Section 4, after Table 1)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0352",
      "title": "How to Design a Stable Serial Knockout Competition",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://pure.tue.nl/ws/files/360156142/lambers-et-al-2024-how-to-design-a-stable-serial-knockout-competition.pdf",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "\\(n = 2^k > 8\\) players, we do not know whether there exist stable SKCs that are inequivalent to the ones that we construct in",
          "location": "Page 13, end of Section 5.2 (after Theorem 3) and reiterated in Section 7 (Discussion), page 14.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0355",
      "title": "Flow Allocation Games",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4391111008_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It is unclear whether the problem of deciding existence of a pure Nash equilibrium in an edge-ranking game is in NP or not, due to",
          "location": "Section 5.1, Remark 21 (page 38 in the provided text pagination)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.0356",
      "title": "Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.0357",
      "title": "Correlated Equilibria for Mean Field Games with Progressive Strategies",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1251",
      "title": "Prophet Inequality for Bipartite Matching: Merits of Being Simple and Nonadaptive",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1252",
      "title": "Game on Random Environment, Mean-Field Langevin System, and Neural Networks",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1253",
      "title": "Coordinate Descent Without Coordinates: Tangent Subspace Descent on Riemannian Manifolds",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1254",
      "title": "Necessary and Sufficient Conditions for Rank-One-Generated Cones",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1255",
      "title": "Guarantees in Fair Division: General or Monotone Preferences",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1256",
      "title": "Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1257",
      "title": "Stochastic Approximation Proximal Method of Multipliers for Convex Stochastic Programming",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1258",
      "title": "Load Balancing Under Strict Compatibility Constraints",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1259",
      "title": "Robust Markov Decision Processes: Beyond Rectangularity",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1260",
      "title": "Equipartition of a Segment",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1261",
      "title": "Diffusion of New Products with Heterogeneous Consumers",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1262",
      "title": "Power Forward Performance in Semimartingale Markets with Stochastic Integrated Factors",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1263",
      "title": "The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1264",
      "title": "New Constructions of Obviously Strategyproof Mechanisms",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1265",
      "title": "The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1266",
      "title": "Optimistic Posterior Sampling for Reinforcement Learning: Worst-Case Regret Bounds",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1267",
      "title": "The Big Match with a Clock and a Bit of Memory",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1268",
      "title": "Learning Zero-Sum Simultaneous-Move Markov Games Using Function Approximation and Correlated Equilibrium",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1269",
      "title": "Modelling Multiperiod Carbon Markets Using Singular Forward-Backward SDEs",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1270",
      "title": "Lipschitz Bernoulli Utility Functions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1271",
      "title": "Pandora’s Box Problem with Order Constraints",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1272",
      "title": "Existence and Complexity of Approximate Equilibria in Weighted Congestion Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1273",
      "title": "A Convex Form That Is Not a Sum of Squares",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1274",
      "title": "A General Framework for Learning Mean-Field Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1275",
      "title": "Distributionally Robust Stochastic Optimization with Wasserstein Distance",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1276",
      "title": "Dynamic Optimal Reinsurance and Dividend Payout in Finite Time Horizon",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1277",
      "title": "Random Perfect Information Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1278",
      "title": "Contingent Capital with Stock Price Triggers in Interbank Networks",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1279",
      "title": "A Classical Search Game in Discrete Locations",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1280",
      "title": "Many-Server Queues with Random Service Rates: A Unified Framework Based on Measure-Valued Processes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1281",
      "title": "Approximation and Convergence of Large Atomic Congestion Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1282",
      "title": "Linear Programming and Community Detection",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1283",
      "title": "Multiagent Online Learning in Time-Varying Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1284",
      "title": "A Sparse Version of Reznick’s Positivstellensatz",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1285",
      "title": "Strong Convexity of Feasible Sets in Off-line and Online Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1286",
      "title": "Repeated Games with Incomplete Information over Predictable Systems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1287",
      "title": "Stochastic Optimization with Decision-Dependent Distributions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1288",
      "title": "On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2002.03764",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "manually confirmed source-explicit unresolved statement"
          ],
          "quote": "However, in general it is conjectured that the Anderson-Weber strategy is asymptotically optimum",
          "location": "Page 3, Introduction",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.1289",
      "title": "Edge-Weighted Online Windowed Matching",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1290",
      "title": "Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1291",
      "title": "Stable Bounds on the Duality Gap of Separable Nonconvex Optimization Problems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1292",
      "title": "A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1293",
      "title": "Overbooking with Bounded Loss",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1294",
      "title": "Liquidity Provision with Adverse Selection and Inventory Costs",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1295",
      "title": "Sums of Separable and Quadratic Polynomials",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1296",
      "title": "Optimality of Independently Randomized Symmetric Policies for Exchangeable Stochastic Teams with Infinitely Many Decision Makers",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1297",
      "title": "Mean Field Contest with Singularity",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1298",
      "title": "On Singular Control for Lévy Processes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1299",
      "title": "Maximum Spectral Measures of Risk with Given Risk Factor Marginal Distributions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1300",
      "title": "Many-Server Heavy-Traffic Limits for Queueing Systems with Perfectly Correlated Service and Patience Times",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1301",
      "title": "Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1302",
      "title": "Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1303",
      "title": "Fair Integral Network Flows",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1305",
      "title": "Exactness Conditions for Semidefinite Programming Relaxations of Generalization of the Extended Trust Region Subproblem",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1306",
      "title": "Solving Optimal Stopping Problems via Randomization and Empirical Dual Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1307",
      "title": "An Equilibrium Model for the Cross Section of Liquidity Premia",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1308",
      "title": "On Integer Programming, Discrepancy, and Convolution",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1309",
      "title": "Provably Efficient Reinforcement Learning with Linear Function Approximation",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1310",
      "title": "Truthfulness of a Network Resource-Sharing Protocol",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1311",
      "title": "Regret Analysis of a Markov Policy Gradient Algorithm for Multiarm Bandits",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1312",
      "title": "Exact Optimal Stopping for Multidimensional Linear Switching Diffusions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1313",
      "title": "Contextual Bandits with Cross-Learning",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1314",
      "title": "Risk-Averse Optimal Control in Continuous Time by Nesting Risk Measures",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1315",
      "title": "A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1316",
      "title": "A Unifying Framework for Submodular Mean Field Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1317",
      "title": "From Perspective Maps to Epigraphical Projections",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1318",
      "title": "Convergence of a Packet Routing Model to Flows over Time",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1319",
      "title": "Optimization Under Rational Expectations: A Framework of Fully Coupled Forward-Backward Stochastic Linear Quadratic Systems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1320",
      "title": "A Generalized Newton Method for Subgradient Systems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1321",
      "title": "Approximate Nash Equilibria in Large Nonconvex Aggregative Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1322",
      "title": "Sampling from the Gibbs Distribution in Congestion Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1330",
      "title": "Generalization Bounds in the Predict-Then-Optimize Framework",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W2947637889_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "[17] to an arbitrary norm setting (or even the case of general \\(\\ell_q\\)-norms) remains an open question that would have interesting applications to our framework.",
          "location": "Page 2, Introduction (discussion following margin-based bounds and contraction lemmas); reiterated on page 8, start of Section 4.2 (margin-based generalization bounds).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.1335",
      "title": "A General Framework for Bandit Problems Beyond Cumulative Objectives",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1336",
      "title": "The Price of Anarchy for Instantaneous Dynamic Equilibria",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2007.07794",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "manually confirmed source-explicit unresolved statement"
          ],
          "quote": "While this conjecture is widely believed to be true, it still remains unproven to this day.",
          "location": "Page 7, discussion of the dynamic-equilibrium monotonicity conjecture",
          "review_disposition": "confirmed_problem"
        },
        {
          "matched_phrases": [
            "manually confirmed source-explicit unresolved statement"
          ],
          "quote": "whether a finite number of such extensions is enough to compute a complete equilibrium flow is still open for dynamic equilibria",
          "location": "Page 34, Conclusions and Open Questions",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.1337",
      "title": "Optimal Relative Performance Criteria in Mean-Field Contribution Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1338",
      "title": "Reduction of Potential-Based Flow Networks",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1342",
      "title": "An Adaptive Lagrangian-Based Scheme for Nonconvex Composite Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1343",
      "title": "Monotone Inclusions, Acceleration, and Closed-Loop Control",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1344",
      "title": "Error Analysis of Surrogate Models Constructed Through Operations on Submodels",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1345",
      "title": "A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1346",
      "title": "Constrained Information Design",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/1811.03588",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2022.1347",
      "title": "On the Douglas–Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1348",
      "title": "Conditional Uniformity and Hawkes Processes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1349",
      "title": "Online Generalized Network Design Under (Dis)Economies of Scale",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2022.1350",
      "title": "A First-Order Primal-Dual Method for Nonconvex Constrained Optimization Based on the Augmented Lagrangian",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0001",
      "title": "Convexification of Bilinear Terms over Network Polytopes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0008",
      "title": "Information Design and Sharing in Supply Chains",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0010",
      "title": "Parabolic Regularity of Spectral Functions",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4401514485_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "While this remains an open question for now and will be a subject of our future research, we show by an example below the possible",
          "location": "Section 5 (discussion immediately after Proposition 5.4), page 25.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0012",
      "title": "A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4387617469_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It remains open whether \\(O(1)\\)-multiplicative violations are possible.",
          "location": "Page 3, Introduction (discussion of prior work on laminar cut constraints following results of Bansal et al. and Olver–Zenklusen).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0015",
      "title": "Uniqueness of Convex-Ranged Probabilities and Applications to Risk Measures and Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0019",
      "title": "Boole’s Probability Bounding Problem, Linear Programming Aggregations, and Nonnegative Quadratic Pseudo-Boolean Functions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0021",
      "title": "Confidence Intervals for Piecewise Normal Distributions and Stochastic Variational Inequalities",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0022",
      "title": "The Privacy Paradox and Optimal Bias–Variance Trade-offs in Data Acquisition",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4390763638_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Thus, an important problem motivated by our work is: what approaches can be brought to bear to mitigate the impact of information leakage and the",
          "location": "Page 15, Section 5 (Concluding Remarks)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0029",
      "title": "Variational Inequalities on Unbounded Domains for Zero-Sum Singular Controller vs. Stopper Games",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2203.06247",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Uniqueness of the solution to Problem A remains an open question.",
          "location": "Page 7, Section 3 (Remark 3.5).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0035",
      "title": "Optimal Partition for a Multi-Type Queueing System",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4226364838_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "the joint assignment and partition problem, we conjecture that under Assumption 1 it is optimal to assign customers with consecutive service rates to the same",
          "location": "Page 34, Section 5 (Extension: Analysis of Sojourn Time), near the discussion following Theorem 8; reiterated in Section 6 (Concluding Remarks) on page 35.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0044",
      "title": "Efficiency of Stochastic Coordinate Proximal Gradient Methods on Nonseparable Composite Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0046",
      "title": "Semidefinite Approximations for Bicliques and Bi-Independent Pairs",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4392748341_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Hence, finding a stronger closed-form bound for \\(\\alpha_{\\mathrm{bal}}(G)\\) that is able to take advantage of the restriction to balanced independent sets remains a problem.",
          "location": "Section 7 (Concluding remarks), page 34.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0050",
      "title": "Load Balancing in Parallel Queues and Rank-Based Diffusions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0054",
      "title": "A Characterization of Simultaneous Optimization, Majorization, and (Bi-)Submodular Polyhedra",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4391954556_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Thus, it is interesting to investigate whether the existence of least \\((a, b)\\)-majorized elements for specific (sets of) values of \\(a\\) and \\(b\\) can be",
          "location": "Page 25, Section 7 (Conclusions and directions for future research), item 1 in the numbered list of future directions.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0055",
      "title": "Scarf’s Algorithm and Stable Marriages",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4410395976_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Second, it would be interesting to understand whether Scarf’s algorithm converges in polynomial time on the bipartite matching polytope for any ordinal matrix C.",
          "location": "Section 8 (Conclusions and Future Work), page 35.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0060",
      "title": "How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices?",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W3080982993_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "A natural question remains unsettled whether \\(E[U] = O(1)\\) requires \\(d(i) = \\Omega(t_{\\mathrm{hit}}(i))\\) for any RWoGG \\((d,(G(i))_{i\\ge 1},(P^{(i)})_{i\\ge 1})\\).",
          "location": "Page 5 (end of Section 1.2, discussion after Theorem 1.3) and Page 23, Section 5 Concluding Remarks.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0065",
      "title": "A Machine Learning Method for Stackelberg Mean Field Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0068",
      "title": "A Riemannian Alternating Direction Method of Multipliers",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4405624370_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "How to design ADMM for solving (1) without smoothing remains an open question for future work.",
          "location": "Page 20, Section 5 (Conclusion)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0076",
      "title": "Optimal Investment Strategy for α-Robust Utility Maximization Problem",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.008",
      "title": "Information Design and Sharing in Supply Chains",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0080",
      "title": "Polynomial Voting Rules",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4391601457_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It remains open to prove such bounds in the range \\((\\lambda_-(\\alpha), \\lambda_+(\\alpha))\\); and once proved, the result will also imply the almost sure convergence of",
          "location": "Appendix, Section 5.1 (page 20).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0081",
      "title": "On the (Im-)Possibility of Representing Probability Distributions as a Difference of I.I.D. Noise Terms",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0090",
      "title": "Fluid Limits for Longest Remaining Time First Queues",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0092",
      "title": "The Core of Housing Markets from an Agent’s Perspective: Is It Worth Sprucing up Your Home?",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://real.mtak.hu/204566/1/core-mor.pdf",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "open_question"
          ],
          "page": 4,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "open_problem"
          ],
          "page": 6,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "remains_open"
          ],
          "page": 28,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "remains_open"
          ],
          "page": 29,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0098",
      "title": "Join-the-Shortest Queue with Abandonment: Critically Loaded and Heavily Overloaded Regimes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0102",
      "title": "Optimal Ratcheting of Dividends with Capital Injection",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0106",
      "title": "Quantitative Convergence for Displacement Monotone Mean Field Games with Controlled Volatility",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0112",
      "title": "Equilibrium Portfolio Selection for Smooth Ambiguity Preferences",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0114",
      "title": "Hidden Convexity, Optimization, and Algorithms on Rotation Matrices",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4400196985_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Conjecture 1.",
          "location": "Page 29, Section 8 (Summary and open questions), paragraph 'Convex coordinate projections'",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0116",
      "title": "Robust-to-Dynamics Optimization",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W2800787305_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "In higher dimensions, however, decidability is unknown even in the special case where the input polyhedron is a single halfspace.",
          "location": "Section 4 (Future directions and a broader agenda), page 34",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0119",
      "title": "Optimal Consumption and Investment with Independent Stochastic Labor Income",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0123",
      "title": "Nonzero-Sum Optimal Stopping Game with Continuous vs. Periodic Exercise Opportunities",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://discovery.ucl.ac.uk/10194549/1/Perez-Rodosthenous-Yamazaki.pdf",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0127",
      "title": "A Universally Efficient Dynamic Auction for All Unimodular Demand Types",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0132",
      "title": "A Homogeneous Second-Order Descent Method for Nonconvex Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0145",
      "title": "Efficient Simulation of Polyhedral Expectations with Applications to Finance",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0148",
      "title": "Linear Mean-Field Games with Discounted Cost",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0149",
      "title": "A 0/1 Constrained Optimization Solving Sample Average Approximation for Chance Constrained Programming",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0159",
      "title": "Near-Optimal Performance of Stochastic Model Predictive Control",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W7125931785_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "In practice, the true distribution of these uncertainties may remain unknown, highlighting the importance of incorporating distributional robustness into the control policy.",
          "location": "Page 7, Remark 5; and page 13, Section 4 (Conclusions and Future Work), third bullet.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0162",
      "title": "Sparse Integer Programming Is Fixed-Parameter Tractable",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0167",
      "title": "An Augmented Lagrangian Approach to Conically Constrained Nonmonotone Variational Inequality Problems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0169",
      "title": "On Average Optimality for Non-Stationary Markov Decision Processes in Borel Spaces",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://pure-oai.bham.ac.uk/ws/files/237771759/GuoHuangZhangMOR2024Accepted.pdf",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0172",
      "title": "Markov Decision Processes with Observation Costs: Framework and Computation with a Penalty Scheme",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0173",
      "title": "ρ-Arbitrage and ρ-Consistent Pricing for Star-Shaped Risk Measures",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0175",
      "title": "Efficient and Near-Optimal Online Portfolio Selection",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0176",
      "title": "Global Algorithms for Mean-Variance Optimization in Markov Decision Processes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0177",
      "title": "Optimality Conditions in Control Problems with Random State Constraints in Probabilistic or Almost Sure Form",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0186",
      "title": "Fast Convex Optimization via Time Scale and Averaging of the Steepest Descent",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4403453300_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It would be interesting to know if we can achieve the same convergence rate using time scaling and perturbation techniques.",
          "location": "Page 26, Section 5.1 (Remark 8).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0191",
      "title": "Higher-Order Expansion and Bartlett Correctability of Distributionally Robust Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0195",
      "title": "Generalized Eluder Coefficient: A Unified Framework for Interactive Decision Making in Markov Decision Processes, Partially Observable Markov Decision Processes, and Beyond",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0200",
      "title": "The Multi-Objective Polynomial Optimization",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4390588799_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Question 7.1.",
          "location": "Section 7 (Conclusions and discussions), page 24 (Question 7.1); see also Appendix A discussion around pages 28–29.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0202",
      "title": "Variational Theory and Algorithms for a Class of Asymptotically Approachable Nonconvex Problems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0203",
      "title": "On Interim Envy-Free Allocation Lotteries",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "http://repository.essex.ac.uk/30538/23/On_Interim_Envy_Free_Allocation_Lotteries.pdf",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Computing iEF lotteries of maximum expected average Nash welfare is elusive at this point.",
          "location": "Page 19, Section 7 (problems)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0204",
      "title": "Maximizing Nash Social Welfare in Two-Value Instances: Delineating Tractability",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0208",
      "title": "Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0209",
      "title": "Relaxed Equilibria for Time-Inconsistent Markov Decision Processes",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4403683873_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "to make this method fully rigorous, it remains to show the theoretic convergence of the single-valued fixed-point iteration, which is a nontrivial problem in itself",
          "location": "Page 10, Remark 2.6 (end of Section 2.2).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0210",
      "title": "Robust Online Selection with Uncertain Offer Acceptance",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W3216294154_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "and decreasing as a function of \\(p\\), and thus we expect the same behavior from \\(\\gamma_\\infty(p)\\), though this remains to be proved (see Figure 1).",
          "location": "Section 9 (Concluding Remarks), page 24, paragraph beginning “We empirically observe …”",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0211",
      "title": "Risk-Averse Markov Decision Processes Through a Distributional Lens",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4400732905_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "However, the equivalence of this limit in current context remains unclear.",
          "location": "Page 14, Remark 2.12 (problem formulation discussion)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0213",
      "title": "Deep Quadratic Hedging",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0216",
      "title": "ℓ p -Sphere Covering and Approximating Nuclear p -Norm",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0221",
      "title": "Tightness Without Counterexamples: A New Approach and New Results for Prophet Inequalities",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4409922425_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "all \\(k > 1\\) our numerical observation that \\(\\lim_{n\\to\\infty} \\gamma_{k,n} = \\inf_{n\\ge 1} \\gamma_{k,n}\\), which would resolve the open question of k-unit IID prophet inequality.",
          "location": "Page 6, Introduction, item 2 under “1.2. New Results”.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0225",
      "title": "A Sampling-Based Gittins Index Approximation",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0231",
      "title": "Tight Running Times for Minimum ℓq-Norm Load Balancing: Beyond Exponential Dependencies on 1/ϵ",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4413848299_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Another interesting problem is to show subexponential lower bound or develop FPTAS for \\(P\\|\\|\\sum_i C_i^q\\) where \\(m = \\Theta((1/\\varepsilon)^\\theta)\\) for \\(\\theta \\in (1/2, 1]\\).",
          "location": "Page 2, Introduction (Contribution Overview); also Page 46, Conclusion (Section H).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0242",
      "title": "Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W7114802374_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "An immediate open question for future research is whether one or more of these problems admit fully polynomial time approximation schemes (FPTAS).",
          "location": "Section 7 (Future Directions), page 34.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0244",
      "title": "Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0246",
      "title": "Risk Sharing with Lambda Value at Risk",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4391994328_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "is beyond the scope of this paper as it involves the robust risk aggregation of two \\(\\Lambda\\mathrm{VaR}^+\\) with fixed marginal distributions and unknown dependence structure.",
          "location": "Section 1 Introduction (page 3) and Section 6 Conclusion (page 17).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0248",
      "title": "Pandora’s Problem with Combinatorial Cost",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4405512051_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "For example, it is not clear whether there exists a poly-time algorithm that finds an optimal (or an approximately optimal) strategy under budget-additive costs.",
          "location": "Section 6 (Conclusion and Future Directions), page 25.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0250",
      "title": "Online Allocation of Reusable Resources in Nonstationary Environments",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0262",
      "title": "Greedy Adversarial Equilibrium: An Efficient Alternative to Nonconvex–Nonconcave Min-Max Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0265",
      "title": "Stochastic Control Problems with State Reflections Arising from Relaxed Benchmark Tracking",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0267",
      "title": "Uncertainty Propagation and Dynamic Robust Risk Measures",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0268",
      "title": "A Simple Integral Equation Approach for Optimal Investment Stopping Problems with Partial Information",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4408054337_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "There remain some problems, for example, the current approach can not be extended if the drift coefficient is a hidden two-state Markov chain.",
          "location": "Page 18, Section 6 (Conclusions)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0270",
      "title": "Local Maximal Monotonicity in Variational Analysis and Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0274",
      "title": "Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4396905249_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "While we prove positive liquid welfare guarantees under mild learning assumptions, we leave open the problem of whether stronger learning guarantees imply better liquid welfare.",
          "location": "Page 18, Section 8 (Conclusion)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0275",
      "title": "Online Regret Bounds for Satisficing in Markov Decision Processes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0276",
      "title": "Streaming Submodular Maximization Under Matroid Constraints",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://drops.dagstuhl.de/storage/00lipics/lipics-vol229-icalp2022/LIPIcs.ICALP.2022.59/LIPIcs.ICALP.2022.59.pdf",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 9,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0278",
      "title": "Correlated Equilibria in Large Anonymous Bayesian Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0281",
      "title": "New Analysis of an Away-Step Frank–Wolfe Method for Minimizing Log-Homogeneous Barriers",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0284",
      "title": "Riemannian Anderson Mixing Methods for Minimizing C 2 Functions on Riemannian Manifolds",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4409800077_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "The global convergence of Anderson mixing remains a problem, even in the Euclidean setting.",
          "location": "Section 4 (Regularied RAM and Global Convergence Analysis), page 10; also reiterated in Section 5.1 (Details Concerning Numerical Implementations), page 14.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0285",
      "title": "Effort Decisions in Contests with Shared Attributes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0295",
      "title": "Analysis of a Class of Minimization Problems Lacking Lower Semicontinuity",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0296",
      "title": "On the Monotonicity and Rate of Convergence of the Markovian Persuasion Value",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W7150839694_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "existence of an example for Case B in which \\(0 < \\delta_0 < 1\\) (where \\(\\delta_0\\) was described in Corollary 1) remains an open question.",
          "location": "Section 3.2.1 (\"On the Analytic Behavior of Two Trajectories\"), page 12 (PDF pagination shown as 12/51).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0297",
      "title": "Marginal Values of a Stochastic Game",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0309",
      "title": "Online Matching in Geometric Random Graphs",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0311",
      "title": "A Squared Smoothing Newton Method for Semidefinite Programming",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0316",
      "title": "Robustness and Approximation of Discrete-Time Mean-Field Games Under Discounted Cost Criterion",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0317",
      "title": "Upper Bounds for All and Max-Gain Policy Iteration Algorithms on Deterministic MDPs",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4409316647_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It remains unknown if such a Hamiltonian path through the set of policies exists for any MDP with \\(k \\ge 3\\) actions.",
          "location": "Section 6 (Summary and outlook), page 31.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0321",
      "title": "Robustly Stable Accelerated Momentum Methods with a Near-Optimal L2 Gain and H∞ Performance",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0322",
      "title": "Improved Guarantees for the A Priori TSP",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://researchonline.lse.ac.uk/id/eprint/126218/1/Improved_guarantees_for_the_a_priori_TSP.pdf",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We conjecture that the master route ratio is exactly \\(\\frac{1}{1-e^{-1/2}}\\).",
          "location": "Page 5, Section 1.2 (after Theorem 6); reiterated in Page 38, Section 9 (Discussion).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0323",
      "title": "Equilibrium Transport with Time-Inconsistent Costs",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4411449955_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Notably, even in the static case with quadratic regularization, this problem has only been examined in a recent work by Gonze1lez-Sanz and Nutz (2024).",
          "location": "Section 2.1.1, Remark 2.1 (page 7 of 56 in the provided parsed text)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0324",
      "title": "Convergence of Augmented Lagrangian Methods for Composite Optimization Problems",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4408446556_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "The main question that remains open here is whether \\(C^2\\)-decomposable functions satisfy in (3.14).",
          "location": "Page 18, end of Section 3 (immediately after Theorem 3.9).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0326",
      "title": "Nonregular McKean–Vlasov Equations and Calibration Problem in Local Stochastic Volatility Models",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0328",
      "title": "Inexact Bregman Proximal Gradient Method and Its Inertial Variant with Absolute and Partial Relative Stopping Criteria",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4408928070_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Thus, it would be interesting to explore whether the requirement \\(\\|\\Delta_k\\| = 0\\) can be removed in our methods, which we will leave for future",
          "location": "Page 9, Section 3 (discussion following Algorithm 1, paragraph comparing (AbSC) and (ReSC)).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0333",
      "title": "Dynamic Bipartite Matching Markets with Stochastic Arrivals and Departures",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0340",
      "title": "A Derivative-Free Algorithm for Minimization in One Dimension: Relaxation, Monte Carlo, and Sampling",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0342",
      "title": "Approximately Stationary Bandits with Knapsacks",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0345",
      "title": "Dynamic Portfolio Selection for Nonlinear Law-Dependent Preferences",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4411801764_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "challenging than the one-dimensional ones, and unless other assumptions are imposed, the well-posedness remains open; see the bibliographical notes in Subsection 7.4 of Zhang (2017).",
          "location": "Page 15, Section 6 (Remark 6.2(a))",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0352",
      "title": "The Minimax Property in Infinite Two-Person Win-Lose Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0356",
      "title": "Newton-CG Methods for Nonconvex Unconstrained Optimization with Hölder Continuous Hessian",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://liu.diva-portal.org/smash/get/diva2:1963266/FULLTEXT01",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 8,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0361",
      "title": "A Moment-Sum-of-Squares Hierarchy for Robust Polynomial Matrix Inequality Optimization with Sum-of-Squares Convexity",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0362",
      "title": "Monotone Causality in Opportunistically Stochastic Shortest Path Problems",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4411674410_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "deterministic games on graphs have been developed in the last ten years [7, 11], but the case of general stochastic games on graphs remains open.",
          "location": "Section 6 (Conclusions), page 33.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0371",
      "title": "Can Learning Be Explained by Local Optimality in Robust Low-Rank Matrix Recovery?",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4412612512_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Indeed, we view proving or disproving the above conjectures as a compelling challenge for future research.",
          "location": "Section 8 (Discussion and Future Directions), page 39 (arXiv PDF numbering)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0374",
      "title": "Nash Equilibria for Dividend Distribution with Competition",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://publications.ut-capitole.fr/id/eprint/51609/1/wp_tse_1495.pdf",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "The question as to whether an equilibrium exists in which Player 1 uses a strategy and Player 2 uses a control (both either pure or",
          "location": "Page 23, Remark 4.9 (end of Section 4, immediately after Theorem 4.1 proof).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0376",
      "title": "Utility Maximization Under Endogenous Pricing",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.0377",
      "title": "Lower Complexity Bounds of First-Order Methods for Affinely Constrained Composite Nonconvex Problems",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4411234993_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "First, for Algorithm Class 1 on solving Problem Class 1, can the lower bound \\(O(\\kappa([\\bar A;A])L_f\\Delta F_0\\varepsilon^{-2})\\) be achieved, i.e., is it tight?",
          "location": "Section 4 (Conclusion and Open Questions), page 25.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0379",
      "title": "On the Set of Balanced Games",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2501.14341",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Indeed, the concept of minimal balanced collection generalizes the concept of partitions, and their enumeration remains a problem.",
          "location": "Introduction, page 2 (discussion of minimal balanced collections and enumeration); also referenced indirectly in Section 5.5 via the number of facets depending on the number of minimal balanced collections.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.0386",
      "title": "Well-Posedness and Sensitivity Analysis of a Fluid Model for Multiclass Many-Server Queues with Abandonment Under Global FCFS Discipline",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1351",
      "title": "Bilateral Trade: A Regret Minimization Perspective",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2109.12974",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "conjecture"
          ],
          "page": 9,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 10,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 13,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 13,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 15,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 30,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 38,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1352",
      "title": "Packing Feedback Arc Sets in Tournaments Exactly",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1353",
      "title": "An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1354",
      "title": "Uniqueness of Clearing Payment Matrices in Financial Networks",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "http://unipub.lib.uni-corvinus.hu/8135/1/moor.2023.1354.pdf",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1355",
      "title": "A Geometric Model of Opinion Polarization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1356",
      "title": "Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1357",
      "title": "Assortment Planning for Recommendations at Checkout Under Inventory Constraints",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1358",
      "title": "Delay-Adaptive Learning in Generalized Linear Contextual Bandits",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1359",
      "title": "On the Diameter of the Stopped Spider Process",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1360",
      "title": "Dissolving Constraints for Riemannian Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1361",
      "title": "Algorithms for Competitive Division of Chores",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/1907.01766",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Computing an exact competitive equilibrium in polynomial time when both the number of agents and chores are variable remains an open question for additive utilities.",
          "location": "Page 10, end of Related Work / start of Section 2 (statement just before Section 2), and reiterated in Section 3 (“What if both n and m are large?”), page 19.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1362",
      "title": "Constrained Trading Networks",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1363",
      "title": "Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W3105682563_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "An interesting question is whether something similar occurs for other classes of independence systems different than matroids of rank 1.",
          "location": "Section 5.3, pages 23–24 (discussion around the limit as p → 1 and matroid secretary problem consequences)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1364",
      "title": "A New Approach to Capacity Scaling Augmented with Unreliable Machine Learning Predictions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1365",
      "title": "Uniform Mixed Equilibria in Network Congestion Games with Link Failures",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1366",
      "title": "Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1367",
      "title": "Asymptotic Optimality of Constant-Order Policies in Joint Pricing and Inventory Models",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1368",
      "title": "Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4377821221_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Note that it is not clear whether the analyses of the algorithms in Section 2 are tight.",
          "location": "Section 7 (Conclusion), page 22 (arXiv v1 pagination)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1369",
      "title": "Distribution-Free Contextual Dynamic Pricing",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4376149422_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "we conjecture the obtained \\(\\tilde O(T^{2/3})\\) rate is close to the optimal rate.",
          "location": "Page 4 (Introduction, end of Abstract/Contributions discussion) and page 20 (Remark 2 following Theorem 1 in Section 3).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1370",
      "title": "Neural Temporal Difference and Q Learning Provably Converge to Global Optima",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1371",
      "title": "Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W2922533999_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "This problem is open even for single-dimensional signals and even for “simple” combinatorial valuations, such as unit demand.",
          "location": "Section 7 (problems), page 16 (in the provided PDF pagination)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1372",
      "title": "A Unified Analysis of a Class of Proximal Bundle Methods for Solving Hybrid Convex Composite Optimization Problems",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4379383737_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It would be interesting to design an accelerated variant of GPB which is optimal for the aforementioned HCCO problem class.",
          "location": "Section 6 (Concluding Remarks), page 21 (paragraph beginning 'First, under the assumption that the diameter D of dom h is finite, ...').",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1373",
      "title": "Large Ranking Games with Diffusion Control",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://hal.science/hal-03434678/document",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It is still a problem to find conditions, sufficient and necessary at the same time, guaranteeing uniqueness in law of weak solutions of (2)",
          "location": "Page 3, Section 1 (Introduction), footnote 1.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1374",
      "title": "Numeraire-Invariant Quadratic Hedging and Mean–Variance Portfolio Allocation",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://openaccess.city.ac.uk/id/eprint/30220/1/2023-04-07-NumeraireMOR_final.pdf",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "manually confirmed source-explicit unresolved statement"
          ],
          "quote": "As yet, we do not know how to obtain the solution of the hedging problem (1.2) for general X.",
          "location": "Page 13, Section 3.6",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1375",
      "title": "Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2005.01869",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 2,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 22,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1376",
      "title": "Solving Optimization Problems with Blackwell Approachability",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1377",
      "title": "On Geometric Connections of Embedded and Quotient Geometries in Riemannian Fixed-Rank Matrix Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1378",
      "title": "A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://www.osti.gov/servlets/purl/2426342",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 2,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "conjecture"
          ],
          "page": 23,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1379",
      "title": "A Simple Characterization of Supply Correspondences",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1380",
      "title": "Nontruthful Position Auctions Are More Robust to Misspecification",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1381",
      "title": "Congruency-Constrained TU Problems Beyond the Bimodular Case",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4386289171_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "In particular, there is a long-standing open question on whether ILPs are efficiently solvable if their constraint matrix is \\(\\Delta\\)-modular for constant \\(\\Delta\\).",
          "location": "Page 2, Section 1 (Introduction)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1382",
      "title": "A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2107.09631",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1384",
      "title": "Secretaries with Advice",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1385",
      "title": "Stochastic Games with General Payoff Functions",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://cris.maastrichtuniversity.nl/ws/files/189808346/Flesch-2023-stochastic-games-with-general-payoff-functions.pdf",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "gives a very partial answer to the long-standing problem of whether every multiplayer stochastic game with finite action spaces, finite or countably infinite state space,",
          "location": "Page 2, Introduction (end of item [4] discussion)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1386",
      "title": "Binary Matrix Factorization and Completion via Integer Programming",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1387",
      "title": "A Primal-Dual Smoothing Framework for Max-Structured Non-Convex Optimization",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4386547517_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "First, the lower complexity bound for finding an \\(\\varepsilon\\)-NS point of (1.1) is not known yet.",
          "location": "Section 8 (Conclusion and future work), page 35.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1388",
      "title": "Improved Online Contention Resolution for Matchings and Applications to the Gig Economy",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4385980778_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "A natural question is whether better (RO-)OCRS can be achieved for points in the matching polytope, i.e., points which also satisfy Edmonds’ odd-set constraints [Edm65].",
          "location": "Section 5 (Discussion), page 20",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.1389",
      "title": "Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2023.1390",
      "title": "A Superlinearly Convergent Subgradient Method for Sharp Semismooth Problems",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4385878155_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "On the other hand, verifying Assumption (A1) is remains an intriguing problem.",
          "location": "Section 5.2.2 (Max-linear regression and PolyakSGM), page 38",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.eb.v48n1",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.eb.v48n2",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2023.eb.v48n3",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0402",
      "title": "Positivstellensätze and Moment Problems with Universal Quantifiers",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4410155359_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Our work leads to many intriguing questions to explore in the future.",
          "location": "Section 7 (Conclusions and Discussions), page 26.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0405",
      "title": "Theoretical Smoothing Frameworks for Nonsmooth Simple Bilevel Problems",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W7140189588_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "et al., 2023]; however, it remains an open question whether the resulting approximation qualifies as a smoothing family in the sense of Definition 2.5 and",
          "location": "Page 30, Section 5 (Concluding Remarks and Future Directions).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0407",
      "title": "Primal-Dual Extrapolation Methods for Monotone Inclusions Under Local Lipschitz Continuity",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4403279582_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "One natural question is whether the aforementioned operation complexity of \\(O(\\varepsilon^{-1}\\log \\varepsilon^{-1})\\) can be improved to \\(O(\\varepsilon^{-1})\\), which would match the optimal complexity for solving",
          "location": "Section 7 (Concluding remarks), page 23",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0408",
      "title": "Uniform Moment Bounds for Generalized Jackson Networks in Multiscale Heavy Traffic",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0413",
      "title": "Splitting Guarantees for Prophet Inequalities via Nonlinear Systems",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4409528654_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Finding an analytical formula for the approximation ratio of \\((k, n)\\)-SPI remains a problem, but our findings offer a potential avenue toward this goal.",
          "location": "Section 6 (Final Remarks), page 28 (arXiv v2 pagination).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0414",
      "title": "Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0415",
      "title": "Fluid Limits for Longest Job First Queues",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0416",
      "title": "Synchronization Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0422",
      "title": "SoS Certification for Symmetric Quadratic Functions and Its Connection to Constrained Boolean Hypercube Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0427",
      "title": "On the Convergence Rate of Sinkhorn’s Algorithm",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0431",
      "title": "Improved Bounds for Single-Nomination Impartial Selection",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4411023035_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Whether such a mechanism exists is an intriguing open question, the resolution of which is likely to require new insights.",
          "location": "Page 14, Section 5 (end of the section introduction, immediately after stating Theorem 5.1 and Corollary 5.2).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0439",
      "title": "Learning Nonparametric Choice Models with Discrete Fourier Analysis",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0444",
      "title": "Rates of Convergence in the Central Limit Theorem for Markov Chains, with an Application to TD Learning",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4414783466_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It would be interesting to see if the \\(O(\\log n/\\sqrt n)\\) rate of convergence in Theorem 1 can be improved to \\(O(1/\\sqrt n)\\) under possibly",
          "location": "Section 5 (Conclusions), page 19",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0449",
      "title": "On Averaging and Extrapolation for Gradient Descent",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4413077228_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We state this formally in the following conjecture.",
          "location": "Section 3.2.1 (Discussion of Conditions (C1) and (C2)), page 12.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0457",
      "title": "An Equivalent Reformulation and Multiproximity Gradient Algorithms for a Class of Nonsmooth Fractional Programming",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0465",
      "title": "Scale-Free Cascading Failures: Generalized Approach for All Simple, Connected Graphs",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2403.11727",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "manually confirmed source-explicit unresolved statement"
          ],
          "quote": "The result of Theorem 2 holds independent of the choice of the exceedance tie-breaking rule.",
          "location": "Page 26, Conjecture 17",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0467",
      "title": "Algorithms for Budget-Constrained D-Optimal Design",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0468",
      "title": "A New Finite Approximation Method for Evaluating Steady-State Performance of a Continuous-State Markov Chain with an Application to Queues with Customer Abandonment",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0471",
      "title": "Bias and Extrapolation in Markovian Linear Stochastic Approximation with Constant Step Sizes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0478",
      "title": "Asymptotic Nash Equilibria of Finite-State Ergodic Markovian Mean Field Games",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4410233669_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "The first author is actively working on this problem, which remains open (see [8]).",
          "location": "Section 4.1, Remark 4.6 (page 14).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0479",
      "title": "Developing Lagrangian-Based Methods for Nonsmooth Nonconvex Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0481",
      "title": "The Complexity of Recognizing Facets for the Knapsack Polytope",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4416295153_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It is still open whether it can be done in time \\(f(K)\\cdot \\mathrm{poly}(n)\\) where \\(f\\) is some computable function independent of \\(n\\), i.e., whether the",
          "location": "Page 16, Section 5 (Concluding Remarks)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0483",
      "title": "Exactness and Effective Degree Bound of Lasserre’s Relaxation for Polynomial Optimization over Finite Variety",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4411879499_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "It would be interesting to investigate the degree bound under the regular sequence condition only.",
          "location": "Section 8 (Conclusion and perspectives), page 21 (in the provided text, the paragraph beginning 'However, Assumption 1 is stronger ...')",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0487",
      "title": "A Polynomial-Time Iterative Algorithm for Random Graph Matching with Nonvanishing Correlation",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0488",
      "title": "A Single-Loop Algorithm for Decentralized Bilevel Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0489",
      "title": "Optimality of Symmetric Independent Policies Under Decentralized Mean-Field Information Sharing for Stochastic Teams and Equivalence with McKean−Vlasov Control of a Representative Agent",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0498",
      "title": "Oracle Complexities of Augmented Lagrangian Methods for Nonsmooth Composite Optimization on a Compact Submanifold",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0500",
      "title": "Erratum to: Linear Convergence of Dual Coordinate Descent on Nonpolyhedral Convex Problems",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0510",
      "title": "AdaBB: Adaptive Barzilai-Borwein Method for Convex Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0518",
      "title": "An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0519",
      "title": "Cooperation, Correlation, and Competition in Ergodic N -Player Games and Mean-Field Games of Singular Controls: A Case Study",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0521",
      "title": "Solving Bilevel Optimization via Sequential Minimax Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0525",
      "title": "Mode Connectivity in Auction Design",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0528",
      "title": "Centrality in Normalized Stochastic Networks",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0531",
      "title": "First-Order Methods for Stochastic Variational Inequality Problems with Function Constraints",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0533",
      "title": "On the Uniform Convergence of Subdifferentials in Stochastic Optimization and Learning",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4413635748_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Extending this theorem could provide tools for solving other weakly-convex optimization problems.",
          "location": "Page 24, Section 7 (Discussion), future directions list",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0534",
      "title": "Relaxations for Binary Polynomial Optimization via Signed Certificates",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2405.13447",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0535",
      "title": "Converging Better Response Dynamics in Sender-Receiver Games",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0541",
      "title": "Exploiting Sign Symmetries in Minimizing Sums of Rational Functions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0548",
      "title": "Minimum Cost Adaptive Submodular Cover",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0549",
      "title": "Existence of Optimal Stationary Singular Controls and Mean Field Game Equilibria",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0550",
      "title": "On the Sequential Convergence of Lloyd’s Algorithms",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2405.20744",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Beyond existing results, a general sequential convergence guaranty for Lloyd’s methods in the semi-discrete setting remains open.",
          "location": "Page 3, Introduction (paragraph ending with 'remains open')",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0557",
      "title": "Quantifying Distributional Model Risk in Marginal Problems via Optimal Transport",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0559",
      "title": "On the Completeness of Several Fortification-Interdiction Games in the Polynomial Hierarchy",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0562",
      "title": "Robust Sparsification for Matroid Intersection with Applications",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4416665164_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "our time complexity: we leave as an open question whether updating a density-based decomposition when performing these kinds of operations can be done more efficiently,",
          "location": "Page 6, Introduction (end of the discussion on density-based decomposition and principal partitions).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0566",
      "title": "Graphon Games with Multiple Equilibria: Analysis and Computation",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0567",
      "title": "Fast Combinatorial Algorithms for Simultaneously Approximating All ℓp-Norms in Correlation Clustering",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4414091988_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "One question is whether there is a simpler existential (not necessarily algorithmic) proof that there exists an \\(O(1)\\)-approximation for the all-norm objective for correlation clustering.",
          "location": "Page 17, Section 5 (Conclusion).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0568",
      "title": "The Information Projection in Moment Inequality Models: Existence, Dual Representation, and Approximation",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0570",
      "title": "Generalized Metric Subregularity with Applications to High-Order Regularized Newton Methods",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2406.13207",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 19,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0571",
      "title": "Tracking Solutions of Time-Varying Variational Inequalities",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0580",
      "title": "Fast Convergence of Frank-Wolfe Algorithms on Polytopes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0581",
      "title": "Fair Congested Assignment",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4410154284_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "With lower bounds it is not clear what the definition of competitiveness should be: how to account for the situation where a lower bound \\(\\underline",
          "location": "Section 7 (Concluding comments), page 29 (paper pagination shown as 28 in the provided text dump), under the heading 'two open questions', item 1",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0582",
      "title": "Low-Rank Optimization Methods Based on Projected Projected-Gradient Descent That Accumulate at Bouligand Stationary Points",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2201.03962",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "manually confirmed source-explicit unresolved statement"
          ],
          "quote": "whether it is possible to restrict (conditionally or not) the range of values in the for-loop while preserving the B-stationarity",
          "location": "Page 19, discussion after the P2GDR complexity table",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0584",
      "title": "Deterministic and Stochastic Frank–Wolfe Recursion on Probability Spaces",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0591",
      "title": "Distorted Optimal Transport",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4412630514_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Similarly, strong duality is only established for convex \\(h\\) and affine cost, and we wonder whether it also holds in more general situations.",
          "location": "Section 9 (Concluding remarks), page 33 (PDF page 33/37), second open-question paragraph.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0607",
      "title": "Optimality Conditions at Infinity in Semialgebraic Vector Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0609",
      "title": "Stability for Nash Equilibrium Problems",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4411959281_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Nevertheless, there are many other unresolved stability issues in NEPs.",
          "location": "Section 7 (Conclusions), page 27",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0610",
      "title": "On the Smoothed Complexity of Combinatorial Local Search",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4414408152_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "However, outside of these restricted instances of the problem, the complexity remains unresolved.",
          "location": "Section 6 (Conclusion and problems), page 33.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0617",
      "title": "Two Typical Implementable Semismooth* Newton Methods for Generalized Equations Are G-Semismooth Newton Methods",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0619",
      "title": "Convergence of Sinkhorn’s Algorithm for Entropic Martingale Optimal Transport Problem",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0627",
      "title": "Strongly Efficient Rare-Event Simulation for Regularly Varying Lévy Processes with Infinite Activities",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0633",
      "title": "Popular Maximum-Utility Matchings with Matroid Constraints",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4414427837_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "the exact matching problem [46] (see Section 5.1 for the definition), for which the existence of a deterministic efficient algorithm remains a longstanding open question.",
          "location": "Page 6 (Introduction, discussion before Theorem 4) and page 22 (Section 5.1, statement of Theorem 4 and surrounding text).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0634",
      "title": "Min-Cost Popular Matchings in a Hospitals/Residents Instance with Complete Preferences",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4416664990_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Settling the computational complexity of the min-cost popular maximum matching problem in a many-to-one instance with strict and incomplete preferences is an interesting problem.",
          "location": "Section 4 (Conclusions and problems), page 20",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0635",
      "title": "Improved Approximation Guarantees for Joint Replenishment in Continuous Time",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0643",
      "title": "Generalized Ellipsoids",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W7126221168_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "A related question is: how well can one approximate an \\(n\\)-dimensional symmetric convex body with a finite intersection of \\(m\\) (co-centered) ellipsoids, with \\(m\\) growing",
          "location": "Section 7 (Future Research Directions), page 31 (PDF pagination in the provided text)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0659",
      "title": "Minimizing Symmetric Convex Functions over a Hybrid of Continuous and Discrete Convex Sets",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0660",
      "title": "Unbiased Least Squares Regression via Averaged Stochastic Gradient Descent",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2406.18623",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0668",
      "title": "Capacitated Network Bargaining Games: Stability and Structure",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0678",
      "title": "Unichain and Aperiodicity Are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0681",
      "title": "On Time-Inconsistent Extended Mean-Field Control Problems with Common Noise",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2409.07219",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "manually confirmed source-explicit unresolved statement"
          ],
          "quote": "the global well-posedness remains an open problem.",
          "location": "Page 3, Introduction, discussion of equation (5.10)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0684",
      "title": "The Competition Complexity of Prophet Inequalities",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4408830023_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Whether this can also be achieved with static prices remains open, just as the question of whether a double-exponentially fast approach is possible with dynamic",
          "location": "Page 5, Section 1.5 (Extensions)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0690",
      "title": "Finite-Time Horizon, Stopper vs. Singular-Controller Games on the Half-Line",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0692",
      "title": "Lipschitz Stability of Least-Squares Problems Regularized by Functions with C2-Cone Reducible Conjugates",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W7118180028_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "One of the open questions we plan to investigate in the future is the computation of the Lipschitz modulus of the solution mapping when Lipschitz",
          "location": "Page 19 (Conclusion), paragraph beginning 'One of the open questions we plan to investigate in the future...'; also reiterated on page 20.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0696",
      "title": "Inevitability of Polarization in Geometric Opinion Exchange",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2402.08446",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0702",
      "title": "Rank-Based Stochastic Differential Inclusions and Diffusion Limits for a Load-Balancing Model",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0704",
      "title": "Corrigendum to “Interim Rationalizable Implementation of Functions” (Kunimoto T, Saran R, Serrano R (2024) Mathematics of Operations Research 49(3):1791–1824)",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0711",
      "title": "The NTU Partitioned Matching Game for International Kidney Exchange Programs",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2409.01452",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "conjecture"
          ],
          "page": 17,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "remains_open"
          ],
          "page": 23,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0712",
      "title": "Market Design with Distributional Objectives",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0714",
      "title": "Fair and Efficient Multi-resource Allocation for Cloud Computing: Beyond Dominant Resource Fairness",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W7128591806_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We leave the gap between 2 and 3 as an open question.",
          "location": "Section 5 (Price of Strategyproofness), page 30 (discussion after Theorem 7) and page 33 (statement preceding Lemma 16).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0720",
      "title": "Time-Consistent Portfolio Selection for Rank-Dependent Utilities in a Constrained Market",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W7127637708_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We even do not know whether there is a non-deterministic equilibrium strategy.",
          "location": "Page 29, Section 5 (Concluding Remarks).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0723",
      "title": "Optimal Budget Aggregation with Star-Shaped Preference Domains",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4417437095_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We conjecture that continuity is required for the characterization as well.",
          "location": "Page 17, Section 6.2 (Characterization) and Page 19, Section 8 (Conclusion)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0725",
      "title": "A Simple 1.5-Approximation Algorithm for a Wide Range of Maximum-Size Stable Matching Problems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0729",
      "title": "Bicriteria Multidimensional Mechanism Design with Side Information",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2302.14234",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "manually confirmed source-explicit unresolved statement"
          ],
          "quote": "is there a closed form characterization of the revenue-maximizing Groves mechanism?",
          "location": "Page 32, Conclusions and Future Research",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0748",
      "title": "Indefinite Linear-Quadratic Partially Observed Mean-Field Game",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4417166251_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Noticing that Riccati equation (35) is an asymmetric indefinite equation with complex structure, its solvability is still a problem.",
          "location": "Page 14, Remark 4.13(ii) (following Theorem 4.12, Section 4.3 \"Feedback representation\").",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0752",
      "title": "On Time-Consistent Equilibrium Stopping Under Aggregation of Diverse Discount Rates",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4417331274_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "As a sharp contrast, in our framework with a general attitude function \\(\\varphi(x)\\), it is an appealing problem to find a general characterization of the",
          "location": "Page 28 (PDF page label 28/38), Section 5.1 \"Geometric Brownian motion\", Remark 5.3 (end of remark).",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0768",
      "title": "An Optimization Dichotomy for Capital Injections and Absolutely Continuous Dividend Strategies",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0769",
      "title": "Denoising Diffusion Probabilistic Models Are Optimally Adaptive to Unknown Low Dimensionality",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W7135205807_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "unclear how the DDPM sampler adapts to unknown low dimensionality when other metrics (e.g.\\ the total-variation distance or the Wasserstein distance) are used to measure",
          "location": "Section 6 (Discussion), page 16.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0770",
      "title": "Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4414541699_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Is there a polynomial time algorithm to find \\(\\alpha\\)-approximately JEF+PO lotteries in two-sided markets, for any constant \\(\\alpha\\)?",
          "location": "Page 23, Section 4 (Conclusion)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0771",
      "title": "Consumption-Portfolio Optimization with Regime- Switching-Modulated Habit Formation and Jump Diffusion",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0772",
      "title": "Equilibrium Portfolio Selection Under Beliefs-Dependent Utilities",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0804",
      "title": "Semistatic Variance-Optimal Hedging with Self-Exciting Jumps",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0809",
      "title": "A Stable-Set Bound and Maximal Numbers of Nash Equilibria in Bimatrix Games",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2411.12385",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "conjecture"
          ],
          "page": 1,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "open_problem"
          ],
          "page": 2,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "conjecture"
          ],
          "page": 2,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "conjecture"
          ],
          "page": 13,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0817",
      "title": "New Combinatorial Insights for Monotone Apportionment",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W4415178980_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Whether a similar result holds without violating the house size is open.",
          "location": "Section 6 (Discussion), page 23.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0820",
      "title": "A Mean-Field Game of Market Entry: Portfolio Liquidation with Trading Constraints",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2403.10441",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 9,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0830",
      "title": "Integer Programs with Nearly Totally Unimodular Matrices: The Cographic Case",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2407.09477",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "manually confirmed source-explicit unresolved statement"
          ],
          "quote": "whether integer programs (IPs) with an integer coefficient matrix M whose subdeterminants are all bounded by a constant Δ can be solved in polynomial time.",
          "location": "Page 1, Abstract",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0837",
      "title": "Approximation Algorithms for Steiner Connectivity Augmentation",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0847",
      "title": "Mirror Descent Algorithms for Risk Budgeting Portfolios",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2411.12323",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "Potential directions for future research include investigating asymptotic error properties by establishing a central limit theorem for the stochastic MD algorithm presented here.",
          "location": "Conclusion (page 25 of 34)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.0855",
      "title": "Single-Server Queues with State-Dependent Hawkes Arrivals",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.0856",
      "title": "Robust Solutions to a System of Stochastic Vertical Linear Complementarity Problems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2024.eb.v49n1",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.eb.v49n2",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.eb.v49n3",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2024.eb.v49n4",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2025.0863",
      "title": "Generalized Monotonicity and the Proximal Point Algorithm",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.0873",
      "title": "The Finite-Horizon Retirement Problem with Borrowing Constraint: A Zero-Sum Stopper Versus Singular-Controller Game",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.0895",
      "title": "On Stability of the Scholtes Regularization for Mathematical Programs with Complementarity Constraints",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.0896",
      "title": "Specific Wasserstein Divergence Between Continuous Martingales",
      "record_type": "research_article",
      "screen_status": "screened_primary_text_extract",
      "full_text_route": "https://pranav-nuti.github.io/open-problems-in-or/data/llm_math_export/problems/W7119488906_p0.json",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "We consider the scaling limit of (2.1) for our choice \\(\\alpha_1(\\cdot)=\\pm W_1(\\cdot,P)^p\\) as an interesting open question which we do not tackle here.",
          "location": "Page 7, Section 2.1, Remark 2.4.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2025.0914",
      "title": "Bilevel Gradient Methods and the Morse Parametric Qualification Condition",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://inria.hal.science/hal-04942322v2/document",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 3,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2025.0915",
      "title": "Envy-Freeness up to Any Good Allocations on Graphs",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.0924",
      "title": "Heavy Traffic Limit with Discontinuous Coefficients via a Nonstandard Semimartingale Decomposition",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.0926",
      "title": "On the Equivalence of Zero-Sum Games and Conic Programs",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2302.03066",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "source-explicit unresolved statement"
          ],
          "quote": "primal-dual pair of conic linear programs, the following question naturally arises: When is a two-player zero-sum game equilibrium-equivalent to a game with cone-leveled strategy sets?",
          "location": "Section 7 (Future directions), page 34.",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2025.0931",
      "title": "An Adaptive Forward-Backward-Forward Splitting Algorithm for Solving Pseudo-Monotone Inclusions",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.0932",
      "title": "N -Player Stochastic Differential Games with Regime Switching and Mean Field Convergence",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.0939",
      "title": "Gradient Descent for Unbounded Convex Functions on Hadamard Manifolds and Its Applications to Scaling Problems",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2404.09746",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "manually confirmed source-explicit unresolved statement"
          ],
          "quote": "we do not know whether (3.13) is true.",
          "location": "Page 12, discussion of equation (3.13)",
          "review_disposition": "confirmed_problem"
        },
        {
          "matched_phrases": [
            "manually confirmed source-explicit unresolved statement"
          ],
          "quote": "it is reasonable to conjecture that it oscillates between orbits",
          "location": "Page 31, discussion of the operator Sinkhorn limit",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2025.0951",
      "title": "A Smooth C-Function-Based ERM Method for Stochastic Symmetric Cone Linear Complementarity Problems",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.1003",
      "title": "A Decomposition Method for Lipschitz Stability of General LASSO-Type Problems",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2407.18884",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 4,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "open_question"
          ],
          "page": 27,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "open_question"
          ],
          "page": 27,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 28,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        },
        {
          "matched_phrases": [
            "unknown"
          ],
          "page": 31,
          "review_disposition": "not_confirmed_by_manual_problem_review"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2025.1037",
      "title": "The Value of Partial Jump Information",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.1044",
      "title": "Semidefinite Programming Bounds on Fractional Cut-Cover and Maximum 2-SAT for Highly Regular Graphs",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2505.10548",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2025.1055",
      "title": "A Riemannian Alternating Descent Ascent Algorithmic Framework for Nonconvex-Linear Minimax Problems on Riemannian Manifolds",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.1060",
      "title": "Generic Linear Convergence for Algorithms of Nonlinear Least Squares over Smooth Varieties",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.1072",
      "title": "Coderivatives at Infinity of Set-Valued Mappings with Applications to Optimization",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.1092",
      "title": "Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.1095",
      "title": "ℓ1-2 Regularization for Sparse Optimization: Consistency and Global Convergence",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.1115",
      "title": "Data-Driven Matching for Impatient and Heterogeneous Demand and Supply",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.1129",
      "title": "Testing Hypotheses Generated by Constraints",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.1136",
      "title": "Dynamically Optimal Portfolios for Monotone Mean-Variance Preferences",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.1183",
      "title": "Branch-and-Bound Algorithms as Polynomial-Time Approximation Schemes",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2025.1233",
      "title": "Mean Field Control with Absorption",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2509.07877",
      "disposition": "screened_no_confirmed_problem",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2025.1239",
      "title": "Non-SOS Positivstellensätze for Semialgebraic Sets Defined by Polynomial Matrix Inequalities",
      "record_type": "research_article",
      "screen_status": "screened_full_text",
      "full_text_route": "https://arxiv.org/pdf/2509.01159",
      "disposition": "confirmed_source_explicit_problem",
      "candidate_passages": [
        {
          "matched_phrases": [
            "manually confirmed source-explicit unresolved statement"
          ],
          "quote": "the exact convergence rate of f⋆2m to f⋆ remains unknown",
          "location": "Page 24, comparison of hierarchies (H2m) and (Pm)",
          "review_disposition": "confirmed_problem"
        }
      ],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2025.eb.v50n1",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2025.eb.v50n2",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2025.eb.v50n3",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2025.eb.v50n4",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2026.50th.v51.n1",
      "title": "Editor’s Comments on the 50th Anniversary of Mathematics of Operations Research",
      "record_type": "research_article",
      "screen_status": "inaccessible",
      "full_text_route": "INFORMS abstract/metadata page only; no independently retrievable full text located",
      "disposition": "full_text_not_located_no_negative_claim",
      "candidate_passages": [],
      "note": "An inaccessible item is not treated as a negative screen."
    },
    {
      "doi": "10.1287/moor.2026.eb.v51n1",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    },
    {
      "doi": "10.1287/moor.2026.eb.v51n2",
      "title": "Editorial Board",
      "record_type": "non_research_item",
      "screen_status": "not_applicable",
      "full_text_route": "Crossref metadata and INFORMS item page",
      "disposition": "excluded_nonresearch",
      "candidate_passages": [],
      "note": "High-recall phrase hits were manually normalized only when the source posed a precise unresolved task."
    }
  ]
}