{"as_of":"2026-08-08T11:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3df6213b85adfce272428a0f116b7c162532c17be071f937450972948a28fceb","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":18,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:57:07.783210Z","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-03T13:38:18.618313Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"2101.12631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-07-03T13:38:18.618313Z","title":"Zhu and C","venue":null,"work_id":"c7db8287-3c74-4a45-97c2-59ffab9262f8","year":2021},"citing_paper":{"arxiv_id":"2401.08281","last_updated":"2025-10-23T09:36:08Z","snapshot_observed_at":"2026-07-31T05:45:37.385210Z","submitted_at":"2024-01-16T11:12:36Z","title":"The Faiss library","version":4},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-05-12T01:47:19.947054Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2401.08281"},"observation_digest":"sha256:8a88ac6b0283997dadc8fad295ce0c9058d7101f7d4f57ae5cc3f3a5ca912e41","observation_id":"20d7b6c0-f464-40da-a37e-a9f7ab6aa920","resolution":{"observed_at":"2026-05-12T01:47:20.123178Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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-07T14:57:07.783210Z","title":"A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.17368","last_updated":"2025-05-23T00:42:01Z","snapshot_observed_at":"2026-08-07T14:46:04.189403Z","submitted_at":"2025-05-23T00:42:01Z","title":"HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:57:07.783210Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2505.17368"},"observation_digest":"sha256:96fb3f3dd7a6cd28030e696d21e974f9993c8b103fc249d20cadcf3ad4b5c418","observation_id":"f02727ec-0c7a-4397-9b63-efe57681eff5","resolution":{"observed_at":"2026-08-07T14:57:07.783210Z","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-07T14:24:59.818976Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.818976Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:b1f9fd4f768856fc37f4b2f781c445b8ae0b7c7664bd1b88a78bcdadcef16ea5","observation_id":"f82dfc86-4986-4ff0-a641-3055e32145f1","resolution":{"observed_at":"2026-08-07T14:24:59.818976Z","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-07T12:02:12.767128Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.00812","last_updated":"2025-06-01T03:27:52Z","snapshot_observed_at":"2026-08-08T05:54:02.701477Z","submitted_at":"2025-06-01T03:27:52Z","title":"VecFlow: A High-Performance Vector Data Management System for Filtered-Search on GPUs","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:12.767128Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2506.00812"},"observation_digest":"sha256:c5339b1676ae6587389a5b778ed9cddac66ff7ff81aa9e54d14232458e19b649","observation_id":"5b1595a4-10f9-4bba-8906-aab41850ba4c","resolution":{"observed_at":"2026-08-07T12:02:12.767128Z","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-07T11:24:03.353505Z","title":"A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.02617","last_updated":"2025-06-03T08:34:01Z","snapshot_observed_at":"2026-08-07T13:13:09.422792Z","submitted_at":"2025-06-03T08:34:01Z","title":"Toward Understanding Bugs in Vector Database Management Systems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T11:24:03.353505Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2506.02617"},"observation_digest":"sha256:46cb543126574ede9a16f0582850994ab70ed81beba0631f1406ebd38fee3b60","observation_id":"1f02c547-0b9d-406f-80e9-e8d17d4a710f","resolution":{"observed_at":"2026-08-07T11:24:03.353505Z","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-06T21:11:18.497723Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.01079","last_updated":"2025-07-01T15:12:14Z","snapshot_observed_at":"2026-08-07T22:22:25.146557Z","submitted_at":"2025-07-01T15:12:14Z","title":"MobileRAG: A Fast, Memory-Efficient, and Energy-Efficient Method for On-Device RAG","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T21:11:18.497723Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2507.01079"},"observation_digest":"sha256:0b7f413e28d348972cb293ec56a6d5cd2cc5239368d8452a7929fad337ecb9d0","observation_id":"1bdd7730-6fd7-481f-81a3-59eed0f83af3","resolution":{"observed_at":"2026-08-06T21:11:18.497723Z","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":{"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-06T16:50:49.265489Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.12378","last_updated":"2025-07-16T16:27:05Z","snapshot_observed_at":"2026-08-07T10:39:07.023233Z","submitted_at":"2025-07-16T16:27:05Z","title":"Developing Visual Augmented Q&A System using Scalable Vision Embedding Retrieval & Late Interaction Re-ranker","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T16:50:49.265489Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2507.12378"},"observation_digest":"sha256:872b2e4afed64b59326a5effa9c23ca318cfdaf06ee768280c2ce8f94e3d463d","observation_id":"2a267967-517c-431e-a391-89151e28d3b4","resolution":{"observed_at":"2026-08-06T16:50:49.265489Z","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-04T21:44:47.864277Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.07789","last_updated":"2025-09-09T14:23:30Z","snapshot_observed_at":"2026-08-04T21:44:42.133686Z","submitted_at":"2025-09-09T14:23:30Z","title":"Filtered Approximate Nearest Neighbor Search: A Unified Benchmark and Systematic Experimental Study [Experiment, Analysis & Benchmark]","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T21:44:47.864277Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2509.07789"},"observation_digest":"sha256:90537c654fb4ab7233cced5494821b69c0d911d80c3730a713431958698dc0f0","observation_id":"34b6b4ed-22f5-461e-81a1-392caf5d418d","resolution":{"observed_at":"2026-08-04T21:44:47.864277Z","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":"2101.12631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-07-03T13:38:18.618313Z","title":"Zhu and C","venue":null,"work_id":"c7db8287-3c74-4a45-97c2-59ffab9262f8","year":2021},"citing_paper":{"arxiv_id":"2605.02171","last_updated":"2026-05-17T16:31:28Z","snapshot_observed_at":"2026-08-02T11:42:52.472108Z","submitted_at":"2026-05-04T03:04:12Z","title":"QuIVer: Rethinking ANN Graph Topology via Training-Free Binary Quantization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-12T01:53:07.106889Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2605.02171"},"observation_digest":"sha256:bcb2874545e1cee14aea840c8330367a402d193ba8415b62d33ff2d8d9452ae6","observation_id":"8351dc78-dc5a-4c06-9f4f-bb50a0d98ea0","resolution":{"observed_at":"2026-05-12T07:46:45.360631Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"2101.12631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-07-03T13:38:18.618313Z","title":"Zhu and C","venue":null,"work_id":"c7db8287-3c74-4a45-97c2-59ffab9262f8","year":2021},"citing_paper":{"arxiv_id":"2605.02171","last_updated":"2026-05-17T16:31:28Z","snapshot_observed_at":"2026-08-02T11:42:52.472108Z","submitted_at":"2026-05-04T03:04:12Z","title":"QuIVer: Rethinking ANN Graph Topology via Training-Free Binary Quantization","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-21T01:12:03.533368Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2605.02171"},"observation_digest":"sha256:13c96bbc0ac751694839ba29789e55549f6fb8f24cabced9219d559c115cd4c4","observation_id":"89ece4dd-063e-4f1a-86e8-e2270aba97a8","resolution":{"observed_at":"2026-05-21T01:13:54.406326Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"2101.12631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-07-03T13:38:18.618313Z","title":"Zhu and C","venue":null,"work_id":"c7db8287-3c74-4a45-97c2-59ffab9262f8","year":2021},"citing_paper":{"arxiv_id":"2605.10135","last_updated":"2026-05-11T07:46:07Z","snapshot_observed_at":"2026-07-06T23:22:08.560919Z","submitted_at":"2026-05-11T07:46:07Z","title":"ScaleGANN: Accelerate Large-Scale ANN Indexing by Cost-effective Cloud GPUs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-12T04:53:42.872514Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2605.10135"},"observation_digest":"sha256:6ef058a95b50ed27ad1c822a0556670918c456eaf92847a5ec464abe4f096870","observation_id":"079035fb-954b-4121-8f4a-c8c76d590897","resolution":{"observed_at":"2026-05-12T05:51:24.707780Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"2101.12631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-07-03T13:38:18.618313Z","title":"Zhu and C","venue":null,"work_id":"c7db8287-3c74-4a45-97c2-59ffab9262f8","year":2021},"citing_paper":{"arxiv_id":"2605.14343","last_updated":"2026-05-14T04:07:05Z","snapshot_observed_at":"2026-07-06T23:25:49.545418Z","submitted_at":"2026-05-14T04:07:05Z","title":"Nearest-Neighbor Radii under Dependent Sampling","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-05-15T01:40:22.110189Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2605.14343"},"observation_digest":"sha256:75ca22945426a65dc6b07e645f0a5a4ef88cf67a2b5781eec6fa890a42d9e4af","observation_id":"c1ae5050-40b1-4ecd-8cf4-0d74adc992c1","resolution":{"observed_at":"2026-05-15T01:43:27.708616Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"2101.12631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-07-03T13:38:18.618313Z","title":"Zhu and C","venue":null,"work_id":"c7db8287-3c74-4a45-97c2-59ffab9262f8","year":2021},"citing_paper":{"arxiv_id":"2605.27066","last_updated":"2026-05-26T14:16:27Z","snapshot_observed_at":"2026-08-02T08:50:22.873323Z","submitted_at":"2026-05-26T14:16:27Z","title":"Large Language Model-Powered Query-Driven Event Timeline Summarization in Industrial Search","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T18:05:06.382333Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2605.27066"},"observation_digest":"sha256:d03f5dc4a451a17cfa237f134218aef49bcafe19202e6a715ec99c104c83979d","observation_id":"d42732ce-0ce9-4598-97dd-4965a164941f","resolution":{"observed_at":"2026-06-29T18:13:49.128641Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"2101.12631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-07-03T13:38:18.618313Z","title":"Zhu and C","venue":null,"work_id":"c7db8287-3c74-4a45-97c2-59ffab9262f8","year":2021},"citing_paper":{"arxiv_id":"2606.00734","last_updated":"2026-05-30T13:56:00Z","snapshot_observed_at":"2026-08-02T09:59:17.967563Z","submitted_at":"2026-05-30T13:56:00Z","title":"EMA: Approximate Nearest Neighbor Search with General Attribute Filtering and Dynamic Updates","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-28T17:58:06.658283Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2606.00734"},"observation_digest":"sha256:7fdb896987876a24e5948a669ae234b8c46d910238709cd24e09b0f07c8d974d","observation_id":"df2f0240-46df-49a6-a006-405192bcbbe3","resolution":{"observed_at":"2026-06-28T18:02:26.924572Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"2101.12631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-07-03T13:38:18.618313Z","title":"Zhu and C","venue":null,"work_id":"c7db8287-3c74-4a45-97c2-59ffab9262f8","year":2021},"citing_paper":{"arxiv_id":"2606.02992","last_updated":"2026-06-02T00:59:39Z","snapshot_observed_at":"2026-08-06T19:36:50.731451Z","submitted_at":"2026-06-02T00:59:39Z","title":"Slipstream: Locality-Aware Graph Index Construction for Streaming Approximate Nearest Neighbor Search","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-28T08:44:13.310548Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2606.02992"},"observation_digest":"sha256:cd9c217f50674ba62298eeb6d455082f1213ff05001562b1b5d93406b949114e","observation_id":"26e36e75-18cc-4cc6-aed2-4d7c82d9aa25","resolution":{"observed_at":"2026-07-02T04:56:38.916370Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"2101.12631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-07-03T13:38:18.618313Z","title":"Zhu and C","venue":null,"work_id":"c7db8287-3c74-4a45-97c2-59ffab9262f8","year":2021},"citing_paper":{"arxiv_id":"2606.11789","last_updated":"2026-06-10T08:21:52Z","snapshot_observed_at":"2026-08-06T05:47:55.997746Z","submitted_at":"2026-06-10T08:21:52Z","title":"Efficient Graph Indexing for Interval-Aware Vector Search","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:afe83a0171381838c5a7805963c9b0b074480c589735d3f1b46a724594dc680c","observation_id":"835022b6-e1e7-470e-9d03-2b597386b8ee","resolution":{"observed_at":"2026-07-03T13:38:18.620134Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"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":"2101.12631","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-07-03T13:38:18.618313Z","title":"Zhu and C","venue":null,"work_id":"c7db8287-3c74-4a45-97c2-59ffab9262f8","year":2021},"citing_paper":{"arxiv_id":"2607.00768","last_updated":"2026-07-01T10:52:09Z","snapshot_observed_at":"2026-08-03T20:26:39.740621Z","submitted_at":"2026-07-01T10:52:09Z","title":"RACORN-1: Adaptive Recall-Preserving Speedup for Low-Selectivity Filtered Vector Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-02T03:11:31.712329Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2607.00768"},"observation_digest":"sha256:1d3b6c40f9b6508d0a46040dca2089922e19ed491408e53f592e8951cca2aa72","observation_id":"f1d364f4-d4c9-4fb1-ada7-c7db209318a9","resolution":{"observed_at":"2026-07-02T03:16:33.317696Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2101.12631/citation-record","integrity":"/paper/2101.12631/integrity","json":"/paper/2101.12631/citation-record.json","paper":"/paper/2101.12631"},"outbound":[],"paper":{"arxiv_id":"2101.12631","last_updated":"2021-05-10T08:54:16Z","latest_version":2,"primary_category":"cs.IR","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 18 inbound Pith citation observations for arXiv:2101.12631."}