{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:C4J3GIYYTCLSWQ3B2MQFAG3B2X","short_pith_number":"pith:C4J3GIYY","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"},"canonical_sha256":"1713b3231898972b4361d320501b61d5e3898ddafe2d3d54dd754f431431a8b8","source":{"kind":"arxiv","id":"1011.2121","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2121","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2121v2","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2121","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"C4J3GIYYTCLS","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"C4J3GIYYTCLSWQ3B","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"C4J3GIYY","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:C4J3GIYYTCLSWQ3B2MQFAG3B2X","target":"record","payload":{"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"},"canonical_sha256":"1713b3231898972b4361d320501b61d5e3898ddafe2d3d54dd754f431431a8b8","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"},"source_kind":"arxiv","source_id":"1011.2121","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwUaU86hIXtkigpovF9yDE0WobDT//BmJlreHr77CSwtjqkPV8EkWLS2qZl3jieBNIuMjW6E4onZ6YxEHXywCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:37:04.769463Z"},"content_sha256":"d850323a61da36f01c95b41912362190213fa4c9c1b5885c4ec19dc7bcf24ad9","schema_version":"1.0","event_id":"sha256:d850323a61da36f01c95b41912362190213fa4c9c1b5885c4ec19dc7bcf24ad9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:C4J3GIYYTCLSWQ3B2MQFAG3B2X","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:23:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQ7Vazjwe09PZbzlrPvR8JRRdh8YyMKXkYnh74sphO1Uz5i3OsU4sLJbuM/fiFSZawdvGj10JVWg9M+Fl6sWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:37:04.770356Z"},"content_sha256":"cb3658cc51809d83e8fd00416446600a70dbff24d92149078cc3e1cfa8dd3a4c","schema_version":"1.0","event_id":"sha256:cb3658cc51809d83e8fd00416446600a70dbff24d92149078cc3e1cfa8dd3a4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X/bundle.json","state_url":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T02:37:04Z","links":{"resolver":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X","bundle":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X/bundle.json","state":"https://pith.science/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4J3GIYYTCLSWQ3B2MQFAG3B2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:C4J3GIYYTCLSWQ3B2MQFAG3B2X","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":"7cde1229beb9534b6c6c920e666a2ebebe3acd201eebbfde9b11c141ab9c65cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-09T15:52:21Z","title_canon_sha256":"d0e277bb70bd2381b67e77c471904118dd83fb0f93d2d5424e4619c3ffe05f92"},"schema_version":"1.0","source":{"id":"1011.2121","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2121","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2121v2","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2121","created_at":"2026-05-18T02:23:37Z"},{"alias_kind":"pith_short_12","alias_value":"C4J3GIYYTCLS","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"C4J3GIYYTCLSWQ3B","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"C4J3GIYY","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:cb3658cc51809d83e8fd00416446600a70dbff24d92149078cc3e1cfa8dd3a4c","target":"graph","created_at":"2026-05-18T02:23:37Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Avinatan Hassidim, Itai Ashlagi, Mark Braverman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-09T15:52:21Z","title":"Matching with Couples Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2121","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d850323a61da36f01c95b41912362190213fa4c9c1b5885c4ec19dc7bcf24ad9","target":"record","created_at":"2026-05-18T02:23:37Z","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":"7cde1229beb9534b6c6c920e666a2ebebe3acd201eebbfde9b11c141ab9c65cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-11-09T15:52:21Z","title_canon_sha256":"d0e277bb70bd2381b67e77c471904118dd83fb0f93d2d5424e4619c3ffe05f92"},"schema_version":"1.0","source":{"id":"1011.2121","kind":"arxiv","version":2}},"canonical_sha256":"1713b3231898972b4361d320501b61d5e3898ddafe2d3d54dd754f431431a8b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1713b3231898972b4361d320501b61d5e3898ddafe2d3d54dd754f431431a8b8","first_computed_at":"2026-05-18T02:23:37.189278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:37.189278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GiZSprKGp3cnKiBGR9XhwMs1owj2fynjOkS2d2khLwMF7k+Msv3oX3mCnFH7eTd9fF7xge5BNpOtIX9u4GFBBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:37.189997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2121","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d850323a61da36f01c95b41912362190213fa4c9c1b5885c4ec19dc7bcf24ad9","sha256:cb3658cc51809d83e8fd00416446600a70dbff24d92149078cc3e1cfa8dd3a4c"],"state_sha256":"3e8b33c51f4886209c1d05e0d7f8664846e2348cf0736120b429e62515a6c08a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pm752naxqY09nI8uLI92JDPUib3DjWH1OHrwcCtceierfN7iMt7W8x6snX44vRrdpOmdsxYGWdYJtE8Y7UY8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:37:04.772671Z","bundle_sha256":"2adc545149c6ea2890b910b2c56f7ef8abbb0b08ebda60113d3442e1749a6ecc"}}