{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HIC27HZQAYICZGVHELVTPDLJVQ","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":"f73671c1b0bcda7e1893378309a7efd3cb5b24f08456eb0a8b5d9b96f2d07ba5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-02T08:27:13Z","title_canon_sha256":"3c9ceb5c1c198efc8c3d08ea5c9ec0f28f2bafaaf9ecfa0d975f31775a113b31"},"schema_version":"1.0","source":{"id":"1211.0391","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0391","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0391v3","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0391","created_at":"2026-05-18T03:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"HIC27HZQAYIC","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HIC27HZQAYICZGVH","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HIC27HZQ","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:4cbf8169b41b45cfae5f07f9dbe33bf346d83d7db2d69dc33a08486dce59b9ec","target":"graph","created_at":"2026-05-18T03:15:06Z","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 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","authors_text":"Andreas Bj\\\"orklund","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-02T08:27:13Z","title":"Below All Subsets for Some Permutational Counting Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0391","kind":"arxiv","version":3},"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:554cb945b4103d6c86c9c1c1ab042b9b56fd0c6360828021a20d4854355cb1ed","target":"record","created_at":"2026-05-18T03:15:06Z","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":"f73671c1b0bcda7e1893378309a7efd3cb5b24f08456eb0a8b5d9b96f2d07ba5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-02T08:27:13Z","title_canon_sha256":"3c9ceb5c1c198efc8c3d08ea5c9ec0f28f2bafaaf9ecfa0d975f31775a113b31"},"schema_version":"1.0","source":{"id":"1211.0391","kind":"arxiv","version":3}},"canonical_sha256":"3a05af9f3006102c9aa722eb378d69ac203ce2e1a3541de49ec49e9d746df04f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a05af9f3006102c9aa722eb378d69ac203ce2e1a3541de49ec49e9d746df04f","first_computed_at":"2026-05-18T03:15:06.357817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:06.357817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T0iE/NMVYDEQFzqlOiaeYBWuqAGUTDsOlmUeCV6dik/iNrx7GuQhsaHteREYop+VboS0QXJCY6kZXI0UT88eAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:06.358643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0391","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:554cb945b4103d6c86c9c1c1ab042b9b56fd0c6360828021a20d4854355cb1ed","sha256:4cbf8169b41b45cfae5f07f9dbe33bf346d83d7db2d69dc33a08486dce59b9ec"],"state_sha256":"a50336fdc83753505359b86d88ae8d994be6660d23c20822bfd31a6dc3a9d9fc"}