{"as_of":"2026-08-12T21:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aa50eb41b46e70cc7fb3d39269c6ece7261e09fcb1092621693ba4cf6f09a89c","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T08:21:33.893478Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.03151/citation-record","integrity":"/paper/2606.03151/integrity","json":"/paper/2606.03151/citation-record.json","paper":"/paper/2606.03151"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:4c686d496d5e73a05a7bd42aa7b9bab49d02b750db3eae73a07e219d3cfd5cc4","observation_id":"d42ce9ab-8160-4ce6-8c16-bc94410ef4cf","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","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":"2512.18335","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T05:16:39.507575Z","title":"Quantization for vector search under streaming updates.arXiv preprint arXiv:2512.18335","venue":null,"work_id":"3edf5858-ea60-4774-8b48-54c212656db3","year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:b11e5afbc7183ba353478952eca277e2d46b5712ff0bfc23840494455f4fa8e0","observation_id":"46276979-022b-4248-a1dc-7bcbb183d7fc","resolution":{"observed_at":"2026-07-02T05:16:39.509415Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:99a79ddca5a9b0d7105efd83245622d7670ffc23302ecd1a6c25139aa180d66f","observation_id":"6f064301-33b9-4d07-a4fa-d2f6c9071e7d","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:83967a2b5319841bb29498fc770a7353a66514e36d2eea5c9d638acd6f378a3d","observation_id":"67c456e3-811b-48fc-aca7-e3e7bf19d66a","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:9341701910666ddedba97dcbd7847cbe8d5e66f1138de222df19b4a004c7dec2","observation_id":"78cfab30-1d05-4daa-aa4c-62822a9a36a3","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","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":"2024.349300","doi":"10.1109/tcad.2024.3493000","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Barkam, Mohsen Imani, Kai Ni, Grace Li Zhang, Bing Li, Ulf Schlichtmann, Cheng Zhuo, and Xunzhao Yin","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","work_id":"5b8c1270-e6e4-45cf-852a-49aeb94312e5","year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:5253d277037f2d53f4a60f18a14103ede5fdb2518534189fc59318f614f508b6","observation_id":"a94a040a-0f52-43be-83f3-d9d0196331f6","resolution":{"observed_at":"2026-06-28T08:21:49.701596Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:91c5463d7fa9b554d71abc2787f5c805ad6f12e65d42d55027e8117e85dbac4d","observation_id":"8012c5de-0e96-4cc5-a146-b2ce532a6f6a","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":"InProceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:1e3edd70967f320f87419a7e50bbb27e1229bf8f801dc64b36c4875a63484165","observation_id":"1295cbd6-722f-46e4-8749-a8a4b3e4c281","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:e0eaefb74348ce205cd1518fb9cc47bf126ce826edc2504aa5eb336ff51b55c6","observation_id":"e87b36ef-b087-4b7d-91d2-97a314702c1b","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:b92ccb84511c3a6bf700267c2970ff7a63af51a2e86035e3b3c041f6d9626c78","observation_id":"5e182020-300b-4af5-b771-4fb8e6ef0dbf","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:3480ed9a9ad210beef170e6353c0b55985465843ab19f1036b1d5e0db1c975f9","observation_id":"3edb72be-e110-4717-9ffd-28a058948731","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:b3b203eb9f8a5eb6776206be83bc86258896f508557bf351be9c94a54718316e","observation_id":"c0401185-e89b-41e0-931b-9e28234bc415","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:963f7c16ee8910cef4fc91589dc03ba2a8f2bfede3f95e6e4f8797c7b2dcd26a","observation_id":"fac59155-7fed-4fe5-9796-6fcbe11d78c7","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:d64c4481d61870181913eeb20e62a14644fd111aeda610c8fdac4c47ef2711e4","observation_id":"8ca26cbf-ec88-4539-a356-aa87412f671d","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":"In2017 IEEE international symposium on high performance computer architecture (HPCA)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:086ecc1c5a07dc99aab9c69123af14f1607d7ae5800c8b7f6d0b362cd9a29614","observation_id":"4c68db48-ee8e-4e93-b961-d17f0c748036","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:489ffd2ba71d793cc021ac58f98f3b3674721bb7463a184a0f8f7f87f154ee3b","observation_id":"3b871c3a-e1d5-47bd-8d2d-6ce6d7829534","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:82023cd58085a0b102efb2fbbf47a358036596e8b70a541e06e73eb38b58c872","observation_id":"fa707456-8c4c-4856-ac9a-cd71294b4d67","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:23cf6e969217dff97428ed243f42bb931050a0a841e6599d4804b316e0a7a95d","observation_id":"64328d2e-2fd9-48bb-ae32-584180f41742","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","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":"2011.594654","doi":"10.1109/icassp.2011.5946540","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Searching in one billion vectors: Re-rank with source coding,","venue":null,"work_id":"fe4a1be3-0b40-47dd-a890-8ec7e9a148a4","year":2011},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:5549d8f530a90b41415eb00030584f9def0426f9f33bb3ae3b8480dbee4e0768","observation_id":"5e964bbc-69b0-4272-b34e-1fa4563493f7","resolution":{"observed_at":"2026-06-28T08:21:49.704638Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:86303a1fdc81e767dbc14c8cc5c4f87860d886eb44f53b338038f7a2f927f57e","observation_id":"1d5a2f9a-7f98-4c96-b332-81314c3eb8a0","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:08d4fe590edc66da4274a35d63b11a8f1f8d4fa5ef759a0a4cc77c7a3609cdf8","observation_id":"739084c8-b46c-4035-9965-79f33df1ca0f","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","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":"9657.2024","doi":"10.1109/isscc49657.2024","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In: 2024 IEEE International Solid-State Circuits Conference (ISSCC)","venue":null,"work_id":"abcef84d-db7c-4667-88b0-155999d7df30","year":2024},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:7dfb10fd8f4231850920edfe3af6a9cad36649776a414356d53826eab8a73af3","observation_id":"bf3350e6-dbbe-4b5e-8ebe-888310679ef5","resolution":{"observed_at":"2026-06-28T08:21:49.694874Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:57416bb90e0716afe5a2521c2ad9d31cc54b5588072e16f2d4faaeafe12e8804","observation_id":"bd8ab1df-05bd-41a6-bcfb-e48495e15aa0","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:d1e7c6dc4906583b44c70dcd5eac4b49b446f7fad6cce649d7dd33be1c22d79f","observation_id":"2bc5b8ca-610f-43f5-96ee-aecc1e548b5a","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","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":"3553.2020","doi":"10.1109/iedm13553.2020.9371956","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Interconnect scaling challenges, and opportunities to enable system -level performance beyond 30 nm p itch","venue":null,"work_id":"49d62d64-3db5-4398-97c0-5666075c001a","year":2020},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:558bc97f768c674763546a57070cefa53c67ebb61306a3b57e86dc1c2cc18b02","observation_id":"2436873d-1052-402a-aa9d-ec87a1390b3c","resolution":{"observed_at":"2026-06-28T08:21:49.688522Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:7321c16837962d63565c2dd950f8e25628c4b3c1e4c4b5732bb86ec5b6ddb8a3","observation_id":"f04a65ab-fa37-4ddb-81de-955830f82955","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:9adb3b7a706b6b28beb923956203c82311a1a91b97cc5e2b95cac856c1317173","observation_id":"f698f2f1-609a-4704-94af-b656def869cf","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:5dcc70c32a73babe070c83b7a3051c1e6c87ba08dc124d4c8c95ef1a44001edd","observation_id":"57fac5e7-5b6b-4192-8796-157eda00daeb","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","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.30612","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T05:16:39.469487Z","title":null,"venue":null,"work_id":"72a9673d-1a74-495e-a536-ba8db3119d75","year":2021},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:e302ae8c67cf76d437cf9d3f7b9f0ae7fd5837961275ee4d60cdc4eea9cfdbf5","observation_id":"13117417-6f98-42b3-8566-2c2de1c5d9df","resolution":{"observed_at":"2026-07-02T05:16:39.471534Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:189817b3c5bce554bf6c9c9d647b2ee72f7974ea984b0fe6a7db9893838f90bc","observation_id":"5b571db5-8c75-4430-b35f-aeb997db76b4","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:c84e848c2a9ecc05f90b93ad62eddc8adc847e3fa1a15f8a67d5a7069e2c89b4","observation_id":"5b7cba74-797a-4e11-9962-ea0f7c8f7691","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:9b2cb215f5d54ebb866096c7e78d21c6d13655f94ed7510b92d9796aba0115c4","observation_id":"d9fc50d6-6853-455e-bb43-1904791a6781","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:dce72a50e041fac0d7618927313582756661a28c6ba68f6678e822c951617382","observation_id":"5958dc66-da18-4b2b-b529-4c6ca002b117","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.00970","last_updated":"2024-11-01T18:43:45Z","snapshot_observed_at":"2026-07-06T19:43:50.724897Z","submitted_at":"2024-11-01T18:43:45Z","title":"Incremental IVF Index Maintenance for Streaming Vector Search","version":1},"cited_work":{"arxiv_id":"2411.00970","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.00970","snapshot_observed_at":"2026-07-02T05:16:39.472830Z","title":"Ilyas, Theodoros Rekatsinas, and Shivaram Venkataraman","venue":null,"work_id":"223140f2-4f3f-4d70-9710-c47dafc1faec","year":2024},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"cited_paper":"/paper/2411.00970","citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:9ca0910b5152d43d1191f597aa5ead628d103bce14d389fbb17237b18de21422","observation_id":"e1b5b753-6c7d-4c91-bfcf-00b696c626fb","resolution":{"observed_at":"2026-07-02T05:16:39.489352Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2025.364102","doi":"10.1109/led.2025.3641028","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"IEEE Electron Device Letters","work_id":"441b0e23-6bdc-4552-b139-6a32dedd294e","year":2026},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:de7e1d7c64d9dad31b706433ef1da2cfe51fb5cca6bfe07e0509681c133c4556","observation_id":"d462b339-708a-4d33-971c-80a926c85dd3","resolution":{"observed_at":"2026-06-28T08:21:49.698154Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:e326ca7497bfe339f103c6cb7a8b0d5ffcf635abcb554f464729c54b293d39c2","observation_id":"099be4e8-ea62-45e1-b38f-26b0d3687e0e","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:7ca4e6e4ec5c698c098415265891498b6198c023ed9c3dd06af3bcd88bbc5889","observation_id":"fc42efd3-120f-4776-aa9f-716845ba65ee","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:ee032acce464a90297e2835dec294a72ee6391d1d6be51053cc36e085ff6cede","observation_id":"fbf4a33d-8ed0-487f-b137-2c0a48f48728","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:ac95d54eda562126aeda43fe9227b08a4709361259c391f701da589d51302b34","observation_id":"b079d302-004b-405d-9c9b-4d43c2d82f6b","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:a57713ca8c27eeceb952775da2f7292d197cc73ada6be87d8950008a04ffc2e8","observation_id":"60960916-c922-4e2c-9a93-8399f7a1a4de","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:5794f3c3a71b4bbff535e08e2cc4c72f93339df33493467c4bdc11e35879d4ef","observation_id":"9aaea2e5-9da6-4328-ac18-ef7302a50159","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:4c565d8cf32600c71805ae69c1a163b54db37c0e2e726e0eadb2a81b2d7c1fc7","observation_id":"939b8d86-4f6f-44f7-b3b5-bc53c76125ab","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:dd00aadbe6b93f6d86654f85aedaad47feefd412a16f5efaf94ffb065007fb0b","observation_id":"2ef959bc-dae4-4a85-b886-cd2417892ac3","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09613","last_updated":"2021-05-20T09:17:13Z","snapshot_observed_at":"2026-08-10T18:40:28.900730Z","submitted_at":"2021-05-20T09:17:13Z","title":"FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search","version":1},"cited_work":{"arxiv_id":"2105.09613","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.09613","snapshot_observed_at":"2026-07-11T03:27:46.428816Z","title":"FreshDiskANN: A fast and accurate graph-based ANN index for streaming similarity search.arXiv preprint arXiv:2105.09613","venue":"cs.IR","work_id":"b6ca6a52-fd51-47d3-ac78-3cb3b6e892bd","year":2021},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"cited_paper":"/paper/2105.09613","citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:3b711274c6a56bc138001185a5849f171d34a1d44023d1db737115744860fd52","observation_id":"42c77ff1-61b4-4f7f-a23e-2c212e63ff00","resolution":{"observed_at":"2026-07-02T05:16:39.493088Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:09bdfd35c74db1deb7a817b688bb846443c4086edba8ee98fa120ac8966eb44e","observation_id":"97690888-0e48-4c57-9c37-a779ca9cd121","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:06bd971968cb5c5f6e0cba1508892f1cdf066b2b76f8d9a75b77f352e175316d","observation_id":"00dfff25-8928-434d-b05c-8de01e853847","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:fc05d93696730472c1ab008d7891516e92922f5ea1f952b5a012f01d1e5acf31","observation_id":"2f1def5d-e5a2-45e7-b8e1-4ee74bd7bad8","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:de8248c2e8bed002d535fc5f79a990f16146c204fc9117b7aff535c315771a30","observation_id":"8636d057-c002-4a29-9c92-cacd64a5ef0e","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:066f6c7bd19dab786270a0d40d243216c674bd4d5a2eb6c3d7864edbb2b1ecc2","observation_id":"5d4976d7-efc0-4dde-8d6d-254b8ba86c21","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:0975fa54b83c15b8bdfb904b37e49d5efd5f2f576bbf1ba165bb0359125e3e63","observation_id":"4cddcaf7-2ee9-447e-874f-9d54daf1d207","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","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":"2026.367171","doi":"10.1109/tc.2026.3671718","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proxima: Near-storage acceleration for graph-based approximate nearest neighbor search in 3d nand,","venue":"IEEE Transactions on Computers","work_id":"bfeafb9f-e6e6-4b0f-8739-b1181762fa88","year":2026},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:e8cdea824c12d1d9940e5208a00af66ffd3db7bdde70e426fad6aa7aee25ccef","observation_id":"d4f42fa0-af42-4fd5-886d-6e15c85fed23","resolution":{"observed_at":"2026-06-28T08:21:49.710283Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2512.06200","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T21:58:59.375947Z","title":"Hnsw index deletion evaluation: Persistent storage ar- tifacts,","venue":null,"work_id":"40fc47e1-228f-48c2-af54-965778a0be3b","year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:c630a89063596b506ac7c75b75fd3b3696db79476f16c6250602f3f63ad585a3","observation_id":"d3682bff-02be-4bfc-8bc7-45ae0234bfd2","resolution":{"observed_at":"2026-07-02T05:16:39.506228Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:9c0e066281d8b5831e059fdb7119689b4a99bf467827889909343f24bc5fcb97","observation_id":"35b2dc93-4102-4df2-8f75-a401ca641331","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":"2022.Semiconductor memory devices and circuits","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:fb6e53cf61f57b2e7c1def018d391bb893bd9e300e89fffa926c87c706de4e81","observation_id":"3dd4aa99-3c1f-44f5-8d19-9aa23c6c8989","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:8d6fe58b3163f8e76434b8768fb25b9cf4ddb5d0fce348045fca4c3def729a4f","observation_id":"f7d9c9b7-5d69-48b8-a75c-7ba3ae03810c","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:c46fadfd9fdf03cd4e62200307636dff4a97d4da4b79eef5c5d63a33cd1187c9","observation_id":"8121ab1f-f9aa-44a9-9227-8975026d2fd2","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T08:21:33.893478Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:a5a9ac941cb1b951bc0df4d5ea9577a1833df09cffba9caf146dd277fedf3afe","observation_id":"801ae425-38ad-40c8-b2eb-d7724f980c14","resolution":{"observed_at":"2026-06-28T08:21:33.893478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":"2507.19802","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.19802","snapshot_observed_at":"2026-07-28T01:22:21.423250Z","title":null,"venue":null,"work_id":"575469bc-a8c6-448c-b57f-180705dd28ac","year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"cited_paper":"/paper/2507.19802","citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:cd9fcb899d2bececc91bdd6172ca7d56adb9512b45b68bcfc190fa5f9e108bee","observation_id":"95d6cfa4-def6-4f2e-9371-fd0d9a324002","resolution":{"observed_at":"2026-07-28T01:22:21.423250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.18234","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T05:16:39.501374Z","title":null,"venue":null,"work_id":"c5a92197-cd58-4dbe-bb58-1cd513456578","year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:b2c9789ac015328cbe6224da40e8b4bcde6a410d78813c567223d19112d24685","observation_id":"f3dbc4bf-160e-4870-8a62-a1d110e8c6fe","resolution":{"observed_at":"2026-07-02T05:16:39.503046Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17152","last_updated":"2026-05-16T05:33:49Z","snapshot_observed_at":"2026-08-12T20:54:15.360404Z","submitted_at":"2025-05-22T11:11:02Z","title":"LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search","version":2},"cited_work":{"arxiv_id":"2505.17152","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.17152","snapshot_observed_at":"2026-07-02T05:16:39.503908Z","title":"LSM-VEC: A Large-Scale Disk-Based System for Dynamic Vector Search","venue":"cs.DB","work_id":"153f2761-8bd9-4a4a-8a7c-6c68628974a0","year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"cited_paper":"/paper/2505.17152","citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:c89f5ea688bd9c153db4c5603ec7b58ccac3a15d8b32ee12f08eb0f627e59921","observation_id":"4211bd25-9fca-459e-93ab-147a85c3ac24","resolution":{"observed_at":"2026-07-02T05:16:39.505266Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","latest_version":1,"primary_category":"cs.AR","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":1,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":46,"verified_exact":11,"verified_fuzzy":0},"total_outbound_references":60},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:2606.03151."}