{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HIC27HZQAYICZGVHELVTPDLJVQ","short_pith_number":"pith:HIC27HZQ","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"},"canonical_sha256":"3a05af9f3006102c9aa722eb378d69ac203ce2e1a3541de49ec49e9d746df04f","source":{"kind":"arxiv","id":"1211.0391","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HIC27HZQAYICZGVHELVTPDLJVQ","target":"record","payload":{"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"},"canonical_sha256":"3a05af9f3006102c9aa722eb378d69ac203ce2e1a3541de49ec49e9d746df04f","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"},"source_kind":"arxiv","source_id":"1211.0391","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J66VYWLjrm50dyTQJ1Q0p3qNPykcMhPtw7Ze5AMcLSEQ0rKBz9qwiNn8bHUfBbbwGxXa8W41ociLleZqAz8bBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:18:34.756971Z"},"content_sha256":"554cb945b4103d6c86c9c1c1ab042b9b56fd0c6360828021a20d4854355cb1ed","schema_version":"1.0","event_id":"sha256:554cb945b4103d6c86c9c1c1ab042b9b56fd0c6360828021a20d4854355cb1ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HIC27HZQAYICZGVHELVTPDLJVQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A4QpwziXPKzDJjvoFdmWPPk6EeLRMP01lXi2bcqKDLNpbbGdPTrnWLbKE6MipLCYrcwQeavRj5rSIYB8nnl9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:18:34.757696Z"},"content_sha256":"4cbf8169b41b45cfae5f07f9dbe33bf346d83d7db2d69dc33a08486dce59b9ec","schema_version":"1.0","event_id":"sha256:4cbf8169b41b45cfae5f07f9dbe33bf346d83d7db2d69dc33a08486dce59b9ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ/bundle.json","state_url":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HIC27HZQAYICZGVHELVTPDLJVQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T21:18:34Z","links":{"resolver":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ","bundle":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ/bundle.json","state":"https://pith.science/pith/HIC27HZQAYICZGVHELVTPDLJVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HIC27HZQAYICZGVHELVTPDLJVQ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DKqzp7X/1JQ2QiIGPIleaekW/FArvUdwL1xov2f2ARqlr1qIdZZ96EqT9bbpan73jzKPL3m1+wlmWjByLOHdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:18:34.761577Z","bundle_sha256":"c9d3615477812eabb564bb139e17aebf53439495293c4ea2ea8e2722ee36d66d"}}