{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4TWY4GGRCXNP5FES55VUESOCP5","short_pith_number":"pith:4TWY4GGR","schema_version":"1.0","canonical_sha256":"e4ed8e18d115dafe9492ef6b4249c27f594c85c83bc43733e10620f456f8ec3c","source":{"kind":"arxiv","id":"1308.6791","version":2},"attestation_state":"computed","paper":{"title":"Deterministic bootstrap percolation in high dimensional grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Choongbum Lee, Hao Huang","submitted_at":"2013-08-30T16:36:20Z","abstract_excerpt":"In this paper, we study the k-neighbor bootstrap percolation process on the d-dimensional grid [n]^d, and show that the minimum number of initial vertices that percolate is (1-d/k)n^d + O(n^{d-1})$ when d<=k<=2d. This confirms a conjecture of Pete."},"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":"1308.6791","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-30T16:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"2093066101aa4fdb98e8d5830f93a3874a4b81a8b628986e8dcd15e73f9243fb","abstract_canon_sha256":"c950f511f0f03810a0c9b9d46e7756ed0573a89b44477b0a442689f09011f2e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:16.872295Z","signature_b64":"YDeA17dULT/psZEzrWzK1h6BQMacKQ9anVfpBRgmgofpvflQ9R/tIyOmcashWPP+pXWSGUK3K06GNQ9WaLFWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4ed8e18d115dafe9492ef6b4249c27f594c85c83bc43733e10620f456f8ec3c","last_reissued_at":"2026-05-18T03:14:16.871576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:16.871576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic bootstrap percolation in high dimensional grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Choongbum Lee, Hao Huang","submitted_at":"2013-08-30T16:36:20Z","abstract_excerpt":"In this paper, we study the k-neighbor bootstrap percolation process on the d-dimensional grid [n]^d, and show that the minimum number of initial vertices that percolate is (1-d/k)n^d + O(n^{d-1})$ when d<=k<=2d. This confirms a conjecture of Pete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6791","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":"1308.6791","created_at":"2026-05-18T03:14:16.871697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.6791v2","created_at":"2026-05-18T03:14:16.871697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6791","created_at":"2026-05-18T03:14:16.871697+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TWY4GGRCXNP","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TWY4GGRCXNP5FES","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TWY4GGR","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.01940","citing_title":"Smallest percolating sets in bootstrap percolation on grids","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4TWY4GGRCXNP5FES55VUESOCP5","json":"https://pith.science/pith/4TWY4GGRCXNP5FES55VUESOCP5.json","graph_json":"https://pith.science/api/pith-number/4TWY4GGRCXNP5FES55VUESOCP5/graph.json","events_json":"https://pith.science/api/pith-number/4TWY4GGRCXNP5FES55VUESOCP5/events.json","paper":"https://pith.science/paper/4TWY4GGR"},"agent_actions":{"view_html":"https://pith.science/pith/4TWY4GGRCXNP5FES55VUESOCP5","download_json":"https://pith.science/pith/4TWY4GGRCXNP5FES55VUESOCP5.json","view_paper":"https://pith.science/paper/4TWY4GGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.6791&json=true","fetch_graph":"https://pith.science/api/pith-number/4TWY4GGRCXNP5FES55VUESOCP5/graph.json","fetch_events":"https://pith.science/api/pith-number/4TWY4GGRCXNP5FES55VUESOCP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TWY4GGRCXNP5FES55VUESOCP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TWY4GGRCXNP5FES55VUESOCP5/action/storage_attestation","attest_author":"https://pith.science/pith/4TWY4GGRCXNP5FES55VUESOCP5/action/author_attestation","sign_citation":"https://pith.science/pith/4TWY4GGRCXNP5FES55VUESOCP5/action/citation_signature","submit_replication":"https://pith.science/pith/4TWY4GGRCXNP5FES55VUESOCP5/action/replication_record"}},"created_at":"2026-05-18T03:14:16.871697+00:00","updated_at":"2026-05-18T03:14:16.871697+00:00"}