{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RMTI7TH2QSWHW3UYRKEA4FBCWN","short_pith_number":"pith:RMTI7TH2","schema_version":"1.0","canonical_sha256":"8b268fccfa84ac7b6e988a880e1422b34e921ee49a584aed2ca58c311f46324e","source":{"kind":"arxiv","id":"1105.5131","version":3},"attestation_state":"computed","paper":{"title":"Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang, Qi Ge","submitted_at":"2011-05-25T19:56:49Z","abstract_excerpt":"We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree Delta. More generally, for an input graph G=(V,E) and an activity lambda>0, we are interested in the quantity Z_G(lambda) defined as the sum over independent sets I weighted as w(I) = lambda^|I|. In statistical physics, Z_G(lambda) is the partition function for the hard-core model, which is an idealized model of a gas where the particles have non-negibile size.\n  Recently, an interesting phase transition was shown to occur for the complexity of approximating the partiti"},"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":"1105.5131","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-25T19:56:49Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"23c39d22d3c2f61b60d60f4cf7188eb7a4e69175359d436a18c3941e44a453f8","abstract_canon_sha256":"c39fb61049e9594ab738ade7a044ec46691363839dd1a7a6585b5cd7b83a0e72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:19.277710Z","signature_b64":"06gjUQ2oNtDFILdGkBeaB7vDnzv4o4yUgVkGL3UpiNHukDkKaQD8offWp79JgtH1fye6G/wPxErbg5Fv0qGjAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b268fccfa84ac7b6e988a880e1422b34e921ee49a584aed2ca58c311f46324e","last_reissued_at":"2026-05-18T03:16:19.277190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:19.277190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang, Qi Ge","submitted_at":"2011-05-25T19:56:49Z","abstract_excerpt":"We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree Delta. More generally, for an input graph G=(V,E) and an activity lambda>0, we are interested in the quantity Z_G(lambda) defined as the sum over independent sets I weighted as w(I) = lambda^|I|. In statistical physics, Z_G(lambda) is the partition function for the hard-core model, which is an idealized model of a gas where the particles have non-negibile size.\n  Recently, an interesting phase transition was shown to occur for the complexity of approximating the partiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5131","kind":"arxiv","version":3},"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":"1105.5131","created_at":"2026-05-18T03:16:19.277268+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.5131v3","created_at":"2026-05-18T03:16:19.277268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5131","created_at":"2026-05-18T03:16:19.277268+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMTI7TH2QSWH","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMTI7TH2QSWHW3UY","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMTI7TH2","created_at":"2026-05-18T12:26:41.206345+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/RMTI7TH2QSWHW3UYRKEA4FBCWN","json":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN.json","graph_json":"https://pith.science/api/pith-number/RMTI7TH2QSWHW3UYRKEA4FBCWN/graph.json","events_json":"https://pith.science/api/pith-number/RMTI7TH2QSWHW3UYRKEA4FBCWN/events.json","paper":"https://pith.science/paper/RMTI7TH2"},"agent_actions":{"view_html":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN","download_json":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN.json","view_paper":"https://pith.science/paper/RMTI7TH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.5131&json=true","fetch_graph":"https://pith.science/api/pith-number/RMTI7TH2QSWHW3UYRKEA4FBCWN/graph.json","fetch_events":"https://pith.science/api/pith-number/RMTI7TH2QSWHW3UYRKEA4FBCWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN/action/storage_attestation","attest_author":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN/action/author_attestation","sign_citation":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN/action/citation_signature","submit_replication":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN/action/replication_record"}},"created_at":"2026-05-18T03:16:19.277268+00:00","updated_at":"2026-05-18T03:16:19.277268+00:00"}