{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EZQM5NLQ3LKDYYEQVPFH7ZUNRC","short_pith_number":"pith:EZQM5NLQ","schema_version":"1.0","canonical_sha256":"2660ceb570dad43c6090abca7fe68d88a02dd701f6d123ddb98ccb1545429f00","source":{"kind":"arxiv","id":"2608.08616","version":1},"attestation_state":"computed","paper":{"title":"A Counting Lov\\'asz Local Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Can Zhou, Chunyang Wang, Hongyang Liu, Yitong Yin, Yiyao Zhang","submitted_at":"2026-08-09T10:05:13Z","abstract_excerpt":"We establish a counting analogue of the Lov\\'asz Local Lemma: we give polynomial-time algorithms for approximately counting satisfying assignments of general constraint satisfaction problems (CSPs) in the local lemma regime $$ 4 \\mathrm{e}\\cdot p\\cdot (D+1)^2\\leq 1, $$ where $p$ is the maximum constraint violation probability and $D$ is the maximum dependency degree.\n  This condition is tight up to constant factors, matching known lower bounds $pD^2\\gtrsim 1$ for approximate counting in natural subclasses of CSPs. The core of our approach is a novel $2$-tree expansion for constraint marginal p"},"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":"2608.08616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-08-09T10:05:13Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"456b1ae5d1f3a7cfb30ecc744162aeb0410e3e7c20662279d0f0ea80edbabb96","abstract_canon_sha256":"abbadf8cc555e6e3a3d7f70f4640c49c8d97aa69bc727a2e78fd7622a80380d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:23:10.545557Z","signature_b64":"M5SnyjnVD7Q+h6NV3yu3gnG+DQ0gw7FQTrljbnPICY6jKfYy+nXeNGJg7o+WT9gYY2j17ZKvJq90JDTHGGnnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2660ceb570dad43c6090abca7fe68d88a02dd701f6d123ddb98ccb1545429f00","last_reissued_at":"2026-08-11T01:23:10.542826Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:23:10.542826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Counting Lov\\'asz Local Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Can Zhou, Chunyang Wang, Hongyang Liu, Yitong Yin, Yiyao Zhang","submitted_at":"2026-08-09T10:05:13Z","abstract_excerpt":"We establish a counting analogue of the Lov\\'asz Local Lemma: we give polynomial-time algorithms for approximately counting satisfying assignments of general constraint satisfaction problems (CSPs) in the local lemma regime $$ 4 \\mathrm{e}\\cdot p\\cdot (D+1)^2\\leq 1, $$ where $p$ is the maximum constraint violation probability and $D$ is the maximum dependency degree.\n  This condition is tight up to constant factors, matching known lower bounds $pD^2\\gtrsim 1$ for approximate counting in natural subclasses of CSPs. The core of our approach is a novel $2$-tree expansion for constraint marginal p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08616","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.08616/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":"2608.08616","created_at":"2026-08-11T01:23:10.543752+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.08616v1","created_at":"2026-08-11T01:23:10.543752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08616","created_at":"2026-08-11T01:23:10.543752+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZQM5NLQ3LKD","created_at":"2026-08-11T01:23:10.543752+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZQM5NLQ3LKDYYEQ","created_at":"2026-08-11T01:23:10.543752+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZQM5NLQ","created_at":"2026-08-11T01:23:10.543752+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/EZQM5NLQ3LKDYYEQVPFH7ZUNRC","json":"https://pith.science/pith/EZQM5NLQ3LKDYYEQVPFH7ZUNRC.json","graph_json":"https://pith.science/api/pith-number/EZQM5NLQ3LKDYYEQVPFH7ZUNRC/graph.json","events_json":"https://pith.science/api/pith-number/EZQM5NLQ3LKDYYEQVPFH7ZUNRC/events.json","paper":"https://pith.science/paper/EZQM5NLQ"},"agent_actions":{"view_html":"https://pith.science/pith/EZQM5NLQ3LKDYYEQVPFH7ZUNRC","download_json":"https://pith.science/pith/EZQM5NLQ3LKDYYEQVPFH7ZUNRC.json","view_paper":"https://pith.science/paper/EZQM5NLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.08616&json=true","fetch_graph":"https://pith.science/api/pith-number/EZQM5NLQ3LKDYYEQVPFH7ZUNRC/graph.json","fetch_events":"https://pith.science/api/pith-number/EZQM5NLQ3LKDYYEQVPFH7ZUNRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZQM5NLQ3LKDYYEQVPFH7ZUNRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZQM5NLQ3LKDYYEQVPFH7ZUNRC/action/storage_attestation","attest_author":"https://pith.science/pith/EZQM5NLQ3LKDYYEQVPFH7ZUNRC/action/author_attestation","sign_citation":"https://pith.science/pith/EZQM5NLQ3LKDYYEQVPFH7ZUNRC/action/citation_signature","submit_replication":"https://pith.science/pith/EZQM5NLQ3LKDYYEQVPFH7ZUNRC/action/replication_record"}},"created_at":"2026-08-11T01:23:10.543752+00:00","updated_at":"2026-08-11T01:23:10.543752+00:00"}