{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KL2TYRAFB4DIQ7MTY3J3XBAY2Z","short_pith_number":"pith:KL2TYRAF","canonical_record":{"source":{"id":"1105.0914","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-05-04T19:52:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e6495d3a0693b9392bbc9431c2461f8405148cb44681f057bc55b428c40a5735","abstract_canon_sha256":"f4aeafaee7ded3c9214f17657bd7388a62270941fe64cb8bb6725c4f78d40a66"},"schema_version":"1.0"},"canonical_sha256":"52f53c44050f06887d93c6d3bb8418d66cc1b2e63267634e6331f5f80bd727dd","source":{"kind":"arxiv","id":"1105.0914","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0914","created_at":"2026-05-18T04:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0914v3","created_at":"2026-05-18T04:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0914","created_at":"2026-05-18T04:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"KL2TYRAFB4DI","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KL2TYRAFB4DIQ7MT","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KL2TYRAF","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KL2TYRAFB4DIQ7MTY3J3XBAY2Z","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0914","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-05-04T19:52:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e6495d3a0693b9392bbc9431c2461f8405148cb44681f057bc55b428c40a5735","abstract_canon_sha256":"f4aeafaee7ded3c9214f17657bd7388a62270941fe64cb8bb6725c4f78d40a66"},"schema_version":"1.0"},"canonical_sha256":"52f53c44050f06887d93c6d3bb8418d66cc1b2e63267634e6331f5f80bd727dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:36.665302Z","signature_b64":"U7ZoUT30LWXGHqZJ9jeqxR9GHdu4dMRsV+/TYm6Kf/RmjNjiG+NQ0MKRpwej0fFZlf2C9EqAB0suVojkq5jjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52f53c44050f06887d93c6d3bb8418d66cc1b2e63267634e6331f5f80bd727dd","last_reissued_at":"2026-05-18T04:15:36.664761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:36.664761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0914","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-18T04:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X6WJPhcLeW9pIyptcCKy2P2wGzJNuhNQogSyNMlNHxHxnNtRgSAnMvu+xMXM2QYPR0TE/BaMI1dqnuxHYJ9aAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:50:09.527280Z"},"content_sha256":"835f6a5888ef2569990366706a5bb124c4a1ce158addfabd3a082479c6546e09","schema_version":"1.0","event_id":"sha256:835f6a5888ef2569990366706a5bb124c4a1ce158addfabd3a082479c6546e09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KL2TYRAFB4DIQ7MTY3J3XBAY2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.PR","authors_text":"Eric Vigoda, Jinwoo Shin, Linji Yang, Prasad Tetali, Ricardo Restrepo","submitted_at":"2011-05-04T19:52:13Z","abstract_excerpt":"We study the hard-core model defined on independent sets, where each independent set I in a graph G is weighted proportionally to $\\lambda^{|I|}$, for a positive real parameter $\\lambda$. For large $\\lambda$, computing the partition function (namely, the normalizing constant which makes the weighting a probability distribution on a finite graph) on graphs of maximum degree $D\\ge 3$, is a well known computationally challenging problem. More concretely, let $\\lambda_c(T_D)$ denote the critical value for the so-called uniqueness threshold of the hard-core model on the infinite D-regular tree; rec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0914","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-18T04:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tTZIvUq2UzOjitG6Ue0brBNcBLLbVyO3xrXmBjLw+bt/Nxg+KrcEgf58i/+fVdMTH7DFeSJo3PKpXFNVvUHZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:50:09.527974Z"},"content_sha256":"e0784c19f2ce86f3640d5a3645b4cc40f2f43b6b6e4ffb987c79672ca039d594","schema_version":"1.0","event_id":"sha256:e0784c19f2ce86f3640d5a3645b4cc40f2f43b6b6e4ffb987c79672ca039d594"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KL2TYRAFB4DIQ7MTY3J3XBAY2Z/bundle.json","state_url":"https://pith.science/pith/KL2TYRAFB4DIQ7MTY3J3XBAY2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KL2TYRAFB4DIQ7MTY3J3XBAY2Z/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-06-09T15:50:09Z","links":{"resolver":"https://pith.science/pith/KL2TYRAFB4DIQ7MTY3J3XBAY2Z","bundle":"https://pith.science/pith/KL2TYRAFB4DIQ7MTY3J3XBAY2Z/bundle.json","state":"https://pith.science/pith/KL2TYRAFB4DIQ7MTY3J3XBAY2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KL2TYRAFB4DIQ7MTY3J3XBAY2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KL2TYRAFB4DIQ7MTY3J3XBAY2Z","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":"f4aeafaee7ded3c9214f17657bd7388a62270941fe64cb8bb6725c4f78d40a66","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-05-04T19:52:13Z","title_canon_sha256":"e6495d3a0693b9392bbc9431c2461f8405148cb44681f057bc55b428c40a5735"},"schema_version":"1.0","source":{"id":"1105.0914","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0914","created_at":"2026-05-18T04:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0914v3","created_at":"2026-05-18T04:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0914","created_at":"2026-05-18T04:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"KL2TYRAFB4DI","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KL2TYRAFB4DIQ7MT","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KL2TYRAF","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:e0784c19f2ce86f3640d5a3645b4cc40f2f43b6b6e4ffb987c79672ca039d594","target":"graph","created_at":"2026-05-18T04:15:36Z","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 hard-core model defined on independent sets, where each independent set I in a graph G is weighted proportionally to $\\lambda^{|I|}$, for a positive real parameter $\\lambda$. For large $\\lambda$, computing the partition function (namely, the normalizing constant which makes the weighting a probability distribution on a finite graph) on graphs of maximum degree $D\\ge 3$, is a well known computationally challenging problem. More concretely, let $\\lambda_c(T_D)$ denote the critical value for the so-called uniqueness threshold of the hard-core model on the infinite D-regular tree; rec","authors_text":"Eric Vigoda, Jinwoo Shin, Linji Yang, Prasad Tetali, Ricardo Restrepo","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-05-04T19:52:13Z","title":"Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0914","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:835f6a5888ef2569990366706a5bb124c4a1ce158addfabd3a082479c6546e09","target":"record","created_at":"2026-05-18T04:15:36Z","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":"f4aeafaee7ded3c9214f17657bd7388a62270941fe64cb8bb6725c4f78d40a66","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-05-04T19:52:13Z","title_canon_sha256":"e6495d3a0693b9392bbc9431c2461f8405148cb44681f057bc55b428c40a5735"},"schema_version":"1.0","source":{"id":"1105.0914","kind":"arxiv","version":3}},"canonical_sha256":"52f53c44050f06887d93c6d3bb8418d66cc1b2e63267634e6331f5f80bd727dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52f53c44050f06887d93c6d3bb8418d66cc1b2e63267634e6331f5f80bd727dd","first_computed_at":"2026-05-18T04:15:36.664761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:36.664761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U7ZoUT30LWXGHqZJ9jeqxR9GHdu4dMRsV+/TYm6Kf/RmjNjiG+NQ0MKRpwej0fFZlf2C9EqAB0suVojkq5jjDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:36.665302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0914","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:835f6a5888ef2569990366706a5bb124c4a1ce158addfabd3a082479c6546e09","sha256:e0784c19f2ce86f3640d5a3645b4cc40f2f43b6b6e4ffb987c79672ca039d594"],"state_sha256":"52078cb84e09a4eb17dc05aea03a8d543b902e4c5161df91560af33a28e8b532"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PmBuDu9AM0N55CRe0YFsF/ckfGVhEEvRi86+m05BvQToETRXeYkXg8nKqnSSG3/IazjJlzTXvV2gXFFdpbpuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:50:09.531926Z","bundle_sha256":"6e880fa18e96d1423923ea3e47f2eb6b754744c98c08122bf8456ced71775d06"}}