{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QORRAXAFADX2KB2SDDXQ4ES2HV","short_pith_number":"pith:QORRAXAF","schema_version":"1.0","canonical_sha256":"83a3105c0500efa5075218ef0e125a3d4f29519746c00fdeb1c9d4951748270c","source":{"kind":"arxiv","id":"2411.16441","version":2},"attestation_state":"computed","paper":{"title":"Shortest Path Lengths in Poisson Line Cox Processes: Approximations and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Gourab Ghatak, Martin Haenggi, Sanjoy Kumar Jhawar","submitted_at":"2024-11-25T14:44:15Z","abstract_excerpt":"We study street-constrained ($\\ell_1$) shortest paths in a Poisson line Cox process (PLCP), where Poisson points of linear intensity $\\mu$ lie on the lines of an underlying Poisson line process (PLP) of density $\\lambda$. Under a one-turn restriction, we derive closed-form expressions for the distribution of the nearest-neighbor path length from (i) the typical PLCP point and (ii) the typical PLP intersection, by explicitly evaluating the relevant void probabilities via a geometric decomposition of the feasible path-length set. For the intersection case, we further provide analytically tractab"},"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":"2411.16441","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-11-25T14:44:15Z","cross_cats_sorted":["math.IT","stat.AP"],"title_canon_sha256":"68501a44f30fd5e06d6d7f75f7c03bb7201ed8b055dedcbbf8e3299b6974d5d7","abstract_canon_sha256":"02914fc125c6758a1edada1d460d5510b9fd08ad4abc37f124098d84e4bdeffc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:16:22.281506Z","signature_b64":"mkPHqCu3TobNcKHITvpCTLVuMbkTfL0PUuhfXFQJdcFov+2vmUNqCBBdaPC34irHPVmjtVTspFeUV9tq6zSWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83a3105c0500efa5075218ef0e125a3d4f29519746c00fdeb1c9d4951748270c","last_reissued_at":"2026-06-30T01:16:22.280854Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:16:22.280854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest Path Lengths in Poisson Line Cox Processes: Approximations and Applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT","stat.AP"],"primary_cat":"cs.IT","authors_text":"Gourab Ghatak, Martin Haenggi, Sanjoy Kumar Jhawar","submitted_at":"2024-11-25T14:44:15Z","abstract_excerpt":"We study street-constrained ($\\ell_1$) shortest paths in a Poisson line Cox process (PLCP), where Poisson points of linear intensity $\\mu$ lie on the lines of an underlying Poisson line process (PLP) of density $\\lambda$. Under a one-turn restriction, we derive closed-form expressions for the distribution of the nearest-neighbor path length from (i) the typical PLCP point and (ii) the typical PLP intersection, by explicitly evaluating the relevant void probabilities via a geometric decomposition of the feasible path-length set. For the intersection case, we further provide analytically tractab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16441","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.16441/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.16441","created_at":"2026-06-30T01:16:22.280942+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16441v2","created_at":"2026-06-30T01:16:22.280942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16441","created_at":"2026-06-30T01:16:22.280942+00:00"},{"alias_kind":"pith_short_12","alias_value":"QORRAXAFADX2","created_at":"2026-06-30T01:16:22.280942+00:00"},{"alias_kind":"pith_short_16","alias_value":"QORRAXAFADX2KB2S","created_at":"2026-06-30T01:16:22.280942+00:00"},{"alias_kind":"pith_short_8","alias_value":"QORRAXAF","created_at":"2026-06-30T01:16:22.280942+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/QORRAXAFADX2KB2SDDXQ4ES2HV","json":"https://pith.science/pith/QORRAXAFADX2KB2SDDXQ4ES2HV.json","graph_json":"https://pith.science/api/pith-number/QORRAXAFADX2KB2SDDXQ4ES2HV/graph.json","events_json":"https://pith.science/api/pith-number/QORRAXAFADX2KB2SDDXQ4ES2HV/events.json","paper":"https://pith.science/paper/QORRAXAF"},"agent_actions":{"view_html":"https://pith.science/pith/QORRAXAFADX2KB2SDDXQ4ES2HV","download_json":"https://pith.science/pith/QORRAXAFADX2KB2SDDXQ4ES2HV.json","view_paper":"https://pith.science/paper/QORRAXAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16441&json=true","fetch_graph":"https://pith.science/api/pith-number/QORRAXAFADX2KB2SDDXQ4ES2HV/graph.json","fetch_events":"https://pith.science/api/pith-number/QORRAXAFADX2KB2SDDXQ4ES2HV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QORRAXAFADX2KB2SDDXQ4ES2HV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QORRAXAFADX2KB2SDDXQ4ES2HV/action/storage_attestation","attest_author":"https://pith.science/pith/QORRAXAFADX2KB2SDDXQ4ES2HV/action/author_attestation","sign_citation":"https://pith.science/pith/QORRAXAFADX2KB2SDDXQ4ES2HV/action/citation_signature","submit_replication":"https://pith.science/pith/QORRAXAFADX2KB2SDDXQ4ES2HV/action/replication_record"}},"created_at":"2026-06-30T01:16:22.280942+00:00","updated_at":"2026-06-30T01:16:22.280942+00:00"}