{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Z2YBKC2NLDQFJDF4ZZS6ZU66K3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"eac940dd2983a640bbda616900250847432bcfee23f9c8fab29e2d1bf23c336d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2026-03-24T10:18:07Z","title_canon_sha256":"98e9e6c19fbe8501e9a065d2be60d155f32ec654adf532d367efbb1091824071"},"schema_version":"1.0","source":{"id":"2603.23038","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.23038","created_at":"2026-05-20T02:05:42Z"},{"alias_kind":"arxiv_version","alias_value":"2603.23038v5","created_at":"2026-05-20T02:05:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.23038","created_at":"2026-05-20T02:05:42Z"},{"alias_kind":"pith_short_12","alias_value":"Z2YBKC2NLDQF","created_at":"2026-05-20T02:05:42Z"},{"alias_kind":"pith_short_16","alias_value":"Z2YBKC2NLDQFJDF4","created_at":"2026-05-20T02:05:42Z"},{"alias_kind":"pith_short_8","alias_value":"Z2YBKC2N","created_at":"2026-05-20T02:05:42Z"}],"graph_snapshots":[{"event_id":"sha256:ddece8810dd71695e49c585e65d2790f4cf2c8e490fd3ab5260542dd9d1cb3de","target":"graph","created_at":"2026-05-20T02:05:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that stable matchings exist when choice correspondences satisfy substitutability and a new general acyclicity condition. We provide a constructive proof using a Grow or Discard Algorithm that iteratively expands or eliminates contracts until a strongly maximal individually rational set is reached."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Choice correspondences satisfy substitutability together with the newly introduced general acyclicity condition (weaker than path independence) for the many-to-many case."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Stable matchings exist under substitutability and general acyclicity for choice correspondences in many-to-many markets, constructed via a Grow or Discard algorithm that avoids permanent rejection of contracts."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Stable matchings exist in many-to-many markets when choice correspondences are substitutable and generally acyclic."}],"snapshot_sha256":"9a60602f5c6989ddca36930b931928de919f39b76c02acdc3baaa36e76cc32b6"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.23038/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the existence of stable matchings when agents have choice correspondences instead of preference relations. We extend the framework of \\cite{chambers2017choice} by weakening the path independence assumption. For many-to-many markets, we show that stable matchings exist when choice correspondences satisfy substitutability and a new general acyclicity condition. We provide a constructive proof using a Grow or Discard Algorithm that iteratively expands or eliminates contracts until a strongly maximal individually rational set is reached. We provide an algorithm to obtain stable matchings ","authors_text":"Mihir Bhattacharya, Ojasvi Khare, Varun Bansal","cross_cats":[],"headline":"Stable matchings exist in many-to-many markets when choice correspondences are substitutable and generally acyclic.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2026-03-24T10:18:07Z","title":"Stable Matchings with Choice Correspondences Under Acyclicity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.23038","kind":"arxiv","version":5},"verdict":{"created_at":"2026-05-15T01:19:15.770611Z","id":"b16ff5fa-2fe5-4cd2-9bcf-2f1e2885898e","model_set":{"reader":"grok-4.3"},"one_line_summary":"Stable matchings exist under substitutability and general acyclicity for choice correspondences in many-to-many markets, constructed via a Grow or Discard algorithm that avoids permanent rejection of contracts.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Stable matchings exist in many-to-many markets when choice correspondences are substitutable and generally acyclic.","strongest_claim":"We show that stable matchings exist when choice correspondences satisfy substitutability and a new general acyclicity condition. We provide a constructive proof using a Grow or Discard Algorithm that iteratively expands or eliminates contracts until a strongly maximal individually rational set is reached.","weakest_assumption":"Choice correspondences satisfy substitutability together with the newly introduced general acyclicity condition (weaker than path independence) for the many-to-many case."}},"verdict_id":"b16ff5fa-2fe5-4cd2-9bcf-2f1e2885898e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8411552ac728019bae9d66a019a2322c69302b6820c41b538cd10e6f89c9b0b9","target":"record","created_at":"2026-05-20T02:05:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"eac940dd2983a640bbda616900250847432bcfee23f9c8fab29e2d1bf23c336d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2026-03-24T10:18:07Z","title_canon_sha256":"98e9e6c19fbe8501e9a065d2be60d155f32ec654adf532d367efbb1091824071"},"schema_version":"1.0","source":{"id":"2603.23038","kind":"arxiv","version":5}},"canonical_sha256":"ceb0150b4d58e0548cbcce65ecd3de56d784f62b70391275faa1f731066ba54d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ceb0150b4d58e0548cbcce65ecd3de56d784f62b70391275faa1f731066ba54d","first_computed_at":"2026-05-20T02:05:42.381986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T02:05:42.381986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pLubjbAAr6sj4lvbOIVEFMaUbYmgV5lWEZFnaUnFozcDSrCPx2IN6h+E79tGscK3YrUCZZn0IGmb5XUiU/4JDw==","signature_status":"signed_v1","signed_at":"2026-05-20T02:05:42.382970Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.23038","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8411552ac728019bae9d66a019a2322c69302b6820c41b538cd10e6f89c9b0b9","sha256:ddece8810dd71695e49c585e65d2790f4cf2c8e490fd3ab5260542dd9d1cb3de"],"state_sha256":"272202e2144b10c1f51c687b5bd62ee156008761b20198f32776630b5529f00d"}