{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XZ3TPOQVSWR2EKOX67V2JEG5YL","short_pith_number":"pith:XZ3TPOQV","schema_version":"1.0","canonical_sha256":"be7737ba1595a3a229d7f7eba490ddc2ef02339c2ae8d100abd3c478bb2a9475","source":{"kind":"arxiv","id":"1107.2001","version":1},"attestation_state":"computed","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. "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.2001","created_at":"2026-05-18T04:18:33.650926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2001v1","created_at":"2026-05-18T04:18:33.650926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2001","created_at":"2026-05-18T04:18:33.650926+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZ3TPOQVSWR2","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZ3TPOQVSWR2EKOX","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZ3TPOQV","created_at":"2026-05-18T12:26:47.523578+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/XZ3TPOQVSWR2EKOX67V2JEG5YL","json":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL.json","graph_json":"https://pith.science/api/pith-number/XZ3TPOQVSWR2EKOX67V2JEG5YL/graph.json","events_json":"https://pith.science/api/pith-number/XZ3TPOQVSWR2EKOX67V2JEG5YL/events.json","paper":"https://pith.science/paper/XZ3TPOQV"},"agent_actions":{"view_html":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL","download_json":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL.json","view_paper":"https://pith.science/paper/XZ3TPOQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2001&json=true","fetch_graph":"https://pith.science/api/pith-number/XZ3TPOQVSWR2EKOX67V2JEG5YL/graph.json","fetch_events":"https://pith.science/api/pith-number/XZ3TPOQVSWR2EKOX67V2JEG5YL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL/action/storage_attestation","attest_author":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL/action/author_attestation","sign_citation":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL/action/citation_signature","submit_replication":"https://pith.science/pith/XZ3TPOQVSWR2EKOX67V2JEG5YL/action/replication_record"}},"created_at":"2026-05-18T04:18:33.650926+00:00","updated_at":"2026-05-18T04:18:33.650926+00:00"}