{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7SVNQL5VXUYFHPDQ47C76KITDZ","short_pith_number":"pith:7SVNQL5V","schema_version":"1.0","canonical_sha256":"fcaad82fb5bd3053bc70e7c5ff29131e47fd93e867045b7d6e49028c19436132","source":{"kind":"arxiv","id":"1807.10323","version":1},"attestation_state":"computed","paper":{"title":"Bootstrap percolation on the product of the two-dimensional lattice with a Hamming square","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Sivakoff, Janko Gravner","submitted_at":"2018-07-26T19:03:08Z","abstract_excerpt":"Bootstrap percolation on a graph is a deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least $\\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure with a low density $p$. Our main focus is on this process on the product graph $\\mathbb{Z}^2\\times K_n^2$, where $K_n$ is a complete graph. We investigate how $p$ scales with $n$ so that a typical site is eventually occupied. Under critical scaling, the dynamics with even $\\theta$ exhibits a sharp phase transition, while odd $\\theta$ yields a gradual p"},"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":"1807.10323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-07-26T19:03:08Z","cross_cats_sorted":[],"title_canon_sha256":"88cc0521ff73f46aabbad5fe03cb97cf34fe8277a9fe69f467c74e6a4ac420f4","abstract_canon_sha256":"8d483ebf8738d5cd04615230170325036ed4d2cab2e3733577f30cf848019016"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:40.948310Z","signature_b64":"L7Houj+EHt5rH/0HJz2v0Bdi3ZdJDYErlB0+3rS9u8zNmxQk3pe+wuA76SdH/cdFolZIxIubOSMdyOUjakpnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcaad82fb5bd3053bc70e7c5ff29131e47fd93e867045b7d6e49028c19436132","last_reissued_at":"2026-05-18T00:09:40.947635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:40.947635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bootstrap percolation on the product of the two-dimensional lattice with a Hamming square","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Sivakoff, Janko Gravner","submitted_at":"2018-07-26T19:03:08Z","abstract_excerpt":"Bootstrap percolation on a graph is a deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least $\\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure with a low density $p$. Our main focus is on this process on the product graph $\\mathbb{Z}^2\\times K_n^2$, where $K_n$ is a complete graph. We investigate how $p$ scales with $n$ so that a typical site is eventually occupied. Under critical scaling, the dynamics with even $\\theta$ exhibits a sharp phase transition, while odd $\\theta$ yields a gradual p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10323","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.10323","created_at":"2026-05-18T00:09:40.947717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10323v1","created_at":"2026-05-18T00:09:40.947717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10323","created_at":"2026-05-18T00:09:40.947717+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SVNQL5VXUYF","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SVNQL5VXUYFHPDQ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SVNQL5V","created_at":"2026-05-18T12:32:11.075285+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/7SVNQL5VXUYFHPDQ47C76KITDZ","json":"https://pith.science/pith/7SVNQL5VXUYFHPDQ47C76KITDZ.json","graph_json":"https://pith.science/api/pith-number/7SVNQL5VXUYFHPDQ47C76KITDZ/graph.json","events_json":"https://pith.science/api/pith-number/7SVNQL5VXUYFHPDQ47C76KITDZ/events.json","paper":"https://pith.science/paper/7SVNQL5V"},"agent_actions":{"view_html":"https://pith.science/pith/7SVNQL5VXUYFHPDQ47C76KITDZ","download_json":"https://pith.science/pith/7SVNQL5VXUYFHPDQ47C76KITDZ.json","view_paper":"https://pith.science/paper/7SVNQL5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10323&json=true","fetch_graph":"https://pith.science/api/pith-number/7SVNQL5VXUYFHPDQ47C76KITDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/7SVNQL5VXUYFHPDQ47C76KITDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SVNQL5VXUYFHPDQ47C76KITDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SVNQL5VXUYFHPDQ47C76KITDZ/action/storage_attestation","attest_author":"https://pith.science/pith/7SVNQL5VXUYFHPDQ47C76KITDZ/action/author_attestation","sign_citation":"https://pith.science/pith/7SVNQL5VXUYFHPDQ47C76KITDZ/action/citation_signature","submit_replication":"https://pith.science/pith/7SVNQL5VXUYFHPDQ47C76KITDZ/action/replication_record"}},"created_at":"2026-05-18T00:09:40.947717+00:00","updated_at":"2026-05-18T00:09:40.947717+00:00"}