{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RMTI7TH2QSWHW3UYRKEA4FBCWN","short_pith_number":"pith:RMTI7TH2","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"},"canonical_sha256":"8b268fccfa84ac7b6e988a880e1422b34e921ee49a584aed2ca58c311f46324e","source":{"kind":"arxiv","id":"1105.5131","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5131","created_at":"2026-05-18T03:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5131v3","created_at":"2026-05-18T03:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5131","created_at":"2026-05-18T03:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"RMTI7TH2QSWH","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RMTI7TH2QSWHW3UY","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RMTI7TH2","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RMTI7TH2QSWHW3UYRKEA4FBCWN","target":"record","payload":{"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"},"canonical_sha256":"8b268fccfa84ac7b6e988a880e1422b34e921ee49a584aed2ca58c311f46324e","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"},"source_kind":"arxiv","source_id":"1105.5131","source_version":3,"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-18T03:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8SxSVHe6X35uH/toPWYJKs7hLtKR8HmVEaGuVw+4pewPDumH9xC61sXWBU5oo6GkLlomn659erfthjpqTxMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:27:17.566543Z"},"content_sha256":"dca01416ab739ebdb01ab553a7569c34d82ac43884b98f305fe33f079e90b6e8","schema_version":"1.0","event_id":"sha256:dca01416ab739ebdb01ab553a7569c34d82ac43884b98f305fe33f079e90b6e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RMTI7TH2QSWHW3UYRKEA4FBCWN","target":"graph","payload":{"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"},"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-18T03:16:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98Hwt9wyvIcxhrvsAkHSZF/U30a/Iz6okWKx9+d1BhgEB7UaFPAEVwSML31zXj890wC8CmHoUTy4SWnOmkAlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:27:17.567184Z"},"content_sha256":"66a20095bc844e61192287dab70656a259bc80c6ade3d76cded541974fb00644","schema_version":"1.0","event_id":"sha256:66a20095bc844e61192287dab70656a259bc80c6ade3d76cded541974fb00644"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN/bundle.json","state_url":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN/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-05-31T22:27:17Z","links":{"resolver":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN","bundle":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN/bundle.json","state":"https://pith.science/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMTI7TH2QSWHW3UYRKEA4FBCWN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RMTI7TH2QSWHW3UYRKEA4FBCWN","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":"c39fb61049e9594ab738ade7a044ec46691363839dd1a7a6585b5cd7b83a0e72","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-25T19:56:49Z","title_canon_sha256":"23c39d22d3c2f61b60d60f4cf7188eb7a4e69175359d436a18c3941e44a453f8"},"schema_version":"1.0","source":{"id":"1105.5131","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5131","created_at":"2026-05-18T03:16:19Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5131v3","created_at":"2026-05-18T03:16:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5131","created_at":"2026-05-18T03:16:19Z"},{"alias_kind":"pith_short_12","alias_value":"RMTI7TH2QSWH","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RMTI7TH2QSWHW3UY","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RMTI7TH2","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:66a20095bc844e61192287dab70656a259bc80c6ade3d76cded541974fb00644","target":"graph","created_at":"2026-05-18T03:16:19Z","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 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","authors_text":"Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang, Qi Ge","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-25T19:56:49Z","title":"Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5131","kind":"arxiv","version":3},"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:dca01416ab739ebdb01ab553a7569c34d82ac43884b98f305fe33f079e90b6e8","target":"record","created_at":"2026-05-18T03:16:19Z","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":"c39fb61049e9594ab738ade7a044ec46691363839dd1a7a6585b5cd7b83a0e72","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-25T19:56:49Z","title_canon_sha256":"23c39d22d3c2f61b60d60f4cf7188eb7a4e69175359d436a18c3941e44a453f8"},"schema_version":"1.0","source":{"id":"1105.5131","kind":"arxiv","version":3}},"canonical_sha256":"8b268fccfa84ac7b6e988a880e1422b34e921ee49a584aed2ca58c311f46324e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b268fccfa84ac7b6e988a880e1422b34e921ee49a584aed2ca58c311f46324e","first_computed_at":"2026-05-18T03:16:19.277190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:19.277190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"06gjUQ2oNtDFILdGkBeaB7vDnzv4o4yUgVkGL3UpiNHukDkKaQD8offWp79JgtH1fye6G/wPxErbg5Fv0qGjAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:19.277710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5131","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dca01416ab739ebdb01ab553a7569c34d82ac43884b98f305fe33f079e90b6e8","sha256:66a20095bc844e61192287dab70656a259bc80c6ade3d76cded541974fb00644"],"state_sha256":"f2c618a650bf07d543442cdab995795ed1292e1017acbd2dca071d7c662ef40b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ScHoqrzKHyseowxxi1VFDDZWIL34zKSc8Pafb0aoO9XV3l7a+ViNRjTSoM3BROPdcBU1keWvygwmovy1zHtuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:27:17.570482Z","bundle_sha256":"8977aa27a80ff89020ec7bbc5c0fb9e5f1a4ef4bf46b4ebd330026d2a1a13429"}}