{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FJRDQE3NZQRKVC4KNYXJRKM4QV","short_pith_number":"pith:FJRDQE3N","canonical_record":{"source":{"id":"1704.05870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-19T18:07:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e814b585e57e5f2175c4b156fa4533688623b5d9686eb7bae78e5fa86dde6604","abstract_canon_sha256":"302fd11ced4df550964fcb18f168ed9a3715c764885ddc08f3f7516c4387873b"},"schema_version":"1.0"},"canonical_sha256":"2a6238136dcc22aa8b8a6e2e98a99c8565c6219c1bd0194d286d89d70d7fd721","source":{"kind":"arxiv","id":"1704.05870","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05870","created_at":"2026-05-18T00:45:38Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05870v2","created_at":"2026-05-18T00:45:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05870","created_at":"2026-05-18T00:45:38Z"},{"alias_kind":"pith_short_12","alias_value":"FJRDQE3NZQRK","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJRDQE3NZQRKVC4K","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJRDQE3N","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FJRDQE3NZQRKVC4KNYXJRKM4QV","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-19T18:07:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e814b585e57e5f2175c4b156fa4533688623b5d9686eb7bae78e5fa86dde6604","abstract_canon_sha256":"302fd11ced4df550964fcb18f168ed9a3715c764885ddc08f3f7516c4387873b"},"schema_version":"1.0"},"canonical_sha256":"2a6238136dcc22aa8b8a6e2e98a99c8565c6219c1bd0194d286d89d70d7fd721","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:38.410172Z","signature_b64":"9/dzs5vS9+KOoO0dAIg5qVZmZ1ITKMAPZ5o5ZOCAi08qp20y2TH/+kwg63WhLQA6ciwYd58XSpVsvISx/cM/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a6238136dcc22aa8b8a6e2e98a99c8565c6219c1bd0194d286d89d70d7fd721","last_reissued_at":"2026-05-18T00:45:38.409547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:38.409547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05870","source_version":2,"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:45:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mycBt6zT0N+P7k2Wi5uNaTN1C6NPJfoBk5ygby2ys/jnTH5pOTBumijE2P6lQCTm0KXqBQUyZ4nLvwuPkOqSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:08:54.448890Z"},"content_sha256":"ac433989b2869ed024e0d0755e5c34e0de5582bcb1b69bfc30cee35cb50eecaa","schema_version":"1.0","event_id":"sha256:ac433989b2869ed024e0d0755e5c34e0de5582bcb1b69bfc30cee35cb50eecaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FJRDQE3NZQRKVC4KNYXJRKM4QV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Covering Monotonic Paths with Simple Random Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Eviatar B. Procaccia, Yuan Zhang","submitted_at":"2017-04-19T18:07:56Z","abstract_excerpt":"In this paper we study the probability that a $d$ dimensional simple random walk (or the first $L$ steps of it) covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball. We show that among all such paths, the one that maximizes the covering probability is the monotonic increasing one that stays within distance 1 from the diagonal. As a result, we can obtain an exponential upper bound on the decaying rate of covering probability of any such path when $d\\ge 4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05870","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"},"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:45:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYpgUf0H7e0mbE7g5uPfajapspi4TpP83LQ7YEPYd3jdBxM4DBONcqVFFTZUBhumEnwRklklg4MCr9djRKq7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:08:54.449521Z"},"content_sha256":"bfacaef6255ab0e792da0678a9252b8943cc1592e0950612bc46281aa1d106b7","schema_version":"1.0","event_id":"sha256:bfacaef6255ab0e792da0678a9252b8943cc1592e0950612bc46281aa1d106b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJRDQE3NZQRKVC4KNYXJRKM4QV/bundle.json","state_url":"https://pith.science/pith/FJRDQE3NZQRKVC4KNYXJRKM4QV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJRDQE3NZQRKVC4KNYXJRKM4QV/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-06-02T06:08:54Z","links":{"resolver":"https://pith.science/pith/FJRDQE3NZQRKVC4KNYXJRKM4QV","bundle":"https://pith.science/pith/FJRDQE3NZQRKVC4KNYXJRKM4QV/bundle.json","state":"https://pith.science/pith/FJRDQE3NZQRKVC4KNYXJRKM4QV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJRDQE3NZQRKVC4KNYXJRKM4QV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FJRDQE3NZQRKVC4KNYXJRKM4QV","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":"302fd11ced4df550964fcb18f168ed9a3715c764885ddc08f3f7516c4387873b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-19T18:07:56Z","title_canon_sha256":"e814b585e57e5f2175c4b156fa4533688623b5d9686eb7bae78e5fa86dde6604"},"schema_version":"1.0","source":{"id":"1704.05870","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05870","created_at":"2026-05-18T00:45:38Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05870v2","created_at":"2026-05-18T00:45:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05870","created_at":"2026-05-18T00:45:38Z"},{"alias_kind":"pith_short_12","alias_value":"FJRDQE3NZQRK","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FJRDQE3NZQRKVC4K","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FJRDQE3N","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:bfacaef6255ab0e792da0678a9252b8943cc1592e0950612bc46281aa1d106b7","target":"graph","created_at":"2026-05-18T00:45:38Z","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 study the probability that a $d$ dimensional simple random walk (or the first $L$ steps of it) covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball. We show that among all such paths, the one that maximizes the covering probability is the monotonic increasing one that stays within distance 1 from the diagonal. As a result, we can obtain an exponential upper bound on the decaying rate of covering probability of any such path when $d\\ge 4$.","authors_text":"Eviatar B. Procaccia, Yuan Zhang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-19T18:07:56Z","title":"On Covering Monotonic Paths with Simple Random Walk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05870","kind":"arxiv","version":2},"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:ac433989b2869ed024e0d0755e5c34e0de5582bcb1b69bfc30cee35cb50eecaa","target":"record","created_at":"2026-05-18T00:45:38Z","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":"302fd11ced4df550964fcb18f168ed9a3715c764885ddc08f3f7516c4387873b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-19T18:07:56Z","title_canon_sha256":"e814b585e57e5f2175c4b156fa4533688623b5d9686eb7bae78e5fa86dde6604"},"schema_version":"1.0","source":{"id":"1704.05870","kind":"arxiv","version":2}},"canonical_sha256":"2a6238136dcc22aa8b8a6e2e98a99c8565c6219c1bd0194d286d89d70d7fd721","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a6238136dcc22aa8b8a6e2e98a99c8565c6219c1bd0194d286d89d70d7fd721","first_computed_at":"2026-05-18T00:45:38.409547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:38.409547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9/dzs5vS9+KOoO0dAIg5qVZmZ1ITKMAPZ5o5ZOCAi08qp20y2TH/+kwg63WhLQA6ciwYd58XSpVsvISx/cM/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:38.410172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05870","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac433989b2869ed024e0d0755e5c34e0de5582bcb1b69bfc30cee35cb50eecaa","sha256:bfacaef6255ab0e792da0678a9252b8943cc1592e0950612bc46281aa1d106b7"],"state_sha256":"96445921a6643dd04c44793a44e4d9f085beb4e64e9601f901a2071f9fd65408"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S6kczCPeztwufN8wSqilqIieQI8cwEGvJ7JFU0EhAS0EEOayjjkEysqnWLWJLGBlw7Amy9YvIsTaDWEEgC8yDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:08:54.452633Z","bundle_sha256":"32bf76823411174fac4f1837369135aaf79ae0588504a4ff20d2afd58106201e"}}