{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:U5BGFYHGHGFRFWQAG7WO7BXQBC","short_pith_number":"pith:U5BGFYHG","schema_version":"1.0","canonical_sha256":"a74262e0e6398b12da0037ecef86f008aebc55ea15da826a46db4e00241f7978","source":{"kind":"arxiv","id":"2406.18224","version":3},"attestation_state":"computed","paper":{"title":"#CFG and #DNNF admit FPRAS","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexis de Colnet, Kuldeep S. Meel","submitted_at":"2024-06-26T10:13:50Z","abstract_excerpt":"We provide the first fully polynomial-time randomized approximation scheme for the following two counting problems: 1. Given a Context Free Grammar $G$ over alphabet $\\Sigma$, count the number of words of length exactly $n$ generated by $G$. 2. Given a circuit $\\varphi$ in Decomposable Negation Normal Form (DNNF) over the set of Boolean variables $X$, compute the number of assignments to $X$ such that $\\varphi$ evaluates to 1.\n  Finding polynomial time algorithms for the aforementioned problems has been a longstanding open problem. Prior work could either only obtain a quasi-polynomial runtime"},"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":"2406.18224","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-26T10:13:50Z","cross_cats_sorted":[],"title_canon_sha256":"4eb4ddc6ecb6511fd6cd6d12836fec84eee9e36dda1d2bdb957054606beab907","abstract_canon_sha256":"3825f8f312e67bc402276608c6c163d90a4594f217ba0b7517a3d21723b24507"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:15.612422Z","signature_b64":"j9buqTE+02Uk3zN4nu3y8mClaHO2lQGsahzD2TaNAX/Jw2Jo9839OWSqL0PhHL4OLseqIFRdmOM/k9o/UXUdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a74262e0e6398b12da0037ecef86f008aebc55ea15da826a46db4e00241f7978","last_reissued_at":"2026-05-20T00:00:15.611455Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:15.611455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"#CFG and #DNNF admit FPRAS","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexis de Colnet, Kuldeep S. Meel","submitted_at":"2024-06-26T10:13:50Z","abstract_excerpt":"We provide the first fully polynomial-time randomized approximation scheme for the following two counting problems: 1. Given a Context Free Grammar $G$ over alphabet $\\Sigma$, count the number of words of length exactly $n$ generated by $G$. 2. Given a circuit $\\varphi$ in Decomposable Negation Normal Form (DNNF) over the set of Boolean variables $X$, compute the number of assignments to $X$ such that $\\varphi$ evaluates to 1.\n  Finding polynomial time algorithms for the aforementioned problems has been a longstanding open problem. Prior work could either only obtain a quasi-polynomial runtime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18224","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.18224/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.18224","created_at":"2026-05-20T00:00:15.611560+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.18224v3","created_at":"2026-05-20T00:00:15.611560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18224","created_at":"2026-05-20T00:00:15.611560+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5BGFYHGHGFR","created_at":"2026-05-20T00:00:15.611560+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5BGFYHGHGFRFWQA","created_at":"2026-05-20T00:00:15.611560+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5BGFYHG","created_at":"2026-05-20T00:00:15.611560+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/U5BGFYHGHGFRFWQAG7WO7BXQBC","json":"https://pith.science/pith/U5BGFYHGHGFRFWQAG7WO7BXQBC.json","graph_json":"https://pith.science/api/pith-number/U5BGFYHGHGFRFWQAG7WO7BXQBC/graph.json","events_json":"https://pith.science/api/pith-number/U5BGFYHGHGFRFWQAG7WO7BXQBC/events.json","paper":"https://pith.science/paper/U5BGFYHG"},"agent_actions":{"view_html":"https://pith.science/pith/U5BGFYHGHGFRFWQAG7WO7BXQBC","download_json":"https://pith.science/pith/U5BGFYHGHGFRFWQAG7WO7BXQBC.json","view_paper":"https://pith.science/paper/U5BGFYHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.18224&json=true","fetch_graph":"https://pith.science/api/pith-number/U5BGFYHGHGFRFWQAG7WO7BXQBC/graph.json","fetch_events":"https://pith.science/api/pith-number/U5BGFYHGHGFRFWQAG7WO7BXQBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5BGFYHGHGFRFWQAG7WO7BXQBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5BGFYHGHGFRFWQAG7WO7BXQBC/action/storage_attestation","attest_author":"https://pith.science/pith/U5BGFYHGHGFRFWQAG7WO7BXQBC/action/author_attestation","sign_citation":"https://pith.science/pith/U5BGFYHGHGFRFWQAG7WO7BXQBC/action/citation_signature","submit_replication":"https://pith.science/pith/U5BGFYHGHGFRFWQAG7WO7BXQBC/action/replication_record"}},"created_at":"2026-05-20T00:00:15.611560+00:00","updated_at":"2026-05-20T00:00:15.611560+00:00"}