{"as_of":"2026-08-04T10:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c97bd4de109350db7a1518b69235ea43b045abaea5d09262037e343914c24395","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T08:30:35.893983Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+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/2606.03129/citation-record","integrity":"/paper/2606.03129/integrity","json":"/paper/2606.03129/citation-record.json","paper":"/paper/2606.03129"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.16071","last_updated":"2021-03-31T14:33:30Z","snapshot_observed_at":"2026-07-06T10:54:42.710591Z","submitted_at":"2021-03-30T04:39:46Z","title":"Approximate Nearest-Neighbor Search for Line Segments","version":2},"cited_work":{"arxiv_id":"2103.16071","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.16071","snapshot_observed_at":"2026-07-02T05:16:38.739375Z","title":null,"venue":null,"work_id":"c11f31de-d6b9-47d1-bcc0-dc11ba8d17cd","year":2021},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"cited_paper":"/paper/2103.16071","citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:88cbe45b196efd20695648973a85f518f78a204537830100e9ff743df99b44c7","observation_id":"40b736b2-e8e1-4c94-a80d-23448daae18d","resolution":{"observed_at":"2026-07-02T05:16:38.741014Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:a0b85b432fdf59518e614e3a579a48bd6ee85bf7b10cb07b0315cc29c87124ff","observation_id":"83b42418-5923-4f56-9f49-8494ea04d0b7","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":"In Pro- ceedings of the sixth annual symposium on Computational geometry","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:127756d8652003c4d29a8924b24b0423fc35430ee72af5aba1166fba8e46e680","observation_id":"63317312-2628-4254-bfd0-897f0f4d2ab5","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:7d086b62ff2be0bdbbcfced6697f22e69ffc8edcb37aef1cb0a1520502eb35d3","observation_id":"94a5f9c8-ecad-4b2c-ba5a-f96dcccbcfda","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:dfd30bf6b60fe44cfc49f4a15d7247679b70ac935ae947f0811b86433226579a","observation_id":"e2ad70a5-936a-491e-b312-f17ae6ddfe0b","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:7eb0f95941970baa0b6284fd5f9e03b907872f83a76be189c7fa20d5f3965354","observation_id":"60495f29-c619-468d-b956-ba6ba48df159","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:cd6ce451b3de4e979c06693ba7ecb242e3c2e4a0c098df4bbb48d2438dc05495","observation_id":"22e0df8b-b160-4b65-8add-77e0d3648ce1","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":"Blelloch, Jeremy T","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:008ba155f6257fc40d695026d6b72320f6b11fc9ef218d25de1b89297f6eb1e6","observation_id":"8686e288-38cc-4088-ad7c-d0b4b739e418","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":"Blumofe and Charles E","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:29cfac1410af311e6e41feb9eac31133c37f17c9f82eb24f4fae78fc68cb7177","observation_id":"11e344e6-6fc2-433e-92b1-9c0fe66d48d5","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:ee59c78ff7517c074853fe0015978eef8f38a09d4e49cae9735f7d54fba71d7f","observation_id":"49c66a90-3850-46df-a9aa-a6b009fa16b1","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:72dd86976ad8cc1b11f0c40d032b75f3dd7a576ac273440efc5db879cdcc2715","observation_id":"43ee3d8d-e528-4012-a5aa-76172ab4f690","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:c3dd33038d57065b5cb2ea1c4a4d478a070e5474a581b148f32528b85cd87e66","observation_id":"3d54c76a-18f1-425b-a5a9-f3c009652ee0","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:e7544c9f3da6bbc08370c8553b3f416b49acb6214ded1969f339f359b23ccd9f","observation_id":"197cb558-11b1-4373-99f4-92847814d5ef","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":"Cormen, Charles E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:202f775b1cbe65af39abb9358fd9aa6c93ff6da90733cf4b9221fbe89c79166b","observation_id":"2293c6b6-cddf-4a1c-a431-549c9a482573","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":"MIT Press","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:54da0fa555f10b769afc5a765330cc743d461aeda9822f4de51a5cdc8bac7fb7","observation_id":"80b1a4d1-bb73-43c0-a0bd-30ba6cd17a2e","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:1797451c4296f91584c9d2c515cbca4734267f8c08c46baf7ac4ab9e8862e7e9","observation_id":"93d3a4c7-f17d-47c3-9b58-ae36080489d7","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.10078","last_updated":"2023-04-20T04:10:38Z","snapshot_observed_at":"2026-07-06T15:17:48.587665Z","submitted_at":"2023-04-20T04:10:38Z","title":"High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems","version":1},"cited_work":{"arxiv_id":"2304.10078","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.10078","snapshot_observed_at":"2026-07-02T05:16:38.736830Z","title":null,"venue":null,"work_id":"0a3188da-eb43-4347-8e6b-87e3483dedb5","year":2023},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"cited_paper":"/paper/2304.10078","citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:80161fdc246fe812691d2be26d5e5334881b5a4282c60ab506457cb4265ffebc","observation_id":"16de18cf-edff-4090-97a4-0b7c20823b6d","resolution":{"observed_at":"2026-07-02T05:16:38.738242Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.15478","last_updated":"2024-03-04T14:07:14Z","snapshot_observed_at":"2026-07-06T12:13:42.924970Z","submitted_at":"2021-11-30T15:14:07Z","title":"A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree","version":5},"cited_work":{"arxiv_id":"2111.15478","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2111.15478","snapshot_observed_at":"2026-07-02T05:16:38.734218Z","title":null,"venue":null,"work_id":"f10373c8-0619-409a-9648-07d3f158f226","year":2021},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"cited_paper":"/paper/2111.15478","citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:3dac278433e2429a3145090791bb332dd235fa1d78806a36017f2c4232d86aea","observation_id":"7d8b4361-2243-4bb8-8ab0-5a9ca48a97c2","resolution":{"observed_at":"2026-07-02T05:16:38.735696Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:93849f18165c652b5be71a3c62ac9f2f6981dd646198cc04b73809f48d468181","observation_id":"2891cf04-a836-4ff3-b595-b00b172ea666","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:a656c446e37eef61b80fed8cf3595fdc36fc8ff64e4753a32f72c79dd7ecb0d8","observation_id":"23f4f480-26d8-4516-9839-3c51f24b0d16","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:3992a69fd676116ddeb1ef035981c6a57fb2f7a2cdfe7df5e50e02e3dae05be1","observation_id":"7dfd5861-6404-481e-810e-dde5af6294c2","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:96dc6347c54aac520d7c9f81a7f4a43cf3c1a193eb1e92abd4ad986f6f81862b","observation_id":"cf1cd912-13cf-4ad4-b2dc-fd1d6de2a24f","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:12bd2c865f18024f983509784ec582208a7cb35071997d9b0084ca87584b06ce","observation_id":"ca7301f3-2d59-45d4-a45e-10a0c539db43","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:ccddedf8f2a0efd106587700e9332a5222bef11e321d9a0d376a1d1f74c5f3e5","observation_id":"52b82399-1176-4897-8563-0b8f133bcb49","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":"Blelloch","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:acd480bac6ba09599645e18d10a38b7046c5240d487aa9a79f9c7630d630e9c8","observation_id":"6441f020-78f0-44b5-9322-5de731dc6064","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:be09fbaaf3e05ac694028be799aab3cb8b1a83d65be76dfd8f70be7aa4b10714","observation_id":"883b2e34-ec69-4847-9f84-851d62e24f85","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:8bc14932713beaa1d32f3ed513c6f0c28048cd827d7984f6e44256db0e3dc7c8","observation_id":"0439b2a6-cf17-41f7-9471-ab644e3fc358","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:8ea093550238d5090afc35a5a9846fecefdb862ba5e8152dde410b3f3ba73ba9","observation_id":"da1b401e-b86b-4dde-b0b9-8e73e6968a05","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:b918b47717c871bb27d849ed5d66c9615a0f885c67784fd0e97a0ed582dbe8eb","observation_id":"6e3b5173-c509-4565-aefe-c28ac93ee7aa","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:5fade1b86e3f958d7ea2f0b5e78917b728bc08cb7a0e324281b24417675f50c9","observation_id":"88fa7a59-e819-4f54-85af-1182a921f964","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:c89a92d650df6753ea270d8d57e6fc8e6dc452144744cdf1582f1709b855848d","observation_id":"0f14efb3-c7c0-40a4-b8ce-feb55ba89b40","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:ba54836ad613af780dae23fb1fc4054a3d6c9cff18be465115e89dc14517a12d","observation_id":"b10b39cb-d978-42ba-911c-f121f0f3f088","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:430dc1a4e5e2121efd33bf7974f2860a31120375c77384b854685e17d9528499","observation_id":"c435bfa4-4391-446b-849b-419fd7bb4286","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":"Wierzchoń","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:c31476073a5237f8397409455b754a612698aee77188f8fca10ac8241909aa8b","observation_id":"f85f8ca5-f64e-4af0-b485-c14ee4201a14","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:10b9dce6e7c2cb94ba5808b29352a473582ea06e1efa07de5b1323e2ee62d908","observation_id":"a26274b7-c4d7-41b5-bb64-7af6dc83a558","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:0d38b9c157e9707b8f1285d9cc835e79e77abe00ce765d64800deede8768403d","observation_id":"5b2e1295-3948-44ad-abd2-a1cc47176b87","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:4adcf71e8503d0fe1b7b6c68d24407aad5f4d5ffa6b44e1506a4d8f2813f7c21","observation_id":"7468c604-8a54-4e3e-9ee8-d2fa0eb2496c","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:02403df998510bf510d7023896fe5a2fc277c30a7885529026b6a0819e508e02","observation_id":"ffd2cdef-f4ae-4c7f-967e-538ff4b6edd0","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":"2003.Efficient algorithms for new computational models","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:1cab685657e203c55c488ce12bca6d90d9c3874439f46e58dca2a78a8a899eb5","observation_id":"9db293f4-f8b5-435d-bf9a-f3873ae3c482","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":"Sebastian and Benjamin B","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:072da9687c555fd94d8826c37fdc5465c5c5412850c1d6e75c7876e17d98cee0","observation_id":"0d42e61c-0f31-43af-9e13-690200c5363d","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:6b432789c2d5a10e0dd9ba6881fb3353a7077772ae6b134d5eede5ca3bcb448f","observation_id":"2ef3472b-23af-49d7-8123-b02bdaedd5a6","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":"Tenenbaum, Vin de Silva, and John C","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:52701b1cae0da25a688acaaecde1757e35a5a87eb852055a8e991db0c4d8afe3","observation_id":"26294974-9c57-41ff-b2d3-ec76bfa15634","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:b2af83eb77de7a1a0332e9883c95434704c9f0b1c9ccf1600b3e6559484c5146","observation_id":"d1a654b9-e0a6-433a-911f-90e5f9150a6b","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","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-06-28T08:30:35.893983Z","title":"WLOG, we assume | 𝑃1| = 𝑚 ≤ 𝑛 = | 𝑃2|","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-28T08:30:35.893983Z"},"links":{"citing_paper":"/paper/2606.03129"},"observation_digest":"sha256:55e45a1bfa1d5f77e9bd40a65a1fbffa2d229e5266d9144b3e4d4654c2f86637","observation_id":"6c1aaf05-8bc3-4384-a6a2-ab019654ffd9","resolution":{"observed_at":"2026-06-28T08:30:35.893983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.03129","last_updated":"2026-06-02T04:15:35Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-01T23:11:40.118249Z","submitted_at":"2026-06-02T04:15:35Z","title":"Parallel Metric Skiplists and Nearest Neighbor Search"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":44},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2606.03129."}