{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:62VG35O56RI5BUX4ACAY665RZO","short_pith_number":"pith:62VG35O5","schema_version":"1.0","canonical_sha256":"f6aa6df5ddf451d0d2fc00818f7bb1cb84142dbe1fe25bdc8c3a46533e6fad6c","source":{"kind":"arxiv","id":"2506.07571","version":1},"attestation_state":"computed","paper":{"title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mark de Berg, Sergio Cabello","submitted_at":"2025-06-09T09:14:34Z","abstract_excerpt":"We prove that the single-source shortest-path problem on disk graphs can be solved in $O(n\\log n)$ time, and that it can be solved on intersection graphs of fat triangles in $O(n\\log^2 n)$ time."},"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":"2506.07571","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-09T09:14:34Z","cross_cats_sorted":[],"title_canon_sha256":"b2f867ab230ca6302126c5a7686abaaf043abb207d6d4175215d89de32af9790","abstract_canon_sha256":"2f8e3a0e3dfacbb42783c7c364dc349dce6f2e3f25983e14a8f56e4dfc40db0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:29.583114Z","signature_b64":"k9foD9/u5WJS+xqWANTb0cYF3QnCszyQVQohcxTuX29Czlf9McL+cQ285mBC9DMDYAUSOKRdrV+L584LLG8wDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6aa6df5ddf451d0d2fc00818f7bb1cb84142dbe1fe25bdc8c3a46533e6fad6c","last_reissued_at":"2026-07-05T11:18:29.582621Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:29.582621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mark de Berg, Sergio Cabello","submitted_at":"2025-06-09T09:14:34Z","abstract_excerpt":"We prove that the single-source shortest-path problem on disk graphs can be solved in $O(n\\log n)$ time, and that it can be solved on intersection graphs of fat triangles in $O(n\\log^2 n)$ time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07571","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.07571/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":"2506.07571","created_at":"2026-07-05T11:18:29.582679+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.07571v1","created_at":"2026-07-05T11:18:29.582679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07571","created_at":"2026-07-05T11:18:29.582679+00:00"},{"alias_kind":"pith_short_12","alias_value":"62VG35O56RI5","created_at":"2026-07-05T11:18:29.582679+00:00"},{"alias_kind":"pith_short_16","alias_value":"62VG35O56RI5BUX4","created_at":"2026-07-05T11:18:29.582679+00:00"},{"alias_kind":"pith_short_8","alias_value":"62VG35O5","created_at":"2026-07-05T11:18:29.582679+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/62VG35O56RI5BUX4ACAY665RZO","json":"https://pith.science/pith/62VG35O56RI5BUX4ACAY665RZO.json","graph_json":"https://pith.science/api/pith-number/62VG35O56RI5BUX4ACAY665RZO/graph.json","events_json":"https://pith.science/api/pith-number/62VG35O56RI5BUX4ACAY665RZO/events.json","paper":"https://pith.science/paper/62VG35O5"},"agent_actions":{"view_html":"https://pith.science/pith/62VG35O56RI5BUX4ACAY665RZO","download_json":"https://pith.science/pith/62VG35O56RI5BUX4ACAY665RZO.json","view_paper":"https://pith.science/paper/62VG35O5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.07571&json=true","fetch_graph":"https://pith.science/api/pith-number/62VG35O56RI5BUX4ACAY665RZO/graph.json","fetch_events":"https://pith.science/api/pith-number/62VG35O56RI5BUX4ACAY665RZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62VG35O56RI5BUX4ACAY665RZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62VG35O56RI5BUX4ACAY665RZO/action/storage_attestation","attest_author":"https://pith.science/pith/62VG35O56RI5BUX4ACAY665RZO/action/author_attestation","sign_citation":"https://pith.science/pith/62VG35O56RI5BUX4ACAY665RZO/action/citation_signature","submit_replication":"https://pith.science/pith/62VG35O56RI5BUX4ACAY665RZO/action/replication_record"}},"created_at":"2026-07-05T11:18:29.582679+00:00","updated_at":"2026-07-05T11:18:29.582679+00:00"}