{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BUMYYX34K52BQDNYOX3VGOPNGD","short_pith_number":"pith:BUMYYX34","schema_version":"1.0","canonical_sha256":"0d198c5f7c5774180db875f75339ed30cfc42007d1302548ebf1f3c992efe820","source":{"kind":"arxiv","id":"1107.4466","version":2},"attestation_state":"computed","paper":{"title":"Counting Perfect Matchings as Fast as Ryser","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund","submitted_at":"2011-07-22T09:49:47Z","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 "},"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":"1107.4466","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-22T09:49:47Z","cross_cats_sorted":[],"title_canon_sha256":"649c923e22bb11db843b34b762244327315cceaf800f1ae1b664996d0b8ab05c","abstract_canon_sha256":"2b8ff1d80f3577ee3716955e2a8ed1e2b688421902152061f53fff3816ad2a8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:58.471723Z","signature_b64":"am33TMB3mp2zjFaRaNdoyfk2EXo9FDq8fO7ehIlzcpmmMPxhWWNW3eY2RpoSB1YQOKzSStfjwfL+bxLFPnEhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d198c5f7c5774180db875f75339ed30cfc42007d1302548ebf1f3c992efe820","last_reissued_at":"2026-05-18T04:10:58.471153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:58.471153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Perfect Matchings as Fast as Ryser","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund","submitted_at":"2011-07-22T09:49:47Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4466","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":"1107.4466","created_at":"2026-05-18T04:10:58.471229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4466v2","created_at":"2026-05-18T04:10:58.471229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4466","created_at":"2026-05-18T04:10:58.471229+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUMYYX34K52B","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUMYYX34K52BQDNY","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUMYYX34","created_at":"2026-05-18T12:26:24.575870+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/BUMYYX34K52BQDNYOX3VGOPNGD","json":"https://pith.science/pith/BUMYYX34K52BQDNYOX3VGOPNGD.json","graph_json":"https://pith.science/api/pith-number/BUMYYX34K52BQDNYOX3VGOPNGD/graph.json","events_json":"https://pith.science/api/pith-number/BUMYYX34K52BQDNYOX3VGOPNGD/events.json","paper":"https://pith.science/paper/BUMYYX34"},"agent_actions":{"view_html":"https://pith.science/pith/BUMYYX34K52BQDNYOX3VGOPNGD","download_json":"https://pith.science/pith/BUMYYX34K52BQDNYOX3VGOPNGD.json","view_paper":"https://pith.science/paper/BUMYYX34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4466&json=true","fetch_graph":"https://pith.science/api/pith-number/BUMYYX34K52BQDNYOX3VGOPNGD/graph.json","fetch_events":"https://pith.science/api/pith-number/BUMYYX34K52BQDNYOX3VGOPNGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUMYYX34K52BQDNYOX3VGOPNGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUMYYX34K52BQDNYOX3VGOPNGD/action/storage_attestation","attest_author":"https://pith.science/pith/BUMYYX34K52BQDNYOX3VGOPNGD/action/author_attestation","sign_citation":"https://pith.science/pith/BUMYYX34K52BQDNYOX3VGOPNGD/action/citation_signature","submit_replication":"https://pith.science/pith/BUMYYX34K52BQDNYOX3VGOPNGD/action/replication_record"}},"created_at":"2026-05-18T04:10:58.471229+00:00","updated_at":"2026-05-18T04:10:58.471229+00:00"}