{"as_of":"2026-08-08T03:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:95ae2785543a46b4bba390f0ac337502546be80e74032c2e5f8370e122a15bc6","coverage":[{"denominator":68,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":68,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:04:31.959245Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T11:49:00.258724Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T03:27:35.708485Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"cited_work":{"arxiv_id":"2507.06653","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.06653","snapshot_observed_at":"2026-07-03T03:27:35.708485Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA, July 2025","venue":null,"work_id":"4c204449-180b-49e3-946a-a1974abfcf8c","year":2025},"citing_paper":{"arxiv_id":"2512.09331","last_updated":"2026-04-04T09:04:44Z","snapshot_observed_at":"2026-07-06T22:38:35.387503Z","submitted_at":"2025-12-10T05:38:59Z","title":"Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANN","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-17T00:01:17.281452Z"},"links":{"cited_paper":"/paper/2507.06653","citing_paper":"/paper/2512.09331"},"observation_digest":"sha256:42e7625fcb115f3c38c2e43105ef5f9f71f822f9fc28a81170257c1a1239272b","observation_id":"98faa792-b317-4e0b-8824-486ea384d5a6","resolution":{"observed_at":"2026-05-17T00:01:22.760806Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"cited_work":{"arxiv_id":"2507.06653","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.06653","snapshot_observed_at":"2026-07-03T03:27:35.708485Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA, July 2025","venue":null,"work_id":"4c204449-180b-49e3-946a-a1974abfcf8c","year":2025},"citing_paper":{"arxiv_id":"2606.02784","last_updated":"2026-06-01T18:49:44Z","snapshot_observed_at":"2026-07-31T18:47:56.958921Z","submitted_at":"2026-06-01T18:49:44Z","title":"LAANN: I/O-Aware Look-Ahead Search for Disk-Based Approximate Nearest Neighbor Search","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-28T11:49:00.258724Z"},"links":{"cited_paper":"/paper/2507.06653","citing_paper":"/paper/2606.02784"},"observation_digest":"sha256:1dafb4f8d7c9f43f5898c3aea00c57a942b86ed6b6b8932eae4fb2038f2ad989","observation_id":"c6a838fa-d1ec-4967-b496-98e65aaa20fe","resolution":{"observed_at":"2026-07-02T01:36:25.215410Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"cited_work":{"arxiv_id":"2507.06653","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.06653","snapshot_observed_at":"2026-07-03T03:27:35.708485Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA, July 2025","venue":null,"work_id":"4c204449-180b-49e3-946a-a1974abfcf8c","year":2025},"citing_paper":{"arxiv_id":"2606.08950","last_updated":"2026-06-08T02:51:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-06-08T02:51:40Z","title":"When More Cores Hurts: The Vector Database Scaling Paradox in HPC","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-06-27T15:19:23.339311Z"},"links":{"cited_paper":"/paper/2507.06653","citing_paper":"/paper/2606.08950"},"observation_digest":"sha256:4d40ca9ab28499d4fb47bac84cee01c3b1d402771600a19a214327efb555223e","observation_id":"7b37c2db-7383-4620-8219-70997ed8bd36","resolution":{"observed_at":"2026-07-03T03:27:35.723089Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.06653/citation-record","integrity":"/paper/2507.06653/integrity","json":"/paper/2507.06653/citation-record.json","paper":"/paper/2507.06653"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:25.997094Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:25.997094Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:a450600c061306fdc11672f092d88c7bd7dc3d33c37388f0af55a6bf86888d51","observation_id":"afbf413f-fb85-418b-ba55-f6e380d8b0ba","resolution":{"observed_at":"2026-08-06T19:04:25.997094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.690083Z","title":null,"venue":null,"work_id":"f6817f8e-cc78-41df-b68b-2195b5538c73","year":2014},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:26.091214Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:4b1d87d89a85db81ea9b4019c21c8008fd38f2403f47bf07a3439af407a35527","observation_id":"ab46fd9b-005d-45d6-9c5c-fcd006621eb7","resolution":{"observed_at":"2026-08-06T19:04:36.692168Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.682502Z","title":null,"venue":null,"work_id":"3dad66a3-4e0a-4f68-b6ff-eea19697e8f7","year":2016},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:26.167124Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:72dc9731296cec5bd737b6c33707fe3c7a7ca0ad6e6522b2482ddaafefb84570","observation_id":"89c14dd8-3606-4753-9ce3-c4e709a8e2c8","resolution":{"observed_at":"2026-08-06T19:04:36.684661Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.674857Z","title":null,"venue":null,"work_id":"868b1303-55e8-4b55-a31e-cfb247f82dd5","year":2018},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:26.243442Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:e4f23b5beccc78e3d9bff58031dfecdec4fdc5563a72c6302a116499957d82e6","observation_id":"ecd83c9e-0625-4ae1-834f-348c8d1dd7cb","resolution":{"observed_at":"2026-08-06T19:04:36.677032Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03216","last_updated":"2025-12-12T11:26:32Z","snapshot_observed_at":"2026-07-06T17:25:35.493362Z","submitted_at":"2024-02-05T17:26:49Z","title":"M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillation","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03216","snapshot_observed_at":"2026-08-06T19:04:26.345094Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:26.345094Z"},"links":{"cited_paper":"/paper/2402.03216","citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:b53a433ed54389840aec4b9fe5032e0ee1f8e4e6df36dbca6c66338dc41a8830","observation_id":"77ff5d73-bb78-42d4-974d-beced64c8c1e","resolution":{"observed_at":"2026-08-06T19:04:26.345094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.669231Z","title":null,"venue":null,"work_id":"b06f5689-f35f-4790-aeaa-f11edbd0b2d3","year":2018},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:26.429593Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:b0530ecd5572c08aa216d35071d906e422dc94adf2e2f6bce1ba0483472ab649","observation_id":"27085be0-d480-408c-b852-f556df66b2d2","resolution":{"observed_at":"2026-08-06T19:04:36.671073Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.661972Z","title":null,"venue":null,"work_id":"7db8ac22-3c36-4586-b5e5-d323589131fc","year":2021},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:26.499831Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:0cfcc52bccf8d77f2d2d78362d0361ea6798654af1b4704c62330a3cddb1c0f8","observation_id":"3cf61494-20ac-4625-a36a-988f38bffcce","resolution":{"observed_at":"2026-08-06T19:04:36.664126Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.655624Z","title":null,"venue":null,"work_id":"c3240d28-1203-49c7-b0fb-405a8771764d","year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:26.584142Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:4336fc90b3f54319bd85cd95997823d57119be4f32694804bf82e64e043e86d1","observation_id":"192b98a3-7862-4382-a9f0-d0a7653657ed","resolution":{"observed_at":"2026-08-06T19:04:36.657629Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.649177Z","title":null,"venue":null,"work_id":"427d2bcc-ad92-43a8-83a1-fde5ce8f7f29","year":2022},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:26.664282Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:38309d8c1dcbf39d960393cc4f64e880d83346b4d9ad8a4faedaa6f5c12f7c79","observation_id":"d3fdad31-1ab1-496f-bd19-10a96a00e6f2","resolution":{"observed_at":"2026-08-06T19:04:36.651198Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:26.737217Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:26.737217Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:d9e8c6a2e9f6dc491697674a458ba7d9f940ea73d285138988579f2c240ff622","observation_id":"7aa402e1-26b4-40a1-ad79-5f620c3ac1bf","resolution":{"observed_at":"2026-08-06T19:04:26.737217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:26.844926Z","title":"Ng Kelvin, Chenyu Jiang, and James Cheng","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:26.844926Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:218aee9b2b48fe13861db5b4f18e58924e6171f9ff8ea387548f4a9fb7831bc3","observation_id":"6d6632f4-9e64-4d8f-ac48-5adfc12c917b","resolution":{"observed_at":"2026-08-06T19:04:26.844926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.638031Z","title":null,"venue":null,"work_id":"3b520758-2473-43db-8fb8-44dd974ec399","year":null},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:26.913120Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:ccfb5bb61d13871811fed0ddaaeef65f4f8edb8b751bc46719cb46689253e312","observation_id":"bbf34de2-38e9-4a13-936b-20add503f273","resolution":{"observed_at":"2026-08-06T19:04:36.640915Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.631714Z","title":null,"venue":null,"work_id":"314e4c82-962b-4f17-9cbe-7bb1b4a375e5","year":2021},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:27.017633Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:6d56350d02fe4c08c14705584e4cf13961a2ea23ceaff913b726f703b90f6ac9","observation_id":"37f74c5b-895a-47a1-b54b-595fffe16535","resolution":{"observed_at":"2026-08-06T19:04:36.633679Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.625315Z","title":null,"venue":null,"work_id":"9530623e-ed16-4193-ac5a-dbdbda7df28d","year":2020},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:27.101752Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:429b7a1de86ed7f28ca24f3db3e6ae523f2a5cf1212d3fd829eab6564db736f6","observation_id":"d5beacdc-b8c9-41f3-80c2-d6a9d19dcc00","resolution":{"observed_at":"2026-08-06T19:04:36.627380Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:27.171695Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:27.171695Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:e5f2e84e26d09fc538e0e4292938f2b53b5eadbd2b530c843c0888e405d4446d","observation_id":"43338205-41bc-4f47-b2f9-f267911eba2d","resolution":{"observed_at":"2026-08-06T19:04:27.171695Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:27.274643Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:27.274643Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:aff8e73f4196c25089e8e4162c3d6c0174189979f124c5e7de8e5365dfb1e9c3","observation_id":"907832a6-fb02-4a0f-99cb-0a5c83657f77","resolution":{"observed_at":"2026-08-06T19:04:27.274643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:27.357561Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:27.357561Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:110d64be787c7e344a1d6e5031391da69b94235f1668676c6fbca393b5be4f1f","observation_id":"e2e9cfee-af01-4a77-8a2c-e067848cd545","resolution":{"observed_at":"2026-08-06T19:04:27.357561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.617173Z","title":null,"venue":null,"work_id":"12d8f87d-b071-4b72-a244-af2056a8904c","year":2020},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:27.429316Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:2af07d619dcefefd204beaba9ed94e11cc6750a10fdc41b3fcc2cb2f5872e904","observation_id":"715326ee-13ab-4824-bdd0-6fdde7005686","resolution":{"observed_at":"2026-08-06T19:04:36.619052Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:27.535935Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:27.535935Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:ebe97490f9a78821d28086ba4846c5d99e9453b54b186acb52f2d47952e3eafe","observation_id":"975b06c3-cc01-4900-b847-c7565c803634","resolution":{"observed_at":"2026-08-06T19:04:27.535935Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.611122Z","title":null,"venue":null,"work_id":"aabe15e1-3c29-4a04-8dad-98ca3f93f988","year":2023},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:27.618812Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:7aa0e5af94b31ba40358b2425f98f63c147194cdf12c190514ca64855ec16717","observation_id":"5ab371e3-4a5d-491f-aa63-22603ee4610a","resolution":{"observed_at":"2026-08-06T19:04:36.613037Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:27.683934Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:27.683934Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:968eed97f9b3cdb28a527e3f714b7895a3bb89392071754f81a90d67ef442d76","observation_id":"9d8b69a8-a501-4e88-aea9-6acf0ef30881","resolution":{"observed_at":"2026-08-06T19:04:27.683934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.596759Z","title":null,"venue":null,"work_id":"1d487872-8a3f-488d-a026-599b0173405f","year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:27.791542Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:7b06ec8ae4c57d871b7343288e9df02c7a7ea68045e29fec81021f21b7a634cc","observation_id":"61931a59-1c58-4532-926c-564cf6613a7c","resolution":{"observed_at":"2026-08-06T19:04:36.600256Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:27.895532Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:27.895532Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:ff94c5d19688d94f43bc9595f5a1d26ad83f2d989ccc541b9d2415b59dbdb960","observation_id":"b7294af2-210b-4ae2-93e6-37798ee5f54c","resolution":{"observed_at":"2026-08-06T19:04:27.895532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.588555Z","title":null,"venue":null,"work_id":"dd49b5ea-4603-4204-afd9-95a8486ceb22","year":2011},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:27.983006Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:30249655493dc01f9762b02df63ffb2bb0517f0bcb0daa4baa842178acd58a47","observation_id":"b4fb76a5-0b8b-405d-9811-af6035620241","resolution":{"observed_at":"2026-08-06T19:04:36.591754Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.581684Z","title":null,"venue":null,"work_id":"ea329a5f-4ddd-4873-aba9-63cedb57a76f","year":2014},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:28.084057Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:b69a837dde2399af56294a8e5b332f58a00f295ca91d445f2da31c7974c97462","observation_id":"b66145f8-81e0-4cc5-a7b7-8ce16e775d44","resolution":{"observed_at":"2026-08-06T19:04:36.583727Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:28.152539Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:28.152539Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:ea9b059130bc368993ca0c334ede44263b5d6be17d736b58a1450322879d9d13","observation_id":"ae4b7cb3-97df-4a87-9773-ffe0bf459edb","resolution":{"observed_at":"2026-08-06T19:04:28.152539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.569991Z","title":"Andersen","venue":null,"work_id":"bef7811b-446e-4637-9183-dcb520fe0cf3","year":2016},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:28.245445Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:4c3f8d9598f03af98b168c0f643d1cdbc7a827112981a722f59c9933a6a22d01","observation_id":"728c3a6d-5dac-4efd-a444-ef3796cf2ba4","resolution":{"observed_at":"2026-08-06T19:04:36.573651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11324","last_updated":"2025-04-12T18:43:50Z","snapshot_observed_at":"2026-08-05T02:46:32.295827Z","submitted_at":"2024-01-20T21:09:19Z","title":"BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11324","snapshot_observed_at":"2026-08-06T19:04:28.327077Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:28.327077Z"},"links":{"cited_paper":"/paper/2401.11324","citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:2c408a5cff6c3f0f130f1b2b9377392df8955a0f6dafdf90fd79e376f8d9f214","observation_id":"df35ce46-9c0a-42f4-9887-c16eb3e0c5f2","resolution":{"observed_at":"2026-08-06T19:04:28.327077Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.562567Z","title":null,"venue":null,"work_id":"7f7a0060-9889-41fa-9234-40a579e8affa","year":2018},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:28.427895Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:43e372f944a29fe61b7a707c41e2e5b6baae240c5c44aed7465b2f7727edec8e","observation_id":"d0c198cb-5e7d-49b3-99b5-2da38ed9ea46","resolution":{"observed_at":"2026-08-06T19:04:36.564594Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3912.17739","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:32.873597Z","title":null,"venue":null,"work_id":"e0b2c381-736b-470b-b21a-4f3ef7026b24","year":2010},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:28.525908Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:3dc12d01049a4e2dafd7d41ac3dd8ebddb4af88ead5fed47b36a4b4d154084ca","observation_id":"6ed81370-f1ee-493b-9a90-9aefb4fdb489","resolution":{"observed_at":"2026-08-06T19:04:32.911320Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.459815Z","title":null,"venue":null,"work_id":"052b08bf-4f9a-4951-b729-8a8c9dbb1eb6","year":2010},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:28.620273Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:54d4ba5a98aba199786d61555371c2a00fd167de4fcfa2a41b13c658e05d4c1b","observation_id":"fe92fd00-8790-431c-b955-d20b21b00d22","resolution":{"observed_at":"2026-08-06T19:04:36.514077Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.312953Z","title":null,"venue":null,"work_id":"96286f5e-6703-41b7-a380-3f9820a04563","year":2019},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:28.736738Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:dfcd22d3d5e4a43f2bc131ee418bafbe2f39f18165ce4f03ee496ffab194cddd","observation_id":"0a16a88a-e2ea-4d01-8d48-56d6bfbd0bb1","resolution":{"observed_at":"2026-08-06T19:04:36.393498Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:28.858289Z","title":"Malkov and D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:28.858289Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:08a059692d3fa7f97193c125c82b51bbe0d633d5fbe08986abf8e5d6c015ff67","observation_id":"540a0887-08e7-418c-a465-e2b74caf9f86","resolution":{"observed_at":"2026-08-06T19:04:28.858289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:28.949608Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:28.949608Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:d823232eb5ed7f981b525826c2dc00638887090d6e52724ea1aeb893c4bba585","observation_id":"7b7d3cbb-2208-4994-8bc3-331594b65d93","resolution":{"observed_at":"2026-08-06T19:04:28.949608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:36.143547Z","title":null,"venue":null,"work_id":"440eaeca-00a2-4eb2-8521-8c2bade10c6a","year":2019},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:29.079932Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:434e0a710930fc13cd4d7629641bf454fe4e24bb77d3e1f0db064234b089e2b1","observation_id":"e3a5aba4-7860-49f3-a98c-2d3bbb003ef6","resolution":{"observed_at":"2026-08-06T19:04:36.275919Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:35.891939Z","title":null,"venue":null,"work_id":"48f6b752-868c-43db-8463-41cd85d8a90b","year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:29.182326Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:4c353b0a595ecf66b948fd99a3518392a1c3603a3bcad2566aa26b283607314e","observation_id":"7ed5dc00-0fc3-472e-9c22-f2118fa4bbfb","resolution":{"observed_at":"2026-08-06T19:04:36.013859Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:35.669206Z","title":null,"venue":null,"work_id":"ba1459ad-cfd9-436a-b639-7fd76ab5e44d","year":2023},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:29.282161Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:e3378ca489875491168e36e9d14c18af443d0e74d476694004ce2e4f434d84e3","observation_id":"ef29841d-1814-4a6a-910f-ac9c05324bd6","resolution":{"observed_at":"2026-08-06T19:04:35.798948Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:29.364052Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:29.364052Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:24b4fbf7f7b54907b20874d973c7ed267691aef8b7b2078789202ee8e9758df3","observation_id":"0061f7f6-4681-495d-93dc-4343500b9e49","resolution":{"observed_at":"2026-08-06T19:04:29.364052Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:35.465437Z","title":null,"venue":null,"work_id":"4c13590b-c43e-4b5c-b054-a48e79d29e85","year":2020},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:29.484782Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:13a1072e7d69f9dee726e244e42a8f171b4e5ad4425ff057c22f9a3ae298410a","observation_id":"c58b609f-b465-4e8a-8ce5-1bfc97bcd3d7","resolution":{"observed_at":"2026-08-06T19:04:35.557694Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:29.611387Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:29.611387Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:62e0683b1c110e1c045ba544370d9fe544fb43a7a8347765f3667f50015200f1","observation_id":"de63f3b5-a720-4678-b1d0-e9a172fe32f0","resolution":{"observed_at":"2026-08-06T19:04:29.611387Z","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":"10.1007/978-3-642-38123-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:32.165829Z","title":"2013.Distributed Termination Detection","venue":null,"work_id":"587b0209-6d15-4bf2-9daf-835792e22236","year":2013},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:29.710449Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:06523da52a19a513dadb30128a065f0f476f92005d83072fd528ecc35ca26687","observation_id":"f97660c7-15e9-42b9-86ee-f0c1945e0c1f","resolution":{"observed_at":"2026-08-06T19:04:32.230734Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:35.223466Z","title":null,"venue":null,"work_id":"b9d7187b-39f3-4446-8aa1-a35cf7a5f877","year":2020},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:29.808280Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:8bf13b4cb010c166b9bf67310f0114cbe89a513ada21e8b1ff2cc52ec3bdc8d4","observation_id":"f09ac508-7963-4f24-b707-054066742c44","resolution":{"observed_at":"2026-08-06T19:04:35.327627Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.02114","last_updated":"2021-11-03T10:16:39Z","snapshot_observed_at":"2026-08-02T08:12:49.547570Z","submitted_at":"2021-11-03T10:16:39Z","title":"LAION-400M: Open Dataset of CLIP-Filtered 400 Million Image-Text Pairs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.02114","snapshot_observed_at":"2026-08-06T19:04:29.877216Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:29.877216Z"},"links":{"cited_paper":"/paper/2111.02114","citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:2f9a8c9782a0b07504f68659934e0f479146c842cfac513f7f981e7fb4148d63","observation_id":"719e5308-3b6a-4bd2-b4ab-165d45fbd02f","resolution":{"observed_at":"2026-08-06T19:04:29.877216Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:35.006615Z","title":null,"venue":null,"work_id":"ef8a356a-5ed3-4825-9b56-91c932c6a17f","year":2022},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:29.965171Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:5af8b16e8bab96f154616207aea790cc329857eee6c928b01323f3c524e10f3b","observation_id":"bf1bcc1f-cb91-413f-aee5-50349fa25182","resolution":{"observed_at":"2026-08-06T19:04:35.119961Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:34.980141Z","title":null,"venue":null,"work_id":"53c935e5-9033-4320-a69d-01e6f9efed26","year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:30.060837Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:ae646fb594f5b0703cc66f04e2f3a9038345bc89e608249c79e29be174684160","observation_id":"84469e41-d835-4e10-b439-c81dae78107e","resolution":{"observed_at":"2026-08-06T19:04:35.000094Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:34.860268Z","title":null,"venue":null,"work_id":"05fd0391-7446-437a-9db8-f28e5c30a614","year":2016},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:30.139000Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:d3f6a16dd956dde0b3e06381486e9bafccd7b5d1dc4b5064ebe981e49a5f6764","observation_id":"837447ac-5d7b-468e-a074-7bf389aca47b","resolution":{"observed_at":"2026-08-06T19:04:34.939010Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:34.774969Z","title":null,"venue":null,"work_id":"37132908-64ea-4e38-a9b7-6eb19372b984","year":2022},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:30.204081Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:77c6736c601c3873c219817ef4e5508443d1f66d3a71d3802719234200432fbc","observation_id":"aefb4ac8-6067-46fe-b793-a3b2ec621290","resolution":{"observed_at":"2026-08-06T19:04:34.817531Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:34.666467Z","title":"2019.DiskANN: fast accurate billion-point nearest neighbor search on a single node","venue":null,"work_id":"38a52983-5fd0-40f1-9dff-e1560883bfdb","year":2019},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:30.339595Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:51a0f6292b9abbb02eebbd55d9ce1cb4ff85a0e03028a30ec9092313cf3d7889","observation_id":"e3f75ddb-1ad5-4f2f-8e29-9240e9f98f46","resolution":{"observed_at":"2026-08-06T19:04:34.713938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:34.575556Z","title":null,"venue":null,"work_id":"de591860-9a16-4c4f-9a8f-8ac845ac92b5","year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:30.460504Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:8bdf69e91097b6a22833dfed170ba9c09a38baecba9b15eea812c61fe281e0c0","observation_id":"a2926336-e575-4de5-b694-82beeae455ab","resolution":{"observed_at":"2026-08-06T19:04:34.606446Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:34.471896Z","title":null,"venue":null,"work_id":"ff36b46f-88a9-4fcc-a0bc-bd94d1314db8","year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:30.590232Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:bc733748263dad3ac46d7192f643da0f755d9d2c989f6dbf27712754453d8682","observation_id":"d81b010e-183c-4a66-970c-173764b57098","resolution":{"observed_at":"2026-08-06T19:04:34.525210Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:34.386409Z","title":null,"venue":null,"work_id":"24d27488-da1a-4f61-b6e2-af944166af91","year":2016},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:30.692763Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:a365c3848222390245e71113faa8f8be010b63aa4facc4084bdfd5188a3798ae","observation_id":"616baca4-12b7-4c46-84bc-8f3a62766757","resolution":{"observed_at":"2026-08-06T19:04:34.428291Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:34.282593Z","title":null,"venue":null,"work_id":"0d2006e7-5f44-4c1e-bc48-4cfef7700237","year":null},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:30.774257Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:dc7df54e90d6cb78dfe57f21d835da014110562c40d8d19681779dfd7d7c0dbb","observation_id":"dc8646b7-e473-43f9-8beb-36ed8e293ba0","resolution":{"observed_at":"2026-08-06T19:04:34.332794Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:30.988417Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:30.988417Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:2f40475e230bc556f604abaaff0247e24245a22158884824706df2d32bc84f8e","observation_id":"19e092a6-27e1-49b5-9809-5b9a772bb52a","resolution":{"observed_at":"2026-08-06T19:04:30.988417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.12631","last_updated":"2021-05-10T08:54:16Z","snapshot_observed_at":"2026-07-06T10:36:50.762036Z","submitted_at":"2021-01-29T15:12:35Z","title":"A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-08-06T19:04:31.095951Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.095951Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:31d26dea8dd66303dfb38bcc69b314a5943dfb21c22a33366d21dcdb76a2de62","observation_id":"afe0f942-b609-4ec6-bd6a-361608ede115","resolution":{"observed_at":"2026-08-06T19:04:31.095951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:31.187997Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.187997Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:3a2938aa2e8c992c5dfe2564d90a6f8b4899ac01c196715568876a73355e1e99","observation_id":"8925b032-7108-4b91-952c-84d3b8b9e3b8","resolution":{"observed_at":"2026-08-06T19:04:31.187997Z","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":"10.14778/3415478","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:32.050209Z","title":null,"venue":null,"work_id":"c6d9813c-22cf-4e37-9e6d-d1aafffc2eba","year":2020},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.222686Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:8b6213f5db99a63e2d487f80f45dac73e00024c6edc7ebf562c1c5b32292dd68","observation_id":"a209be8a-6aa1-4c83-a32b-fa4bf0b3d140","resolution":{"observed_at":"2026-08-06T19:04:32.093220Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:34.185282Z","title":null,"venue":null,"work_id":"54ab6bc0-7ede-46c9-bda5-63ea19180deb","year":2018},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.278162Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:53f6011c83cd291311f13bfd31db71a4d50e4ad4b2fff61c139153bddeb47de6","observation_id":"cfdce1f6-0c41-4961-b420-7fb5ebc8a322","resolution":{"observed_at":"2026-08-06T19:04:34.235323Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:31.414382Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.414382Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:6078693f578e0f35f335bf826eb5b5eeabec47f02d4df910dfbb786ebc5afef7","observation_id":"9437ac0e-7d2b-4a26-b9e1-6066f3e96d5e","resolution":{"observed_at":"2026-08-06T19:04:31.414382Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:31.508034Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.508034Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:bde15b5191b95f0f95ad0587484ec29dd5f06cc7c2fcd77402675d549ffd6fe3","observation_id":"ff589149-556d-4ed6-93c1-280b39884a7f","resolution":{"observed_at":"2026-08-06T19:04:31.508034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:34.096662Z","title":null,"venue":null,"work_id":"8f65a666-ee51-4536-96fd-01ac24dac8d3","year":2018},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.567684Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:f4fc8b35a603bd72a2ff187ad7e3a50f8662a2ee5c697d59c8d143a6034122fc","observation_id":"f1fc4b66-8df5-4155-b9d5-c75fcbb5e74d","resolution":{"observed_at":"2026-08-06T19:04:34.148610Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:34.005438Z","title":null,"venue":null,"work_id":"697585c8-b92d-4bc5-90f7-5ade7240c3aa","year":null},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.614283Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:43a3388a43e86d7115efb38331f5ba62b2ffde7c5633f603a527803f5a1e230a","observation_id":"f8b70131-f28d-4509-a1cd-4c990e88c61d","resolution":{"observed_at":"2026-08-06T19:04:34.046498Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:33.730068Z","title":null,"venue":null,"work_id":"dc88ebda-6016-4419-ac46-9ef9511431d3","year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.716602Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:fa612b53eb6bfdc7daf2b21eea97e14eb5b0a1ca3b8ea1d273c0307acc7a7835","observation_id":"31e8b89d-65bb-4e8d-841d-7b3490286204","resolution":{"observed_at":"2026-08-06T19:04:33.776424Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.19473","last_updated":"2024-06-21T08:26:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-29T18:59:01Z","title":"Retrieval-Augmented Generation for AI-Generated Content: A Survey","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.19473","snapshot_observed_at":"2026-08-06T19:04:31.781660Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.781660Z"},"links":{"cited_paper":"/paper/2402.19473","citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:7eba7b1fb539aa9805d559b52eafb50e4ebb1f903dc1db0bf4f3859138a58bbd","observation_id":"0ff7f0bd-ba23-44ea-b9a5-599a2da5b610","resolution":{"observed_at":"2026-08-06T19:04:31.781660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:33.505681Z","title":null,"venue":null,"work_id":"9d36563d-29b4-478f-a70e-7e132903ec55","year":2021},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.828371Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:de597ff932aa97026d227e09347793cdb8bcc2cd333741874b12943774743931","observation_id":"c44664fe-2e8a-4549-96eb-1c93cc57d4aa","resolution":{"observed_at":"2026-08-06T19:04:33.602588Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:33.368399Z","title":null,"venue":null,"work_id":"73cd0bfc-21f6-4652-859a-541a5cc3e57c","year":null},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.889361Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:931283ed5bac69dcc6e69ec513c3db4dd362376864db0d6fbd45fd4ccd0e3914","observation_id":"3d0ad3e9-22cd-4ecd-957e-287b6aaacf26","resolution":{"observed_at":"2026-08-06T19:04:33.445627Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:31.959245Z","title":"1, 2, Article 131 (June 2023), 26 pages","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.959245Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:8e4386ccd114fc9589c89892813c79cc4147cdcede1d1f5cc855cd1e65219d21","observation_id":"2d30bb2d-f7e0-490a-95fa-17ba9d10d2af","resolution":{"observed_at":"2026-08-06T19:04:31.959245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:30.858920Z","title":"In Proceedings of the 2021 International Conference on Management of Data (Virtual Event, China)(SIGMOD ’21)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:30.858920Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:fa9be66c28d6ad6f3db1f2d8d583e0d5a35d3661ebd74ba13a4b53b72c34a0ae","observation_id":"4774f5fc-47e3-4398-80ef-15399ad0785d","resolution":{"observed_at":"2026-08-06T19:04:30.858920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:04:33.866709Z","title":"In20th USENIX Symposium on Networked Systems Design and Implementation (NSDI 23)","venue":null,"work_id":"d3c327b8-9b68-48c2-833c-4ac58c01e6d8","year":null},"citing_paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:31.657923Z"},"links":{"citing_paper":"/paper/2507.06653"},"observation_digest":"sha256:64e4de1c0baf1ac362ab8fa6094d4b7377c116dac945c3023d693993139d9cc0","observation_id":"8a8f8eb2-d43c-4a23-80bc-d17b8b700ae0","resolution":{"observed_at":"2026-08-06T19:04:33.933895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.06653","last_updated":"2025-07-09T08:36:20Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-06T18:55:30.207022Z","submitted_at":"2025-07-09T08:36:20Z","title":"Towards Efficient and Scalable Distributed Vector Search with RDMA"},"reference_resolution":{"displayed":68,"state_counts":{"malformed_identifier":5,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":58,"verified_exact":1,"verified_fuzzy":3},"total_outbound_references":68},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 68 of 68 outbound references and 3 inbound Pith citation observations for arXiv:2507.06653."}