{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TVZCGBM4VMYSXBEQYBDUHRBUNA","short_pith_number":"pith:TVZCGBM4","schema_version":"1.0","canonical_sha256":"9d7223059cab312b8490c04743c4346800571d761029745915a0ff8c8ee89969","source":{"kind":"arxiv","id":"1007.1146","version":2},"attestation_state":"computed","paper":{"title":"Exponential Time Complexity of Weighted Counting of Independent Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cs.CC","authors_text":"Christian Hoffmann","submitted_at":"2010-07-07T14:31:32Z","abstract_excerpt":"We consider weighted counting of independent sets using a rational weight x: Given a graph with n vertices, count its independent sets such that each set of size k contributes x^k. This is equivalent to computation of the partition function of the lattice gas with hard-core self-repulsion and hard-core pair interaction. We show the following conditional lower bounds: If counting the satisfying assignments of a 3-CNF formula in n variables (#3SAT) needs time 2^{\\Omega(n)} (i.e. there is a c>0 such that no algorithm can solve #3SAT in time 2^{cn}), counting the independent sets of size n/3 of an"},"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":"1007.1146","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-07T14:31:32Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"7fe57fc67ab192d093b6a55d21610652b2445065407257b70ccbbd1004ab123a","abstract_canon_sha256":"a0153ffc186e1d3ece69206b981f6bf6f647d9406036eb17adc85503b6378906"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:31.525668Z","signature_b64":"9kJEh62L1pb3V6oqlbfMBRDGsO/ZiU9ANa03MX/164zW9Y1AGjMgy9oqGdLPAnPmfINqxbjwFl5ng/krrmyECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d7223059cab312b8490c04743c4346800571d761029745915a0ff8c8ee89969","last_reissued_at":"2026-05-18T02:06:31.524838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:31.524838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential Time Complexity of Weighted Counting of Independent Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cs.CC","authors_text":"Christian Hoffmann","submitted_at":"2010-07-07T14:31:32Z","abstract_excerpt":"We consider weighted counting of independent sets using a rational weight x: Given a graph with n vertices, count its independent sets such that each set of size k contributes x^k. This is equivalent to computation of the partition function of the lattice gas with hard-core self-repulsion and hard-core pair interaction. We show the following conditional lower bounds: If counting the satisfying assignments of a 3-CNF formula in n variables (#3SAT) needs time 2^{\\Omega(n)} (i.e. there is a c>0 such that no algorithm can solve #3SAT in time 2^{cn}), counting the independent sets of size n/3 of an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1146","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":"1007.1146","created_at":"2026-05-18T02:06:31.524984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.1146v2","created_at":"2026-05-18T02:06:31.524984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1146","created_at":"2026-05-18T02:06:31.524984+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVZCGBM4VMYS","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVZCGBM4VMYSXBEQ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVZCGBM4","created_at":"2026-05-18T12:26:15.391820+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/TVZCGBM4VMYSXBEQYBDUHRBUNA","json":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA.json","graph_json":"https://pith.science/api/pith-number/TVZCGBM4VMYSXBEQYBDUHRBUNA/graph.json","events_json":"https://pith.science/api/pith-number/TVZCGBM4VMYSXBEQYBDUHRBUNA/events.json","paper":"https://pith.science/paper/TVZCGBM4"},"agent_actions":{"view_html":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA","download_json":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA.json","view_paper":"https://pith.science/paper/TVZCGBM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.1146&json=true","fetch_graph":"https://pith.science/api/pith-number/TVZCGBM4VMYSXBEQYBDUHRBUNA/graph.json","fetch_events":"https://pith.science/api/pith-number/TVZCGBM4VMYSXBEQYBDUHRBUNA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA/action/storage_attestation","attest_author":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA/action/author_attestation","sign_citation":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA/action/citation_signature","submit_replication":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA/action/replication_record"}},"created_at":"2026-05-18T02:06:31.524984+00:00","updated_at":"2026-05-18T02:06:31.524984+00:00"}