{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:6RALGGXQNMEP3R74NRDHXBX5OP","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":"7b6937c1d9c6807d02d6dc7557dcb581dccb161a6100584ee7d196487826b627","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-07-15T17:25:43Z","title_canon_sha256":"15b6de69ee91f4a841cec644356c61734ad9cf78afb93edd1497e3a830e3a824"},"schema_version":"1.0","source":{"id":"0907.2663","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.2663","created_at":"2026-05-18T04:12:56Z"},{"alias_kind":"arxiv_version","alias_value":"0907.2663v2","created_at":"2026-05-18T04:12:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.2663","created_at":"2026-05-18T04:12:56Z"},{"alias_kind":"pith_short_12","alias_value":"6RALGGXQNMEP","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"6RALGGXQNMEP3R74","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"6RALGGXQ","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:b521d3d872a90b90baecf85a5752259ac7cc5d656e7ad966377180ed9e1c8bf7","target":"graph","created_at":"2026-05-18T04:12:56Z","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":"The degree of a CSP instance is the maximum number of times that any variable appears in the scopes of constraints. We consider the approximate counting problem for Boolean CSP with bounded-degree instances, for constraint languages containing the two unary constant relations {0} and {1}. When the maximum allowed degree is large enough (at least 6) we obtain a complete classification of the complexity of this problem. It is exactly solvable in polynomial-time if every relation in the constraint language is affine. It is equivalent to the problem of approximately counting independent sets in bi","authors_text":"David Richerby, Leslie Ann Goldberg, Markus Jalsenius, Martin Dyer","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-07-15T17:25:43Z","title":"The Complexity of Approximating Bounded-Degree Boolean \\sharp CSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.2663","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:d3ad6cbb01073e590cb1e6a55473127579e493dd251f454d954f9548715f8ec1","target":"record","created_at":"2026-05-18T04:12:56Z","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":"7b6937c1d9c6807d02d6dc7557dcb581dccb161a6100584ee7d196487826b627","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-07-15T17:25:43Z","title_canon_sha256":"15b6de69ee91f4a841cec644356c61734ad9cf78afb93edd1497e3a830e3a824"},"schema_version":"1.0","source":{"id":"0907.2663","kind":"arxiv","version":2}},"canonical_sha256":"f440b31af06b08fdc7fc6c467b86fd73d351161bf482fc1c7e270c08434af34d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f440b31af06b08fdc7fc6c467b86fd73d351161bf482fc1c7e270c08434af34d","first_computed_at":"2026-05-18T04:12:56.559988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:56.559988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"azkxviHdDKRd7lZx4g6xeuRVid0diuQ4uizhfptu9M9vW9AyYHsrLsCiCbs+d68+psg8OG/gS0k7Tn5gcQoGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:56.560503Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.2663","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3ad6cbb01073e590cb1e6a55473127579e493dd251f454d954f9548715f8ec1","sha256:b521d3d872a90b90baecf85a5752259ac7cc5d656e7ad966377180ed9e1c8bf7"],"state_sha256":"9e61e74d59c72036541b0fb5489e2c26d55d596a2cf5f8f5fcc05dd04a4f33ff"}