{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MMBEJTDG6PY7OWVAJNOHN4JRH7","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":"ccee45a79919d2211de4c9f292f36668b511f5e63fc0510ba6581e18ce09f26d","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-03T05:55:38Z","title_canon_sha256":"5364cad3bdc56edd464e58ec54557fe63842142e661900b043863d5fe28eaa08"},"schema_version":"1.0","source":{"id":"1711.01032","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01032","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01032v2","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01032","created_at":"2026-05-18T00:30:57Z"},{"alias_kind":"pith_short_12","alias_value":"MMBEJTDG6PY7","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MMBEJTDG6PY7OWVA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MMBEJTDG","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:8b794b4deaf3daec2af82383ad82ba67d1d99b9fd1b630984b4fdb0ba7e41fbc","target":"graph","created_at":"2026-05-18T00:30:57Z","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":"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","authors_text":"Anna R. Karlin, Robbie Weber, Shayan Oveis Gharan","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-03T05:55:38Z","title":"A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01032","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:7b00b31ff0bcb718cd474d775df402a9e3f92704ce70cda64cfc22f736c04fbd","target":"record","created_at":"2026-05-18T00:30:57Z","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":"ccee45a79919d2211de4c9f292f36668b511f5e63fc0510ba6581e18ce09f26d","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-03T05:55:38Z","title_canon_sha256":"5364cad3bdc56edd464e58ec54557fe63842142e661900b043863d5fe28eaa08"},"schema_version":"1.0","source":{"id":"1711.01032","kind":"arxiv","version":2}},"canonical_sha256":"630244cc66f3f1f75aa04b5c76f1313fd3987d3cdaba6f46532ba536f87410c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"630244cc66f3f1f75aa04b5c76f1313fd3987d3cdaba6f46532ba536f87410c3","first_computed_at":"2026-05-18T00:30:57.170832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:57.170832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zsXQFVhERPjKbShcTbinpQbcu5VM4aCLy5430MxmqU4c1fY82QClr8h83AvuVNZTObGb1cxS7CuwqRdd0OdnAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:57.171777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01032","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b00b31ff0bcb718cd474d775df402a9e3f92704ce70cda64cfc22f736c04fbd","sha256:8b794b4deaf3daec2af82383ad82ba67d1d99b9fd1b630984b4fdb0ba7e41fbc"],"state_sha256":"5314982cfa41fa4d9de67bc423f6a8d3f131ee7bdea3e3bc691dc43a10907a4a"}