{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TVZCGBM4VMYSXBEQYBDUHRBUNA","short_pith_number":"pith:TVZCGBM4","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"},"canonical_sha256":"9d7223059cab312b8490c04743c4346800571d761029745915a0ff8c8ee89969","source":{"kind":"arxiv","id":"1007.1146","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1146","created_at":"2026-05-18T02:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1146v2","created_at":"2026-05-18T02:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1146","created_at":"2026-05-18T02:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"TVZCGBM4VMYS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TVZCGBM4VMYSXBEQ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TVZCGBM4","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TVZCGBM4VMYSXBEQYBDUHRBUNA","target":"record","payload":{"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"},"canonical_sha256":"9d7223059cab312b8490c04743c4346800571d761029745915a0ff8c8ee89969","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"},"source_kind":"arxiv","source_id":"1007.1146","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQnx4gUAEBxUdVv/FB0WJTJq+CiHgFMTpFoWrfuWVM4cC02j8sK79po9p94mnh2OR0xRwuL5AovACxSMB53iCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T06:23:55.065587Z"},"content_sha256":"3abcec244da8610893d81a8174d5dd3b91972604f7714cc083eec71dbb653cc4","schema_version":"1.0","event_id":"sha256:3abcec244da8610893d81a8174d5dd3b91972604f7714cc083eec71dbb653cc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TVZCGBM4VMYSXBEQYBDUHRBUNA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:06:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5luHEMjNn36ogNCLrC7fcmHjSurLipdoUZN+WvJvfM4jvdqlbCUQPpX1yC5iHIrBdjJX1QMZ0nDe5L4UIkskBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T06:23:55.065948Z"},"content_sha256":"c0c07360d87feab3ff1c693c57d48052515f6e0db88e9796fd99ac96ec2cb689","schema_version":"1.0","event_id":"sha256:c0c07360d87feab3ff1c693c57d48052515f6e0db88e9796fd99ac96ec2cb689"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA/bundle.json","state_url":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-01T06:23:55Z","links":{"resolver":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA","bundle":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA/bundle.json","state":"https://pith.science/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVZCGBM4VMYSXBEQYBDUHRBUNA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TVZCGBM4VMYSXBEQYBDUHRBUNA","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":"a0153ffc186e1d3ece69206b981f6bf6f647d9406036eb17adc85503b6378906","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-07T14:31:32Z","title_canon_sha256":"7fe57fc67ab192d093b6a55d21610652b2445065407257b70ccbbd1004ab123a"},"schema_version":"1.0","source":{"id":"1007.1146","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1146","created_at":"2026-05-18T02:06:31Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1146v2","created_at":"2026-05-18T02:06:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1146","created_at":"2026-05-18T02:06:31Z"},{"alias_kind":"pith_short_12","alias_value":"TVZCGBM4VMYS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TVZCGBM4VMYSXBEQ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TVZCGBM4","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:c0c07360d87feab3ff1c693c57d48052515f6e0db88e9796fd99ac96ec2cb689","target":"graph","created_at":"2026-05-18T02:06:31Z","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":"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","authors_text":"Christian Hoffmann","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-07T14:31:32Z","title":"Exponential Time Complexity of Weighted Counting of Independent Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1146","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:3abcec244da8610893d81a8174d5dd3b91972604f7714cc083eec71dbb653cc4","target":"record","created_at":"2026-05-18T02:06:31Z","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":"a0153ffc186e1d3ece69206b981f6bf6f647d9406036eb17adc85503b6378906","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-07-07T14:31:32Z","title_canon_sha256":"7fe57fc67ab192d093b6a55d21610652b2445065407257b70ccbbd1004ab123a"},"schema_version":"1.0","source":{"id":"1007.1146","kind":"arxiv","version":2}},"canonical_sha256":"9d7223059cab312b8490c04743c4346800571d761029745915a0ff8c8ee89969","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d7223059cab312b8490c04743c4346800571d761029745915a0ff8c8ee89969","first_computed_at":"2026-05-18T02:06:31.524838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:06:31.524838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9kJEh62L1pb3V6oqlbfMBRDGsO/ZiU9ANa03MX/164zW9Y1AGjMgy9oqGdLPAnPmfINqxbjwFl5ng/krrmyECg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:06:31.525668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.1146","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3abcec244da8610893d81a8174d5dd3b91972604f7714cc083eec71dbb653cc4","sha256:c0c07360d87feab3ff1c693c57d48052515f6e0db88e9796fd99ac96ec2cb689"],"state_sha256":"f4ac68e77e8ebd174878c1a709ebd138e3ed0759ccfbcc8fc504cdbaea6e6266"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKXS5DY6xAsLTHCTAKvofDraUjb0cVcbxng1GkIcfYn2Fnd53UxTyiquIVIAOnjVgd3MHwWgCnaETaksq5L3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T06:23:55.068182Z","bundle_sha256":"832c285c5f6f29225206a95abc06e267c355e39ae60454ee059aa32448732017"}}