{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XWR7B4EDWYASQ3MROVMLGJCGF5","short_pith_number":"pith:XWR7B4ED","schema_version":"1.0","canonical_sha256":"bda3f0f083b601286d917558b324462f504d12768805da080b0a5d3391c82b3f","source":{"kind":"arxiv","id":"1411.4041","version":1},"attestation_state":"computed","paper":{"title":"Scheduling of non-colliding random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Allan Sly, Riddhipratim Basu, Vladas Sidoravicius","submitted_at":"2014-11-14T20:59:23Z","abstract_excerpt":"On the complete graph ${\\cal{K}}_M$ with $M \\ge3$ vertices consider two independent discrete time random walks $\\mathbb{X}$ and $\\mathbb{Y}$, choosing their steps uniformly at random. A pair of trajectories $\\mathbb{X} = \\{ X_1, X_2, \\dots \\}$ and $\\mathbb{Y} = \\{Y_1, Y_2, \\dots \\}$ is called {\\it{non-colliding}}, if by delaying their jump times one can keep both walks at distinct vertices forever. It was conjectured by P. Winkler that for large enough $M$ the set of pairs of non-colliding trajectories $\\{\\mathbb{X},\\mathbb{Y} \\} $ has positive measure. N. Alon translated this problem to the l"},"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":"1411.4041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-14T20:59:23Z","cross_cats_sorted":[],"title_canon_sha256":"58418817a5e845d14672eb6b478f12d37f30b142801b5070a37f19f0f9a6989f","abstract_canon_sha256":"9f91e2682249824a2657c4f54fe0ead8d507d5c4d4cedf46319ceac2a503e4c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:37.167129Z","signature_b64":"C2T40Ord1kPXOJ/zK1rmuNjR2ptgc0Mx/vJWt3YkeHT9n25usTuOkKNReEinTqHtQ80TpQYB7miOyTk/sccLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bda3f0f083b601286d917558b324462f504d12768805da080b0a5d3391c82b3f","last_reissued_at":"2026-05-18T02:37:37.166677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:37.166677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling of non-colliding random walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Allan Sly, Riddhipratim Basu, Vladas Sidoravicius","submitted_at":"2014-11-14T20:59:23Z","abstract_excerpt":"On the complete graph ${\\cal{K}}_M$ with $M \\ge3$ vertices consider two independent discrete time random walks $\\mathbb{X}$ and $\\mathbb{Y}$, choosing their steps uniformly at random. A pair of trajectories $\\mathbb{X} = \\{ X_1, X_2, \\dots \\}$ and $\\mathbb{Y} = \\{Y_1, Y_2, \\dots \\}$ is called {\\it{non-colliding}}, if by delaying their jump times one can keep both walks at distinct vertices forever. It was conjectured by P. Winkler that for large enough $M$ the set of pairs of non-colliding trajectories $\\{\\mathbb{X},\\mathbb{Y} \\} $ has positive measure. N. Alon translated this problem to the l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4041","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":"1411.4041","created_at":"2026-05-18T02:37:37.166746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4041v1","created_at":"2026-05-18T02:37:37.166746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4041","created_at":"2026-05-18T02:37:37.166746+00:00"},{"alias_kind":"pith_short_12","alias_value":"XWR7B4EDWYAS","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XWR7B4EDWYASQ3MR","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XWR7B4ED","created_at":"2026-05-18T12:28:57.508820+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/XWR7B4EDWYASQ3MROVMLGJCGF5","json":"https://pith.science/pith/XWR7B4EDWYASQ3MROVMLGJCGF5.json","graph_json":"https://pith.science/api/pith-number/XWR7B4EDWYASQ3MROVMLGJCGF5/graph.json","events_json":"https://pith.science/api/pith-number/XWR7B4EDWYASQ3MROVMLGJCGF5/events.json","paper":"https://pith.science/paper/XWR7B4ED"},"agent_actions":{"view_html":"https://pith.science/pith/XWR7B4EDWYASQ3MROVMLGJCGF5","download_json":"https://pith.science/pith/XWR7B4EDWYASQ3MROVMLGJCGF5.json","view_paper":"https://pith.science/paper/XWR7B4ED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4041&json=true","fetch_graph":"https://pith.science/api/pith-number/XWR7B4EDWYASQ3MROVMLGJCGF5/graph.json","fetch_events":"https://pith.science/api/pith-number/XWR7B4EDWYASQ3MROVMLGJCGF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XWR7B4EDWYASQ3MROVMLGJCGF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XWR7B4EDWYASQ3MROVMLGJCGF5/action/storage_attestation","attest_author":"https://pith.science/pith/XWR7B4EDWYASQ3MROVMLGJCGF5/action/author_attestation","sign_citation":"https://pith.science/pith/XWR7B4EDWYASQ3MROVMLGJCGF5/action/citation_signature","submit_replication":"https://pith.science/pith/XWR7B4EDWYASQ3MROVMLGJCGF5/action/replication_record"}},"created_at":"2026-05-18T02:37:37.166746+00:00","updated_at":"2026-05-18T02:37:37.166746+00:00"}