{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KPLU6PVXDQQULKR3XXCN5PCMN2","short_pith_number":"pith:KPLU6PVX","canonical_record":{"source":{"id":"1406.1273","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-05T05:33:15Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"144329fcfd1619d4513231121c258685c311f5681d2e99f28633cd4f9af1b6ce","abstract_canon_sha256":"c18c5a98e5ff8a85f62f54d687ee177765869dc1895d5ad327ef6a54f3a5a7de"},"schema_version":"1.0"},"canonical_sha256":"53d74f3eb71c2145aa3bbdc4debc4c6ea9c53a230ffed07792a29dfdea28e6d8","source":{"kind":"arxiv","id":"1406.1273","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1273","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1273v2","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1273","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"KPLU6PVXDQQU","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KPLU6PVXDQQULKR3","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KPLU6PVX","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KPLU6PVXDQQULKR3XXCN5PCMN2","target":"record","payload":{"canonical_record":{"source":{"id":"1406.1273","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-05T05:33:15Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"144329fcfd1619d4513231121c258685c311f5681d2e99f28633cd4f9af1b6ce","abstract_canon_sha256":"c18c5a98e5ff8a85f62f54d687ee177765869dc1895d5ad327ef6a54f3a5a7de"},"schema_version":"1.0"},"canonical_sha256":"53d74f3eb71c2145aa3bbdc4debc4c6ea9c53a230ffed07792a29dfdea28e6d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:47.132694Z","signature_b64":"RzPagctH6ApgC5S58PIAuFENpMp5DPy5TyzMcpykvGQjoSchrs2vBi0+y8Img8S0GpWJs3lJzzPQGVRCeNZ8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53d74f3eb71c2145aa3bbdc4debc4c6ea9c53a230ffed07792a29dfdea28e6d8","last_reissued_at":"2026-05-18T02:40:47.132253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:47.132253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.1273","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:40:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GxgeuKEZ0HLYelB7Jjt+yJU4azzQxOqQg3CCTLFiXNWO5GC2Ui6vlFoCeUAh5RHVBdsahak4AI6XDQ+9kKNxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:25:39.645735Z"},"content_sha256":"f7c0004daf4ec03927813a2a8527ba3eb256bc02fd8f3a83cf9d39cad0a3f052","schema_version":"1.0","event_id":"sha256:f7c0004daf4ec03927813a2a8527ba3eb256bc02fd8f3a83cf9d39cad0a3f052"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KPLU6PVXDQQULKR3XXCN5PCMN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On The Communication Complexity of Finding an (Approximate) Stable Marriage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Rafail Ostrovsky, Will Rosenbaum","submitted_at":"2014-06-05T05:33:15Z","abstract_excerpt":"In this paper, we consider the communication complexity of protocols that compute stable matchings. We work within the context of Gale and Shapley's original stable marriage problem\\cite{GS62}: $n$ men and $n$ women each privately hold a total and strict ordering on all of the members of the opposite gender. They wish to collaborate in order to find a stable matching---a pairing of the men and women such that no unmatched pair mutually prefer each other to their assigned partners in the matching. We show that any communication protocol (deterministic, nondeterministic, or randomized) that corr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1273","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:40:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JvVc28Wz/57IpKdWOeotO8z61M1A9aAQbNsruGI2VCUP1lkdODtu/kdw3Eugk7i2S5myoL0NnJMbRYGJtd1eBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:25:39.646436Z"},"content_sha256":"5c995510539c17a19eb2df02ae381c4ae5f3454eb39ddd70b24e679decbbbdaa","schema_version":"1.0","event_id":"sha256:5c995510539c17a19eb2df02ae381c4ae5f3454eb39ddd70b24e679decbbbdaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPLU6PVXDQQULKR3XXCN5PCMN2/bundle.json","state_url":"https://pith.science/pith/KPLU6PVXDQQULKR3XXCN5PCMN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPLU6PVXDQQULKR3XXCN5PCMN2/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-06-12T03:25:39Z","links":{"resolver":"https://pith.science/pith/KPLU6PVXDQQULKR3XXCN5PCMN2","bundle":"https://pith.science/pith/KPLU6PVXDQQULKR3XXCN5PCMN2/bundle.json","state":"https://pith.science/pith/KPLU6PVXDQQULKR3XXCN5PCMN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPLU6PVXDQQULKR3XXCN5PCMN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KPLU6PVXDQQULKR3XXCN5PCMN2","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":"c18c5a98e5ff8a85f62f54d687ee177765869dc1895d5ad327ef6a54f3a5a7de","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-05T05:33:15Z","title_canon_sha256":"144329fcfd1619d4513231121c258685c311f5681d2e99f28633cd4f9af1b6ce"},"schema_version":"1.0","source":{"id":"1406.1273","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1273","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1273v2","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1273","created_at":"2026-05-18T02:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"KPLU6PVXDQQU","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KPLU6PVXDQQULKR3","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KPLU6PVX","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:5c995510539c17a19eb2df02ae381c4ae5f3454eb39ddd70b24e679decbbbdaa","target":"graph","created_at":"2026-05-18T02:40:47Z","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":"In this paper, we consider the communication complexity of protocols that compute stable matchings. We work within the context of Gale and Shapley's original stable marriage problem\\cite{GS62}: $n$ men and $n$ women each privately hold a total and strict ordering on all of the members of the opposite gender. They wish to collaborate in order to find a stable matching---a pairing of the men and women such that no unmatched pair mutually prefer each other to their assigned partners in the matching. We show that any communication protocol (deterministic, nondeterministic, or randomized) that corr","authors_text":"Rafail Ostrovsky, Will Rosenbaum","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-05T05:33:15Z","title":"On The Communication Complexity of Finding an (Approximate) Stable Marriage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1273","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:f7c0004daf4ec03927813a2a8527ba3eb256bc02fd8f3a83cf9d39cad0a3f052","target":"record","created_at":"2026-05-18T02:40:47Z","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":"c18c5a98e5ff8a85f62f54d687ee177765869dc1895d5ad327ef6a54f3a5a7de","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-05T05:33:15Z","title_canon_sha256":"144329fcfd1619d4513231121c258685c311f5681d2e99f28633cd4f9af1b6ce"},"schema_version":"1.0","source":{"id":"1406.1273","kind":"arxiv","version":2}},"canonical_sha256":"53d74f3eb71c2145aa3bbdc4debc4c6ea9c53a230ffed07792a29dfdea28e6d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53d74f3eb71c2145aa3bbdc4debc4c6ea9c53a230ffed07792a29dfdea28e6d8","first_computed_at":"2026-05-18T02:40:47.132253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:47.132253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RzPagctH6ApgC5S58PIAuFENpMp5DPy5TyzMcpykvGQjoSchrs2vBi0+y8Img8S0GpWJs3lJzzPQGVRCeNZ8CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:47.132694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1273","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7c0004daf4ec03927813a2a8527ba3eb256bc02fd8f3a83cf9d39cad0a3f052","sha256:5c995510539c17a19eb2df02ae381c4ae5f3454eb39ddd70b24e679decbbbdaa"],"state_sha256":"8453ee06183b4d117e298765d81b98df5ee689b7afc7bdf67ae2930a771956ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/hqN6KY5DmG/GOJE/NwU4QTvqlLU34gPCyU81H0mVg8X5RWapNIzDIrZ58BNyY4NqlrOTmmzgrJ7c/Sh5AUhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:25:39.651629Z","bundle_sha256":"130a6e28c9f722bb5826d9bacb197cbacf9ed1323db47597df2ea5f16f37ad2b"}}