{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Z2YBKC2NLDQFJDF4ZZS6ZU66K3","short_pith_number":"pith:Z2YBKC2N","schema_version":"1.0","canonical_sha256":"ceb0150b4d58e0548cbcce65ecd3de56d784f62b70391275faa1f731066ba54d","source":{"kind":"arxiv","id":"2603.23038","version":5},"attestation_state":"computed","paper":{"title":"Stable Matchings with Choice Correspondences Under Acyclicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Stable matchings exist in many-to-many markets when choice correspondences are substitutable and generally acyclic.","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Mihir Bhattacharya, Ojasvi Khare, Varun Bansal","submitted_at":"2026-03-24T10:18:07Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2603.23038","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.TH","submitted_at":"2026-03-24T10:18:07Z","cross_cats_sorted":[],"title_canon_sha256":"98e9e6c19fbe8501e9a065d2be60d155f32ec654adf532d367efbb1091824071","abstract_canon_sha256":"eac940dd2983a640bbda616900250847432bcfee23f9c8fab29e2d1bf23c336d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:05:42.382970Z","signature_b64":"pLubjbAAr6sj4lvbOIVEFMaUbYmgV5lWEZFnaUnFozcDSrCPx2IN6h+E79tGscK3YrUCZZn0IGmb5XUiU/4JDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceb0150b4d58e0548cbcce65ecd3de56d784f62b70391275faa1f731066ba54d","last_reissued_at":"2026-05-20T02:05:42.381986Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:05:42.381986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stable Matchings with Choice Correspondences Under Acyclicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Stable matchings exist in many-to-many markets when choice correspondences are substitutable and generally acyclic.","cross_cats":[],"primary_cat":"econ.TH","authors_text":"Mihir Bhattacharya, Ojasvi Khare, Varun Bansal","submitted_at":"2026-03-24T10:18:07Z","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 "},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Choice correspondences satisfy substitutability together with the newly introduced general acyclicity condition (weaker than path independence) for the many-to-many case.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Stable matchings exist in many-to-many markets when choice correspondences are substitutable and generally acyclic.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9a60602f5c6989ddca36930b931928de919f39b76c02acdc3baaa36e76cc32b6"},"source":{"id":"2603.23038","kind":"arxiv","version":5},"verdict":{"id":"b16ff5fa-2fe5-4cd2-9bcf-2f1e2885898e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:19:15.770611Z","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.","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","weakest_assumption":"Choice correspondences satisfy substitutability together with the newly introduced general acyclicity condition (weaker than path independence) for the many-to-many case.","pith_extraction_headline":"Stable matchings exist in many-to-many markets when choice correspondences are substitutable and generally acyclic."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.23038/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.23038","created_at":"2026-05-20T02:05:42.382133+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.23038v5","created_at":"2026-05-20T02:05:42.382133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.23038","created_at":"2026-05-20T02:05:42.382133+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2YBKC2NLDQF","created_at":"2026-05-20T02:05:42.382133+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2YBKC2NLDQFJDF4","created_at":"2026-05-20T02:05:42.382133+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2YBKC2N","created_at":"2026-05-20T02:05:42.382133+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z2YBKC2NLDQFJDF4ZZS6ZU66K3","json":"https://pith.science/pith/Z2YBKC2NLDQFJDF4ZZS6ZU66K3.json","graph_json":"https://pith.science/api/pith-number/Z2YBKC2NLDQFJDF4ZZS6ZU66K3/graph.json","events_json":"https://pith.science/api/pith-number/Z2YBKC2NLDQFJDF4ZZS6ZU66K3/events.json","paper":"https://pith.science/paper/Z2YBKC2N"},"agent_actions":{"view_html":"https://pith.science/pith/Z2YBKC2NLDQFJDF4ZZS6ZU66K3","download_json":"https://pith.science/pith/Z2YBKC2NLDQFJDF4ZZS6ZU66K3.json","view_paper":"https://pith.science/paper/Z2YBKC2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.23038&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2YBKC2NLDQFJDF4ZZS6ZU66K3/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2YBKC2NLDQFJDF4ZZS6ZU66K3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2YBKC2NLDQFJDF4ZZS6ZU66K3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2YBKC2NLDQFJDF4ZZS6ZU66K3/action/storage_attestation","attest_author":"https://pith.science/pith/Z2YBKC2NLDQFJDF4ZZS6ZU66K3/action/author_attestation","sign_citation":"https://pith.science/pith/Z2YBKC2NLDQFJDF4ZZS6ZU66K3/action/citation_signature","submit_replication":"https://pith.science/pith/Z2YBKC2NLDQFJDF4ZZS6ZU66K3/action/replication_record"}},"created_at":"2026-05-20T02:05:42.382133+00:00","updated_at":"2026-05-20T02:05:42.382133+00:00"}