{"as_of":"2026-08-08T09:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9374c2442bfc78016f1e496135e5721ad6f74bddf7a5d954200a1023eb806162","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:44:11.207176Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.07571/citation-record","integrity":"/paper/2506.07571/integrity","json":"/paper/2506.07571/citation-record.json","paper":"/paper/2506.07571"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0925-7721(95)00005-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:13.688895Z","title":"Agarwal, Matthew J","venue":null,"work_id":"bdbe97f9-9524-421f-a4a7-27de84c37e50","year":1995},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:06.825237Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:83bf115c6cc33c966e1a42b249e2d3e22dcc5f7c2e4ddb8557db6b72a0b1be52","observation_id":"84fa77a8-aa0a-4c5b-bd14-6d565dd17cc6","resolution":{"observed_at":"2026-08-07T05:44:13.803065Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:06.968449Z","title":"Improved bounds for the union of locally fat objects in the plane","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:06.968449Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:8a4f878f1160e42b9ac3e86c63b801645d51331e59c936f6904e134cb2116f64","observation_id":"f91b5fd4-e03a-4fab-a131-2f49d4bdd6c3","resolution":{"observed_at":"2026-08-07T05:44:06.968449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0279.22030","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:15.686574Z","title":null,"venue":null,"work_id":"8a10715f-b2af-4e40-8f9a-fead7fd0dd3d","year":1995},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:07.087639Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:ef8defb2c9dc438451a474309898807d9cee508f5df372167686c3e38bad7f9c","observation_id":"7c8601b9-4e42-40e9-ad32-08bbd2034d3f","resolution":{"observed_at":"2026-08-07T05:44:15.819959Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:07.228243Z","title":"Shortest paths in intersection graphs of unit disks","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:07.228243Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:b140c31438b4805629c7dfa973c48d7aa636b4f78fd91f7bf516f8f78cde5eee","observation_id":"8c0f48d1-dfa8-4663-887b-0a7ebae90ce0","resolution":{"observed_at":"2026-08-07T05:44:07.228243Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:07.404092Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:07.404092Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:0bc4456a16fc23d14dfa24da1af0ba470462c853f3f66501c1547fb29fdc8751","observation_id":"1fbf9f47-3112-4ccc-aded-dbe101e7e506","resolution":{"observed_at":"2026-08-07T05:44:07.404092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:07.565406Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:07.565406Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:92e4f4b3366d1164958cec4753ee114f77ca411d2c1385b850683db72ba0bb21","observation_id":"bd3ea6ed-fc92-4085-8cec-b31e9ba38dfb","resolution":{"observed_at":"2026-08-07T05:44:07.565406Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00454-016-9785-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:13.424263Z","title":null,"venue":null,"work_id":"6f76e2bf-cc0b-4a45-a2ee-aca459484ad6","year":2016},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:07.686171Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:68a37b72feaf7936dbc2ed8847283de30e43f78b50da7ca571c0e2ba15ea9621","observation_id":"a2625332-c3b1-4e3f-849f-b1b821ee661d","resolution":{"observed_at":"2026-08-07T05:44:13.556036Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:07.811580Z","title":"Chan and Zhengcheng Huang","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:07.811580Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:d28c9b08646811debb29ae8709181e26fbcea945db26cf223c5c70f510f19673","observation_id":"50ab4bfe-faa9-4ed9-8089-032a1aba7c82","resolution":{"observed_at":"2026-08-07T05:44:07.811580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:07.952589Z","title":"Chan and Dimitrios Skrepetos","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:07.952589Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:162802f9543b6da1209616503562eb72693c19d4c349368e049ebdb9aebbfabc","observation_id":"08e84b1e-261b-4387-8ebd-a0fc927eda9e","resolution":{"observed_at":"2026-08-07T05:44:07.952589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:08.100197Z","title":"Chan and Dimitrios Skrepetos","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:08.100197Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:e299ade2e99400798899fd35f93f8f80181cb866963f489930194cca66f4a31e","observation_id":"183c29d9-3fc8-46d7-a717-82daa1b295da","resolution":{"observed_at":"2026-08-07T05:44:08.100197Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0221041","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:13.108588Z","title":"An optimal algorithm for intersecting three-dimensional convex polyhedra","venue":null,"work_id":"9897a69e-78ab-4f4c-93a6-9f55f635dcee","year":1992},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:08.258372Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:c1f0dd2e18685dcc30f4a17ce8aa583e31d9f9cda26166127261031880be9a78","observation_id":"07adc9bd-a4a6-4aed-8da1-cd7e8109ad68","resolution":{"observed_at":"2026-08-07T05:44:13.256858Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7508.14751","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:15.309941Z","title":"An optimal algorithm for intersecting line segments in the plane","venue":null,"work_id":"65e2bb48-360d-4774-a69a-1c1e8ed4beda","year":1992},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:08.392493Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:0391f6c35e00efb8a336adea43d2e4e108192febfb80d805b70d6f46fb0a8638","observation_id":"1838a3f1-57cb-4a80-9089-4123aeb28da6","resolution":{"observed_at":"2026-08-07T05:44:15.419898Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:08.526032Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:08.526032Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:8110dbc01afcb90b6b9e1725bb1fd45c54ef9f0f786f9643088b1c44659f3d35","observation_id":"5415914f-a661-4e55-ac2e-50916ac0eeab","resolution":{"observed_at":"2026-08-07T05:44:08.526032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:16.259121Z","title":"Cormen, Charles E","venue":null,"work_id":"45048972-1ee6-4a48-95c1-e7bbed26f08b","year":2009},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:08.687970Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:c24198852d3daadbd4b92d97b638ad93270f568c42c5552c930c8eac04a3d097","observation_id":"61f9b01e-1a76-463e-8c6e-3ee55e517eef","resolution":{"observed_at":"2026-08-07T05:44:16.392239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:08.835613Z","title":"van Kreveld, and Mark H","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:08.835613Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:a946bd5bb5676ef51964ff51b71fc3938ab3539d312ec05a841a9afb70393d65","observation_id":"fa07d1b5-bf5c-4765-8da4-055a82c69a01","resolution":{"observed_at":"2026-08-07T05:44:08.835613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:08.988182Z","title":"Algorithms in Combinatorial Geometry , volume 10 of EATCS Monographs on Theoretical Computer Science","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:08.988182Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:d733988fa4a37b78c6cee42b9d0d019b4c78c08f32399529c3b1b70e48dca942","observation_id":"068b2e24-2de6-4c3a-921b-fb5a7f659eef","resolution":{"observed_at":"2026-08-07T05:44:08.988182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:09.149680Z","title":"Guibas, and Jorge Stolfi","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:09.149680Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:cd7f62165e23efe622a7ad7b0a283e3e084c96e798b2e22fb5beb9ccaa5c5dc2","observation_id":"242f80b2-6a9c-4dbe-91ef-618415f3971b","resolution":{"observed_at":"2026-08-07T05:44:09.149680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-001-0016-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:12.789145Z","title":null,"venue":null,"work_id":"48a88541-cec7-4e5b-80f0-75eceaa6753a","year":2001},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:09.267608Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:88b9544e948d6cdb7e0ccd133d40bb7fdca019658a8fd3632641d1911279e14f","observation_id":"d7897ecb-4296-4bb6-9ddd-0669d4561aba","resolution":{"observed_at":"2026-08-07T05:44:12.935379Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1142/s0218195908002568","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:12.550838Z","title":"Goodrich, and Jonathan Z","venue":null,"work_id":"1833fecc-e025-40e3-980a-9e900d3212b6","year":2008},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:09.403687Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:cb15a3d49251dde7d1d995f0de05768c89b6f64e893802e4754f2f2bdef6d3b6","observation_id":"4368f696-99ee-4229-b511-93b1db0dabc3","resolution":{"observed_at":"2026-08-07T05:44:12.664874Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:09.550357Z","title":"New lower bounds for H opcroft's problem","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:09.550357Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:51f3e7ddc0d2a37b7b40a48a0c2646a8c0b81ef3c390093e20b9d885f94b9815","observation_id":"36ae5a55-d2a7-481d-8857-b4354d9d9013","resolution":{"observed_at":"2026-08-07T05:44:09.550357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:09.658298Z","title":"A sweepline algorithm for V oronoi diagrams","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:09.658298Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:f1a04c29cf89d85bb561b4c8a0f02274a9d53ad953b99a0a5d73178a46ba3a0e","observation_id":"b1748580-c080-433c-954d-c2bba35e2596","resolution":{"observed_at":"2026-08-07T05:44:09.658298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"portal/3256691","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:14.972982Z","title":"Algorithms for Fat Objects: Decompositions and Applications","venue":null,"work_id":"6bdbd628-2ec6-488e-ba0d-6b277cb2ab41","year":2008},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:09.801274Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:f9aa81bc0f66fdbea2086a882bfddc5d27fac26cbbaf9bf85af026333f347282","observation_id":"45b80c4b-b1a8-4f4f-b354-57ae910b7ee3","resolution":{"observed_at":"2026-08-07T05:44:15.058061Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2918.28292","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:14.614525Z","title":"Guibas and Jorge Stolfi","venue":null,"work_id":"19154664-1a3e-453d-b112-f1a9814f7926","year":1985},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:09.923083Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:97a5831a9239fe10624c6ec0a608ebc083139bfebf5a313e9d1f0b707280a00a","observation_id":"0f55125f-0262-4b58-886b-bfa5fdf1302f","resolution":{"observed_at":"2026-08-07T05:44:14.752645Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:10.032920Z","title":"Geometric approximation algorithms , volume 173 of Mathematical Surveys and Monographs","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:10.032920Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:28a562a7256c6046f1d5d13047e8690e816d6dbb64a8a618e53f3f744e76c79b","observation_id":"b6f89802-98d7-4215-afa6-49bbc9030e86","resolution":{"observed_at":"2026-08-07T05:44:10.032920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00454-020-00243-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:12.195482Z","title":"Dynamic planar V oronoi diagrams for general distance functions and their algorithmic applications","venue":null,"work_id":"7bd19956-a4d2-4f83-af1a-20a6363c14e3","year":2020},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:10.272158Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:d8102e23cb6c480d63d2708311fb14ab308fef5422cfedb01a04d655ee41689e","observation_id":"442d95de-335f-4814-af6b-edca75d458c1","resolution":{"observed_at":"2026-08-07T05:44:12.386310Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sfcs.1979.15","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:11.963866Z","title":"Kirkpatrick","venue":null,"work_id":"32c1c19b-ab77-4cb5-b98b-fbf35e97ce88","year":1979},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:10.399573Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:dffbae5e0895a744289a88cd13cdee34ad208d1b095fa3d39604dc112c9a0bfb","observation_id":"619d5d8a-7bcf-4719-8939-6f21dae69f95","resolution":{"observed_at":"2026-08-07T05:44:12.083674Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:10.561189Z","title":"An algorithmic framework for the single source shortest path problem with applications to disk graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:10.561189Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:cf6fe3ce471943cd9ededcac7046af413c69d37e8c0a8869fe10230d7ce24736","observation_id":"8417575b-c0eb-4e3c-903c-59519335ee2d","resolution":{"observed_at":"2026-08-07T05:44:10.561189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/20m1388371","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:11.630881Z","title":"Nearly optimal planar k nearest neighbors queries under general distance functions","venue":null,"work_id":"42d9f854-3c6e-40ce-a08b-b31bfdb7ba96","year":2022},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:10.682282Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:188f46623529c51285b37002a75ec3f3a18654246ac0171caf114ff2a62b2210","observation_id":"4bdf2cbf-dd00-412b-9a83-4293236c7110","resolution":{"observed_at":"2026-08-07T05:44:11.772249Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:15.989463Z","title":"Lectures on Discrete Geometry , volume 212 of Graduate Texts in Mathematics","venue":null,"work_id":"1e0d88c1-d4c4-4a00-90df-4883648e4f81","year":2002},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:10.787742Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:228fe6584e7813ac3ea5821fc8947a02bf635c77ef41f6af8a8cbddc2a10a1a7","observation_id":"d9d1b702-816c-4539-9353-931554448aaf","resolution":{"observed_at":"2026-08-07T05:44:16.110673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2782.10278","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:14.129783Z","title":"A fast planar partition algorithm, II","venue":null,"work_id":"7bc35a0a-67c4-44b4-8591-ad02e0fffae2","year":1991},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:10.933098Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:ce427d457cc2171eb09ddfb07372f733c8212e2294a5e1d732b144e9cdb53a1c","observation_id":"45fac9b7-4e6e-4045-a7fd-595fa0f9d5fe","resolution":{"observed_at":"2026-08-07T05:44:14.278358Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-009-9322-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:11.332174Z","title":"On bounded leg shortest paths problems","venue":null,"work_id":"559fe4cd-d437-427f-8297-29cf5890e30a","year":2011},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:11.064471Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:dd4e18e3914705cb0f3fa16c128f5169525aa241776bc8fe35898278df4c02e7","observation_id":"06c90625-3aa6-47c6-8899-9c8605d92357","resolution":{"observed_at":"2026-08-07T05:44:11.498819Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:44:11.207176Z","title":"Willard and George S","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T05:44:11.207176Z"},"links":{"citing_paper":"/paper/2506.07571"},"observation_digest":"sha256:b52989b9374195eaa489808e9c6a8b63e67ab15e71dd44d4cecece1fb637bceb","observation_id":"39a418fe-eba0-4e6d-bd1b-6042eaf224f9","resolution":{"observed_at":"2026-08-07T05:44:11.207176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.07571","last_updated":"2025-06-09T09:14:34Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-07T05:28:08.987228Z","submitted_at":"2025-06-09T09:14:34Z","title":"An $O(n\\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":16,"verified_exact":10,"verified_fuzzy":2},"total_outbound_references":32},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 0 inbound Pith citation observations for arXiv:2506.07571."}