{"alias":"ECON-4","canonical_alias":"ECON-4","canonical_problem_id":"prb_34ecf5fa262f4a85a0fbe4af9837c46b","contributions":["ECON-4-A1","ECON-4-A2"],"display_label":"Econ-20","display_labels":["Econ-20"],"number":107793,"record":{"attribution":{"contribution_mode":"ai_only","humans":[],"organisations":[],"submitter":{"authorship_confirmation":"confirmed","display_name":"Anonymous submitter","github_id":243585043,"login_at_event":null,"person_ref":"per_f000c79a661e4888846b5ce878366ad0","roles":["prompting","submission"]}},"classifications":[{"code":"C73","scheme":"jel"}],"disciplines":[{"discipline":"economics","role":"primary"}],"expected_statement_predecessor":"stm_32cd4f81d2514415920d3ba7e50d23af","external_ids":[],"kind":"proposed","model_uses":[{"declared_name":"gpt 6 astra pro","family":null,"generation_date":null,"provenance":{"evidence":[],"level":"declared"},"provider":"OpenAI","role":"generated_draft","settings":{"reasoning":"unknown"},"version":"unknown"},{"declared_name":"codex (gpt-6)","family":null,"generation_date":null,"provenance":{"evidence":[],"level":"declared"},"provider":"OpenAI","role":"editing","settings":{"reasoning":"unknown"},"version":"unknown"},{"declared_name":"unspecified llm (editorial reformulation)","family":null,"generation_date":null,"provenance":{"evidence":[],"level":"declared"},"provider":"Unknown","role":"editing","settings":null,"version":"unknown"}],"problem_id":"prb_34ecf5fa262f4a85a0fbe4af9837c46b","proposal":{"elementary_checks":"Source and scope checks only. No new proof, counterexample search, or implementation is claimed. See the manuscript for the stated elementary boundary checks.","literature_search":"The source statements and pinned literature references were checked on 17–18 October 2026. Existing catalogue titles were checked for matching targets. Open status and novelty remain subject to expert review.","motivation":"Determine whether the exact Govindan-Wilson B, D*, I* axioms force every selected set to contain a Mertens 0-stable set in every finite game, including nongeneric games.","novelty_disclaimer_acknowledged":true,"relation_to_known":"The manuscript identifies its source theorem or algorithm and explains the additional question; no new result or priority is claimed."},"relations":[],"rights":{"holders":["Anonymous submitter"],"licence":"CC-BY-4.0","redistribution":"permitted"},"schema_version":1,"sources":[],"statement_artifact":{"path":"statement.tex"},"statement_revision_id":"stm_98b676801bd24583959904cb93d3dcb4","title":"Axiomatic containment of Mertens-stable sets without genericity"},"source_records":["ECON-4"],"url":"/problems/axiomatic-containment-of-mertens-stable-sets-without-genericity/"}