{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2EDIG3HYF6M63YPMKQJ5SAVE23","short_pith_number":"pith:2EDIG3HY","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"},"canonical_sha256":"d106836cf82f99ede1ec5413d902a4d6db1e7be49c337d59e23ab3d688eae13d","source":{"kind":"arxiv","id":"1705.03915","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03915","created_at":"2026-05-18T00:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03915v1","created_at":"2026-05-18T00:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03915","created_at":"2026-05-18T00:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"2EDIG3HYF6M6","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2EDIG3HYF6M63YPM","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2EDIG3HY","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2EDIG3HYF6M63YPMKQJ5SAVE23","target":"record","payload":{"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"},"canonical_sha256":"d106836cf82f99ede1ec5413d902a4d6db1e7be49c337d59e23ab3d688eae13d","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"},"source_kind":"arxiv","source_id":"1705.03915","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BF2ffJiGnIyveyY2wdu8kSpecx/tH3fo8K10CoiTR/3+9KWunHaJCCaLCXVQLHJxBsyxFkF1pxDekJyY5mNnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:24:52.068983Z"},"content_sha256":"faa361c4313b0d0b8f11038339e55deab8d44b03bdbdbead6c31e61dc24092a9","schema_version":"1.0","event_id":"sha256:faa361c4313b0d0b8f11038339e55deab8d44b03bdbdbead6c31e61dc24092a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2EDIG3HYF6M63YPMKQJ5SAVE23","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:44:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Ukse76VIhjHvIdzJCoIpP65nRjjnILF9EdNS2Ni0sfP07Bzx+6a4djvF/dborGpECZvgu8qNWk1uPPbT54pCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:24:52.069411Z"},"content_sha256":"9382751e4fbed7de5a33c36dd697a57fee0b73c555085e1dc6df96dc412447d8","schema_version":"1.0","event_id":"sha256:9382751e4fbed7de5a33c36dd697a57fee0b73c555085e1dc6df96dc412447d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23/bundle.json","state_url":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2EDIG3HYF6M63YPMKQJ5SAVE23/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T18:24:52Z","links":{"resolver":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23","bundle":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23/bundle.json","state":"https://pith.science/pith/2EDIG3HYF6M63YPMKQJ5SAVE23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2EDIG3HYF6M63YPMKQJ5SAVE23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2EDIG3HYF6M63YPMKQJ5SAVE23","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":"60bbb2cfc09c7d0cca026d768f2a78bfbbe1dd058d6457cf628062760b3652f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-05-10T18:31:23Z","title_canon_sha256":"13c6f3ad5756e49fee608748652de954b52f1b6565b8f1cf558d635be85592d7"},"schema_version":"1.0","source":{"id":"1705.03915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03915","created_at":"2026-05-18T00:44:41Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03915v1","created_at":"2026-05-18T00:44:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03915","created_at":"2026-05-18T00:44:41Z"},{"alias_kind":"pith_short_12","alias_value":"2EDIG3HYF6M6","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2EDIG3HYF6M63YPM","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2EDIG3HY","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:9382751e4fbed7de5a33c36dd697a57fee0b73c555085e1dc6df96dc412447d8","target":"graph","created_at":"2026-05-18T00:44:41Z","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":"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^{","authors_text":"Eviatar B. Procaccia, Yuan Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-05-10T18:31:23Z","title":"On Covering paths with 3 Dimensional Random Walk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03915","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:faa361c4313b0d0b8f11038339e55deab8d44b03bdbdbead6c31e61dc24092a9","target":"record","created_at":"2026-05-18T00:44:41Z","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":"60bbb2cfc09c7d0cca026d768f2a78bfbbe1dd058d6457cf628062760b3652f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-05-10T18:31:23Z","title_canon_sha256":"13c6f3ad5756e49fee608748652de954b52f1b6565b8f1cf558d635be85592d7"},"schema_version":"1.0","source":{"id":"1705.03915","kind":"arxiv","version":1}},"canonical_sha256":"d106836cf82f99ede1ec5413d902a4d6db1e7be49c337d59e23ab3d688eae13d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d106836cf82f99ede1ec5413d902a4d6db1e7be49c337d59e23ab3d688eae13d","first_computed_at":"2026-05-18T00:44:41.853500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:41.853500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S3DqqccjjYo+ED86ETGrd3p8MmUhLzU7O/iWaOC6XpO1jEHxXOXY2XrEyngBc9e3vhtiCxFK8iMfW80YGyeCBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:41.854068Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faa361c4313b0d0b8f11038339e55deab8d44b03bdbdbead6c31e61dc24092a9","sha256:9382751e4fbed7de5a33c36dd697a57fee0b73c555085e1dc6df96dc412447d8"],"state_sha256":"c4a8ceb1c3f23f4d510c3c42b210705c05b8d78b3a1f6bd228d1f012ee6239d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T6JYoCE6MlNcHE8k0JY/vn/s8C66EYlYXPw4kdtKO/Lfob2VrWwQlupXXwgc4u+85JA+nCI/Gx3ozOeRfn6JDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:24:52.072324Z","bundle_sha256":"26554146c7bbd4e7cd7348231962fabdbbb3350bab051998e42238c6505b3df3"}}