{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:U5VXJDRHNUNWAC77GXM2352DM3","short_pith_number":"pith:U5VXJDRH","schema_version":"1.0","canonical_sha256":"a76b748e276d1b600bff35d9adf74366cec9529dc0e6a42b2368a87a232b2f4c","source":{"kind":"arxiv","id":"1202.5351","version":5},"attestation_state":"computed","paper":{"title":"Bootstrap percolation on the Hamming torus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christopher Hoffman, David Sivakoff, James Pfeiffer, Janko Gravner","submitted_at":"2012-02-24T00:47:02Z","abstract_excerpt":"The Hamming torus of dimension $d$ is the graph with vertices $\\{1,\\dots,n\\}^d$ and an edge between any two vertices that differ in a single coordinate. Bootstrap percolation with threshold $\\theta$ starts with a random set of open vertices, to which every vertex belongs independently with probability $p$, and at each time step the open set grows by adjoining every vertex with at least $\\theta$ open neighbors. We assume that $n$ is large and that $p$ scales as $n^{-\\alpha}$ for some $\\alpha>1$, and study the probability that an $i$-dimensional subgraph ever becomes open. For large $\\theta$, we"},"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":"1202.5351","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-02-24T00:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"5ad37ec5e7c32ed11070a98efa639bd75bdd3623c8493496fed4ff2ee3fa9d65","abstract_canon_sha256":"6a5d2f9bdf49c06603ca12218cb9b6adebb972a33a747150be2681a0ac66d97d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:54.273486Z","signature_b64":"lpqIDuN3NoAf/W6rZEuAdpf84S9p8PiBvi5mhDPq+gwSOCUozyB68dISPa0LnH7qOFFMQ+LlqRG6nhFLb1ikDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a76b748e276d1b600bff35d9adf74366cec9529dc0e6a42b2368a87a232b2f4c","last_reissued_at":"2026-05-18T02:28:54.273152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:54.273152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bootstrap percolation on the Hamming torus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christopher Hoffman, David Sivakoff, James Pfeiffer, Janko Gravner","submitted_at":"2012-02-24T00:47:02Z","abstract_excerpt":"The Hamming torus of dimension $d$ is the graph with vertices $\\{1,\\dots,n\\}^d$ and an edge between any two vertices that differ in a single coordinate. Bootstrap percolation with threshold $\\theta$ starts with a random set of open vertices, to which every vertex belongs independently with probability $p$, and at each time step the open set grows by adjoining every vertex with at least $\\theta$ open neighbors. We assume that $n$ is large and that $p$ scales as $n^{-\\alpha}$ for some $\\alpha>1$, and study the probability that an $i$-dimensional subgraph ever becomes open. For large $\\theta$, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5351","kind":"arxiv","version":5},"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":"1202.5351","created_at":"2026-05-18T02:28:54.273204+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5351v5","created_at":"2026-05-18T02:28:54.273204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5351","created_at":"2026-05-18T02:28:54.273204+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5VXJDRHNUNW","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5VXJDRHNUNWAC77","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5VXJDRH","created_at":"2026-05-18T12:27:23.164592+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/U5VXJDRHNUNWAC77GXM2352DM3","json":"https://pith.science/pith/U5VXJDRHNUNWAC77GXM2352DM3.json","graph_json":"https://pith.science/api/pith-number/U5VXJDRHNUNWAC77GXM2352DM3/graph.json","events_json":"https://pith.science/api/pith-number/U5VXJDRHNUNWAC77GXM2352DM3/events.json","paper":"https://pith.science/paper/U5VXJDRH"},"agent_actions":{"view_html":"https://pith.science/pith/U5VXJDRHNUNWAC77GXM2352DM3","download_json":"https://pith.science/pith/U5VXJDRHNUNWAC77GXM2352DM3.json","view_paper":"https://pith.science/paper/U5VXJDRH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5351&json=true","fetch_graph":"https://pith.science/api/pith-number/U5VXJDRHNUNWAC77GXM2352DM3/graph.json","fetch_events":"https://pith.science/api/pith-number/U5VXJDRHNUNWAC77GXM2352DM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5VXJDRHNUNWAC77GXM2352DM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5VXJDRHNUNWAC77GXM2352DM3/action/storage_attestation","attest_author":"https://pith.science/pith/U5VXJDRHNUNWAC77GXM2352DM3/action/author_attestation","sign_citation":"https://pith.science/pith/U5VXJDRHNUNWAC77GXM2352DM3/action/citation_signature","submit_replication":"https://pith.science/pith/U5VXJDRHNUNWAC77GXM2352DM3/action/replication_record"}},"created_at":"2026-05-18T02:28:54.273204+00:00","updated_at":"2026-05-18T02:28:54.273204+00:00"}