{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HIC27HZQAYICZGVHELVTPDLJVQ","short_pith_number":"pith:HIC27HZQ","schema_version":"1.0","canonical_sha256":"3a05af9f3006102c9aa722eb378d69ac203ce2e1a3541de49ec49e9d746df04f","source":{"kind":"arxiv","id":"1211.0391","version":3},"attestation_state":"computed","paper":{"title":"Below All Subsets for Some Permutational Counting Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund","submitted_at":"2012-11-02T08:27:13Z","abstract_excerpt":"We show that the two problems of computing the permanent of an $n\\times n$ matrix of $\\operatorname{poly}(n)$-bit integers and counting the number of Hamiltonian cycles in a directed $n$-vertex multigraph with $\\operatorname{exp}(\\operatorname{poly}(n))$ edges can be reduced to relatively few smaller instances of themselves. In effect we derive the first deterministic algorithms for these two problems that run in $o(2^n)$ time in the worst case. Classic $\\operatorname{poly}(n)2^n$ time algorithms for the two problems have been known since the early 1960's. Our algorithms run in $2^{n-\\Omega(\\s"},"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":"1211.0391","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-02T08:27:13Z","cross_cats_sorted":[],"title_canon_sha256":"3c9ceb5c1c198efc8c3d08ea5c9ec0f28f2bafaaf9ecfa0d975f31775a113b31","abstract_canon_sha256":"f73671c1b0bcda7e1893378309a7efd3cb5b24f08456eb0a8b5d9b96f2d07ba5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:06.358643Z","signature_b64":"T0iE/NMVYDEQFzqlOiaeYBWuqAGUTDsOlmUeCV6dik/iNrx7GuQhsaHteREYop+VboS0QXJCY6kZXI0UT88eAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a05af9f3006102c9aa722eb378d69ac203ce2e1a3541de49ec49e9d746df04f","last_reissued_at":"2026-05-18T03:15:06.357817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:06.357817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Below All Subsets for Some Permutational Counting Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund","submitted_at":"2012-11-02T08:27:13Z","abstract_excerpt":"We show that the two problems of computing the permanent of an $n\\times n$ matrix of $\\operatorname{poly}(n)$-bit integers and counting the number of Hamiltonian cycles in a directed $n$-vertex multigraph with $\\operatorname{exp}(\\operatorname{poly}(n))$ edges can be reduced to relatively few smaller instances of themselves. In effect we derive the first deterministic algorithms for these two problems that run in $o(2^n)$ time in the worst case. Classic $\\operatorname{poly}(n)2^n$ time algorithms for the two problems have been known since the early 1960's. Our algorithms run in $2^{n-\\Omega(\\s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0391","kind":"arxiv","version":3},"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":"1211.0391","created_at":"2026-05-18T03:15:06.357946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0391v3","created_at":"2026-05-18T03:15:06.357946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0391","created_at":"2026-05-18T03:15:06.357946+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIC27HZQAYIC","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIC27HZQAYICZGVH","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIC27HZQ","created_at":"2026-05-18T12:27:09.501522+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/HIC27HZQAYICZGVHELVTPDLJVQ","json":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ.json","graph_json":"https://pith.science/api/pith-number/HIC27HZQAYICZGVHELVTPDLJVQ/graph.json","events_json":"https://pith.science/api/pith-number/HIC27HZQAYICZGVHELVTPDLJVQ/events.json","paper":"https://pith.science/paper/HIC27HZQ"},"agent_actions":{"view_html":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ","download_json":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ.json","view_paper":"https://pith.science/paper/HIC27HZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0391&json=true","fetch_graph":"https://pith.science/api/pith-number/HIC27HZQAYICZGVHELVTPDLJVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HIC27HZQAYICZGVHELVTPDLJVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ/action/storage_attestation","attest_author":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ/action/author_attestation","sign_citation":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ/action/citation_signature","submit_replication":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ/action/replication_record"}},"created_at":"2026-05-18T03:15:06.357946+00:00","updated_at":"2026-05-18T03:15:06.357946+00:00"}