{"as_of":"2026-08-10T22:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1cf0260369f6ebc4d9a8c17e6458b91c1152db640e1c101e6817e0983296c059","coverage":[{"denominator":97,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":97,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T05:11:48.367705Z","state":"measured"},{"denominator":97,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":97,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.05750/citation-record","integrity":"/paper/2509.05750/integrity","json":"/paper/2509.05750/citation-record.json","paper":"/paper/2509.05750"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:11:48.090180Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.090180Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:dc47cf6f9a3bf7b0004edd3c0127dff389e67988c2ddcc2a4c6770abe060fd16","observation_id":"489e724e-3b75-4af9-adf6-92be63271731","resolution":{"observed_at":"2026-08-05T05:11:48.090180Z","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-05T05:11:48.094913Z","title":"https://github.com/nmslib/hnswlib, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.094913Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:378d5935c3dab759bbe0b9f36613cfed39559cf3c0d0ca8ac9ea0593a995c3d5","observation_id":"0dcc6648-f330-4695-8de5-81401933f663","resolution":{"observed_at":"2026-08-05T05:11:48.094913Z","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-05T05:11:48.098206Z","title":"https://github.com/scalablesimilaritysearch/ELPIS, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.098206Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:656bdc8110f6942d64f0ed79230cabce068fc772c43e658df113d0578b41a29c","observation_id":"76b84346-5948-4223-bb8a-6bdb14ad3d40","resolution":{"observed_at":"2026-08-05T05:11:48.098206Z","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-05T05:11:48.101592Z","title":"https://github.com/iliasazizi/GVS, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.101592Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:7cc163e8124f5ee44d55a273112052829b8fd7823403fb06ea84a040a39375e2","observation_id":"e6ab047f-7221-4f99-899b-7bfe4cda5d28","resolution":{"observed_at":"2026-08-05T05:11:48.101592Z","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":"2021.10180","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T05:11:48.640696Z","title":"and Ceccarello, M","venue":null,"work_id":"9d6b6377-54e3-44f8-afe8-8468da2d80fb","year":2021},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.105011Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:07a2cf4b8eb1c6218bec0f8eafa98ca3df3b0759331b750865f74cf34d1e898d","observation_id":"8a02f68c-d7a6-4202-b3fa-5961f0a55ea8","resolution":{"observed_at":"2026-08-05T05:11:48.647221Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.108142Z","title":"Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.108142Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:5234772edc68b285006ca74c40a63fbaddf83920b1ace13290156309806be1c2","observation_id":"136f272f-9879-479b-a8cb-5aaf534e66b1","resolution":{"observed_at":"2026-08-05T05:11:48.108142Z","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-05T05:11:48.111478Z","title":"Voronoi diagrams and Delaunay triangulations","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.111478Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:32061446fcba1ee321622639693afac6fb02441f9cabc8dbcd4739ae0ee70436","observation_id":"6ac2eb21-e701-4373-b773-454c237cc7aa","resolution":{"observed_at":"2026-08-05T05:11:48.111478Z","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-05T05:11:48.114887Z","title":"Elpis: Graph-based similarity search for scalable data science","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.114887Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:c87e6d262b278816810e03124d471690e4f44debfb52ec9aa9a2f0c78857fe5b","observation_id":"797d7af7-ff63-4449-903f-82c57a0e1089","resolution":{"observed_at":"2026-08-05T05:11:48.114887Z","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-05T05:11:48.117722Z","title":"Graph-based vector search: An experimental evaluation of the state-of-the-art","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.117722Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:6ceb27fa126bb8444c549686b69a64b15f79611fa55074dc4f0cacdc94d9b314","observation_id":"8fcac87c-b202-4628-9e05-7901c1e1e833","resolution":{"observed_at":"2026-08-05T05:11:48.117722Z","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-05T05:11:48.121223Z","title":"and Lempitsky, V","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.121223Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:b9441c67c384388d56a4f024ef25d6a3be6c0771774be6547534d6364080ee41","observation_id":"bf559b2f-0833-4599-94ef-8c04529d676f","resolution":{"observed_at":"2026-08-05T05:11:48.121223Z","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-05T05:11:48.124884Z","title":"and Babenko, A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.124884Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:8228ea580deb900677eddcdd987275eaed732cc237cc2f97ac2bccc265e846be","observation_id":"7c23ce53-226c-487b-b92e-cc8d3d8a776d","resolution":{"observed_at":"2026-08-05T05:11:48.124884Z","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-05T05:11:48.128167Z","title":"Voronet: A scalable object network based on voronoi tessellations","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.128167Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:6615f88a4dce2312e96cb0ad3cbf43cbf9c6070913ec6aee1bbf8528b47042d8","observation_id":"b2783a54-669c-41d7-8c20-9ac1f9a5b8c0","resolution":{"observed_at":"2026-08-05T05:11:48.128167Z","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-05T05:11:48.131038Z","title":"Peer to peer multidimensional overlays: Approximating complex structures","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.131038Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:d32e38cd58545073a90c38951e75e263abf56b80b1f7b92f2603419a4cee6f60","observation_id":"30730836-fb18-4ffa-9cb7-25723880786d","resolution":{"observed_at":"2026-08-05T05:11:48.131038Z","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-05T05:11:48.134341Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.134341Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:173835b6229af6d85327243dc49b497cabbe62465abfea6c0c4bb7bededd7da0","observation_id":"5c23ea12-0ea2-495c-b350-fcd5e2b1fb58","resolution":{"observed_at":"2026-08-05T05:11:48.134341Z","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-05T05:11:48.137252Z","title":"Retrieval-augmented diffusion models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.137252Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:4561bbe51e99209769fc83604ef97e12d30b3fe086b3b584fedcbd553951c63b","observation_id":"0f1943bf-f9a8-4d07-baf9-87eb177a809f","resolution":{"observed_at":"2026-08-05T05:11:48.137252Z","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-05T05:11:48.140047Z","title":"and Palpanas, T","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.140047Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:4544a6f4812b0369c89d4108bd09ce54538f885ce4c125391aea0cad10879bc8","observation_id":"896065f3-90ea-4a8b-a279-6beb9805a389","resolution":{"observed_at":"2026-08-05T05:11:48.140047Z","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-05T05:11:48.142867Z","title":"and von Luxburg, U","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.142867Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:df41413aa306e8a5b9fc31377a316ced56e0475bf6741c8a242b25b1f2dfd84a","observation_id":"63c23abd-a200-4011-b1b2-c0180da0778f","resolution":{"observed_at":"2026-08-05T05:11:48.142867Z","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-05T05:11:48.145823Z","title":"Beyond One Billion Time Series: Indexing and Mining Very Large Time Series Collections With i SAX2+","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.145823Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:808855ce0f4860eb83f27d0fd04324b0e9739d38fda491e5d2c3921c8191404a","observation_id":"3c500319-739d-4f06-b1f0-f3c18deaadf4","resolution":{"observed_at":"2026-08-05T05:11:48.145823Z","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-05T05:11:49.342037Z","title":"SPTAG: A library for fast approximate nearest neighbor search, 2018","venue":null,"work_id":"2581e65a-4b4a-4564-86c9-0d8f70009cc7","year":2018},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.148842Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:1afc164245b07b26cfb6dc54ba2ff724d1efe16155e420c1e05862c8080f827f","observation_id":"a55f49ca-722c-46aa-9217-565c1b13e2cd","resolution":{"observed_at":"2026-08-05T05:11:49.345158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.333228Z","title":"Efficient and reliable vector similarity search using asymmetric encoding with nand-flash for many-class few-shot learning","venue":null,"work_id":"f1a77932-6979-4ac7-8ffb-df928dd5eda5","year":2025},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.151573Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:bd023fa9fbb56549f4408910c0c2d2f4b50d055ca2fa02f73c7bfce88b7c1404","observation_id":"9adcc500-9408-42ee-a5bb-4ef76ccb97ac","resolution":{"observed_at":"2026-08-05T05:11:49.336817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.324608Z","title":"An overview of end-to-end entity resolution for big data","venue":null,"work_id":"34f57d1c-0a3a-47c4-a97a-8b43cc2a5791","year":2020},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.154324Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:826a4396e64062d9c6805709206b9a7584b58acbb16fdcc39dd3b4f997f6c2ce","observation_id":"320f1776-945f-4e90-9c4f-58fd02ad7511","resolution":{"observed_at":"2026-08-05T05:11:49.327321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.316813Z","title":"Diskann: Fast approximate nearest neighbor search on disk","venue":null,"work_id":"fb9565c1-056b-4161-849e-125ef3f11d60","year":2021},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.157102Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:f7e57c2d34563d51915d03eb2a2a4bfd6d62209da3131aa9a5201a47b3d89295","observation_id":"977dfee4-2b98-4a3d-bcab-0286582ccbec","resolution":{"observed_at":"2026-08-05T05:11:49.319591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.308727Z","title":"and Freund, Y","venue":null,"work_id":"0cae6372-dfb0-424e-a2e1-e4a6e3d8bc41","year":2008},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.159768Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:48b8a50f2a0b9b92f62c4e0d755c10fcd1e57698c7cf115b9f405d0badae9563","observation_id":"812a9b00-5f06-470e-8e72-be445722ca4d","resolution":{"observed_at":"2026-08-05T05:11:49.311504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.299836Z","title":"Nns benchmark: Evaluating approximate nearest neighbor search algorithms in high dimensional euclidean space - dpg algorithm","venue":null,"work_id":"2f33e41e-94f8-45e8-82e8-f2a90403d22d","year":2023},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.162513Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:043ea116417874ba188991242054a134d3a4a7accbd0b0aa2095b63e1e1a7717","observation_id":"4ba79b55-efa4-4e69-9a0c-96f1fa8396d3","resolution":{"observed_at":"2026-08-05T05:11:49.302904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.291665Z","title":null,"venue":null,"work_id":"9b12cdd4-ce0b-45f9-8a17-6097f2d54442","year":2023},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.165446Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:66283557de34cf58f06ae66f9415533bdfa0d409d72edfc559106213f45502ec","observation_id":"d00291d1-7706-44ed-a87d-fb98be4b0893","resolution":{"observed_at":"2026-08-05T05:11:49.294490Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.283097Z","title":"P., Friedman, S","venue":null,"work_id":"137533a2-87a9-4142-a9dd-f26fc0a8ac1f","year":1990},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.168317Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:2e8e9cc94d7a74b8fdeffad3acc20b516210c2e3cb67d26b9084896ea214ccf1","observation_id":"e3dd7d73-051c-4b2d-986c-d82b80242400","resolution":{"observed_at":"2026-08-05T05:11:49.286306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.274886Z","title":"Kgraph, an open source library for k-nn graph construction and nearest neighbor search","venue":null,"work_id":"ab14b02c-6b7d-4b22-be9b-7ceb3f9c9756","year":2022},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.171180Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:0132694defece2eaa3d7a206cdb2689d62f44bf7d4c1e633cdfbc21ed133e5bd","observation_id":"29e8cad5-524e-4ffa-a26e-c243cf720820","resolution":{"observed_at":"2026-08-05T05:11:49.277757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.266298Z","title":"Efficient k-nearest neighbor graph construction for generic similarity measures","venue":null,"work_id":"76aa6e03-da1c-47d3-9d9f-b45b9507f80a","year":2011},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.173889Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:b997c85af094c0be28b5c045f48829792709a6696ded43ac6e49196f18e1bdd5","observation_id":"8c24b7b8-2a81-49d0-9bc4-b1816e28de1a","resolution":{"observed_at":"2026-08-05T05:11:49.268976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.257564Z","title":"Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search","venue":null,"work_id":"cc07a7bf-46bd-4755-9a70-d5fc661c00a5","year":2019},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.176539Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:c0bc37d2367d35eeb0e492bd61d8beb0e68117daaf856d50f177b551d3c60f2f","observation_id":"dbd64748-6e9f-4273-b22b-207f9b10acc0","resolution":{"observed_at":"2026-08-05T05:11:49.260461Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.248585Z","title":"High-dimensional similarity search for scalable data science","venue":null,"work_id":"362a9771-55c0-4143-8584-9e297ea8e02c","year":2021},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.179095Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:3a9deb3199bca601bcbab6e147f95f031d5b450ecc28431405be3e9d66d573c3","observation_id":"6dcde396-ed07-4b36-9828-4b8630013468","resolution":{"observed_at":"2026-08-05T05:11:49.251843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.240017Z","title":"Hercules Against Data Series Similarity Search","venue":null,"work_id":"30e470b4-da36-439c-8915-8e15c9ed779b","year":2022},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.181805Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:f0e3fd866e02369e40682f80837b5467d571a7ea8bf582a9752907cc38f9e3c2","observation_id":"12fecd9f-31d2-4369-a9bd-67e9b954f564","resolution":{"observed_at":"2026-08-05T05:11:49.243084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.231890Z","title":"Algorithms in Combinatorial Geometry","venue":null,"work_id":"a21df633-12c3-4b12-8830-6ac33d43d3ed","year":2012},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.184540Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:a8674e29a18311691dc5cf2f81b4db1e741d6cfb904b1292cbba9292a4e9bead","observation_id":"1d22bf59-51ee-4363-bd6d-c279dba0bb76","resolution":{"observed_at":"2026-08-05T05:11:49.234441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.223253Z","title":null,"venue":null,"work_id":"d0ab57da-cd75-49d9-a740-a4d5a2020f75","year":2004},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.187270Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:19c6c3d41304e5ec6f9d835d62467c338bd4a989cb0398c66858001cb1af62b5","observation_id":"49e1ac64-8995-496d-be53-0d54c87e84ba","resolution":{"observed_at":"2026-08-05T05:11:49.226097Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.213945Z","title":"Vector approximation based indexing for non-uniform high dimensional data sets","venue":null,"work_id":"ed03e970-9519-4b08-a0a9-7f35ca41dffa","year":2000},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.190112Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:fa0f3c4f7adb0a1470e471bdbfea787eb8f8e4110311f006153d7a9c6ea3fb6a","observation_id":"3a2da735-7b8c-4527-97bd-dbb1afedadb2","resolution":{"observed_at":"2026-08-05T05:11:49.217084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.205648Z","title":null,"venue":null,"work_id":"21b66e0b-9b03-43b1-b2b7-f5feeffe94c8","year":2018},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.192787Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:b21f01fe7a1358937ad8182edf629fa7a12fc45b5e194ab531f970c097812074","observation_id":"e82857ad-becf-4b11-99f9-bcf120d8827b","resolution":{"observed_at":"2026-08-05T05:11:49.208432Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.196465Z","title":"Voronoi diagrams and delaunay triangulations","venue":null,"work_id":"e4ee4ee7-ec9e-402e-b7d3-3fc45f2aa510","year":1995},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.195480Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:ac346a472ac3c2836928c7cd4ca85896d024d14502fec93fe753283290628c47","observation_id":"e36b8795-0c74-4e1c-a0d4-61c6a9dd65dc","resolution":{"observed_at":"2026-08-05T05:11:49.199748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-10T10:50:57.961967Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-08-05T05:11:48.198060Z","title":"and Cai, D","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.198060Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:3f3f8441e97c4e89cd92ff04dd74ae2ecb731c36c235c5d2e25fc9ca4c077ab8","observation_id":"975c73cd-094c-4ffb-aba9-4b5dc07218b5","resolution":{"observed_at":"2026-08-05T05:11:48.198060Z","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-05T05:11:49.186489Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":null,"work_id":"da4340c2-6b13-4e9e-9fc5-3473cd9f3e58","year":2019},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.201150Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:2b51fb7b259f3e6e8664183ff9325524933de1d53f7d4011798bb0fa6e70f641","observation_id":"b984f8eb-5d25-4551-88b4-95f347bce80c","resolution":{"observed_at":"2026-08-05T05:11:49.189772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.177113Z","title":"High dimensional similarity search with satellite system graph: Efficiency, scalability, and unindexed query compatibility","venue":null,"work_id":"f5b16629-3a59-432c-953b-516aa49276fd","year":2021},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.203737Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:0cc6c485111cecfc6f7c1fc11676e3c65b0b413c2859858488b7ad4b1dead80a","observation_id":"ef7e4ce4-632b-4bfe-8d6d-646f7c383b29","resolution":{"observed_at":"2026-08-05T05:11:49.180639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.168109Z","title":null,"venue":null,"work_id":"67045415-6080-4f21-8467-be200a0115ee","year":1969},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.206463Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:646c710e0254f97785fa66a4472bd6434ceb83ee4dc22315bea60cae8f5812ee","observation_id":"544cf87f-c77c-485a-b9a3-716a6fe2c66f","resolution":{"observed_at":"2026-08-05T05:11:49.171238Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.158096Z","title":"Similarity search in high dimensions via hashing","venue":null,"work_id":"75468071-6a54-40f2-b884-dbc8a3570a69","year":1999},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.209890Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:f98cad0e0e3d3041fc93677e3b9193196483da31f08b8843aa00f25056ca4a20","observation_id":"5dd7269c-d5f6-4559-a8c8-f5f4797c24e6","resolution":{"observed_at":"2026-08-05T05:11:49.161502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.148853Z","title":"Data Series Progressive Similarity Search with Probabilistic Quality Guarantees","venue":null,"work_id":"b32469e5-641d-473d-af62-1245a9e64968","year":2020},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.212902Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:c557add9bf3e0894c3f52fa3e2d9bfae210ed238ae036d0e345ce2791c0fd117","observation_id":"c7c44222-f5b1-4a4d-b883-0c1469bff251","resolution":{"observed_at":"2026-08-05T05:11:49.151995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1206.6411","last_updated":"2012-06-27T19:59:59Z","snapshot_observed_at":"2026-07-06T02:50:47.096675Z","submitted_at":"2012-06-27T19:59:59Z","title":"On the Difficulty of Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"1206.6411","doi":null,"metadata_source":"pith","pith_arxiv_id":"1206.6411","snapshot_observed_at":"2026-08-05T05:11:48.550580Z","title":"On the Difficulty of Nearest Neighbor Search","venue":"cs.LG","work_id":"4165e363-be7a-46b4-9939-fe1b6ef215f8","year":2012},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.215810Z"},"links":{"cited_paper":"/paper/1206.6411","citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:f5086e2c18cee7378cbd9984e2f7d5b90abb4c2fbb4730010ecf235cfba805c3","observation_id":"42e51b16-8b21-4cf8-be55-576dfc79840c","resolution":{"observed_at":"2026-08-05T05:11:48.554087Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.218998Z","title":"Deep residual learning for image recognition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.218998Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:3b576a48efb4060fd8116aa85bab58571710294f35188f6b233218ad77e8b8fd","observation_id":"de9b0511-cbba-4f27-91ec-d131968e75b3","resolution":{"observed_at":"2026-08-05T05:11:48.218998Z","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-05T05:11:49.133594Z","title":"Bore: Energy-efficient banded vector similarity search with optimized range encoding for memory-augmented neural network","venue":null,"work_id":"dacfe4f2-525a-4422-9eec-54e31b4b57ea","year":2024},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.222125Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:5c08b247e450518e0a32c63d6f3532aa8f8f63adf8ac29c7e2895492d7ee399a","observation_id":"50090947-b2c6-4965-b740-a74447a8c2c9","resolution":{"observed_at":"2026-08-05T05:11:49.136998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.125283Z","title":"Pruned bi-directed k-nearest neighbor graph for proximity search","venue":null,"work_id":"3b40fa6f-771d-4d8f-9990-60ce8a3403ee","year":2016},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.225192Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:fccc072a2532704b491a17112e42da01120f436df69d886c59a8516d98bdd4b4","observation_id":"3f4d7e01-b972-44b2-9352-1258122f3845","resolution":{"observed_at":"2026-08-05T05:11:49.128130Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.116383Z","title":"Product quantization for nearest neighbor search","venue":null,"work_id":"ffaf40d5-0a5f-4b66-9bfb-e79e8e10789c","year":2011},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.228103Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:cc599830df8115c54ab1c9c21bc7e99c0eb66a0001f598da9949ffeabe34dac0","observation_id":"b4ab816a-d203-44e3-935f-9a3e9ef3ce39","resolution":{"observed_at":"2026-08-05T05:11:49.119586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.108436Z","title":"Fast and accurate hashing via iterative nearest neighbors expansion","venue":null,"work_id":"0f981459-b28a-461d-93b3-333095db79d4","year":2014},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.230966Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:75fc705d2c2e2257349d8fe9ba643c34753c6f95ec3f21cf06ab8e3aa3033c27","observation_id":"433a9caf-5b59-4394-81d8-d283ecb19a6d","resolution":{"observed_at":"2026-08-05T05:11:49.111275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.100001Z","title":"Billion-scale similarity search with GPUs","venue":null,"work_id":"c7192d01-7682-470b-a10c-ce4cb30808a2","year":2019},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.233797Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:ccaa0c25d4db624c6a8b5df0ab1d8ed85fd3ab764d0c329a535725b5b887a107","observation_id":"e5a6d238-4b0f-41bb-bb10-333c982c3380","resolution":{"observed_at":"2026-08-05T05:11:49.103085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.091458Z","title":"Local interpretation of nonlinear regression model with k-nearest neighbors","venue":null,"work_id":"e01600b9-7e74-42e2-a7c6-6dba950aad46","year":2023},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.239251Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:8e76b36f6a64dc2f27cc823959b16bc835fa93b268baacf8868c9280fa9976a5","observation_id":"f9ae7f90-08a2-4b2d-ab5a-818b6082a3e6","resolution":{"observed_at":"2026-08-05T05:11:49.094508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04906","last_updated":"2020-09-30T21:27:13Z","snapshot_observed_at":"2026-07-06T09:11:26.109763Z","submitted_at":"2020-04-10T04:53:17Z","title":"Dense Passage Retrieval for Open-Domain Question Answering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04906","snapshot_observed_at":"2026-08-05T05:11:48.242133Z","title":"Dense passage retrieval for open-domain question answering","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.242133Z"},"links":{"cited_paper":"/paper/2004.04906","citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:dbdcaf4a82b80dfbfd8e91e3e394896f12071dfbcd9c82e4a37cdaba4f852f16","observation_id":"c616611c-5596-42ef-bab1-4d243ae01d7c","resolution":{"observed_at":"2026-08-05T05:11:48.242133Z","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-05T05:11:49.083148Z","title":null,"venue":null,"work_id":"65321398-3717-4635-9416-6fb458b0e9d1","year":2002},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.245411Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:7d606cf4ee47efe2d51e85f39eaa9f1ab660ce9536a6e9a29eaf78c3ca27e542","observation_id":"56c304c8-fe65-4907-9666-d74375b9b567","resolution":{"observed_at":"2026-08-05T05:11:49.085893Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.074302Z","title":null,"venue":null,"work_id":"dce895c6-8f6a-45f8-a6b3-973e27d5bdf6","year":2000},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.248291Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:ebad83cc4693539a2f689057692d79033f6faef2bb7d346ab0cbea77f955daec","observation_id":"edb0f4a8-419d-48c1-a517-98e93ae98860","resolution":{"observed_at":"2026-08-05T05:11:49.077263Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.065651Z","title":"Approximate nearest neighbor search on high dimensional data: experiments, analyses, and improvement","venue":null,"work_id":"38f2fa9f-ff7f-440a-9991-efec3c924b7f","year":2019},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.251216Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:8a9edc41e65b337c0d0653ec820e19245909ccafe49fe88be1d6d8b2390393ae","observation_id":"8bd410b1-a511-45f7-97eb-94eda147571e","resolution":{"observed_at":"2026-08-05T05:11:49.069056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.057272Z","title":"Hvs: Hierarchical graph structure based on voronoi diagrams for solving approximate nearest neighbor search, 2023","venue":null,"work_id":"1e4fdcb5-8458-4352-b88b-09c2f303809d","year":2023},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.254478Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:2a0eec5ce6ebd957f779faf95d4cc0c34c155231a9ac014372828355cee0afce","observation_id":"a3271559-695d-4b0d-a2d4-8cb44690246e","resolution":{"observed_at":"2026-08-05T05:11:49.060168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.048609Z","title":"Hvs: hierarchical graph structure based on voronoi diagrams for solving approximate nearest neighbor search","venue":null,"work_id":"df864110-b9e0-4c09-affd-744342a930c2","year":2021},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.257625Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:f6fa1bc77f94d1bccf4d26ffc5c13368e97816a58007fdfa6719555e312d0d1d","observation_id":"beb1deac-4fd6-4f3f-a2e7-2618b3cbaf2d","resolution":{"observed_at":"2026-08-05T05:11:49.051533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.040491Z","title":null,"venue":null,"work_id":"8df9068c-20f0-434e-bb2a-474a291fa571","year":2014},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.260567Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:4b5d5800b8595871ec2959c5a371ae7dba28a15a4be423dff72d32d3bf87ea73","observation_id":"732eefc3-ee81-46b6-9f85-1e375548d268","resolution":{"observed_at":"2026-08-05T05:11:49.043158Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.031839Z","title":"Approximate nearest neighbor algorithm based on navigable small world graphs","venue":null,"work_id":"e32dac54-9f6a-4043-ac8b-adb9552df804","year":2014},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.263555Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:56281f16b28a90d9cf727b363b837bd1583043715916c0aee388d27656d36c13","observation_id":"331fbbb8-07c4-46dd-8bdb-208dd959faf6","resolution":{"observed_at":"2026-08-05T05:11:49.035109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.023147Z","title":null,"venue":null,"work_id":"c16dc7ef-0303-4f75-8f4a-e2273dc67ee8","year":2020},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.266404Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:24738c63e76890912c2f10d4bfb1e3816e11a7892cb5e0b74f4b2da532fe1d60","observation_id":"f084ab35-47b6-41d3-9557-a0dfd3fd9fda","resolution":{"observed_at":"2026-08-05T05:11:49.026038Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.014829Z","title":"D., Shen, Z., Blelloch, G., Dhulipala, L., Gu, Y., Simhadri, H","venue":null,"work_id":"1d45509a-7199-4459-8eb5-8134f717bd75","year":2024},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.269181Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:8607fdf622fc4bbd2b362972bae22d7cd104fd714939cf30f41f8f77795acf4f","observation_id":"029f3b90-ffc6-43fe-9a92-081f95a7c3dc","resolution":{"observed_at":"2026-08-05T05:11:49.017650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:49.006050Z","title":null,"venue":null,"work_id":"03574b80-921b-45bd-8f04-cc3e51aa443f","year":1980},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.271907Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:853215fddbee41125810baba17fc403d733446736331f7ee4b53c650908b16db","observation_id":"747992db-cab9-410d-b475-ed5f91922a4c","resolution":{"observed_at":"2026-08-05T05:11:49.009108Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.997637Z","title":"and Babenko, A","venue":null,"work_id":"311d2686-525f-47d4-8b7e-fb532fc603cf","year":2018},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.274671Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:d10cc7b1b178824b178211f1548cdeef7eeb96ea196c54154fdd6bc88b966f98","observation_id":"642dce91-8db0-47c5-9254-9a7852f1e5cf","resolution":{"observed_at":"2026-08-05T05:11:49.000337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.989387Z","title":"V., Gon c alves, M","venue":null,"work_id":"0410051b-210e-48c1-bf6c-97a665eeae0b","year":2019},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.277337Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:74abd7e588e055ca4660ef6995059e2877ac46a1195acec2275039daabe69d0a","observation_id":"2db99cec-9116-4dba-9a24-33a250ccd5f7","resolution":{"observed_at":"2026-08-05T05:11:48.992140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.980707Z","title":"and Torralba, A","venue":null,"work_id":"42329ddc-4d2b-46cb-86b8-fc6dd917873a","year":2001},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.279950Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:cf99e0adfa184b4faee233e9deac84b86b8977f28ec7f97d6aa2fdc20115e1f7","observation_id":"4eb256dc-8daf-425a-9b04-3744077ae647","resolution":{"observed_at":"2026-08-05T05:11:48.983592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.972094Z","title":"Data series management: The road to big sequence analytics","venue":null,"work_id":"9e6be4c3-5c18-4a57-a72a-5e572334939b","year":2015},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.282539Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:91b389890e2dd16275cb711edc70b87140665cdedfdfb6d305efe627c3c3211f","observation_id":"72a02a74-70f7-410c-929d-d5b527ef9121","resolution":{"observed_at":"2026-08-05T05:11:48.975054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.963999Z","title":"and Beckmann, V","venue":null,"work_id":"2081143e-ded8-4b72-86c1-05c7d0a23814","year":2019},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.285422Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:e900de417b5f1e13079601f12da5bbabe5cdda7c6ed2ac58b471cb66b50c303b","observation_id":"a42072a9-73c2-4bc1-aa2b-cf08d7bfd63d","resolution":{"observed_at":"2026-08-05T05:11:48.966606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.955561Z","title":"I., Nicholson, A","venue":null,"work_id":"59e4c29b-9d53-452e-9648-bffdcb6b2302","year":2014},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.288015Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:af4f0210d3a355e0a0a47bb5c81e2e571d6a2aebef206fde05859aa55d245f36","observation_id":"8f0fc347-93a4-436e-860f-a101840f55ad","resolution":{"observed_at":"2026-08-05T05:11:48.958306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.946138Z","title":"Approximate nearest neighbor search small world approach","venue":null,"work_id":"5ecabe66-79c4-4999-a282-63a96c02a4d6","year":2011},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.290668Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:246cefd2149df147393a86d47ef2a9ba139d1c050259af2fee104a4760863709","observation_id":"b3e88420-1757-48ff-ab4a-0396924c79cb","resolution":{"observed_at":"2026-08-05T05:11:48.949628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.936509Z","title":"Skip lists: a probabilistic alternative to balanced trees","venue":null,"work_id":"9c097be9-b01a-4a14-aa95-4a1ba43dfb87","year":1990},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.293257Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:c12ea7a3f8635fe99399abcf4b383c4c34154bc4c58f8a41c9fe1da6068771a7","observation_id":"d89fe499-8060-4ad2-a3e2-e6dec2cb0e48","resolution":{"observed_at":"2026-08-05T05:11:48.939879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.928095Z","title":null,"venue":null,"work_id":"bfb7968c-4843-449f-b052-ac0a8f09e00b","year":1977},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.296043Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:6f929ccf6319d40220c46176eb46220011776e62052d8b0feaaf5264c747dc61","observation_id":"e4fb21aa-515b-447e-aa3c-0f4f15f3fc78","resolution":{"observed_at":"2026-08-05T05:11:48.931039Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.919508Z","title":"Imagenet large scale visual recognition challenge","venue":null,"work_id":"ae5e9c10-91db-4b40-be37-03211e3deb77","year":2015},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.298516Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:2ded77a6e45314f50bb441f7a1772f5b86aa76ae1361bc7ab8a2f592b0d82383","observation_id":"69101b01-4514-4c45-9a2e-9b0bf3996483","resolution":{"observed_at":"2026-08-05T05:11:48.922350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.910519Z","title":null,"venue":null,"work_id":"3af78ca7-7fa7-45f4-ba68-30e7ed53f6f6","year":1975},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.300877Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:20f759053a05998f6abcff82bfc26a737c7961f4f10c43d6b66d3f8365c811a1","observation_id":"d680723a-94e6-4a08-914b-16e36ad39a48","resolution":{"observed_at":"2026-08-05T05:11:48.913472Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.03763","last_updated":"2022-05-08T02:41:54Z","snapshot_observed_at":"2026-07-06T13:07:44.802145Z","submitted_at":"2022-05-08T02:41:54Z","title":"Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.03763","snapshot_observed_at":"2026-08-05T05:11:48.303480Z","title":"V., Williams, G., Aum \\\" u ller, M., Douze, M., Babenko, A., Baranchuk, D., Chen, Q., Hosseini, L., Krishnaswamy, R., Srinivasa, G., Subramanya, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.303480Z"},"links":{"cited_paper":"/paper/2205.03763","citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:9d7abbc85cf54ea99f7caa45414e19511b5541a7cc2aaca8a56fe1aa7c2482d9","observation_id":"405b0bb1-fd75-4182-ba18-aba25ba4e061","resolution":{"observed_at":"2026-08-05T05:11:48.303480Z","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-05T05:11:48.901556Z","title":"Deep billion-scale indexing","venue":null,"work_id":"9be6af56-d653-49c1-8627-90b86252b27c","year":2018},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.306677Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:d967d24fe7095b83958a458b8473eb9aa5818c762d14568b29ec51b297e129ff","observation_id":"72fbcd82-a115-4d4b-8398-097944045ae5","resolution":{"observed_at":"2026-08-05T05:11:48.904498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.892215Z","title":"Large-scale training system for 100-million classification at alibaba","venue":null,"work_id":"5ad3ea2e-1d8f-4360-ad3c-d56dacd38e6b","year":2020},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.309246Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:44bf4fa542169b22749d2560af2d8c206af54798213b1b6538317d5b309c9416","observation_id":"a27fccf7-9819-444f-ba82-6ee8c932627f","resolution":{"observed_at":"2026-08-05T05:11:48.895154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.883524Z","title":"J., Kadekodi, R., Krishaswamy, R., and Simhadri, H","venue":null,"work_id":"a5768210-489e-4651-932c-6eb617541ab1","year":2019},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.311707Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:17f6428a846d20fb24149d7c7b932f9ab915be04230811c2e1310f2a92db148e","observation_id":"5f884e51-5018-4ec4-8259-39cd80713efc","resolution":{"observed_at":"2026-08-05T05:11:48.886360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.874392Z","title":"On approximately searching for similar word embeddings","venue":null,"work_id":"5307e32c-c83e-44fa-b59a-875d09250e39","year":2016},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.314457Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:bfc3275cdf3ae55fc1bfd8ef3b8d1323ff71de9c82879156632c02598e0e201f","observation_id":"e0c35b2b-3950-4fc2-a75f-673f0231768b","resolution":{"observed_at":"2026-08-05T05:11:48.877649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.864552Z","title":"SRS: Solving c-approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index","venue":null,"work_id":"f06684a8-28e0-41f1-b526-b34293cfe72e","year":2014},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.317072Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:1958e0ab919bd30865093ccfa2a63426d755ed8bbbfe53c416ab6471e1ee4923","observation_id":"ae0db2ee-b804-4412-bc5c-b0f5c7ef10ef","resolution":{"observed_at":"2026-08-05T05:11:48.867980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.854847Z","title":"SRS: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index","venue":null,"work_id":"76513ccf-9cbf-47c6-ac34-565e5bdb14c9","year":2014},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.319730Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:a8f54f9a9cfe3d47b5e6cfb5a3e430f3b60b8484a9a44938eb05e92c8cd44703","observation_id":"00aac86e-a6fa-4d4e-9288-ea5fa33ebf1b","resolution":{"observed_at":"2026-08-05T05:11:48.858438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.844574Z","title":"Quality and efficiency in high dimensional nearest neighbor search","venue":null,"work_id":"41114655-a9f6-4bbe-9582-c6c779ed8c1c","year":2009},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.322226Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:7d45864a9856d562418cad7b7eca8af275f16fcc24dd2ea40db780693f32af08","observation_id":"500de555-54a4-49bb-8cff-e23b1a331b3d","resolution":{"observed_at":"2026-08-05T05:11:48.848006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.833479Z","title":null,"venue":null,"work_id":"66a4c351-cfe8-4593-8a9c-52e08042758f","year":2023},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.324797Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:983371b22529fc37f40db1cec2b38ce99fce8009bac3d09615c7be6d8103cd29","observation_id":"70ea708b-75ce-4f46-b820-1213fc401126","resolution":{"observed_at":"2026-08-05T05:11:48.837131Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.822534Z","title":"Datasets for approximate nearest neighbor search","venue":null,"work_id":"6015d4fb-4ecc-487a-8aae-ea79c8b0ca5d","year":2018},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.327654Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:0c7b93bcf6fd701888974494d9836d7d5a07c4279f423e85447b1c552fe65f71","observation_id":"dcf8736d-9008-42ed-b3ae-d3570e4bfe9d","resolution":{"observed_at":"2026-08-05T05:11:48.825768Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.810804Z","title":null,"venue":null,"work_id":"e8626005-3373-4c79-a241-5f34c23af67b","year":1980},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.330216Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:c63276e07faa081be0052c432cbeccc227d1aee1650eb7492277a1ae00f2c282","observation_id":"e3ce1ad2-759c-4971-8077-ee902128b7d1","resolution":{"observed_at":"2026-08-05T05:11:48.814525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.798108Z","title":null,"venue":null,"work_id":"829b7978-f335-4f4c-bef3-0d38b98286fc","year":2002},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.332794Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:59e3db203d81656c82c8d0d5f3fbb3b833e6884a471e58dd3faba0d17382750e","observation_id":"9e697609-58f5-4248-9ece-e5fa8177e75f","resolution":{"observed_at":"2026-08-05T05:11:48.801522Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.786608Z","title":"Southwest University Adult Lifespan Dataset (SALD)","venue":null,"work_id":"c67ac6cc-b45f-4e1f-a6e6-773a3f28bb67","year":2018},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.335405Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:f74aae78792eab5daf28149407e2dcd0f9332c79268e6b10cc4c00daf590395c","observation_id":"7b5a2f40-e0fa-4d87-89b4-05215d5bba91","resolution":{"observed_at":"2026-08-05T05:11:48.790611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.773736Z","title":"Trinary-projection trees for approximate nearest neighbor search","venue":null,"work_id":"3e26cf27-ce7e-4092-a0ab-1be1d51e58cd","year":2013},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.337982Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:f73b1f73ac0592fd9df1fb2c894f3ebdaf1c02287a13faba55da644ad9070d63","observation_id":"1590598a-9839-4531-ba5d-4895a75e807e","resolution":{"observed_at":"2026-08-05T05:11:48.777802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.762144Z","title":null,"venue":null,"work_id":"5f6bbba0-66eb-4c03-ba09-fdeec51bb4f0","year":2018},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.340554Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:240d53de0456a480add472ff980284cf97edf29ac2acc1a5cb16daa2599bb8ea","observation_id":"978e7a8a-24ed-4d8a-b8fd-2c5c2eab039c","resolution":{"observed_at":"2026-08-05T05:11:48.766228Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.343212Z","title":"A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.343212Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:7981f34b516d3f72b3c04c1abdd9b8df6805629b3353439238f8dc1654e34234","observation_id":"9717fc9b-0c83-43d7-b932-c5374c06ef32","resolution":{"observed_at":"2026-08-05T05:11:48.343212Z","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-05T05:11:48.749910Z","title":"LeaFi: Data Series Indexes on Steroids with Learned Filters","venue":null,"work_id":"50d16f4b-90df-400b-92e9-191561bd8fa9","year":2025},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.345730Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:eb1db592b25665a7c53dc03da5b5c4ccc37f0cd4d5ecdf0b7504451e04f71fec","observation_id":"a0d42631-b070-4123-9eb9-fa2f5c371dab","resolution":{"observed_at":"2026-08-05T05:11:48.754139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.737412Z","title":null,"venue":null,"work_id":"9e5ffda9-a589-4d4e-b1f5-0160a47ca278","year":1998},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.348491Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:a3885fbbad38f54f39b535014f61590cf4d55bc3b642e806f87da0c142d6ded3","observation_id":"1ee0ae0f-3dfa-4812-bc79-052a9c2c935c","resolution":{"observed_at":"2026-08-05T05:11:48.741389Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.726047Z","title":"A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces","venue":null,"work_id":"aa815e49-863e-4392-9e05-e8a6e61ff4cb","year":1998},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.350958Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:a2a0be873b413ce5c7d2900fc478a4e45b57dd0214d4c80da3698c5010d0bbf3","observation_id":"2da78a69-1e28-409c-8e1f-8b3e3c2f5ca2","resolution":{"observed_at":"2026-08-05T05:11:48.729949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.713599Z","title":"C., and Giles , C","venue":null,"work_id":"e3ba75e5-16ef-4d75-af7b-561e2b2ac98f","year":2014},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.353725Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:27de8aed184a838abeccf68049fd05688adabb7a89bcbed05080465824a40797","observation_id":"508bf351-fe19-4b05-9a76-f80a9d0f6817","resolution":{"observed_at":"2026-08-05T05:11:48.718025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.697482Z","title":"Ngt: Neighborhood graph and tree for high-dimensional data","venue":null,"work_id":"091add62-5c53-4916-9fb2-738cace50f09","year":2022},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.356629Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:7f7aa71d685b91607c1e9f3b55414e456818fe34209917c3c85bc405feb7d4da","observation_id":"2895d734-c2dc-4062-a2f2-ec4d56050313","resolution":{"observed_at":"2026-08-05T05:11:48.701437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.685055Z","title":null,"venue":null,"work_id":"2568b471-f4dc-4de6-947c-ae92372debc7","year":1993},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.359304Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:f5eb0844c95ba9938fbad30c840578db8bfa521e1c957e50b7a5d14f7c6dbed1","observation_id":"c58b239a-b135-4d5c-bd3f-6b69641ad7fc","resolution":{"observed_at":"2026-08-05T05:11:48.689154Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.669749Z","title":"Fast knn graph construction with locality sensitive hashing","venue":null,"work_id":"9de3542b-0345-46ea-a716-353cb371d8f2","year":2013},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.362074Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:029fdc221812b095652ca44c20123078659579d1e6dd37a5991d8896c9967daf","observation_id":"36c48279-3b51-4d10-8307-4795970f9531","resolution":{"observed_at":"2026-08-05T05:11:48.676374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T05:11:48.655787Z","title":"Towards efficient index construction and approximate nearest neighbor search in high-dimensional spaces","venue":null,"work_id":"3c12b3a9-4085-460d-be62-4e5bdafb79c0","year":1979},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.364790Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:3e81e72ec6ae0bed47f743339c77a7839eeb8469ffcfa35fd6839ba4ec52a8e3","observation_id":"993326f6-455b-485b-814a-b65beab8b36b","resolution":{"observed_at":"2026-08-05T05:11:48.660657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00778-018-0513-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T06:12:12.796739Z","title":"Generating data series query workloads","venue":"The VLDB Journal","work_id":"92dfc82f-f7a5-43cd-a300-45925e46507b","year":2018},"citing_paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-05T05:11:48.367705Z"},"links":{"citing_paper":"/paper/2509.05750"},"observation_digest":"sha256:b0e818489b0133773edc217a05818c25083e98479dc89429fd3b2487de429c96","observation_id":"038fa31d-3787-4258-8d0f-01693586e3fc","resolution":{"observed_at":"2026-08-05T05:11:48.399476Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.05750","last_updated":"2025-09-06T15:43:36Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-07T22:41:56.764892Z","submitted_at":"2025-09-06T15:43:36Z","title":"Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search"},"reference_resolution":{"displayed":97,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":39,"verified_exact":2,"verified_fuzzy":55},"total_outbound_references":97},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 97 of 97 outbound references and 0 inbound Pith citation observations for arXiv:2509.05750."}