{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MMBEJTDG6PY7OWVAJNOHN4JRH7","short_pith_number":"pith:MMBEJTDG","schema_version":"1.0","canonical_sha256":"630244cc66f3f1f75aa04b5c76f1313fd3987d3cdaba6f46532ba536f87410c3","source":{"kind":"arxiv","id":"1711.01032","version":2},"attestation_state":"computed","paper":{"title":"A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Anna R. Karlin, Robbie Weber, Shayan Oveis Gharan","submitted_at":"2017-11-03T05:55:38Z","abstract_excerpt":"Stable matching is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley. In this paper, we provide a new upper bound on $f(n)$, the maximum number of stable matchings that a stable matching instance with $n$ men and $n$ women can have. It has been a long-standing open problem to understand the asymptotic behavior of $f(n)$ as $n\\to\\infty$, first posed by Donald Knuth in the 1970s. Until now the best lower bound was approximately $2.28^n$, and the best upper bound was $2^{n\\lo"},"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":"1711.01032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-03T05:55:38Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"5364cad3bdc56edd464e58ec54557fe63842142e661900b043863d5fe28eaa08","abstract_canon_sha256":"ccee45a79919d2211de4c9f292f36668b511f5e63fc0510ba6581e18ce09f26d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:57.171777Z","signature_b64":"zsXQFVhERPjKbShcTbinpQbcu5VM4aCLy5430MxmqU4c1fY82QClr8h83AvuVNZTObGb1cxS7CuwqRdd0OdnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"630244cc66f3f1f75aa04b5c76f1313fd3987d3cdaba6f46532ba536f87410c3","last_reissued_at":"2026-05-18T00:30:57.170832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:57.170832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Anna R. Karlin, Robbie Weber, Shayan Oveis Gharan","submitted_at":"2017-11-03T05:55:38Z","abstract_excerpt":"Stable matching is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley. In this paper, we provide a new upper bound on $f(n)$, the maximum number of stable matchings that a stable matching instance with $n$ men and $n$ women can have. It has been a long-standing open problem to understand the asymptotic behavior of $f(n)$ as $n\\to\\infty$, first posed by Donald Knuth in the 1970s. Until now the best lower bound was approximately $2.28^n$, and the best upper bound was $2^{n\\lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01032","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":"1711.01032","created_at":"2026-05-18T00:30:57.170977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01032v2","created_at":"2026-05-18T00:30:57.170977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01032","created_at":"2026-05-18T00:30:57.170977+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMBEJTDG6PY7","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMBEJTDG6PY7OWVA","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMBEJTDG","created_at":"2026-05-18T12:31:31.346846+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/MMBEJTDG6PY7OWVAJNOHN4JRH7","json":"https://pith.science/pith/MMBEJTDG6PY7OWVAJNOHN4JRH7.json","graph_json":"https://pith.science/api/pith-number/MMBEJTDG6PY7OWVAJNOHN4JRH7/graph.json","events_json":"https://pith.science/api/pith-number/MMBEJTDG6PY7OWVAJNOHN4JRH7/events.json","paper":"https://pith.science/paper/MMBEJTDG"},"agent_actions":{"view_html":"https://pith.science/pith/MMBEJTDG6PY7OWVAJNOHN4JRH7","download_json":"https://pith.science/pith/MMBEJTDG6PY7OWVAJNOHN4JRH7.json","view_paper":"https://pith.science/paper/MMBEJTDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01032&json=true","fetch_graph":"https://pith.science/api/pith-number/MMBEJTDG6PY7OWVAJNOHN4JRH7/graph.json","fetch_events":"https://pith.science/api/pith-number/MMBEJTDG6PY7OWVAJNOHN4JRH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMBEJTDG6PY7OWVAJNOHN4JRH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMBEJTDG6PY7OWVAJNOHN4JRH7/action/storage_attestation","attest_author":"https://pith.science/pith/MMBEJTDG6PY7OWVAJNOHN4JRH7/action/author_attestation","sign_citation":"https://pith.science/pith/MMBEJTDG6PY7OWVAJNOHN4JRH7/action/citation_signature","submit_replication":"https://pith.science/pith/MMBEJTDG6PY7OWVAJNOHN4JRH7/action/replication_record"}},"created_at":"2026-05-18T00:30:57.170977+00:00","updated_at":"2026-05-18T00:30:57.170977+00:00"}