{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:XZ3TPOQVSWR2EKOX67V2JEG5YL","short_pith_number":"pith:XZ3TPOQV","canonical_record":{"source":{"id":"1107.2001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-11T11:27:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"fc07373db6d807b8c5749d56d2223f9aa948b35bf6a5f4a18afe11c1bca09e91","abstract_canon_sha256":"8b3fc164ecc8c96521ff9e8fabcd71de998a5157ff399dc52693c882f6c22efc"},"schema_version":"1.0"},"canonical_sha256":"be7737ba1595a3a229d7f7eba490ddc2ef02339c2ae8d100abd3c478bb2a9475","source":{"kind":"arxiv","id":"1107.2001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2001","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2001v1","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2001","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"XZ3TPOQVSWR2","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XZ3TPOQVSWR2EKOX","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XZ3TPOQV","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:XZ3TPOQVSWR2EKOX67V2JEG5YL","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-11T11:27:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"fc07373db6d807b8c5749d56d2223f9aa948b35bf6a5f4a18afe11c1bca09e91","abstract_canon_sha256":"8b3fc164ecc8c96521ff9e8fabcd71de998a5157ff399dc52693c882f6c22efc"},"schema_version":"1.0"},"canonical_sha256":"be7737ba1595a3a229d7f7eba490ddc2ef02339c2ae8d100abd3c478bb2a9475","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:33.651372Z","signature_b64":"dzyFJVoQ13AYr9q3VRIU9/KOCEGGZt+8UdPRG8QuuZzE+r5LRbKfrkBcondigmmwr8rpt6kedJGboBDCrVW8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be7737ba1595a3a229d7f7eba490ddc2ef02339c2ae8d100abd3c478bb2a9475","last_reissued_at":"2026-05-18T04:18:33.650847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:33.650847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2001","source_version":1,"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-18T04:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHc9wimprHCeuXdYkmC9YqP0np2CYgLZGDBwijVch/byBT7Jlge+CmRbv5bOV83d4ZQSwh8OW1Dnro/yYrDKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:55:17.164159Z"},"content_sha256":"3acd80172bea042d69616db6275bd6c8038a9f865f2367c206b48407c94e2c2b","schema_version":"1.0","event_id":"sha256:3acd80172bea042d69616db6275bd6c8038a9f865f2367c206b48407c94e2c2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:XZ3TPOQVSWR2EKOX67V2JEG5YL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Approximation Algorithm for #k-SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Marc Thurley","submitted_at":"2011-07-11T11:27:34Z","abstract_excerpt":"We present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximates #k-SAT for any k >= 3 within a running time that is not only non-trivial, but also significantly better than that of the currently fastest exact algorithms for the problem. More precisely, our algorithm is a randomized approximation scheme whose running time depends polynomially on the error tolerance and is mildly exponential in the number n of variables of the input formula. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2001","kind":"arxiv","version":1},"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-18T04:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AY5ZdSofh9zC/tcpG7W8HS9rUvNvLI72Lj5JZKCofECYj8Egz+aByiSyNzCdh5yr1Wq7MdtSyUhSs3fwcgqcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:55:17.164535Z"},"content_sha256":"68cc8ac330db6cb1e2dab6f0674fda92133607ac771d12644e33da29a43275d7","schema_version":"1.0","event_id":"sha256:68cc8ac330db6cb1e2dab6f0674fda92133607ac771d12644e33da29a43275d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL/bundle.json","state_url":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL/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-23T15:55:17Z","links":{"resolver":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL","bundle":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL/bundle.json","state":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XZ3TPOQVSWR2EKOX67V2JEG5YL","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":"8b3fc164ecc8c96521ff9e8fabcd71de998a5157ff399dc52693c882f6c22efc","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-11T11:27:34Z","title_canon_sha256":"fc07373db6d807b8c5749d56d2223f9aa948b35bf6a5f4a18afe11c1bca09e91"},"schema_version":"1.0","source":{"id":"1107.2001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2001","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2001v1","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2001","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"XZ3TPOQVSWR2","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XZ3TPOQVSWR2EKOX","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XZ3TPOQV","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:68cc8ac330db6cb1e2dab6f0674fda92133607ac771d12644e33da29a43275d7","target":"graph","created_at":"2026-05-18T04:18:33Z","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 present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximates #k-SAT for any k >= 3 within a running time that is not only non-trivial, but also significantly better than that of the currently fastest exact algorithms for the problem. More precisely, our algorithm is a randomized approximation scheme whose running time depends polynomially on the error tolerance and is mildly exponential in the number n of variables of the input formula. ","authors_text":"Marc Thurley","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-11T11:27:34Z","title":"An Approximation Algorithm for #k-SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2001","kind":"arxiv","version":1},"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:3acd80172bea042d69616db6275bd6c8038a9f865f2367c206b48407c94e2c2b","target":"record","created_at":"2026-05-18T04:18:33Z","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":"8b3fc164ecc8c96521ff9e8fabcd71de998a5157ff399dc52693c882f6c22efc","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-11T11:27:34Z","title_canon_sha256":"fc07373db6d807b8c5749d56d2223f9aa948b35bf6a5f4a18afe11c1bca09e91"},"schema_version":"1.0","source":{"id":"1107.2001","kind":"arxiv","version":1}},"canonical_sha256":"be7737ba1595a3a229d7f7eba490ddc2ef02339c2ae8d100abd3c478bb2a9475","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be7737ba1595a3a229d7f7eba490ddc2ef02339c2ae8d100abd3c478bb2a9475","first_computed_at":"2026-05-18T04:18:33.650847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:33.650847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dzyFJVoQ13AYr9q3VRIU9/KOCEGGZt+8UdPRG8QuuZzE+r5LRbKfrkBcondigmmwr8rpt6kedJGboBDCrVW8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:33.651372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3acd80172bea042d69616db6275bd6c8038a9f865f2367c206b48407c94e2c2b","sha256:68cc8ac330db6cb1e2dab6f0674fda92133607ac771d12644e33da29a43275d7"],"state_sha256":"409532d061026d710e3adde529794dbec3c3fe4a029cfaba9c224ddbb79880e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7mAcfnWHDt0z6j4eFrusiFzlulZ+pdwgcfAtdjPb/w+C+CUnA8QIxVrKZ6RLNADzhwJ26EPieS1LB3r0UtyvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:55:17.166567Z","bundle_sha256":"6e3e77d702097b1cf31ffe23c461f2719ca891f36f011ffb3ed61d7427b71e20"}}