{"as_of":"2026-08-13T10:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17e2140b890047c95cf27b7782da03c30b5a34bf7f9911289f843814a006a338","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-19T18:23:28.252547Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2604.09173/citation-record","integrity":"/paper/2604.09173/integrity","json":"/paper/2604.09173/citation-record.json","paper":"/paper/2604.09173"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cassandra","venue":null,"work_id":"1fd7f730-286c-4a7e-9a03-14134d385fcd","year":2025},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:b6b6a2467c44d7ede01110d53b7e9e050d3238a6de413784e260661e70bbc247","observation_id":"5ee883c9-1579-4282-9451-64b2ecbf0798","resolution":{"observed_at":"2026-05-19T18:27:43.897135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Language models are few-shot learners.Proc","venue":null,"work_id":"86fe48dd-a5c8-4ff4-8046-4939b9720674","year":2020},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:51da49134c32dddb7a0d5d1b61f7d65af210e65b093015f712e9c418bca7a05d","observation_id":"cf5b9d99-764b-4d8a-9f37-4f246a729398","resolution":{"observed_at":"2026-05-19T18:27:43.871235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4ef0b7a2-64dd-409c-a5bd-1c165de0d5df","year":2020},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:f3da545aaa7aa185eab159ebffbe7203b94505ff3a5711c9b499c0cba906c524","observation_id":"f6678aca-dcdf-4945-8ce9-829a788e6a0f","resolution":{"observed_at":"2026-05-19T18:27:43.876041Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Hsieh, Deborah A","venue":null,"work_id":"cb5d9d16-fa9a-4d40-acb7-63989a7c1523","year":2006},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:ddb65fb68b3ec29c30479cb3d91167dfeb2cc0b096c0304b453fc6e244365c81","observation_id":"6d12e7e2-fc2c-422f-a322-0427154d6b50","resolution":{"observed_at":"2026-05-19T18:27:43.885927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Sptag: A li- brary for fast approximate nearest neighbor search","venue":null,"work_id":"7276f1cd-8198-4bf3-9721-e36e9de987dc","year":2018},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:6050c1c222449d0bb9720c5a28685f2ae31f23b1e5f55cd00fabfbfb66bd7105","observation_id":"1397c36c-e50d-42b1-b3dd-f1d480cdee37","resolution":{"observed_at":"2026-05-19T18:27:43.903610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"SPANN: Highly-efficient billion-scale approx- imate nearest neighborhood search.Proc","venue":null,"work_id":"601b4137-af4d-45bd-8b64-6dec84673bf7","year":2021},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:cdf0c81e753f861532b032f238bd934dd2bf5bd5fd6edd62b8632887001a746a","observation_id":"23f19089-4fd6-4579-9a1d-5510c1f6410e","resolution":{"observed_at":"2026-05-19T18:27:43.883675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a68770e1-6145-4d30-a9d3-b93c3a40c774","year":2011},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:98fb79ca4a341703dbf33836fbaecee1d4ae16ac2a080685198f430d9c4d22b0","observation_id":"9e281422-fae3-4ad5-a4e6-9b895c85b694","resolution":{"observed_at":"2026-05-19T18:27:43.894458Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Deep neural networks for YouTube recommendations","venue":null,"work_id":"2698af52-c4a8-4212-9148-4fb7192b3426","year":2016},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:f5223786a586630115ccd5888970ad299f0fc11431327befaa3c0378b2dcb7c4","observation_id":"0b6be513-38b9-4b81-9c6a-078a0ca49233","resolution":{"observed_at":"2026-05-19T18:27:43.901453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1311.2540","last_updated":"2014-01-06T11:35:10Z","snapshot_observed_at":"2026-08-08T01:03:44.466292Z","submitted_at":"2013-11-11T19:21:53Z","title":"Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding","version":2},"cited_work":{"arxiv_id":"1311.2540","doi":null,"metadata_source":"pith","pith_arxiv_id":"1311.2540","snapshot_observed_at":"2026-07-04T10:29:45.534188Z","title":"Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding","venue":"cs.IT","work_id":"98a5f432-b8a7-4070-b535-be281b7c7a81","year":2013},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"cited_paper":"/paper/1311.2540","citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:528dc2f52beb667b6b170e23f7e86db506c9edc77d55dd851059aa3693e8b6a8","observation_id":"17451246-71ea-47d3-a6c2-8f6b99d903f9","resolution":{"observed_at":"2026-05-19T18:27:43.089644Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Efficient storage and retrieval by content and address of static files.Journal of the ACM (JACM), 21(2):246--260","venue":null,"work_id":"23863f5f-ca60-4eaa-9567-50292335d485","year":1974},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:5690be3332d40e4760df84d7c0a274910cff33555e6c2f6241d560a21a719478","observation_id":"f8e361e3-bf0b-4eec-92c7-9a9a75f765a7","resolution":{"observed_at":"2026-05-19T18:27:43.881202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Massachusetts Institute of Technology, Project MAC","venue":null,"work_id":"bd616272-2b75-4d1d-99ac-5f00b028eb1f","year":1971},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:bbf4ce6e1ec40cf7bdfce26c90fa62d68be56c75881234f770b19b4e99d731a8","observation_id":"c71189b7-870f-43a6-8e80-b1639f746384","resolution":{"observed_at":"2026-05-19T18:27:43.892305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Fast approximate nearest neighbor search with the navi- gating spreading-out graph.Proceedings of the VLDB Endowment, 12(5):461--474","venue":null,"work_id":"5e8782c9-9140-46f6-9730-77f12c2fa8be","year":2019},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:6bd08293cd2cd5252272566b5d7bc94ec24ac9d0c4c09028c63fbd857c275df9","observation_id":"e859c60b-05e1-4ddf-bc00-aff75ad9ceef","resolution":{"observed_at":"2026-05-19T18:27:43.888145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"RabitQ: Quantizing high-dimensional vectors with a theoretical error bound for approximate nearest neighbor search.Proc","venue":null,"work_id":"e7ab947c-4505-4930-81b4-79b2a9c72c02","year":2024},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:b3cf24a5bf1ee9a9205d52a464c7dd44018ad03acc1baf1fa721a0a9a52758fa","observation_id":"bc600a7d-b86e-4b47-a80c-03086ab48d77","resolution":{"observed_at":"2026-05-19T18:27:43.873735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10997","last_updated":"2024-03-27T09:16:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-18T07:47:33Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","version":5},"cited_work":{"arxiv_id":"2312.10997","doi":"10.1186/1476-072x-8-72","metadata_source":"pith","pith_arxiv_id":"2312.10997","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","venue":"cs.CL","work_id":"b80d2790-6cd9-4c87-b3c4-de404f99a80e","year":2023},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:357df356de62280bfcfe5c794c0dd647dd4f776bf74cf41eb0fef8a9446c3816","observation_id":"e11cfeaf-bacd-459a-b84a-900fa281402b","resolution":{"observed_at":"2026-05-19T18:27:43.093616Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Op- timized product quantization.IEEE Trans","venue":null,"work_id":"03f86600-5044-4e17-82d7-a44e8e6f331b","year":2013},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:faed65fb97960aa688d8aba301c81105a5b7911003c4f4b14c593b920da9d5e1","observation_id":"185c0bf4-02d6-415d-a569-8a5b01812888","resolution":{"observed_at":"2026-05-19T18:27:43.890282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Succinct","venue":null,"work_id":"14770ae6-06f9-42fa-b275-3d830c43b84a","year":2017},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:9d1b1afc458973c316f9f928f628fb57cb4b00a53f919cd1043f04fa1e0172e7","observation_id":"cc5e8031-f281-487f-9a42-a64582cadb0f","resolution":{"observed_at":"2026-05-19T18:27:43.899221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Real-time person- alization using embeddings for search ranking at airbnb","venue":null,"work_id":"ec67b2d6-62ec-4c40-80bb-27c26bcbc914","year":2018},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:e6a2704d3e3d8e4c5701398325b9bfaa13f72f992c4ce05292da94b6e25541b1","observation_id":"d9ab0e50-abe8-4de7-9011-6b58b4a4fe12","resolution":{"observed_at":"2026-05-19T18:27:43.878660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Achieving low-latency graph- based vector search via aligning best-first search algo- rithm with SSD","venue":null,"work_id":"d103f4f1-49fe-4723-bd64-f5f1e937e963","year":2025},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:a3ead86be8cbd6a23472f1bc60dcb4fbfcbe9d30dd3b8f43614ecdee8de138a1","observation_id":"8b554f78-8530-43ff-9ab6-82d2915c24c8","resolution":{"observed_at":"2026-05-19T18:33:10.527432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"OdinANN: Direct insert for consistently stable performance in billion-scale graph- based vector search","venue":null,"work_id":"c59d1aba-6051-415c-800b-4f1110a33679","year":2026},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:0db8993139c198a234e7f3baeb8769800e31302d2ea403527ae752dab0a9c21a","observation_id":"68041a38-69fe-4643-854c-47504de35d3f","resolution":{"observed_at":"2026-05-19T18:33:10.519155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Research talk: Approximate nearest neighbor search systems at scale","venue":null,"work_id":"12dc857c-8168-418f-8003-34379f064e00","year":2022},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:f607e526ef438b9b142bb232d8a1637c9be02048434372a5f0b639a4dddad4e4","observation_id":"144a2a17-fdbf-4499-9d40-379dcc7c448b","resolution":{"observed_at":"2026-05-19T18:32:44.005270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"ZipNN: Lossless compression for AI models","venue":null,"work_id":"806e3aec-a112-492d-991a-4da5f4fd7086","year":2025},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:c33d724e2c577fffdcbfe9ad6788b794e3dd2cf235923575edbc0ae4d6a6d559","observation_id":"0e1eb7ff-89a4-42e5-a61a-4641769ced30","resolution":{"observed_at":"2026-05-19T18:32:44.000969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"AI and the future of unstructured data","venue":null,"work_id":"96276f77-08f6-4ad4-915f-6d2a24102686","year":2025},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:336711d740aab5ff80f0a4e7056b9071bc2994f6a0b344633a1a6ae523a4d502","observation_id":"72501cd3-fe26-41a3-81d0-5d5627cd4bf7","resolution":{"observed_at":"2026-05-19T18:32:44.003160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"AI data centers are swallowing the world’s memory and storage supply, setting the stage for a pricing apocalypse that could last a decade","venue":null,"work_id":"9538c151-fb6f-403d-a742-227fd47f2a05","year":2025},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:fe9ff389ca83f1c12f66675093f69bf906e7385f27a98e3a5a8892b39b9b513e","observation_id":"ebf9389b-a5a4-4192-88ec-66f4723db791","resolution":{"observed_at":"2026-05-19T18:32:44.009623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"DiskANN: Fast accurate billion-point near- est neighbor search on a single node.Proc","venue":null,"work_id":"ca17c62f-d1bd-4080-8113-c396d9470958","year":2019},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:4eaf51d420375b8cef5134506b6ca98d5ba11d5e9a631b43d0f79b8116f21fe6","observation_id":"974ab200-c010-40f7-9696-8feaeaf0ddb3","resolution":{"observed_at":"2026-05-19T18:32:43.994821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Product quantization for nearest neighbor search.IEEE Trans","venue":null,"work_id":"1355057a-3d75-46df-8cef-1f06b6d12058","year":2010},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:a9d403db80f4a24adca292478980168f14e009983f73889ab46cc3b366983e79","observation_id":"04ba0d01-16c0-4b0d-b94c-dd36e1f27493","resolution":{"observed_at":"2026-05-19T18:32:43.988450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Searching in one billion vectors: re- rank with source coding","venue":null,"work_id":"718e2cc5-dc80-4d83-9b81-1afe84134138","year":2011},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:1e71acc4b1fd52abda7066cd0005f633ae9cf19ca8de0a55cb3eac4464f7b242","observation_id":"a2358e3d-73ac-49b3-bb6d-3e5e089e163a","resolution":{"observed_at":"2026-05-19T18:32:43.990522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Introducing the Mil- vus Sizing Tool: Calculating and Optimizing Your Milvus Deployment Resources","venue":null,"work_id":"6cd38a73-c60c-412d-a572-7704f38f42ed","year":2025},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:63092573a5c76e87f6ede8c0dedc3b3198f4f6ffa912fb0c6fb8f5a943652361","observation_id":"917e5989-c2a6-44eb-9696-44bb7872a30e","resolution":{"observed_at":"2026-05-19T18:32:43.992663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Dynamic Huffman coding.Journal of Algorithms, 6(2):163--180","venue":null,"work_id":"fe7813dc-f6c8-4f1e-b43d-073dafb80fff","year":1985},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:6ca6afc87da9247794fa0d89609797ed259233d20ad68a94549a2ad6f8e5bb43","observation_id":"65086b1a-79c6-4599-893d-dfee35202ce9","resolution":{"observed_at":"2026-05-19T18:32:43.996856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Datasets for ap- proximate nearest neighbor search","venue":null,"work_id":"4b90b060-0421-44f6-b683-921585542815","year":2010},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:a273e3636f14cc061c75e2c28fff738d8cc0cfb850bf650f4d815355284de80a","observation_id":"4ec97a2d-ee6a-4426-a573-6c627a157e73","resolution":{"observed_at":"2026-05-19T18:32:43.999003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"VStore: in-storage graph based vector search accelerator","venue":null,"work_id":"5357e733-211f-46be-b4bb-0c14eca05f8a","year":2022},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:cff23500904815c2d0cf8b166a2f0994d97b7af42564aa26e7542f5eec50dfc2","observation_id":"9d7ebe56-b913-451e-8632-de939496bbdf","resolution":{"observed_at":"2026-05-19T18:32:44.007393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Efficient and robust approximate nearest neighbor search using hier- archical navigable small world graphs.IEEE Trans","venue":null,"work_id":"1b09231d-c398-4bb7-8945-ac55479a0959","year":2018},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:363b8f9dc2c7e1018e59f6e43430a1b050a1525d8ce230f52425d4ae576f7799","observation_id":"63eae2b6-2bab-43a8-82f7-1ed22c51f31d","resolution":{"observed_at":"2026-05-19T18:32:44.014086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"SPTAG issue #416: Segmentation fault when building SIFT1B","venue":null,"work_id":"509a177c-59f9-4aa1-9498-a3259e0ec581","year":2024},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:e46200244b641d58f8a7edc635d728699c7ce327549df29ab4e5b49f050711e4","observation_id":"19ae1c0d-dda4-49b0-a9f8-266c83dd7734","resolution":{"observed_at":"2026-05-19T18:32:43.986381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Flann-fast library for approximate nearest neighbors user manual.Computer Science Department, University of British Columbia, Vancouver, BC, Canada, 5(6)","venue":null,"work_id":"e964e46a-f274-41e6-bbfb-cbc672c43432","year":2009},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:41f64a6e7b60f40e2a4b2802425c917e02176f0ea322ce9530594f1ad1f5a4bf","observation_id":"d675f9d3-ddeb-4863-bd64-0b4ab09ca34b","resolution":{"observed_at":"2026-05-19T18:32:44.011859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"BIG ANN-Benchmarks","venue":null,"work_id":"2460e502-0479-4aa3-889b-87846da7fde4","year":2021},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:bbf6a567b1fbecc7d4df5423297462ba645e76d23bc5c3a4a4ea5fe3a3e244ff","observation_id":"271769e8-ac89-4421-9d52-f9dd3529489c","resolution":{"observed_at":"2026-05-19T18:33:10.517132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Fm- delta: Lossless compression for storing massive fine- tuned foundation models.Proc","venue":null,"work_id":"b6d6a29d-c73a-4c76-b92e-b527b07ba5ad","year":2024},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:8b92701516442720c04436592adcc9d3b66573bdfebb8c1114ed876ce89aa293","observation_id":"4fee9792-9ad3-4f13-a0cc-ffe8545704e0","resolution":{"observed_at":"2026-05-19T18:33:10.507141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"The ChatGPT Retrieval Plugin lets you easily search and find personal or work documents by ask- ing questions in everyday language","venue":null,"work_id":"12363ac9-d4e1-4a7c-aab3-254187c9c11d","year":2023},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:c86a60cdd91f91940ba84e73eab162f0dbab28f82127fc03c28967bd6a9abcc1","observation_id":"74178c63-7fe3-4280-8844-e2e2ed9cf208","resolution":{"observed_at":"2026-05-19T18:33:10.524706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Partitioned elias-fano indexes","venue":null,"work_id":"68915bcd-647a-4af8-a796-7c6f29607057","year":2014},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:7876fdcf9abeda10a97e6178ff47cac0986466e7e05687ce04cb2fae8f34dcd1","observation_id":"05b40148-c6cc-492b-9d2f-12e658b48c4b","resolution":{"observed_at":"2026-05-19T18:33:10.505155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"TiKV.https://tikv.org","venue":null,"work_id":"2ab42f67-d660-4d7b-a23b-458653815b34","year":2025},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:c83281c68e6fb0df46b97c650f3cc76f48f5e6dcf149e456b3b389f969437b4d","observation_id":"9a44c74a-0590-48b6-8a1d-aca0a368da15","resolution":{"observed_at":"2026-05-19T18:33:10.506935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Sentence-bert: Sen- tence embeddings using siamese bert-networks","venue":null,"work_id":"fb8cef27-27f4-459a-8b5e-9b14154c7b6f","year":2019},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:d19180c10abb065677bb99a3dbd887e8b72fcb7bb21b7851ffc6d5dcde21d8a7","observation_id":"89f8d4d6-c2dd-4390-9e13-61cd79523be2","resolution":{"observed_at":"2026-05-19T18:33:10.529238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"FPGA-based lossless data compression using Huffman and LZ77 algorithms","venue":null,"work_id":"ee5bd391-41a1-48d0-ae8d-0d7cd900572b","year":2007},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:b59b25793dd98051672ec9329d890af491b2722a096f4d431e919c4792ff1eba","observation_id":"d8efeb0d-adeb-4530-856e-8612f13e9022","resolution":{"observed_at":"2026-05-19T18:33:10.509695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"A mathematical theory of commu- nication.The Bell system technical journal, 27(3):379-- 423","venue":null,"work_id":"70c7a0c0-0eb2-4a7f-9ab1-6dec0a94c88c","year":1948},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:f20565ffefc18f76e79f1a78e0f070091354cca4595fa082f619b26fdb64adc3","observation_id":"f982d8b0-f845-45f8-a1bc-5a18cbaf6ab6","resolution":{"observed_at":"2026-05-19T18:27:43.905691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09613","last_updated":"2021-05-20T09:17:13Z","snapshot_observed_at":"2026-08-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":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"cited_paper":"/paper/2105.09613","citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:d9d96e391ea527af6f98c48df59269ae312487cec2d1ae93a2734797a2519c96","observation_id":"316b4664-9369-484d-8726-6f4c2fa040d5","resolution":{"observed_at":"2026-05-19T18:27:43.097573Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Scalable billion-point approximate nearest neighbor search using SmartSSDs","venue":null,"work_id":"b8eea6d3-a389-4243-9270-04c1d37c4a55","year":2024},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:5637198e77ea7b2c64e581ad8643a7134f13d7d6bec8127cc69aa72b5eb52df4","observation_id":"fb95c9bc-6c6a-4d21-91b5-5af6874a17f9","resolution":{"observed_at":"2026-05-19T18:33:10.515764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Towards high- throughput and low-latency billion-scale vector search via CPU/GPU collaborative filtering and re-ranking","venue":null,"work_id":"1910d4c8-3024-45ce-a57e-cab2c9ff5aee","year":2025},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:88ab39ad27237f78631a547c32bc1051f76f69fbb8cdb8fccb828b3fdb9cc1e5","observation_id":"1116ab7a-6344-4704-a439-e2e54d0b57f9","resolution":{"observed_at":"2026-05-19T18:33:10.530332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"The relative neighbourhood graph of a finite planar set.Pattern recognition, 12(4):261--268","venue":null,"work_id":"733dc31a-0792-41a3-b8e4-9edda676962f","year":1980},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:718d5a6c7c45bc27b48e93681a9c687ae7de122a48bd572a60db90aa2974a71f","observation_id":"8f0055d9-2784-498e-8c63-5be960983266","resolution":{"observed_at":"2026-05-19T18:33:10.492831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"DiskANN: Graph-structured Indices for Scalable, Fast, Fresh and Filtered Approximate Nearest Neighbor Search","venue":null,"work_id":"b0bfbb52-1502-402f-a517-542844b68d54","year":2023},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:548a5e940f5a04322101980a4ece4ee420ab3ce1c5c77800c964cab8b59f6457","observation_id":"c7c75c1f-30dc-4421-8b4e-08afa5941769","resolution":{"observed_at":"2026-05-19T18:33:10.515547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"MILC: Inverted list compression in memory.Proceedings of the VLDB Endowment, 10(8):853--864","venue":null,"work_id":"854b4508-fc1d-4a91-9199-187b4469e6f8","year":2017},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:d4ff1cf548a72cd2bc6aa410d1847161578f34074e71d997d647ae8df85e2d54","observation_id":"d26fd20e-1777-4612-911f-5f29692bda96","resolution":{"observed_at":"2026-05-19T18:33:10.511780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Starling: An I/O-efficient disk-resident graph index framework for high-dimensional vector similarity search on data segment.Proc","venue":null,"work_id":"bffdd069-fb5e-4bf5-9b6b-76c011c55c5b","year":2024},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:eb7ef9409e6ef686156e1fcd9eb3f8d9d437dad68257b6b37f166c143e8c0165","observation_id":"f26265ba-0eb3-4b49-8b17-3093389fd920","resolution":{"observed_at":"2026-05-19T18:33:10.522880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"ZipLLM:towards efficient LLM storage reduction via tensor deduplication and delta com- pression","venue":null,"work_id":"5afb6106-b61a-4386-8b3a-448c799f4a43","year":2026},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:82beb56d65197feeb901280e6c9ecf414ee80015a221f0e6335cafd04fa856f2","observation_id":"9a204326-ee12-415f-a896-3b403dcdabc7","resolution":{"observed_at":"2026-05-19T18:33:10.521010Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Configure replication in Weaviate ANN service","venue":null,"work_id":"99aa57b8-263b-4998-b536-bfbb7dc0903e","year":2025},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:9128a0a1371438612980d62e7f8f0eb1bf0817ff3f30578d00b08c027b17dc2f","observation_id":"290465f0-d95a-4157-8057-c18344cd2b57","resolution":{"observed_at":"2026-05-19T18:33:10.531117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13826","last_updated":"2025-02-19T15:41:08Z","snapshot_observed_at":"2026-08-07T18:04:40.708988Z","submitted_at":"2025-02-19T15:41:08Z","title":"In-Place Updates of a Graph Index for Streaming Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2502.13826","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.13826","snapshot_observed_at":"2026-07-02T04:56:38.912566Z","title":"In-place updates of a graph in- dex for streaming approximate nearest neighbor search","venue":null,"work_id":"5df76726-c438-4944-8487-1967e1ecdd6a","year":2025},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"cited_paper":"/paper/2502.13826","citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:3abf86c983d5237ee472c532936c0138767a168eb6250cd07d0c9da665a2d155","observation_id":"112e565a-dc3e-4023-b9cb-a36ab71c7eed","resolution":{"observed_at":"2026-05-19T18:27:43.101206Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"SPFresh: Incremental in- place update for billion-scale vector search","venue":null,"work_id":"93e47047-de9f-436a-870c-72c61d93bc9d","year":2023},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:8df0ce3b1e6127337ae1ab2b69ae4d1bbcf53a533554ec6c7bfeef2ddb1f5399","observation_id":"4467f1e5-5eef-47c6-9da2-c189fe2a27ff","resolution":{"observed_at":"2026-05-19T18:33:10.523203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"New Generation Entropy coders","venue":null,"work_id":"2946b13b-44eb-4ca9-a55a-723c3a46ab7a","year":2019},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:35fa08b8eb06cad8be875a24cffbc5dd66ecb8ec8abc67139d5da024b8b08a46","observation_id":"5655aa70-5034-4766-85de-7fce752db7de","resolution":{"observed_at":"2026-05-19T18:33:10.519650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Finesse: Fine-grained fea- ture locality based fast resemblance detection for post- deduplication delta compression","venue":null,"work_id":"9412ae6b-b84a-4969-8b4b-3f0776ea647a","year":2019},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:176c50a68266e626beeac3df021bff7d35ed71bd5afefc4c67feb96db35f1e8b","observation_id":"5d7b18ac-68d3-462f-8b06-3b77cc19c54e","resolution":{"observed_at":"2026-05-19T18:33:10.525083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-05T21:23:00.469572Z","title":"Fast vector query processing for large datasets beyond GPU memory with reordered pipelining","venue":null,"work_id":"e1c0baed-d084-4a92-afbc-e726f748a0f6","year":2024},"citing_paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-05-19T18:23:28.252547Z"},"links":{"citing_paper":"/paper/2604.09173"},"observation_digest":"sha256:b745e76f3d8526f3bed89673d5e04bd43dde61bb3a25ee1991e8e158f31125fc","observation_id":"b11748b6-9ba0-407f-aa1a-5d1dd74422d2","resolution":{"observed_at":"2026-05-19T18:33:10.521457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.09173","last_updated":"2026-05-15T14:16:47Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-07-06T22:58:08.579543Z","submitted_at":"2026-04-10T09:58:17Z","title":"Decoupling Vector Data and Index Storage for Space Efficiency"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":4,"verified_fuzzy":49},"total_outbound_references":55},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 0 inbound Pith citation observations for arXiv:2604.09173."}