{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5Q4KEKA47HHMBRJSTJOZ6U6Q7Q","short_pith_number":"pith:5Q4KEKA4","schema_version":"1.0","canonical_sha256":"ec38a2281cf9cec0c5329a5d9f53d0fc2ff925dbb506b72288379d378878ea7d","source":{"kind":"arxiv","id":"1703.08706","version":1},"attestation_state":"computed","paper":{"title":"Greedy walks on two lines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Katja Gabrysch","submitted_at":"2017-03-25T15:51:53Z","abstract_excerpt":"The greedy walk is a walk on a point process that always moves from its current position to the nearest not yet visited point. We consider here various point processes on two lines. We look first at the greedy walk on two independent one-dimensional Poisson processes placed on two intersecting lines and prove that the greedy walk almost surely does not visit all points. When a point process is defined on two parallel lines, the result depends on the definition of the process: If each line has a copy of the same realisation of a homogeneous Poisson point process, then the walk almost surely doe"},"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":"1703.08706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-03-25T15:51:53Z","cross_cats_sorted":[],"title_canon_sha256":"9e0922644a28d6e9ec24c1ba79002486a5903e738a31f287eba3f1f8f59b1141","abstract_canon_sha256":"492d27b0b021865be1b6711f1f53e133f7b4ef7c4f073aa76d3ba59bbc99bfe6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:55.813900Z","signature_b64":"tqnm9+uLpwSMz/sUzZejP4dtX0U77WEIzcvbOeuZhXKvLgG+R04Q1fH7oBmipfCMY7AfLamfoF4/HaLY2NLEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec38a2281cf9cec0c5329a5d9f53d0fc2ff925dbb506b72288379d378878ea7d","last_reissued_at":"2026-05-18T00:47:55.813400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:55.813400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy walks on two lines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Katja Gabrysch","submitted_at":"2017-03-25T15:51:53Z","abstract_excerpt":"The greedy walk is a walk on a point process that always moves from its current position to the nearest not yet visited point. We consider here various point processes on two lines. We look first at the greedy walk on two independent one-dimensional Poisson processes placed on two intersecting lines and prove that the greedy walk almost surely does not visit all points. When a point process is defined on two parallel lines, the result depends on the definition of the process: If each line has a copy of the same realisation of a homogeneous Poisson point process, then the walk almost surely doe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08706","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":"1703.08706","created_at":"2026-05-18T00:47:55.813467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08706v1","created_at":"2026-05-18T00:47:55.813467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08706","created_at":"2026-05-18T00:47:55.813467+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Q4KEKA47HHM","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Q4KEKA47HHMBRJS","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Q4KEKA4","created_at":"2026-05-18T12:31:00.734936+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/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q","json":"https://pith.science/pith/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q.json","graph_json":"https://pith.science/api/pith-number/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q/graph.json","events_json":"https://pith.science/api/pith-number/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q/events.json","paper":"https://pith.science/paper/5Q4KEKA4"},"agent_actions":{"view_html":"https://pith.science/pith/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q","download_json":"https://pith.science/pith/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q.json","view_paper":"https://pith.science/paper/5Q4KEKA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08706&json=true","fetch_graph":"https://pith.science/api/pith-number/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q/action/storage_attestation","attest_author":"https://pith.science/pith/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q/action/author_attestation","sign_citation":"https://pith.science/pith/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q/action/citation_signature","submit_replication":"https://pith.science/pith/5Q4KEKA47HHMBRJSTJOZ6U6Q7Q/action/replication_record"}},"created_at":"2026-05-18T00:47:55.813467+00:00","updated_at":"2026-05-18T00:47:55.813467+00:00"}