{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:B332OPXZLAUTJIOEDOC2JEDNMI","short_pith_number":"pith:B332OPXZ","canonical_record":{"source":{"id":"1004.3531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-04-20T19:09:06Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e030262442d7450331b2f3205e70a2dce9d4e7d320b52ff178e3b5ce0a929b6b","abstract_canon_sha256":"5070f8bbf850c83520f359c0c9adc7c15a2cb41d55548b9bdea737014bdeb28f"},"schema_version":"1.0"},"canonical_sha256":"0ef7a73ef9582934a1c41b85a4906d622f61044bc0a4b5240470187d942ccdd9","source":{"kind":"arxiv","id":"1004.3531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.3531","created_at":"2026-05-18T03:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1004.3531v1","created_at":"2026-05-18T03:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3531","created_at":"2026-05-18T03:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"B332OPXZLAUT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"B332OPXZLAUTJIOE","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"B332OPXZ","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:B332OPXZLAUTJIOEDOC2JEDNMI","target":"record","payload":{"canonical_record":{"source":{"id":"1004.3531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-04-20T19:09:06Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e030262442d7450331b2f3205e70a2dce9d4e7d320b52ff178e3b5ce0a929b6b","abstract_canon_sha256":"5070f8bbf850c83520f359c0c9adc7c15a2cb41d55548b9bdea737014bdeb28f"},"schema_version":"1.0"},"canonical_sha256":"0ef7a73ef9582934a1c41b85a4906d622f61044bc0a4b5240470187d942ccdd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:20.961541Z","signature_b64":"FTOEXGTxA+w39ElO9MZ8cIIJhCTdUU6qAQFMTLd5CL/gjg9phuWsazPeUpwB4DcitDadxYeAgqCNDHtMnlLRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ef7a73ef9582934a1c41b85a4906d622f61044bc0a4b5240470187d942ccdd9","last_reissued_at":"2026-05-18T03:20:20.961076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:20.961076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.3531","source_version":1,"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:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d90SK+9NmGFp/eRzU/5YkyonrQIea6aaRdEQSwTCeeMo95osgMosuQZxilpTlCa7OODPW39idvUDAngIMJJIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:50:44.782427Z"},"content_sha256":"90c7d88f536e0f0c0db9ef7eb9a14a8b08d8e86c59473cb7d8adfcc7153af6cf","schema_version":"1.0","event_id":"sha256:90c7d88f536e0f0c0db9ef7eb9a14a8b08d8e86c59473cb7d8adfcc7153af6cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:B332OPXZLAUTJIOEDOC2JEDNMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstruction Threshold for the Hardcore Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.PR","authors_text":"Allan Sly, Nayantara Bhatnagar, Prasad Tetali","submitted_at":"2010-04-20T19:09:06Z","abstract_excerpt":"In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non-reconstruction when lambda < (ln 2-o(1))ln^2(k)/(2 lnln(k)) improving the previous best bound of lambda < e-1.  This is almost tight as reconstruction is known to hold when lambda> (e+o(1))ln^2(k).  We discuss the relationship for finding large independent sets in sparse random graphs and to the mixing time of Markov chains for sampling independent sets on trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3531","kind":"arxiv","version":1},"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:20:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPd0yZqY8M5nLCZzWEq5vJbsRQGxaMNsFVkH3HOBdl+GwgMhOrZAKSWdtCDi8/gyy5pmTfc7aG+Of0smRKprAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:50:44.782777Z"},"content_sha256":"7b660f607e3a329a85f3870501f9b17a733521fd99d4e4d5ab8949efe6bf9c64","schema_version":"1.0","event_id":"sha256:7b660f607e3a329a85f3870501f9b17a733521fd99d4e4d5ab8949efe6bf9c64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B332OPXZLAUTJIOEDOC2JEDNMI/bundle.json","state_url":"https://pith.science/pith/B332OPXZLAUTJIOEDOC2JEDNMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B332OPXZLAUTJIOEDOC2JEDNMI/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-09T16:50:44Z","links":{"resolver":"https://pith.science/pith/B332OPXZLAUTJIOEDOC2JEDNMI","bundle":"https://pith.science/pith/B332OPXZLAUTJIOEDOC2JEDNMI/bundle.json","state":"https://pith.science/pith/B332OPXZLAUTJIOEDOC2JEDNMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B332OPXZLAUTJIOEDOC2JEDNMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:B332OPXZLAUTJIOEDOC2JEDNMI","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":"5070f8bbf850c83520f359c0c9adc7c15a2cb41d55548b9bdea737014bdeb28f","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-04-20T19:09:06Z","title_canon_sha256":"e030262442d7450331b2f3205e70a2dce9d4e7d320b52ff178e3b5ce0a929b6b"},"schema_version":"1.0","source":{"id":"1004.3531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.3531","created_at":"2026-05-18T03:20:20Z"},{"alias_kind":"arxiv_version","alias_value":"1004.3531v1","created_at":"2026-05-18T03:20:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.3531","created_at":"2026-05-18T03:20:20Z"},{"alias_kind":"pith_short_12","alias_value":"B332OPXZLAUT","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"B332OPXZLAUTJIOE","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"B332OPXZ","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:7b660f607e3a329a85f3870501f9b17a733521fd99d4e4d5ab8949efe6bf9c64","target":"graph","created_at":"2026-05-18T03:20:20Z","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":"In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non-reconstruction when lambda < (ln 2-o(1))ln^2(k)/(2 lnln(k)) improving the previous best bound of lambda < e-1.  This is almost tight as reconstruction is known to hold when lambda> (e+o(1))ln^2(k).  We discuss the relationship for finding large independent sets in sparse random graphs and to the mixing time of Markov chains for sampling independent sets on trees.","authors_text":"Allan Sly, Nayantara Bhatnagar, Prasad Tetali","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-04-20T19:09:06Z","title":"Reconstruction Threshold for the Hardcore Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.3531","kind":"arxiv","version":1},"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:90c7d88f536e0f0c0db9ef7eb9a14a8b08d8e86c59473cb7d8adfcc7153af6cf","target":"record","created_at":"2026-05-18T03:20:20Z","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":"5070f8bbf850c83520f359c0c9adc7c15a2cb41d55548b9bdea737014bdeb28f","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-04-20T19:09:06Z","title_canon_sha256":"e030262442d7450331b2f3205e70a2dce9d4e7d320b52ff178e3b5ce0a929b6b"},"schema_version":"1.0","source":{"id":"1004.3531","kind":"arxiv","version":1}},"canonical_sha256":"0ef7a73ef9582934a1c41b85a4906d622f61044bc0a4b5240470187d942ccdd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ef7a73ef9582934a1c41b85a4906d622f61044bc0a4b5240470187d942ccdd9","first_computed_at":"2026-05-18T03:20:20.961076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:20.961076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FTOEXGTxA+w39ElO9MZ8cIIJhCTdUU6qAQFMTLd5CL/gjg9phuWsazPeUpwB4DcitDadxYeAgqCNDHtMnlLRCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:20.961541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.3531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90c7d88f536e0f0c0db9ef7eb9a14a8b08d8e86c59473cb7d8adfcc7153af6cf","sha256:7b660f607e3a329a85f3870501f9b17a733521fd99d4e4d5ab8949efe6bf9c64"],"state_sha256":"f82f1b357cc39de407bc49083caaea5b7e3c24b9af2ce4e0df72b04581f1446e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULblMPd7dtVY/U1MQyw3SRyIe0wcOy6MkgFSS6blkHabMYpfXWe4Q0qbenJqpa7Aaqt5h7iU0+jYMZ0HSodVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:50:44.784849Z","bundle_sha256":"0f0a54b84e58775b3f9c261315c47dde3eac259e3173e1ca976c404dbb9ccc74"}}