{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2EDIG3HYF6M63YPMKQJ5SAVE23","short_pith_number":"pith:2EDIG3HY","schema_version":"1.0","canonical_sha256":"d106836cf82f99ede1ec5413d902a4d6db1e7be49c337d59e23ab3d688eae13d","source":{"kind":"arxiv","id":"1705.03915","version":1},"attestation_state":"computed","paper":{"title":"On Covering paths with 3 Dimensional Random Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Eviatar B. Procaccia, Yuan Zhang","submitted_at":"2017-05-10T18:31:23Z","abstract_excerpt":"In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\\ge 4$, it has been shown in [5] that such probability decays exponentially with respect to $N$. For $d=3$, however, the same technique does not apply, and in this paper we obtain a slightly weaker upper bound: $\\forall \\varepsilon>0,\\exists c_\\varepsilon>0,$ $$P\\left({\\rm Trace}(\\mathcal{P})\\subseteq {\\rm Trace}\\big(\\{X_n\\}_{n=0}^\\infty\\big) \\right)\\le \\exp\\left(-c_\\varepsilon N\\log^{"},"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":"1705.03915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-05-10T18:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"13c6f3ad5756e49fee608748652de954b52f1b6565b8f1cf558d635be85592d7","abstract_canon_sha256":"60bbb2cfc09c7d0cca026d768f2a78bfbbe1dd058d6457cf628062760b3652f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:41.854068Z","signature_b64":"S3DqqccjjYo+ED86ETGrd3p8MmUhLzU7O/iWaOC6XpO1jEHxXOXY2XrEyngBc9e3vhtiCxFK8iMfW80YGyeCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d106836cf82f99ede1ec5413d902a4d6db1e7be49c337d59e23ab3d688eae13d","last_reissued_at":"2026-05-18T00:44:41.853500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:41.853500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Covering paths with 3 Dimensional Random Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Eviatar B. Procaccia, Yuan Zhang","submitted_at":"2017-05-10T18:31:23Z","abstract_excerpt":"In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\\ge 4$, it has been shown in [5] that such probability decays exponentially with respect to $N$. For $d=3$, however, the same technique does not apply, and in this paper we obtain a slightly weaker upper bound: $\\forall \\varepsilon>0,\\exists c_\\varepsilon>0,$ $$P\\left({\\rm Trace}(\\mathcal{P})\\subseteq {\\rm Trace}\\big(\\{X_n\\}_{n=0}^\\infty\\big) \\right)\\le \\exp\\left(-c_\\varepsilon N\\log^{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03915","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":"1705.03915","created_at":"2026-05-18T00:44:41.853571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.03915v1","created_at":"2026-05-18T00:44:41.853571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03915","created_at":"2026-05-18T00:44:41.853571+00:00"},{"alias_kind":"pith_short_12","alias_value":"2EDIG3HYF6M6","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2EDIG3HYF6M63YPM","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2EDIG3HY","created_at":"2026-05-18T12:30:55.937587+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/2EDIG3HYF6M63YPMKQJ5SAVE23","json":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23.json","graph_json":"https://pith.science/api/pith-number/2EDIG3HYF6M63YPMKQJ5SAVE23/graph.json","events_json":"https://pith.science/api/pith-number/2EDIG3HYF6M63YPMKQJ5SAVE23/events.json","paper":"https://pith.science/paper/2EDIG3HY"},"agent_actions":{"view_html":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23","download_json":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23.json","view_paper":"https://pith.science/paper/2EDIG3HY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.03915&json=true","fetch_graph":"https://pith.science/api/pith-number/2EDIG3HYF6M63YPMKQJ5SAVE23/graph.json","fetch_events":"https://pith.science/api/pith-number/2EDIG3HYF6M63YPMKQJ5SAVE23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23/action/storage_attestation","attest_author":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23/action/author_attestation","sign_citation":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23/action/citation_signature","submit_replication":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23/action/replication_record"}},"created_at":"2026-05-18T00:44:41.853571+00:00","updated_at":"2026-05-18T00:44:41.853571+00:00"}