{"as_of":"2026-08-08T23:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ad62b3442490db40a8705a3e13764941f4ae4aa125e6abf817fd208dd76f0041","coverage":[{"denominator":87,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":87,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:46:10.620146Z","state":"measured"},{"denominator":89,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":89,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-12T08:12:08.041225Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T02:57:34.471405Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2509.00365","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.00365","snapshot_observed_at":"2026-07-03T02:57:34.471405Z","title":null,"venue":null,"work_id":"0f525905-6396-42ad-8284-697ed97cca4b","year":2025},"citing_paper":{"arxiv_id":"2607.02338","last_updated":"2026-07-05T02:09:42Z","snapshot_observed_at":"2026-08-02T19:20:45.091703Z","submitted_at":"2026-07-02T15:44:43Z","title":"HNSW with Accuracy Guarantees Using Graph Spanners","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-03T02:55:42.606201Z"},"links":{"cited_paper":"/paper/2509.00365","citing_paper":"/paper/2607.02338"},"observation_digest":"sha256:bc04c5d40f3310cb7f48a4a612af58ca8c3421fccffe3b4d9f25f0c8fbd2dc4f","observation_id":"528e933d-781c-4dc5-ba2b-f2d6a9172d7c","resolution":{"observed_at":"2026-07-03T02:57:34.473264Z","resolver_source":"arxiv_id","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":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.00365","snapshot_observed_at":"2026-07-12T08:12:08.041225Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.02338","last_updated":"2026-07-05T02:09:42Z","snapshot_observed_at":"2026-08-02T19:20:45.091703Z","submitted_at":"2026-07-02T15:44:43Z","title":"HNSW with Accuracy Guarantees Using Graph Spanners","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-12T08:12:08.041225Z"},"links":{"cited_paper":"/paper/2509.00365","citing_paper":"/paper/2607.02338"},"observation_digest":"sha256:916b9a21b872a6052bbef9e422a10c4530e6c15806e73d226a74ca796369167d","observation_id":"874b3fc3-fd8b-4dd9-8f1e-4e8bedc7b286","resolution":{"observed_at":"2026-07-12T08:12:08.041225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2509.00365/citation-record","integrity":"/paper/2509.00365/integrity","json":"/paper/2509.00365/citation-record.json","paper":"/paper/2509.00365"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:46:04.307825Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:04.307825Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:0e577c3a97ae43396cc65a34e826bf00e47a75c7e3e03c97cc9a08279ec87fc7","observation_id":"3c7a973a-ce41-4a11-9d51-1e7c56ea2ad1","resolution":{"observed_at":"2026-08-05T13:46:04.307825Z","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-05T13:46:04.347877Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:04.347877Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:3c871e88a9304da645edf159668fe572fb3110e7aae320d270e06be32e230797","observation_id":"9b95ae72-61a8-43cb-831f-2ffadb0ada93","resolution":{"observed_at":"2026-08-05T13:46:04.347877Z","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-05T13:46:04.433218Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:04.433218Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:494da494fe40c8b4114726baf2b3a78a6c65aa3013077513eb4ae1d1413d6cbf","observation_id":"957589dc-610f-466b-b117-758c7daf4b05","resolution":{"observed_at":"2026-08-05T13:46:04.433218Z","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-05T13:46:04.492507Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:04.492507Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:4db13e1da2c5b3712e766f74ae3854af540a259df5b244a69edb7cff52bcc3eb","observation_id":"5bb03182-6c2b-42a8-88f0-26091f3e0994","resolution":{"observed_at":"2026-08-05T13:46:04.492507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.06829","last_updated":"2018-04-23T13:13:00Z","snapshot_observed_at":"2026-07-06T06:34:09.942779Z","submitted_at":"2018-04-18T17:28:48Z","title":"HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.06829","snapshot_observed_at":"2026-08-05T13:46:04.558798Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:04.558798Z"},"links":{"cited_paper":"/paper/1804.06829","citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:b726d9fe27eeb606532da6237cc3544d711e78307727de1ac3da4565ea96e620","observation_id":"0de3f1cd-684a-4315-b4d3-7a9464d29f84","resolution":{"observed_at":"2026-08-05T13:46:04.558798Z","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-05T13:46:04.650508Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:04.650508Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:d0b1fa39215139b2732ca1dfb6e0db22012457e09ff984100241db4c26b4fa59","observation_id":"8215daf6-69c0-4882-80a9-8e009261b35b","resolution":{"observed_at":"2026-08-05T13:46:04.650508Z","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-05T13:46:04.718030Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:04.718030Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:93849d7c3f29fdb2bb5cde9f622e327e76be538cd9e8246b3612de620e5c174c","observation_id":"e2bdc65d-9330-42e4-8cdd-354b71651de5","resolution":{"observed_at":"2026-08-05T13:46:04.718030Z","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-05T13:46:04.807293Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:04.807293Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:ec3e5d8b412bb48a218a10128495cabb13a3f9ad83988c12eeb255693ad0290c","observation_id":"9451de8d-76d0-40f0-8a09-78a4b0f92579","resolution":{"observed_at":"2026-08-05T13:46:04.807293Z","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-05T13:46:20.249240Z","title":null,"venue":null,"work_id":"ebea28ca-922b-47cc-aa40-c2869367f2f6","year":1997},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:04.850127Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:f1cad21fadd7e1673e8214d971fcc04df9881edc8bb2939bca332c54a2ad7d7e","observation_id":"d699334a-1540-4158-86a4-64d931e0c575","resolution":{"observed_at":"2026-08-05T13:46:20.301330Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:20.057254Z","title":null,"venue":null,"work_id":"6b2b1107-f486-4288-978a-d8f460fa9d17","year":2019},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:04.929390Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:bc76e3ceef1af59a28a02f9092593dc02e8cd0548ef1fe63bdac1fdc26a81a48","observation_id":"8bd74377-5462-49dc-a272-bf19d2b0193f","resolution":{"observed_at":"2026-08-05T13:46:20.154900Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:19.920049Z","title":null,"venue":null,"work_id":"c2329c5e-7a7f-4c46-8b35-0a8b8ad88915","year":1975},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:04.976088Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:9c4bd27fe272b7e418b837be35e5d2ea9529772c4427d3e1516d5d70c758c8c3","observation_id":"25995c1d-e95d-402c-976b-bed06dfcec3b","resolution":{"observed_at":"2026-08-05T13:46:19.985262Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:19.793719Z","title":null,"venue":null,"work_id":"d57ef27a-df7c-4d61-90f1-fd022d1eb9e8","year":2006},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:05.110406Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:599f9ea4c1efb90fd8531946edee3a0dd3345a6a92ffeaaaa3086f33953ba35c","observation_id":"80a24982-bb2c-4bab-9b1b-1a4951cf4750","resolution":{"observed_at":"2026-08-05T13:46:19.832550Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:19.651550Z","title":null,"venue":null,"work_id":"d6a7f458-8da0-47bb-960f-9b6afe00b5f9","year":2013},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:05.216527Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:b7cf3058649b3c5ea8215c38df63873376e4a20974f9ed14c102c6e5b6d6469e","observation_id":"9fb14ab9-8c05-433d-9762-890ba62c4bfe","resolution":{"observed_at":"2026-08-05T13:46:19.715133Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:05.297877Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:05.297877Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:84ef2785aa2644fb6661292da4cd502431d00fc4bc4840de5b530db9e6a20e37","observation_id":"ed1980ff-6f5d-40a6-a629-6c53ad3c7c1e","resolution":{"observed_at":"2026-08-05T13:46:05.297877Z","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-05T13:46:19.524284Z","title":null,"venue":null,"work_id":"7aec2e4e-2287-4c44-a442-f94e873ea29f","year":2023},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:05.401501Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:e02d6159e8ff4ccf5a3c8b40dee372f59d2d4d40cccf2d5fb1b8fb72a9889d8c","observation_id":"ebb34771-9cf3-40d5-a06e-227940f71cc3","resolution":{"observed_at":"2026-08-05T13:46:19.604264Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:19.362234Z","title":null,"venue":null,"work_id":"77e0e99b-568f-4fc4-a5e5-30cf1ebc9905","year":1997},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:05.448286Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:1bd2261d6ea1d64693b5601a8d87a6ebbbf9a5713f0c13f00f565c29ebea35af","observation_id":"64163857-b3a2-430f-ac8f-290a0be5c3f6","resolution":{"observed_at":"2026-08-05T13:46:19.439476Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:19.208384Z","title":null,"venue":null,"work_id":"cb6b72e3-f58c-4e26-8b40-58248b4f689f","year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:05.496678Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:f8ffd2e6be2c8e4dfaa1500bf44061c90fde55c619ac432c6d0c95d0025728ad","observation_id":"ee4b9f20-2c59-4e31-92e2-d7877d291f8f","resolution":{"observed_at":"2026-08-05T13:46:19.305125Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:19.065737Z","title":null,"venue":null,"work_id":"691c736e-053a-469f-83f4-57c3ca8b7fe1","year":2013},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:05.577151Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:5ee8d94d379ea467a4e1052f7d300311ebff6b70cfd1d83ca01f4b9fe2d671c4","observation_id":"774e91fc-d7f8-4363-9baf-5d0ce35ac9bc","resolution":{"observed_at":"2026-08-05T13:46:19.127869Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:18.922608Z","title":null,"venue":null,"work_id":"75af2865-0259-4034-b565-7eddca79c02a","year":2008},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:05.666971Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:7899fb21874ee3a35425256571670cc40be606dac2a3a92d7f0f5ea7f2a07510","observation_id":"fc88d6e2-4efe-48e9-860b-d908c00f902f","resolution":{"observed_at":"2026-08-05T13:46:18.971649Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:05.735139Z","title":null,"venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:05.735139Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:aefac6718c491cfaca687119148fbd3a0b79fc2e451f18d0722a0172f6378283","observation_id":"92102e62-b19d-43c1-9b3d-23b4ff1be01c","resolution":{"observed_at":"2026-08-05T13:46:05.735139Z","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-05T13:46:18.753975Z","title":null,"venue":null,"work_id":"da21e225-9c93-4a1e-8964-9d352edf0b8a","year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:05.789214Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:9a71004f3c2db2fbeb6a8c98e0fefae7ad39fa46933812fe38356b33b419c21a","observation_id":"672ebb8f-fb72-4f01-9ece-b7f15c9df670","resolution":{"observed_at":"2026-08-05T13:46:18.808507Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:18.633049Z","title":null,"venue":null,"work_id":"524117a7-fdf6-4232-9d1c-c0b8cf661e6e","year":2021},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:05.890007Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:d34ebbd4a00f0583fd7403e3f9d91e916378fb50a169543a6238030ff5abb2e5","observation_id":"2ee98aff-55c5-44a9-87e8-5f24dc972fdb","resolution":{"observed_at":"2026-08-05T13:46:18.678196Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:18.528966Z","title":null,"venue":null,"work_id":"83dada32-1dd3-42a0-98d7-87dfdd28ff7e","year":null},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:05.965749Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:61000c568913df41aa3fb400d7032299944f4ff6b4398fde8330825cb80c91b0","observation_id":"78542470-4692-44a6-b6c9-451ed55bc513","resolution":{"observed_at":"2026-08-05T13:46:18.568868Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:18.295774Z","title":null,"venue":null,"work_id":"2c1f25a4-1925-40e0-b06e-b7595b6952cd","year":1995},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.084231Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:604240b9c69669f9dcb51f11d27f12d5100407d00c2b50300f6f455ee85ae200","observation_id":"0cf09341-6084-43ea-8f7f-cc6239c9156f","resolution":{"observed_at":"2026-08-05T13:46:18.338144Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:18.191712Z","title":null,"venue":null,"work_id":"7dec0b95-7115-4a5d-a1dd-9646bd404d73","year":2021},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.153927Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:d8a212cb3bb99b965abf9e1d05cbb5fac741400b95a311bc05d8f617e204ac7d","observation_id":"480f4218-f66e-46e0-9e8e-3efff0bd67f8","resolution":{"observed_at":"2026-08-05T13:46:18.244383Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:18.099989Z","title":null,"venue":null,"work_id":"fa952084-cba2-422a-b0ed-3f329bc986bb","year":2019},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.233023Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:d0e653a3610a8068f2237c781619200b042beed5cce918987684a0b42ea57abd","observation_id":"2210a215-ed13-4a45-ae8d-e7a5e4877f00","resolution":{"observed_at":"2026-08-05T13:46:18.139793Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:17.970039Z","title":null,"venue":null,"work_id":"d3d89577-8f97-422f-b931-43865b64be78","year":2012},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.322517Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:8e67891854262ff2167d7ab7a74180e327df0b774a570f0d0b7789b021541b6d","observation_id":"90245fc1-84f9-46ae-954d-2bbbdb6b9935","resolution":{"observed_at":"2026-08-05T13:46:18.009586Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:17.901352Z","title":null,"venue":null,"work_id":"39c22fe9-624b-4ad1-a4e0-13602605215f","year":2023},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.401964Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:02e778dc3e5a6c31f380ec0473cf6b17b039770d76e3f3d10b28e6324bbb8f59","observation_id":"1e13e10f-f6f6-476f-ade5-caeab6184243","resolution":{"observed_at":"2026-08-05T13:46:17.930102Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:17.759379Z","title":null,"venue":null,"work_id":"bced70e0-31fa-40cb-8adf-2cedc2592ae7","year":2024},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.481126Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:1fdbd832a70ad383ff2c09021f811777cab9bbe37acb46084b2274d0bea8f7ff","observation_id":"864e4c09-4061-4a8a-a241-d093e6a886a5","resolution":{"observed_at":"2026-08-05T13:46:17.814350Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:06.563264Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.563264Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:174d6318cc91c6af5695513ae3f03c2440efd3fb4d83022ad293ecebbb00cf0b","observation_id":"fee27cf1-2f1c-408b-a688-2c519fbd405d","resolution":{"observed_at":"2026-08-05T13:46:06.563264Z","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-05T13:46:06.628735Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.628735Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:e7adb25ba576c15f266b4bddf71fbd797d481bd58d9407fabf1487129770cb97","observation_id":"aa2fdadc-f9ca-4491-8962-99047a31bd96","resolution":{"observed_at":"2026-08-05T13:46:06.628735Z","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-05T13:46:17.584057Z","title":null,"venue":null,"work_id":"aaf8ff25-fead-41d1-ad59-1c0adf15ab57","year":2023},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.706738Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:c17196a28d332ee40a22f648175459d5a95d8535e0d12ac9ae1fc2e61f267b5c","observation_id":"37ad425f-267b-4cc0-9853-3c53ae13803b","resolution":{"observed_at":"2026-08-05T13:46:17.645428Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:17.432516Z","title":null,"venue":null,"work_id":"eb489d8e-343b-4b15-ab05-9d18d55be767","year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.783560Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:937654627e6f42c8a9da5d48f8b08ebbf27c32e800b4ae8619e9d4d760f3df98","observation_id":"28a36893-eebe-406d-9646-1e400f3c8a6b","resolution":{"observed_at":"2026-08-05T13:46:17.504812Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:17.282182Z","title":null,"venue":null,"work_id":"8b69124a-1998-4765-a0fa-1be842533a54","year":2012},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.874602Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:daac90f68cca6bb1ed47ccc6fc6cfd506772a31acb5d371f4bfee3b183f2a0ee","observation_id":"91a61004-3e56-4889-9a05-720d34c34c68","resolution":{"observed_at":"2026-08-05T13:46:17.352979Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:17.115253Z","title":null,"venue":null,"work_id":"3e5a6df0-d04d-4ce9-ac61-be47c9304be2","year":2023},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.963778Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:a5e9776a6972f4031d9dc472fbce3ab131ec6c9b616a559ff06ca16c2733c0a3","observation_id":"72d0081e-cc43-409c-961d-70b7356e5a45","resolution":{"observed_at":"2026-08-05T13:46:17.199142Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:16.981976Z","title":null,"venue":null,"work_id":"360e1b96-56a8-4944-bdf1-9604c0378ce0","year":2022},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:07.035713Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:3e38c0c45ebf29b39ea58686bdb2f8ca26ecf1e5c4221527994460b5551f7619","observation_id":"d6351cc7-348c-45ce-8dc0-d935b627f37f","resolution":{"observed_at":"2026-08-05T13:46:17.046166Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:16.819693Z","title":null,"venue":null,"work_id":"9ce8dcf2-7281-47a1-97ea-704bf3e24172","year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:07.119221Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:79d138b1c26bcdcab8b834b253ceb6adbc8046457473dc47173db94c9434141e","observation_id":"df7a653a-98b9-4bb5-81c4-f86f2c1ecd22","resolution":{"observed_at":"2026-08-05T13:46:16.890989Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:16.677477Z","title":null,"venue":null,"work_id":"98714ced-3b20-452b-986f-6d41eda4eafd","year":null},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:07.199380Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:217738500b47498a309dddde36eb9c69f0378fa5aae8827ac9a6911080ecfad3","observation_id":"a7a21d0f-c3a9-4572-bd9b-e2c805982963","resolution":{"observed_at":"2026-08-05T13:46:16.749855Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:16.381510Z","title":null,"venue":null,"work_id":"55f6f371-f946-4e66-aef1-70ee89224f76","year":2016},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:07.344698Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:24591cce249e503da9b568b56e3fc2d8566b14c938e4f8f74158832cb8edeb49","observation_id":"60ea46c5-36df-4942-97b1-15f254bf627a","resolution":{"observed_at":"2026-08-05T13:46:16.425966Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:16.232509Z","title":null,"venue":null,"work_id":"1c2f14c9-896e-4434-bb83-afb4d31be91e","year":2015},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:07.455720Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:e038c5da9e69fd74c20e2ba20e04962ad56b0b27895beae6a75e0559ce5b03ea","observation_id":"ac236ebd-a71b-4415-8661-678377a27e8b","resolution":{"observed_at":"2026-08-05T13:46:16.276305Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:16.058016Z","title":null,"venue":null,"work_id":"782c18b4-7bf4-4bc2-9d3e-6d0f99879e82","year":1998},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:07.535368Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:728fff16f9b216761102c92d89bad86b9f5cf0021aebcfdb8b62c254237e5397","observation_id":"f3b07525-f154-4811-afc8-89200a86f70e","resolution":{"observed_at":"2026-08-05T13:46:16.141255Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:15.886907Z","title":null,"venue":null,"work_id":"40d361ca-8ce1-41bc-898b-622aec2bde89","year":2023},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:07.662902Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:d0a2fdf661944360f6b19fa3e4781247d4f7e2cba8380cd923930d76c2af8af1","observation_id":"f0f6a2ea-dc65-4923-8b10-7c4dc60fa69b","resolution":{"observed_at":"2026-08-05T13:46:15.966689Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:07.732134Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:07.732134Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:189aec6010c285139338fdddc752e4116223d80a74034b6209d079f9b81725dc","observation_id":"a73de1ac-b695-4ef0-9e80-df08eaaa8803","resolution":{"observed_at":"2026-08-05T13:46:07.732134Z","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-05T13:46:15.722031Z","title":null,"venue":null,"work_id":"ccff64e5-0f95-4a14-b2eb-fe7fa6c51337","year":null},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:07.807069Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:d989887a38bf8d0d218989467002ec54aea5d1d59ea8aff23e2cccfbc79cdac5","observation_id":"10cd6d69-0f32-4fce-8734-ffe467948f13","resolution":{"observed_at":"2026-08-05T13:46:15.780866Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:07.968951Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:07.968951Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:83dfcc42ea264af98fa187d2c88184b33dc4556ddf20fdd40df325d6626eeaa4","observation_id":"0ec02812-6743-4432-ab0c-112966deb3e6","resolution":{"observed_at":"2026-08-05T13:46:07.968951Z","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-05T13:46:15.399012Z","title":null,"venue":null,"work_id":"7f43b042-7d99-46cd-bfe7-8773e4276594","year":1998},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.030666Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:f581cf228c96f9c171962f18c476d2aa76d29e25f780e540eac42e94a3706413","observation_id":"8b509599-ba4e-4989-b30c-fb84cf7cf6fa","resolution":{"observed_at":"2026-08-05T13:46:15.467576Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:15.576346Z","title":"In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","venue":null,"work_id":"349a3648-0920-413f-b948-27b0a9ac3dd0","year":null},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:07.870243Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:f2183823442812b82114731ed2e1a90588b57b6ee70de5472edfec35c7e8a871","observation_id":"33127d03-d2b8-4edb-8844-bd2690eb52d5","resolution":{"observed_at":"2026-08-05T13:46:15.635791Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:46:15.213827Z","title":null,"venue":null,"work_id":"277f6d72-ac18-4cc5-b511-b847f098c64f","year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.251648Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:da26260f00e6fd8a598eb0b8504966119b44208084d0e76afe836bd9a44291ec","observation_id":"d0ebc700-45f9-4002-935c-171fe1cbf251","resolution":{"observed_at":"2026-08-05T13:46:15.290634Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:15.046379Z","title":null,"venue":null,"work_id":"b5c548cc-fe69-49c0-9777-6e923667aa50","year":2018},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.308316Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:62524d25616bcb3a1c898955d96b52ef67912e6d26c35bb9bc0db96ffb624c06","observation_id":"61b61901-cf70-45ef-a0db-4ed4b466005d","resolution":{"observed_at":"2026-08-05T13:46:15.111944Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:08.129684Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.129684Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:37632412b7533141b657f28ce158c1187656b61ceacca9ad3f8a65c0f5a7e33a","observation_id":"1507cffe-17fa-4ae4-8a6e-c5224822b8ec","resolution":{"observed_at":"2026-08-05T13:46:08.129684Z","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-05T13:46:14.665401Z","title":null,"venue":null,"work_id":"a84fa594-1b1d-4dd3-91e5-0b3dfe4f95d9","year":2024},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.470421Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:1116254e4a47879f83aae45652cc46dd45629b81d31f5302ffb0c577c76879a9","observation_id":"49018196-bac3-4084-91d5-c45a99dd4b40","resolution":{"observed_at":"2026-08-05T13:46:14.732729Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:14.481873Z","title":null,"venue":null,"work_id":"df2f9bea-a79e-4ae4-a370-48327e6f0812","year":2019},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.548573Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:777ee417900d35a6c274ab140323ebfb124847f4e82154117564d44a4c43dd14","observation_id":"801ac953-385d-4a64-982d-3ba8d4942785","resolution":{"observed_at":"2026-08-05T13:46:14.575436Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:14.849665Z","title":null,"venue":null,"work_id":"59b63011-17d1-4974-affd-7ad06f3ef4ef","year":2018},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.389174Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:f6945c5a167887c83e6c8477dddf320295aeda63cbb9a8ec167692491711fc3e","observation_id":"996569fd-390e-488e-9895-33aa48bc2b9e","resolution":{"observed_at":"2026-08-05T13:46:14.935042Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:08.685372Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.685372Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:e814cb242a5562a55f6c5ac982c9b135734be201fdf33bf3a9d4d886322a7fc5","observation_id":"25f8b93d-dead-48a7-8046-24963032c2d2","resolution":{"observed_at":"2026-08-05T13:46:08.685372Z","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-05T13:46:08.794317Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.794317Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:336a002f90918eb40d3df243089fa56e2f9353eaa2ab721a996b5fa788fcaaa5","observation_id":"7de574fa-ff79-4f15-92c6-ba76c6425e7d","resolution":{"observed_at":"2026-08-05T13:46:08.794317Z","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-05T13:46:14.328023Z","title":null,"venue":null,"work_id":"a9f41505-ba29-48b4-9604-fdf7ffade060","year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.583593Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:9d484ad6fdadc89bb3243928c6055486c3098d3ca074e8578afbf6f8c3a775f7","observation_id":"4f16f584-77fc-4be5-8940-8b7f649ec62a","resolution":{"observed_at":"2026-08-05T13:46:14.392641Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:08.901675Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.901675Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:4dae1fbfa40da97e68ce6cd95dc755bf3c5d340fe82ebcc426d609680bca24a8","observation_id":"7c743f4b-5a31-4dcb-b1dd-a0080edb52cd","resolution":{"observed_at":"2026-08-05T13:46:08.901675Z","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-05T13:46:08.965227Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.965227Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:15642a65b2bda242ac2a70010877581f5208104a9b6548308b42fb6cd7f211c2","observation_id":"294826da-20e3-4f02-a40c-e1997385ae11","resolution":{"observed_at":"2026-08-05T13:46:08.965227Z","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-05T13:46:13.958758Z","title":null,"venue":null,"work_id":"5856d399-122e-4674-b192-8efbd832e7cd","year":2019},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.106807Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:1b0a1632517d2794b61d61be7e30a155855dff771a520e68fbe5048c27bf89ba","observation_id":"505810cc-6d6e-41a1-91db-77d99582fc70","resolution":{"observed_at":"2026-08-05T13:46:14.034188Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2411.00970","last_updated":"2024-11-01T18:43:45Z","snapshot_observed_at":"2026-07-06T19:43:50.724897Z","submitted_at":"2024-11-01T18:43:45Z","title":"Incremental IVF Index Maintenance for Streaming Vector Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.00970","snapshot_observed_at":"2026-08-05T13:46:08.856194Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.856194Z"},"links":{"cited_paper":"/paper/2411.00970","citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:5ce29a84640e6286fb0266ec22fa551900175fa1adb979f3fbd5832c03e8cc7c","observation_id":"14109b42-d498-4a2b-afa4-777288c9b9ce","resolution":{"observed_at":"2026-08-05T13:46:08.856194Z","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-05T13:46:13.697725Z","title":null,"venue":null,"work_id":"796cae9b-8f19-4946-9a96-83927c624dbf","year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.236512Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:cba1b5bb18eb456f76113583c18cdee59f44dc2624e7f03d67e88802b15eeffb","observation_id":"9e4638dc-b24e-4fb9-b64b-99af938828f8","resolution":{"observed_at":"2026-08-05T13:46:13.765256Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:13.517016Z","title":null,"venue":null,"work_id":"3b8279e5-5b02-4dc7-8893-9fce41ee5332","year":2021},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.303479Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:d4c14b1c44bf6920aae52e69a55c82d685842421e2197fdbbba1bef35767502a","observation_id":"34a6032f-1f0e-4402-860f-46a6badbdcf1","resolution":{"observed_at":"2026-08-05T13:46:13.580840Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:13.337137Z","title":null,"venue":null,"work_id":"f455f330-1196-40c5-8e3b-a434cddc10cb","year":2019},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.378084Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:33b12399a11999718799ec598102ad8e5a45d82e6ee4fb67d023eb0cc035ba7a","observation_id":"5cdb34a9-c7ee-4f4d-ad60-7f4e7be61039","resolution":{"observed_at":"2026-08-05T13:46:13.435189Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:13.202702Z","title":null,"venue":null,"work_id":"0775f920-abf8-4045-bf2d-27fc49926d70","year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.450850Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:b52bb3e8e1d6a238535993e53f62c00904c1ae1ae3a86ba5fa23c848db1fcf24","observation_id":"fc304991-20a4-4f15-ada4-e090ddbabd29","resolution":{"observed_at":"2026-08-05T13:46:13.261131Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:13.827778Z","title":null,"venue":null,"work_id":"b144a269-fb72-47f6-9815-eba14f90951b","year":2009},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.184397Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:76260178ad3929cc425e46272f9f572211d96ee56add5e760dd892358d7786b7","observation_id":"c6f9d52c-16fc-4172-82c6-facf0184f477","resolution":{"observed_at":"2026-08-05T13:46:13.879925Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:13.038765Z","title":null,"venue":null,"work_id":"6a34f006-2011-4526-ab94-40d0e98be8e6","year":2025},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.589262Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:2132b782ab974c797581e96848fbfaa490244b1979f2c3554d9785236efbaa87","observation_id":"5968d77d-06b0-42da-b47b-c9607a081288","resolution":{"observed_at":"2026-08-05T13:46:13.103241Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:12.907628Z","title":null,"venue":null,"work_id":"987740d4-74ed-4a9f-a01a-0c95a58006d0","year":2008},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.662291Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:79f533235c4bae620079a48cadb0a46a63bd1907453cae8048dd9ceae25af25f","observation_id":"f210cdea-3ec6-4cb5-aa03-62c151cda68f","resolution":{"observed_at":"2026-08-05T13:46:12.942959Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2105.09613","last_updated":"2021-05-20T09:17:13Z","snapshot_observed_at":"2026-08-07T07:51:37.438902Z","submitted_at":"2021-05-20T09:17:13Z","title":"FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.09613","snapshot_observed_at":"2026-08-05T13:46:09.728692Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.728692Z"},"links":{"cited_paper":"/paper/2105.09613","citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:e447b76c0653d7ba714d149f1b434570711436da3ee37616386151f44b2b757f","observation_id":"1f5e1ec6-3812-4339-8dc8-272acadd6b74","resolution":{"observed_at":"2026-08-05T13:46:09.728692Z","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-05T13:46:12.677998Z","title":null,"venue":null,"work_id":"c4783e0a-9a34-4c12-a95a-0e32b5442d20","year":2019},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.799813Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:3e8af62e48efc6062d7a1b4a42ab4eef9cef19be136fc7bcc097a1bb9be1fff9","observation_id":"158e089b-be95-4a3c-8872-922ad254e92d","resolution":{"observed_at":"2026-08-05T13:46:12.823806Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:09.495978Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.495978Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:affaaf561a7f0e28f84a3e5ba70ea703fa510351d80bf64a0a7f73acf8a353e4","observation_id":"de55cf35-650b-4af7-8dce-f68695a5891a","resolution":{"observed_at":"2026-08-05T13:46:09.495978Z","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-05T13:46:12.306106Z","title":null,"venue":null,"work_id":"593b6bdb-e1c3-45a3-96d0-613cf174d84c","year":2010},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.915517Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:2bc69ab6331a914a904d1e11c9974cc43d7fa2809cdcd07ffbca9b7976770ba6","observation_id":"395ad8bb-d7fa-4b09-9b2e-c4d02905e43c","resolution":{"observed_at":"2026-08-05T13:46:12.374086Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:12.127723Z","title":null,"venue":null,"work_id":"67612430-a7bd-4efe-8dec-b3a6eb765d14","year":2023},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.979645Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:23f245d2c5fbaeb65b3cf4c09a96bc942b82c600fb81338d27ece79ad799e9de","observation_id":"8eeb505d-930f-4ecf-9f61-4cb91d06a1f3","resolution":{"observed_at":"2026-08-05T13:46:12.214230Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:11.954619Z","title":null,"venue":null,"work_id":"244c532c-fb52-4675-9993-1a16b4146b9e","year":2021},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:10.036471Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:a71cb86adb2eab2ed81dafbd069e2b4ccbb06d688beca851e901ab73b8791536","observation_id":"99bff3e9-9a20-46ea-b835-b34985901402","resolution":{"observed_at":"2026-08-05T13:46:12.031010Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:11.773901Z","title":null,"venue":null,"work_id":"7c992fcc-4395-4d46-baec-0fb61d23e84c","year":2024},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:10.089266Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:70391c01b4dd7fa0b6fbeac65e9335e85c23762f53a6a21b9e3f439ce2333313","observation_id":"8a6ca84e-4dee-4008-af2d-c6ebcadde7c7","resolution":{"observed_at":"2026-08-05T13:46:11.858513Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:12.487864Z","title":null,"venue":null,"work_id":"b4bfc6a6-17fe-4521-81e2-1ed9145fc87e","year":2014},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.884467Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:7b1b72ceac8027cfb8382d9622c6a16a96d271ce372cfe760f8d7d54a8ad7785","observation_id":"782bcee3-2eef-46bb-b0bd-4bdf7727119c","resolution":{"observed_at":"2026-08-05T13:46:12.574365Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:11.439639Z","title":null,"venue":null,"work_id":"04476176-4bdb-42ca-8c24-8b9beedb080b","year":2021},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:10.187335Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:9c2338d5e62c77186f32647731a6117d5ff3b2eebb7cb00521cf38355d93e4ad","observation_id":"8ff97cb4-0225-4518-a8c3-2d693c5f9421","resolution":{"observed_at":"2026-08-05T13:46:11.493908Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:11.273686Z","title":null,"venue":null,"work_id":"52a188f2-202e-403d-b594-ce9d0ab1d6d9","year":2023},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:10.261512Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:4ecd9c61c13cdf39c84f0979fa1c353e3889437662edd40eb28902095c47bd75","observation_id":"fd49fd7d-b1f0-4150-90d4-63b71c7fe968","resolution":{"observed_at":"2026-08-05T13:46:11.353880Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:11.158531Z","title":null,"venue":null,"work_id":"db04db0b-b041-469d-b02c-fe25bdab699c","year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:10.327950Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:753b3714b924538df3d3cc76be9367efe78aef824293467de0e7cd5375132347","observation_id":"edcf9efd-fd0d-4a66-a6e8-f4115a6827bb","resolution":{"observed_at":"2026-08-05T13:46:11.205132Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:11.011989Z","title":null,"venue":null,"work_id":"60d662d8-c542-48e8-ab57-c251cbd7b673","year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:10.410532Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:711f1a860aa7458c0ddead313c86f0da7cafb2149b1976a3dec3952092baab30","observation_id":"11348cd4-d3a2-4ece-acce-d6fee9220e15","resolution":{"observed_at":"2026-08-05T13:46:11.081942Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:11.595688Z","title":null,"venue":null,"work_id":"fdbd140e-302d-4200-9f3d-052dd9143ab5","year":2021},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:10.152630Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:89b4bd416916f7eb535770fbbb9da67bd3d72da24929807a2739f955af976a48","observation_id":"1bb1901d-6240-49f3-96a0-48fc4083cd9e","resolution":{"observed_at":"2026-08-05T13:46:11.668176Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2503.17911","last_updated":"2025-07-15T11:31:14Z","snapshot_observed_at":"2026-08-07T16:43:43.965224Z","submitted_at":"2025-03-23T03:16:50Z","title":"VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.17911","snapshot_observed_at":"2026-08-05T13:46:10.548090Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:10.548090Z"},"links":{"cited_paper":"/paper/2503.17911","citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:8f3f791b054e0dedaa1bbaccdc077f6ae4145804a941921983746a3cb07f9a96","observation_id":"98091dd6-a7d9-4812-8c69-c0a371903816","resolution":{"observed_at":"2026-08-05T13:46:10.548090Z","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-05T13:46:10.748588Z","title":null,"venue":null,"work_id":"6e8314f0-d0d0-4c8a-829d-e921a3df6cd2","year":2019},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:10.620146Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:55ca83d89d0260735361625c218c9406b9c5f7253aa73ba6a86563e3ee2fa91f","observation_id":"a3ae268b-ad0c-4ce7-ab08-95d5587eca71","resolution":{"observed_at":"2026-08-05T13:46:10.795162Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:10.864303Z","title":null,"venue":null,"work_id":"0c393f20-37b7-474d-8bc9-79831cb29964","year":2020},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:10.482429Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:2e7d4d858123466f9bc44bc497b880a55a28bcb6ef4d75607224bd907b5bd41f","observation_id":"a7fd59bd-58f8-4885-893a-1495b21f3d6d","resolution":{"observed_at":"2026-08-05T13:46:10.908466Z","resolver_source":"raw_fallback","status":"unresolved"},"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-05T13:46:08.746615Z","title":"Information Systems 45 (2014), 61–68","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:08.746615Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:2467ac81c1e5a9828cf1adc3075fedc615936997ae29fc1159015690eb449cc0","observation_id":"3ee63861-f99d-4222-950e-30cb60127dc8","resolution":{"observed_at":"2026-08-05T13:46:08.746615Z","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-05T13:46:14.104967Z","title":"Pattern Recognition 96 (2019), 106970","venue":null,"work_id":"265aff81-1fe8-40d8-85dd-6971d148248b","year":2019},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:09.042442Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:68b2fc73a510d43ffcd4167fc9f2bd000fbeecc25460d60597c3a77abfd68864","observation_id":"525fe1c4-ba48-49b1-b7e3-abf7498c0850","resolution":{"observed_at":"2026-08-05T13:46:14.193313Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:46:16.533572Z","title":"In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","venue":null,"work_id":"fa331976-ae29-4366-ae4b-0ba9ff4e927a","year":null},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:07.268991Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:7cc50d934a04598df18d34d1f4e192a892a512221b09aceda45a5ec42286b75f","observation_id":"e2485031-212f-4387-8af6-a2b377ad07da","resolution":{"observed_at":"2026-08-05T13:46:16.605317Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T13:46:18.405138Z","title":"ACM Transactions on Information Systems 41, 1 (2023), 1–27","venue":null,"work_id":"3a3bc689-b420-44a5-9ab6-a307c2151085","year":2023},"citing_paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-05T13:46:06.010630Z"},"links":{"citing_paper":"/paper/2509.00365"},"observation_digest":"sha256:24264973547d0897ede003f884983dca11e5382c47ddf79d777f2503ab2173e6","observation_id":"5fc6d21f-7521-4bd8-8692-fee0f66a6022","resolution":{"observed_at":"2026-08-05T13:46:18.445007Z","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"}}],"paper":{"arxiv_id":"2509.00365","last_updated":"2025-08-30T05:27:09Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-07T07:52:05.028059Z","submitted_at":"2025-08-30T05:27:09Z","title":"CRouting: Reducing Expensive Distance Calls in Graph-Based Approximate Nearest Neighbor Search"},"reference_resolution":{"displayed":87,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":83,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":87},"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 87 of 87 outbound references and 2 inbound Pith citation observations for arXiv:2509.00365."}