{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:C5I2RRJDIJXUGEQPKUDBG5D3GL","short_pith_number":"pith:C5I2RRJD","schema_version":"1.0","canonical_sha256":"1751a8c523426f43120f550613747b32e9c15a97fc426eb5fb18a528ca5043fc","source":{"kind":"arxiv","id":"1010.3326","version":2},"attestation_state":"computed","paper":{"title":"The sharp threshold for bootstrap percolation in all dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.DS","math.MP"],"primary_cat":"math.PR","authors_text":"B\\'ela Bollob\\'as, Hugo Duminil-Copin, J\\'ozsef Balogh, Robert Morris","submitted_at":"2010-10-16T06:22:53Z","abstract_excerpt":"In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially 'infected' vertices spreads by infecting (at each time step) vertices with at least r already-infected neighbours. This process may be viewed as a monotone version of the Glauber dynamics of the Ising model, and has been extensively studied on the d-dimensional grid $[n]^d$. The elements of the set A are usually chosen independently, with some density p, and the main question is to determine $p_c([n]^d,r)$, the density at which percolation (infection of the entire vertex set) becomes likely.\n  In this pa"},"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":"1010.3326","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-10-16T06:22:53Z","cross_cats_sorted":["math-ph","math.CO","math.DS","math.MP"],"title_canon_sha256":"ba790195c12e01be35cdab3c92cdc81e0f311090ac4489d68dc203bc35eb8a56","abstract_canon_sha256":"926780e0f5e275bf61cc3f6eed8fe894e15e1ab59967953dc1358e345ab669b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:58.695193Z","signature_b64":"e2n44qlb64CGPjjhwY+wOUSa7arVhZV46lWRZHpMU1Eh1gDrWCSErDqiQQYNDL8P5G9pZwWxMihYhpQPlSBDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1751a8c523426f43120f550613747b32e9c15a97fc426eb5fb18a528ca5043fc","last_reissued_at":"2026-05-18T04:27:58.694741Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:58.694741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The sharp threshold for bootstrap percolation in all dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.DS","math.MP"],"primary_cat":"math.PR","authors_text":"B\\'ela Bollob\\'as, Hugo Duminil-Copin, J\\'ozsef Balogh, Robert Morris","submitted_at":"2010-10-16T06:22:53Z","abstract_excerpt":"In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially 'infected' vertices spreads by infecting (at each time step) vertices with at least r already-infected neighbours. This process may be viewed as a monotone version of the Glauber dynamics of the Ising model, and has been extensively studied on the d-dimensional grid $[n]^d$. The elements of the set A are usually chosen independently, with some density p, and the main question is to determine $p_c([n]^d,r)$, the density at which percolation (infection of the entire vertex set) becomes likely.\n  In this pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3326","kind":"arxiv","version":2},"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":"1010.3326","created_at":"2026-05-18T04:27:58.694783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.3326v2","created_at":"2026-05-18T04:27:58.694783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3326","created_at":"2026-05-18T04:27:58.694783+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5I2RRJDIJXU","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5I2RRJDIJXUGEQP","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5I2RRJD","created_at":"2026-05-18T12:26:05.355336+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/C5I2RRJDIJXUGEQPKUDBG5D3GL","json":"https://pith.science/pith/C5I2RRJDIJXUGEQPKUDBG5D3GL.json","graph_json":"https://pith.science/api/pith-number/C5I2RRJDIJXUGEQPKUDBG5D3GL/graph.json","events_json":"https://pith.science/api/pith-number/C5I2RRJDIJXUGEQPKUDBG5D3GL/events.json","paper":"https://pith.science/paper/C5I2RRJD"},"agent_actions":{"view_html":"https://pith.science/pith/C5I2RRJDIJXUGEQPKUDBG5D3GL","download_json":"https://pith.science/pith/C5I2RRJDIJXUGEQPKUDBG5D3GL.json","view_paper":"https://pith.science/paper/C5I2RRJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.3326&json=true","fetch_graph":"https://pith.science/api/pith-number/C5I2RRJDIJXUGEQPKUDBG5D3GL/graph.json","fetch_events":"https://pith.science/api/pith-number/C5I2RRJDIJXUGEQPKUDBG5D3GL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5I2RRJDIJXUGEQPKUDBG5D3GL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5I2RRJDIJXUGEQPKUDBG5D3GL/action/storage_attestation","attest_author":"https://pith.science/pith/C5I2RRJDIJXUGEQPKUDBG5D3GL/action/author_attestation","sign_citation":"https://pith.science/pith/C5I2RRJDIJXUGEQPKUDBG5D3GL/action/citation_signature","submit_replication":"https://pith.science/pith/C5I2RRJDIJXUGEQPKUDBG5D3GL/action/replication_record"}},"created_at":"2026-05-18T04:27:58.694783+00:00","updated_at":"2026-05-18T04:27:58.694783+00:00"}