{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BUMYYX34K52BQDNYOX3VGOPNGD","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":"2b8ff1d80f3577ee3716955e2a8ed1e2b688421902152061f53fff3816ad2a8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-22T09:49:47Z","title_canon_sha256":"649c923e22bb11db843b34b762244327315cceaf800f1ae1b664996d0b8ab05c"},"schema_version":"1.0","source":{"id":"1107.4466","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4466","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4466v2","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4466","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"BUMYYX34K52B","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BUMYYX34K52BQDNY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BUMYYX34","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:ced6221b5e0d01ebc427dc87ee73fa5e6a245c62c485507be1b55c4553c7bf55","target":"graph","created_at":"2026-05-18T04:10:58Z","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":"We show that there is a polynomial space algorithm that counts the number of perfect matchings in an $n$-vertex graph in $O^*(2^{n/2})\\subset O(1.415^n)$ time. ($O^*(f(n))$ suppresses functions polylogarithmic in $f(n)$).The previously fastest algorithms for the problem was the exponential space $O^*(((1+\\sqrt{5})/2)^n) \\subset O(1.619^n)$ time algorithm by Koivisto, and for polynomial space, the $O(1.942^n)$ time algorithm by Nederlof. Our new algorithm's runtime matches up to polynomial factors that of Ryser's 1963 algorithm for bipartite graphs. We present our algorithm in the more general ","authors_text":"Andreas Bj\\\"orklund","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-22T09:49:47Z","title":"Counting Perfect Matchings as Fast as Ryser"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4466","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:91bfdcc1786472a8b6d1d0780b20e4d4538296d299aa30a1b2fa2c7e53aa832f","target":"record","created_at":"2026-05-18T04:10:58Z","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":"2b8ff1d80f3577ee3716955e2a8ed1e2b688421902152061f53fff3816ad2a8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-22T09:49:47Z","title_canon_sha256":"649c923e22bb11db843b34b762244327315cceaf800f1ae1b664996d0b8ab05c"},"schema_version":"1.0","source":{"id":"1107.4466","kind":"arxiv","version":2}},"canonical_sha256":"0d198c5f7c5774180db875f75339ed30cfc42007d1302548ebf1f3c992efe820","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d198c5f7c5774180db875f75339ed30cfc42007d1302548ebf1f3c992efe820","first_computed_at":"2026-05-18T04:10:58.471153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:58.471153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"am33TMB3mp2zjFaRaNdoyfk2EXo9FDq8fO7ehIlzcpmmMPxhWWNW3eY2RpoSB1YQOKzSStfjwfL+bxLFPnEhDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:58.471723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4466","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91bfdcc1786472a8b6d1d0780b20e4d4538296d299aa30a1b2fa2c7e53aa832f","sha256:ced6221b5e0d01ebc427dc87ee73fa5e6a245c62c485507be1b55c4553c7bf55"],"state_sha256":"1e3ff0229c481837b5406caf384548a21fcec57ff997e59d6abbdac8fcd1935f"}