{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2F6K3BXKS2ZCEHL3VZKBIQXZYN","short_pith_number":"pith:2F6K3BXK","canonical_record":{"source":{"id":"1511.02910","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-09T22:12:58Z","cross_cats_sorted":[],"title_canon_sha256":"4512c589011e672337509761e59f1347dd74fc11466134c371a3c45d85759018","abstract_canon_sha256":"1a546619a036d309453b850d9e34ff54491b17a627a16076f2cb77cbf88c1644"},"schema_version":"1.0"},"canonical_sha256":"d17cad86ea96b2221d7bae541442f9c35c384769005a3c09ccd94c6309e1e0a9","source":{"kind":"arxiv","id":"1511.02910","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02910","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02910v2","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02910","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"pith_short_12","alias_value":"2F6K3BXKS2ZC","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2F6K3BXKS2ZCEHL3","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2F6K3BXK","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2F6K3BXKS2ZCEHL3VZKBIQXZYN","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02910","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-09T22:12:58Z","cross_cats_sorted":[],"title_canon_sha256":"4512c589011e672337509761e59f1347dd74fc11466134c371a3c45d85759018","abstract_canon_sha256":"1a546619a036d309453b850d9e34ff54491b17a627a16076f2cb77cbf88c1644"},"schema_version":"1.0"},"canonical_sha256":"d17cad86ea96b2221d7bae541442f9c35c384769005a3c09ccd94c6309e1e0a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:58.280901Z","signature_b64":"v+RMykYGPoDxKwrJRcEp1wT8X//9uEz9pmdYqG3CnEsEuaydmWaMYaZCmfWfOxmDrXX477/fRQSbG9LgCMaWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d17cad86ea96b2221d7bae541442f9c35c384769005a3c09ccd94c6309e1e0a9","last_reissued_at":"2026-05-18T00:44:58.280458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:58.280458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02910","source_version":2,"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-18T00:44:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bMbVtKVjMKw3QZpAHnwjpZzwCPueEEK39xfzG3GuM5OwsjHjCH5oZvAw2zgkumx7ykqnSYJpFVOO+/lUzmpEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:05:27.148062Z"},"content_sha256":"077009bdf24cd66326c18dc9d78a69b9d72b0cc3e62d43de6b0555c7d3a9be24","schema_version":"1.0","event_id":"sha256:077009bdf24cd66326c18dc9d78a69b9d72b0cc3e62d43de6b0555c7d3a9be24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2F6K3BXKS2ZCEHL3VZKBIQXZYN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Radu Curticapean","submitted_at":"2015-11-09T22:12:58Z","abstract_excerpt":"We devise a framework for proving tight lower bounds under the counting exponential-time hypothesis #ETH introduced by Dell et al. (ACM Transactions on Algorithms, 2014). Our framework allows us to convert classical #P-hardness results for counting problems into tight lower bounds under #ETH, thus ruling out algorithms with running time $2^{o(n)}$ on graphs with $n$ vertices and $O(n)$ edges. As exemplary applications of this framework, we obtain tight lower bounds under #ETH for the evaluation of the zero-one permanent, the matching polynomial, and the Tutte polynomial on all non-easy points "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02910","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"},"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-18T00:44:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4y5t6gKD9SREPOr0ZOJOA5jZDFL7/bbXXd6kfEZGdIISu6GJSdLQ1RALfHGTkSSMi1pxghRYE8SxqMys94hOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T20:05:27.148413Z"},"content_sha256":"38f0599cc013fa932c67e671e2d2850e65f5445172bf9e59088f391ae14ce8cb","schema_version":"1.0","event_id":"sha256:38f0599cc013fa932c67e671e2d2850e65f5445172bf9e59088f391ae14ce8cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2F6K3BXKS2ZCEHL3VZKBIQXZYN/bundle.json","state_url":"https://pith.science/pith/2F6K3BXKS2ZCEHL3VZKBIQXZYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2F6K3BXKS2ZCEHL3VZKBIQXZYN/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-06-26T20:05:27Z","links":{"resolver":"https://pith.science/pith/2F6K3BXKS2ZCEHL3VZKBIQXZYN","bundle":"https://pith.science/pith/2F6K3BXKS2ZCEHL3VZKBIQXZYN/bundle.json","state":"https://pith.science/pith/2F6K3BXKS2ZCEHL3VZKBIQXZYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2F6K3BXKS2ZCEHL3VZKBIQXZYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2F6K3BXKS2ZCEHL3VZKBIQXZYN","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":"1a546619a036d309453b850d9e34ff54491b17a627a16076f2cb77cbf88c1644","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-09T22:12:58Z","title_canon_sha256":"4512c589011e672337509761e59f1347dd74fc11466134c371a3c45d85759018"},"schema_version":"1.0","source":{"id":"1511.02910","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02910","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02910v2","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02910","created_at":"2026-05-18T00:44:58Z"},{"alias_kind":"pith_short_12","alias_value":"2F6K3BXKS2ZC","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2F6K3BXKS2ZCEHL3","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2F6K3BXK","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:38f0599cc013fa932c67e671e2d2850e65f5445172bf9e59088f391ae14ce8cb","target":"graph","created_at":"2026-05-18T00:44: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 devise a framework for proving tight lower bounds under the counting exponential-time hypothesis #ETH introduced by Dell et al. (ACM Transactions on Algorithms, 2014). Our framework allows us to convert classical #P-hardness results for counting problems into tight lower bounds under #ETH, thus ruling out algorithms with running time $2^{o(n)}$ on graphs with $n$ vertices and $O(n)$ edges. As exemplary applications of this framework, we obtain tight lower bounds under #ETH for the evaluation of the zero-one permanent, the matching polynomial, and the Tutte polynomial on all non-easy points ","authors_text":"Radu Curticapean","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-09T22:12:58Z","title":"Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02910","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:077009bdf24cd66326c18dc9d78a69b9d72b0cc3e62d43de6b0555c7d3a9be24","target":"record","created_at":"2026-05-18T00:44: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":"1a546619a036d309453b850d9e34ff54491b17a627a16076f2cb77cbf88c1644","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-11-09T22:12:58Z","title_canon_sha256":"4512c589011e672337509761e59f1347dd74fc11466134c371a3c45d85759018"},"schema_version":"1.0","source":{"id":"1511.02910","kind":"arxiv","version":2}},"canonical_sha256":"d17cad86ea96b2221d7bae541442f9c35c384769005a3c09ccd94c6309e1e0a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d17cad86ea96b2221d7bae541442f9c35c384769005a3c09ccd94c6309e1e0a9","first_computed_at":"2026-05-18T00:44:58.280458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:58.280458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v+RMykYGPoDxKwrJRcEp1wT8X//9uEz9pmdYqG3CnEsEuaydmWaMYaZCmfWfOxmDrXX477/fRQSbG9LgCMaWAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:58.280901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02910","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:077009bdf24cd66326c18dc9d78a69b9d72b0cc3e62d43de6b0555c7d3a9be24","sha256:38f0599cc013fa932c67e671e2d2850e65f5445172bf9e59088f391ae14ce8cb"],"state_sha256":"d45709d52295a1bde8ac2995effc5145447ffc07861015b1cc20be1ff0943538"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0T72qXjYhEIsc0m1flm84CmU8vq8pyZJ4k2eZvFAyqlFNe1IMKk70ojyREs4gJe4dHeTdcOmJ8qneowkKj9VAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T20:05:27.150255Z","bundle_sha256":"766f4d4248c076f241b1f53608e83861021c672fe0bc81b4d37003944bc24dbd"}}