{"as_of":"2026-08-14T02:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2cf0cd10fe07a65f5d088a23479a13aa063c59126982c698c0eb2a58ef4cdc9f","coverage":[{"denominator":70,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":70,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T07:49:49.397065Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.11789/citation-record","integrity":"/paper/2606.11789/integrity","json":"/paper/2606.11789/citation-record.json","paper":"/paper/2606.11789"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1804.06829","last_updated":"2018-04-23T13:13:00Z","snapshot_observed_at":"2026-08-10T08:25:12.943254Z","submitted_at":"2018-04-18T17:28:48Z","title":"HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces","version":2},"cited_work":{"arxiv_id":"1804.06829","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.06829","snapshot_observed_at":"2026-07-03T13:38:18.620598Z","title":"HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces","venue":"cs.DB","work_id":"38e0dd3f-f78c-4642-afee-8393cbc061af","year":2018},"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":1,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/1804.06829","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:c290e0a9d534918d43837e6ec9971e1220c33ff1bc83b675071c58d582496a95","observation_id":"03509cd1-ef74-4e87-9586-79e067405968","resolution":{"observed_at":"2026-07-03T13:38:18.621826Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2020},"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":2,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:cb478ca3d7942478b97a2d784968d832b01aacb56b5b340f972ade8cfaea8357","observation_id":"8caa709b-1255-44f5-84e5-2535d7c8d952","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2025},"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":3,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:911aed78e01b4e827b0838cc1a40ba004db9b311d6fee2fd67905f40b4d6cb0c","observation_id":"15ea0e95-b087-46d2-a378-11619194ada6","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":"nearest neighbor","venue":null,"work_id":null,"year":1999},"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":4,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:7355fbc757ae799feb2a6f0ceaa3009ffe17ec0b520048b8ef3556ee763149bf","observation_id":"50945b35-0667-4969-9749-42176303c270","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2006},"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":5,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:55b350d1c464839f3915d7be198c8e6da6aad91e4bd4783d3fe21107f6606ab3","observation_id":"ff6632ed-665a-40e0-affc-c275d03ca400","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2000},"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":6,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:93abe1f5c6c6cdcc37559e98d806428ccdac5eb59b1f398a9b1387717e26dfed","observation_id":"4fb3cb17-cbf8-4dcd-996d-ce079f3c5007","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2020},"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":7,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:fe1b9e2228e0a36c8e9e65fcd1c5dc2210d71b24a4ef07316d3f5a2cce66421b","observation_id":"acb7ca75-d0ee-4675-b325-61aa1864fea6","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2025},"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":8,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:3d28d2d898b9636010ac69cea477b5d4e026cf58160408590d814b730ded8ea0","observation_id":"bb2a6667-a077-4624-9b4a-958cbe60d456","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":1967},"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":9,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:5a80fe1815ee4727f493729be95c587fc0244f801667ade270e5ab7563fd37f6","observation_id":"03182d83-2305-463d-9c44-682b7ae764a3","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.04359","last_updated":"2024-02-08T17:00:13Z","snapshot_observed_at":"2026-08-13T11:47:39.468674Z","submitted_at":"2023-05-07T19:28:23Z","title":"ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms","version":2},"cited_work":{"arxiv_id":"2305.04359","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.04359","snapshot_observed_at":"2026-07-03T13:38:18.615637Z","title":"Blelloch, Laxman Dhulipala, Yan Gu, Harsha Vardhan Simhadri, and Yihan Sun","venue":null,"work_id":"d4e3c1cc-f41c-4226-b576-8bd37f481619","year":2023},"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":10,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/2305.04359","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:832d79d91f379c94f583d8d35ad3be488ccc7f1e4630bb95213b5558b6661bb3","observation_id":"18ffc18a-b94d-45ec-83fe-8b2e818c2292","resolution":{"observed_at":"2026-07-03T13:38:18.617230Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2025},"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":11,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:a89d9296b673b66e10438d3c2d669af634289afbe38ad25055f7c08160634b8b","observation_id":"0594fb38-1d58-494f-9d05-75d9a32a1fc5","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00943","last_updated":"2024-06-04T15:38:08Z","snapshot_observed_at":"2026-08-13T04:28:57.364746Z","submitted_at":"2024-02-01T19:00:40Z","title":"Approximate Nearest Neighbor Search with Window Filters","version":2},"cited_work":{"arxiv_id":"2402.00943","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.00943","snapshot_observed_at":"2026-07-03T13:38:18.628944Z","title":null,"venue":null,"work_id":"83af5ed0-10e6-46fe-9c4d-a29aa6f5e154","year":2024},"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":12,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/2402.00943","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:71bccd9b7285aa539b93737a1c4d8de49633b7cfb90bb0734f8dce545b4ed194","observation_id":"c0def2c0-3688-4943-9464-d0286e5f05f4","resolution":{"observed_at":"2026-07-03T13:38:18.630311Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":1996},"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":13,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:5dd5a7760159ebf9192563dbbf407a92c155ca8c5953ba4b8bea878ad29b9f15","observation_id":"9af56f6f-3a7f-4cb4-8ad4-b1c19e650f55","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2017},"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":14,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:7aa13c986f541bf8b8d78465f31a6854177dc8a2fa4314b9c9c22b7dedd6773e","observation_id":"e9c2b376-ed7e-479c-abd3-ff9871569aeb","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"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":15,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:79ede18d04ddb51ad2019cf796d970d73fbc24fe7ff47fee2f4f3dd60c060921","observation_id":"d9e0c554-cb9d-4448-9a7f-98794f481a88","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-08-13T22:17:52.616830Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":"1707.00143","doi":"10.48550/arxiv.1707.00143","metadata_source":"arxiv_reference","pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","venue":"arXiv (Cornell University)","work_id":"faca0749-5138-4781-b2ba-6fbf9b0b783a","year":2017},"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":16,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:692e6b5a3fd0c8705008d6bd9a9c554fcea224308b65c8278aa4678ab29384db","observation_id":"294c0680-dab9-4f7d-ba81-7fe16b8c4a93","resolution":{"observed_at":"2026-07-03T13:38:18.627776Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2024},"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":17,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:03711b01e3e6257fda046c77d02d90faf2525c66419478cf285e8b79e174f7da","observation_id":"a19f77c5-f137-43fb-8037-2ce4c8d1ca83","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2013},"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":18,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:e3c97c2f149ccdbe3424131808cb9a91d35c53d298af2193f227646c9e3f36f8","observation_id":"133e9173-e3c2-4f9c-800b-26ab9c2555db","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2023},"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":19,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:586a99bb04d5a732a1eb1fea93d5502571fe52a7010143554616174493c93451","observation_id":"b37f369b-e873-432a-afb6-8735f7ab2a75","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2012},"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":20,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:cbeec228f73fed8a519994b834f948f19dd336ed60601b5d056c5ed35a61fb74","observation_id":"131449ef-2db5-4090-b751-18e76b4b2720","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15014","last_updated":"2023-08-29T04:34:32Z","snapshot_observed_at":"2026-08-13T10:25:18.093063Z","submitted_at":"2023-08-29T04:34:32Z","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","version":1},"cited_work":{"arxiv_id":"2308.15014","doi":"10.48550/arxiv.2308.15014","metadata_source":"arxiv_reference","pith_arxiv_id":"2308.15014","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"59e563fd-e191-41a0-a34e-d30289d9ca27","year":2023},"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":21,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/2308.15014","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:29f58a61928e1d2b0c619c1adfb29b96bd23dbcdae290ff8c262114cd1b8f949","observation_id":"60dc8085-9840-455e-b2fb-b61888cd229f","resolution":{"observed_at":"2026-07-03T13:38:18.599488Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2016},"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":22,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:cd7f53857d1510a90316a248675298fa0650e82bac8611727a9cdb3a644258a6","observation_id":"2f459ac1-68b9-483a-85bc-96bcb1b9cb1d","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":1998},"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":23,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:29dc608922ffce4df8f598fc2a8d5c89c5d370abe8bf539d69d9e285d1ae19e4","observation_id":"c250f455-43d5-454e-aa52-cd9e7903266d","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2019},"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":24,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:21e166dd913bc38c35d3cb2307a73d0f40dcb84b8fa6e30ef0cebdb9bcd7f8d9","observation_id":"d00be42c-7f6b-4d92-b0b2-ad99d15cc16a","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2010},"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":25,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:0c0016ee305be5a4ac4d65c7784ac6e1073498d1cb421d70c673e4c42dc421ff","observation_id":"479b24b9-d2a5-4f55-ab75-b0da6964eea6","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":1956},"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":26,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:c44cc207c4b23c6e91ec4e6666bb26b75e902b1605dae3d49f42a23ef89a7282","observation_id":"dd8328da-6084-4fd9-beab-2907490b23ae","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2015},"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":27,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:07cade67d061c65340d0c806527f2f26f1e6f3b295ffa84437c2c80a5a201b90","observation_id":"16ee07dc-939f-428f-b529-dc89c6b2162c","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2018},"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":28,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:43f8e190ccad25a24c3a68f525da2f41d934a59a65d1efdb1f978a55d3db7303","observation_id":"bdbbf196-cd47-49a3-8af0-695a09dbef55","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":null},"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":29,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:64390ca5c3b62dbc03d0a6016d9a15ece483522c8751034accb846a7567dede2","observation_id":"ecd1bd3d-07be-4c39-8494-f7fcd10c0940","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2025},"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":30,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:b767e5f86d62b48c3429beb9c88069a26681d9658d64064a76fd33bf6e33f4cf","observation_id":"4a71f24d-b382-4695-950e-453ee06b17d3","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2019},"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":31,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:4d2b72f8300e05eb57ba54e0740d880b039768f1018dab9b5975d5059886e0e9","observation_id":"d17f7f05-227e-46bc-bde7-43f3cf6b790a","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.02448","last_updated":"2025-06-17T09:24:55Z","snapshot_observed_at":"2026-08-11T23:23:55.589732Z","submitted_at":"2024-12-03T13:32:11Z","title":"UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search","version":2},"cited_work":{"arxiv_id":"2412.02448","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.02448","snapshot_observed_at":"2026-07-03T13:38:18.623567Z","title":null,"venue":null,"work_id":"ccb1d129-628e-4751-a823-5f31289119b9","year":2024},"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":32,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/2412.02448","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:48beb92d0c2bba5151489b2c3648b49d36367fdfdf90c2c138700c72f06efb9c","observation_id":"8175b175-3a44-47ce-9ad0-24233cfcc836","resolution":{"observed_at":"2026-07-03T13:38:18.624883Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2026},"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":33,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:b8d17440afe6c1499dce4195d5d6b01c94c5a86e2b28a85317d5b083357089b9","observation_id":"2e11c9f8-b8cc-42de-a3da-4b51452c46a0","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2007},"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":34,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:3fceccccab01014fcea4b7a51a7436cbdd5ac694f209c6a68a966745f73a7512","observation_id":"976dc880-2ce9-46b3-9bc0-9e2a353f21dd","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":null},"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":35,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:fc6e625759d095ba3c4b9031412395503bc2e86351649f54bf36dfa590c51404","observation_id":"95e85d3f-ee74-445e-b391-bf5c064fe20e","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2014},"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":36,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:294c2dec1fb9d085cb1e80f5a2ca6422aca6fbacc060780e474028c7e9398b73","observation_id":"502d28b3-8e26-4585-862b-ced72b6631ee","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2018},"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":37,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:bbe90fbb53ae7324848a484bdfcf73959b6f3353e93fb40ba0a79620a871e5d1","observation_id":"5353755a-4e2c-4d16-822e-a140c5fbfff2","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2018},"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":38,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:a413ab770798810ab321cd5ea6c892f4f590586e63b2b11fe7540452f35ef36b","observation_id":"3c616f8b-6a1d-421c-aa48-30c3b4e07ec7","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.14021","last_updated":"2023-10-21T14:09:48Z","snapshot_observed_at":"2026-08-13T05:44:05.597350Z","submitted_at":"2023-10-21T14:09:48Z","title":"Survey of Vector Database Management Systems","version":1},"cited_work":{"arxiv_id":"2310.14021","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.14021","snapshot_observed_at":"2026-07-03T13:38:18.628182Z","title":"Pan et al","venue":null,"work_id":"1e5c25f0-0d59-40f2-9670-5a0f401f6dc6","year":2023},"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":39,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/2310.14021","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:06d9b9f4ec05627547e1a561be8460cffe78c349cdcaab25d249c67bb8db91b7","observation_id":"b446289f-618b-457b-90ed-4542eed38218","resolution":{"observed_at":"2026-07-03T13:38:18.629534Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2024},"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":40,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:166bcfc2ed22e89fe1ad342e88b53ac90e3e484c30d6c7aaf6ac31cffd31cf6d","observation_id":"3926cac8-504d-435a-bbf1-40cc89fb688a","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2005},"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":41,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:fc181b3a0fe135fad40dc73187c45ca9700c9dfd6a682bd3091382eef6d52543","observation_id":"1737d49a-976c-42dd-9f85-3084bf6a18b5","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2024},"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":42,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:e73347a0807a594c29cdcd00aa5ee115772c153f08e4de7eef6990cce787fd34","observation_id":"2e43ed1a-d295-4e6b-a0b2-6e043d55addb","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2025},"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":43,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:b8acf2a3b50d86cf79b999fb9a3e727b5abbbbb41a9460d1ec1df8de0ee65aad","observation_id":"1d4d4075-fdd8-4c47-b533-06defdedf701","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2022},"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":44,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:c3d3c418eac6622bad28ab641abf727bddda973b0ab89cbcbd0e3a48cbd654f9","observation_id":"baf81e7f-e7ca-4876-bc09-ea566ba5dca4","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2019},"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":45,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:70b1f6077f48c2b7c5ac7511fae1fa995fcc399f00561f664b11b89a4c4d5a59","observation_id":"62a5ec5f-67ac-4018-95e0-0652e08b2e8b","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2019},"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":46,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:0efe44d5d289768d131c47fab69100f3e39cb2a58228d292b2db54a5626f6db9","observation_id":"82a894d2-9e80-4e6f-a801-dfef5612e8c4","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2001},"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":47,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:9ffad2afd49c6df006716be15ea41c70264b73bc8155188a5eab7c2a5f06ad2f","observation_id":"b70c66f2-8258-420a-8d1f-5583436da860","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":1980},"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":48,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:f4f8e34cc500cd5e979c6c364f0f957d9c4c8e004fe88f5c20d527ebf2b765bb","observation_id":"95edbac6-9eb8-4ca4-8c55-5c307baff8eb","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":"Gonçalves, Zanoni Dias, and Ricardo da S","venue":null,"work_id":null,"year":null},"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":49,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:e222d01733e033499c175e5f5c0f09a4f28e1e71c5e51ff056cc5a4cd581ec18","observation_id":"122e4984-3596-4c5f-b5a1-d7f2d44f5e9d","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","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.1016/j.patcog","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T18:17:32.863672Z","title":"Pattern Recognition47(1), 388–401 (2014)","venue":null,"work_id":"d41f402d-5300-4159-a20f-a95208048584","year":2025},"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":50,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:7bcd034a96cbeec9faaad74be555622028a3786ee4395e70986d20f7c9926d95","observation_id":"f1e24707-e2f0-44a6-ae66-b8d9ec663fc8","resolution":{"observed_at":"2026-06-27T07:50:43.192605Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1408.2927","last_updated":"2014-08-13T07:29:12Z","snapshot_observed_at":"2026-07-06T03:51:37.228909Z","submitted_at":"2014-08-13T07:29:12Z","title":"Hashing for Similarity Search: A Survey","version":1},"cited_work":{"arxiv_id":"1408.2927","doi":null,"metadata_source":"pith","pith_arxiv_id":"1408.2927","snapshot_observed_at":"2026-07-03T13:38:18.613062Z","title":"Hashing for Similarity Search: A Survey","venue":"cs.DS","work_id":"99b3cd36-c71a-4398-ab89-dc4cf40f89f4","year":2014},"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":51,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/1408.2927","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:638089dee674f22300d6c256982e932beb216e90c3ced8802c47393e29e3b88e","observation_id":"4526a6e1-af78-4e01-a6c0-dc0a046d55aa","resolution":{"observed_at":"2026-07-03T13:38:18.614389Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"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":52,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:e2c3224f5af24ff7a4cbeb4fdd23e383b3224e2613747cc75207344d790c9f67","observation_id":"008eed44-7fed-43a1-badd-1deec935f1d6","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2017},"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":53,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:c63322e2f4b182a379f7548bc0412b20f740c68222c40309be684154abc8b95f","observation_id":"d57a8eba-3de8-4170-b7a2-1430f2bc9d34","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","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-08-13T20:23:00.345351Z","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:e8beeb1be126c81c8c01801c4c81587e6738d761181f13ccf31a962b3fb9c961","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-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2025},"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":55,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:05e518feecff69125024dd4e6bddb92c490cac65d98e4ef9d771103c7816939e","observation_id":"0a981568-3106-46e7-a8af-2984ca987e4c","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":1998},"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":56,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:76d4f5d39b25b605a418f98618f662042c89dd0403bc3dee0f4a47b924688f6b","observation_id":"c6588bba-47f8-4544-9353-30401b7831ca","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2020},"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":57,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:efefb0778c2406fd64ba9c675581001b474ee4d7075d15d534985feb4cf68fee","observation_id":"5eb95300-1c24-4881-a9e9-c40658dd08e9","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2025},"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":58,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:30512ba05f5c693ae26f9592c816e6f1a8a3e2dc510041c91e213219559a7f1d","observation_id":"0980d82b-7302-4179-85e1-758377024416","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":null},"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":59,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:7385a0c2d3b027860d8028aec6b9ba2fe2782722ee97ce5aff0aacc1f9eb3858","observation_id":"87493ba0-e28f-447c-b3b9-4a514bb3e03d","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2024},"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":60,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:9b579da7534067ccfc9b0a2c547df51a3a61f7f82a7a5cd6f68f7a8e79c3cd14","observation_id":"ba90885b-ebfa-4e83-ab62-dd793c582a6c","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2025},"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":61,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:37d2740f4e43dec08e4a5aaa5304fa87a83170bc9cb2a7f4837ee5f1e579fa1e","observation_id":"b0265daf-a5bf-44f5-9c97-df0071f5e7a6","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.01960","last_updated":"2026-06-02T03:45:45Z","snapshot_observed_at":"2026-07-13T14:06:07.705156Z","submitted_at":"2026-04-02T12:22:38Z","title":"BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector","version":3},"cited_work":{"arxiv_id":"2604.01960","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.01960","snapshot_observed_at":"2026-07-03T13:38:18.621302Z","title":"BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector","venue":"cs.DB","work_id":"83a6b539-6773-4e21-8027-63a17d950058","year":2026},"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":62,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/2604.01960","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:df8b3059e8aec38b9818b5750c9617573e1b069d8ff3373a5f0d45bdcc203a69","observation_id":"e9c3c9e2-4267-46e3-9973-b027990e8d9b","resolution":{"observed_at":"2026-07-03T13:38:18.622477Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":null},"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":63,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:5f4d95ba3721d19ff43476751fe433fa23515aa0b549ef7a84f9d2c119bcea26","observation_id":"d23d3f7e-18c7-4ab5-a3c0-2967c12b2036","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07331","last_updated":"2024-11-14T13:04:41Z","snapshot_observed_at":"2026-08-13T00:57:03.704632Z","submitted_at":"2024-03-12T05:32:33Z","title":"LIST: Learning to Index Spatio-Textual Data for Embedding based Spatial Keyword Queries","version":3},"cited_work":{"arxiv_id":"2403.07331","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.07331","snapshot_observed_at":"2026-07-03T13:38:18.614764Z","title":"arXiv:2403.07331 [cs.IR] https://arxiv.org/abs/2403.07331","venue":null,"work_id":"b5d47735-a3f3-42cd-a1c0-2312e6437545","year":null},"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":64,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/2403.07331","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:6336e07a1b4535763b19919af33038ecf3e11ccda44efe32a2c2c43bc100efdf","observation_id":"56380043-6906-4b7b-a0fb-47bee1f14e5f","resolution":{"observed_at":"2026-07-03T13:38:18.616303Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3709679","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Management of Data","work_id":"4b3e61e4-4779-49f7-a14e-827dc3990f16","year":2025},"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":65,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:c7891509e14a0c38993a976440dd76bd7913e313fcc781a9fbef6f5173a1832d","observation_id":"77967b63-39b8-4fc5-a0b9-a31b7ff99455","resolution":{"observed_at":"2026-06-27T07:50:43.193285Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2025},"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":66,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:ce414135b15d4a31b6009d7ddb49a427471376ef35e473a1f8a6532c3170054b","observation_id":"32f7b463-130d-4333-bd41-ad94b60d0c33","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2023},"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":67,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:d13d45a8dbafb4e6003c3f2eec3cda2e4b020b5bbadf6b405cf7dda0fff72dc3","observation_id":"93d3c7df-afde-4cfb-8711-5b0c64b1d9ad","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2026},"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":68,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:8dae6f5e4fce2d0e17b74ec6b29689a450233b6dc08d75f55a8d0ff239044d38","observation_id":"c88739f2-2d54-4ae8-989a-f35a047c1b36","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.12913","last_updated":"2026-05-03T15:13:42Z","snapshot_observed_at":"2026-08-11T14:10:52.814773Z","submitted_at":"2026-03-13T11:29:58Z","title":"RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":"2603.12913","doi":null,"metadata_source":"pith","pith_arxiv_id":"2603.12913","snapshot_observed_at":"2026-07-03T13:38:18.606381Z","title":"RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search","venue":"cs.DB","work_id":"4948068e-ab82-4a05-8c60-2a9f71730933","year":2026},"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":69,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"cited_paper":"/paper/2603.12913","citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:c4497c3ff6b58f47af02f2030d3d0c07ba36bb5393813d86d0106478939030a2","observation_id":"74136940-b8fa-4dc7-93ad-14cae66642b7","resolution":{"observed_at":"2026-07-03T13:38:18.607602Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T07:49:49.397065Z","title":null,"venue":null,"work_id":null,"year":2024},"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":70,"source":"pdf_text","source_observed_at":"2026-06-27T07:49:49.397065Z"},"links":{"citing_paper":"/paper/2606.11789"},"observation_digest":"sha256:f066a20162fc1a7165993161607aa49db2ce5d7b22d15a5ff148e61fe83623be","observation_id":"c80e1811-97d6-47e2-8553-38fc4ca22e83","resolution":{"observed_at":"2026-06-27T07:49:49.397065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.11789","last_updated":"2026-06-10T08:21:52Z","latest_version":1,"primary_category":"cs.DB","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"},"reference_resolution":{"displayed":70,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":56,"verified_exact":13,"verified_fuzzy":0},"total_outbound_references":70},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 70 of 70 outbound references and 0 inbound Pith citation observations for arXiv:2606.11789."}