{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QTLSEAG2D5I3NNYN3PBOSTC4OV","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":"8fab6990fd27e18fbaed01b4b454e1ff7fa70f3da7f0c71b792ac3f556367fbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-10-19T18:59:54Z","title_canon_sha256":"f383c6d611ee38c50e9ea9aaa61950773030602deed893e4df997623305142d7"},"schema_version":"1.0","source":{"id":"1310.5262","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5262","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5262v1","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5262","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"QTLSEAG2D5I3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QTLSEAG2D5I3NNYN","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QTLSEAG2","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:ab8aff1cee2ee0a3af9fcd265a19bb4ef911a0a510cb0ef32451842aee19d36f","target":"graph","created_at":"2026-05-18T03:09:46Z","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":"We investigate the problem of embedding infinite binary sequences into Bernoulli site percolation on $\\mathbb{Z}^d$ with parameter $p$, known also as percolation of words.\\ In 1995, I.\\ Benjamini and H.\\ Kesten proved that, for $d \\geq 10$ and $p=1/2$, all sequences can be embedded, almost surely. They conjectured that the same should hold for $d \\geq 3$. In this paper we consider $d \\geq 3$ and $p \\in (p_c(d), 1-p_c(d))$, where $p_c(d)<1/2$ is the critical threshold for site percolation on $\\mathbb{Z}^d$. We show that there exists an integer $M = M (p)$, such that, a.s., every binary sequence","authors_text":"Bernardo N. B. de Lima, Marcelo R. Hil\\'ario, Pierre Nolin, Vladas Sidoravicius","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-10-19T18:59:54Z","title":"Embedding binary sequences into Bernoulli site percolation on $\\mathbb{Z}^3$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5262","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:92ff31768cece08585a1f1d6283d5096f025f4a39b29966ef94ba8f185e95b56","target":"record","created_at":"2026-05-18T03:09:46Z","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":"8fab6990fd27e18fbaed01b4b454e1ff7fa70f3da7f0c71b792ac3f556367fbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-10-19T18:59:54Z","title_canon_sha256":"f383c6d611ee38c50e9ea9aaa61950773030602deed893e4df997623305142d7"},"schema_version":"1.0","source":{"id":"1310.5262","kind":"arxiv","version":1}},"canonical_sha256":"84d72200da1f51b6b70ddbc2e94c5c75658db52de9e5da3e8fddfe3c3a91bfb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84d72200da1f51b6b70ddbc2e94c5c75658db52de9e5da3e8fddfe3c3a91bfb3","first_computed_at":"2026-05-18T03:09:46.257238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:46.257238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cPTPqO/ikDM4DzD3h9fpzRiXr3u1LNeCCHmlXnvdp0DL98aGZpSHaLmI1ACBJdR8gKn8+XUKRPbAldWj4r8xAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:46.258098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5262","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92ff31768cece08585a1f1d6283d5096f025f4a39b29966ef94ba8f185e95b56","sha256:ab8aff1cee2ee0a3af9fcd265a19bb4ef911a0a510cb0ef32451842aee19d36f"],"state_sha256":"05acf1206a39e2859a326d36a6f74d1b1a8502578f8fe0d8a93f1881c67d507b"}