{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OZRNXDZRBB7LTSI476B3SPOCHL","short_pith_number":"pith:OZRNXDZR","schema_version":"1.0","canonical_sha256":"7662db8f31087eb9c91cff83b93dc23adc2a5a9bca72b8febbc629d7d0aa2725","source":{"kind":"arxiv","id":"1405.7709","version":5},"attestation_state":"computed","paper":{"title":"A Stable Marriage Requires Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Noam Nisan, Rafail Ostrovsky, Will Rosenbaum, Yannai A. Gonczarowski","submitted_at":"2014-05-29T20:09:12Z","abstract_excerpt":"The Gale-Shapley algorithm for the Stable Marriage Problem is known to take $\\Theta(n^2)$ steps to find a stable marriage in the worst case, but only $\\Theta(n \\log n)$ steps in the average case (with $n$ women and $n$ men). In 1976, Knuth asked whether the worst-case running time can be improved in a model of computation that does not require sequential access to the whole input. A partial negative answer was given by Ng and Hirschberg, who showed that $\\Theta(n^2)$ queries are required in a model that allows certain natural random-access queries to the participants' preferences. A significan"},"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":"1405.7709","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-05-29T20:09:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f36ccb2e58e787463248ea0ad756511da36ff3ce225be7bc4d8daa531891dbe6","abstract_canon_sha256":"3d880df6ecc94518f907e3a63a7a3d6521640d343c5b772838c4c94bb1683847"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:53.496103Z","signature_b64":"rkyW+zNiCTz5D9qKE+UvTN8MLe2ch3mJDVKLhP1bZq2tYSXI2wPNkeX3Ro7OVwDvJATy84Uy0WfumYTK9HWWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7662db8f31087eb9c91cff83b93dc23adc2a5a9bca72b8febbc629d7d0aa2725","last_reissued_at":"2026-05-18T00:09:53.495423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:53.495423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Stable Marriage Requires Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Noam Nisan, Rafail Ostrovsky, Will Rosenbaum, Yannai A. Gonczarowski","submitted_at":"2014-05-29T20:09:12Z","abstract_excerpt":"The Gale-Shapley algorithm for the Stable Marriage Problem is known to take $\\Theta(n^2)$ steps to find a stable marriage in the worst case, but only $\\Theta(n \\log n)$ steps in the average case (with $n$ women and $n$ men). In 1976, Knuth asked whether the worst-case running time can be improved in a model of computation that does not require sequential access to the whole input. A partial negative answer was given by Ng and Hirschberg, who showed that $\\Theta(n^2)$ queries are required in a model that allows certain natural random-access queries to the participants' preferences. A significan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7709","kind":"arxiv","version":5},"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":"1405.7709","created_at":"2026-05-18T00:09:53.495542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7709v5","created_at":"2026-05-18T00:09:53.495542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7709","created_at":"2026-05-18T00:09:53.495542+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZRNXDZRBB7L","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZRNXDZRBB7LTSI4","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZRNXDZR","created_at":"2026-05-18T12:28:43.426989+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/OZRNXDZRBB7LTSI476B3SPOCHL","json":"https://pith.science/pith/OZRNXDZRBB7LTSI476B3SPOCHL.json","graph_json":"https://pith.science/api/pith-number/OZRNXDZRBB7LTSI476B3SPOCHL/graph.json","events_json":"https://pith.science/api/pith-number/OZRNXDZRBB7LTSI476B3SPOCHL/events.json","paper":"https://pith.science/paper/OZRNXDZR"},"agent_actions":{"view_html":"https://pith.science/pith/OZRNXDZRBB7LTSI476B3SPOCHL","download_json":"https://pith.science/pith/OZRNXDZRBB7LTSI476B3SPOCHL.json","view_paper":"https://pith.science/paper/OZRNXDZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7709&json=true","fetch_graph":"https://pith.science/api/pith-number/OZRNXDZRBB7LTSI476B3SPOCHL/graph.json","fetch_events":"https://pith.science/api/pith-number/OZRNXDZRBB7LTSI476B3SPOCHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZRNXDZRBB7LTSI476B3SPOCHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZRNXDZRBB7LTSI476B3SPOCHL/action/storage_attestation","attest_author":"https://pith.science/pith/OZRNXDZRBB7LTSI476B3SPOCHL/action/author_attestation","sign_citation":"https://pith.science/pith/OZRNXDZRBB7LTSI476B3SPOCHL/action/citation_signature","submit_replication":"https://pith.science/pith/OZRNXDZRBB7LTSI476B3SPOCHL/action/replication_record"}},"created_at":"2026-05-18T00:09:53.495542+00:00","updated_at":"2026-05-18T00:09:53.495542+00:00"}