{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:C4J3GIYYTCLSWQ3B2MQFAG3B2X","short_pith_number":"pith:C4J3GIYY","schema_version":"1.0","canonical_sha256":"1713b3231898972b4361d320501b61d5e3898ddafe2d3d54dd754f431431a8b8","source":{"kind":"arxiv","id":"1011.2121","version":2},"attestation_state":"computed","paper":{"title":"Matching with Couples Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Avinatan Hassidim, Itai Ashlagi, Mark Braverman","submitted_at":"2010-11-09T15:52:21Z","abstract_excerpt":"It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a general class of large random markets the algorithm will find a stable matching with high probability. In particular we allow the number of couples to grow at a near-linear rate. Furthermore, truth-telling is an approximated equilibrium in the game induced by the new matching algorithm. Our results are tight: for markets in which the number of couples grows at a linear rate, we show that with constant probability no sta"},"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":"1011.2121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-09T15:52:21Z","cross_cats_sorted":[],"title_canon_sha256":"d0e277bb70bd2381b67e77c471904118dd83fb0f93d2d5424e4619c3ffe05f92","abstract_canon_sha256":"7cde1229beb9534b6c6c920e666a2ebebe3acd201eebbfde9b11c141ab9c65cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.189997Z","signature_b64":"GiZSprKGp3cnKiBGR9XhwMs1owj2fynjOkS2d2khLwMF7k+Msv3oX3mCnFH7eTd9fF7xge5BNpOtIX9u4GFBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1713b3231898972b4361d320501b61d5e3898ddafe2d3d54dd754f431431a8b8","last_reissued_at":"2026-05-18T02:23:37.189278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.189278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching with Couples Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Avinatan Hassidim, Itai Ashlagi, Mark Braverman","submitted_at":"2010-11-09T15:52:21Z","abstract_excerpt":"It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a general class of large random markets the algorithm will find a stable matching with high probability. In particular we allow the number of couples to grow at a near-linear rate. Furthermore, truth-telling is an approximated equilibrium in the game induced by the new matching algorithm. Our results are tight: for markets in which the number of couples grows at a linear rate, we show that with constant probability no sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2121","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1011.2121","created_at":"2026-05-18T02:23:37.189395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2121v2","created_at":"2026-05-18T02:23:37.189395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2121","created_at":"2026-05-18T02:23:37.189395+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4J3GIYYTCLS","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4J3GIYYTCLSWQ3B","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4J3GIYY","created_at":"2026-05-18T12:26:05.355336+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/C4J3GIYYTCLSWQ3B2MQFAG3B2X","json":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X.json","graph_json":"https://pith.science/api/pith-number/C4J3GIYYTCLSWQ3B2MQFAG3B2X/graph.json","events_json":"https://pith.science/api/pith-number/C4J3GIYYTCLSWQ3B2MQFAG3B2X/events.json","paper":"https://pith.science/paper/C4J3GIYY"},"agent_actions":{"view_html":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X","download_json":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X.json","view_paper":"https://pith.science/paper/C4J3GIYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2121&json=true","fetch_graph":"https://pith.science/api/pith-number/C4J3GIYYTCLSWQ3B2MQFAG3B2X/graph.json","fetch_events":"https://pith.science/api/pith-number/C4J3GIYYTCLSWQ3B2MQFAG3B2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X/action/storage_attestation","attest_author":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X/action/author_attestation","sign_citation":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X/action/citation_signature","submit_replication":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X/action/replication_record"}},"created_at":"2026-05-18T02:23:37.189395+00:00","updated_at":"2026-05-18T02:23:37.189395+00:00"}