{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:6RALGGXQNMEP3R74NRDHXBX5OP","short_pith_number":"pith:6RALGGXQ","schema_version":"1.0","canonical_sha256":"f440b31af06b08fdc7fc6c467b86fd73d351161bf482fc1c7e270c08434af34d","source":{"kind":"arxiv","id":"0907.2663","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Approximating Bounded-Degree Boolean \\sharp CSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"David Richerby, Leslie Ann Goldberg, Markus Jalsenius, Martin Dyer","submitted_at":"2009-07-15T17:25:43Z","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"},"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":"0907.2663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-07-15T17:25:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"15b6de69ee91f4a841cec644356c61734ad9cf78afb93edd1497e3a830e3a824","abstract_canon_sha256":"7b6937c1d9c6807d02d6dc7557dcb581dccb161a6100584ee7d196487826b627"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:56.560503Z","signature_b64":"azkxviHdDKRd7lZx4g6xeuRVid0diuQ4uizhfptu9M9vW9AyYHsrLsCiCbs+d68+psg8OG/gS0k7Tn5gcQoGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f440b31af06b08fdc7fc6c467b86fd73d351161bf482fc1c7e270c08434af34d","last_reissued_at":"2026-05-18T04:12:56.559988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:56.559988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Approximating Bounded-Degree Boolean \\sharp CSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"David Richerby, Leslie Ann Goldberg, Markus Jalsenius, Martin Dyer","submitted_at":"2009-07-15T17:25:43Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.2663","kind":"arxiv","version":2},"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":"0907.2663","created_at":"2026-05-18T04:12:56.560070+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.2663v2","created_at":"2026-05-18T04:12:56.560070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.2663","created_at":"2026-05-18T04:12:56.560070+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RALGGXQNMEP","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RALGGXQNMEP3R74","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RALGGXQ","created_at":"2026-05-18T12:25:58.837520+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/6RALGGXQNMEP3R74NRDHXBX5OP","json":"https://pith.science/pith/6RALGGXQNMEP3R74NRDHXBX5OP.json","graph_json":"https://pith.science/api/pith-number/6RALGGXQNMEP3R74NRDHXBX5OP/graph.json","events_json":"https://pith.science/api/pith-number/6RALGGXQNMEP3R74NRDHXBX5OP/events.json","paper":"https://pith.science/paper/6RALGGXQ"},"agent_actions":{"view_html":"https://pith.science/pith/6RALGGXQNMEP3R74NRDHXBX5OP","download_json":"https://pith.science/pith/6RALGGXQNMEP3R74NRDHXBX5OP.json","view_paper":"https://pith.science/paper/6RALGGXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.2663&json=true","fetch_graph":"https://pith.science/api/pith-number/6RALGGXQNMEP3R74NRDHXBX5OP/graph.json","fetch_events":"https://pith.science/api/pith-number/6RALGGXQNMEP3R74NRDHXBX5OP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RALGGXQNMEP3R74NRDHXBX5OP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RALGGXQNMEP3R74NRDHXBX5OP/action/storage_attestation","attest_author":"https://pith.science/pith/6RALGGXQNMEP3R74NRDHXBX5OP/action/author_attestation","sign_citation":"https://pith.science/pith/6RALGGXQNMEP3R74NRDHXBX5OP/action/citation_signature","submit_replication":"https://pith.science/pith/6RALGGXQNMEP3R74NRDHXBX5OP/action/replication_record"}},"created_at":"2026-05-18T04:12:56.560070+00:00","updated_at":"2026-05-18T04:12:56.560070+00:00"}