{"as_of":"2026-08-19T09:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2aac1c933d0634a1aa61a71a3511de8dae31a9fb81b94f0994419961546938aa","coverage":[{"denominator":72,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":72,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:33:54.755093Z","state":"measured"},{"denominator":72,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":72,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2504.20461/citation-record","integrity":"/paper/2504.20461/integrity","json":"/paper/2504.20461/citation-record.json","paper":"/paper/2504.20461"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:56.122756Z","title":null,"venue":null,"work_id":"5b15b4c6-2ae8-404a-baab-f6603bf01a58","year":2012},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.395948Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:c801971cc44e3d96795608c0b51711c675422464dc82cb4d75e13fbc3d2402f3","observation_id":"36357a89-b44f-4dea-bf55-0feab7293dcf","resolution":{"observed_at":"2026-08-16T05:33:56.127080Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:56.108471Z","title":null,"venue":null,"work_id":"9849fc42-6a9a-4b98-9293-5316792214e0","year":2019},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.405918Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:3adf54581cbb04c93bae0e078fbfdf67dd44983f4e4d585914d50f032124c346","observation_id":"b48cbcb5-efba-44a8-a31e-4028e60cf3d2","resolution":{"observed_at":"2026-08-16T05:33:56.113166Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.412006Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.412006Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:108b692b6a02c69eba4beca15a80b204afb20361ded36d768b972970b54678ee","observation_id":"074f1991-782c-44cc-82fc-8828594d0e41","resolution":{"observed_at":"2026-08-16T05:33:54.412006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:56.085368Z","title":null,"venue":null,"work_id":"0e7b6b97-b825-4ee9-9e8d-4293a20d4adc","year":2023},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.417223Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:10bf1e6ad24f05550bf911ab94cc8b50a9f5ee84fd49cef4572fc2eaaed4710f","observation_id":"6ebbdce9-9290-4f68-a8f2-07d2dabe438a","resolution":{"observed_at":"2026-08-16T05:33:56.089727Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.422447Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.422447Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:b54bbcdfe7ba1d88be1aeaeed0253037fa7bef82317a4eebfe99b3356cd841fb","observation_id":"0567d884-f6d7-42e1-a6fb-85818bab8b28","resolution":{"observed_at":"2026-08-16T05:33:54.422447Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.427312Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.427312Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:94a41ceb974837e9582306d0051cd6f6d7406801379173c516f3d46427b69441","observation_id":"70e4f78f-80f2-414d-ae08-f460a7aeaa88","resolution":{"observed_at":"2026-08-16T05:33:54.427312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.08566","last_updated":"2021-11-05T06:28:15Z","snapshot_observed_at":"2026-08-16T17:43:50.833809Z","submitted_at":"2021-11-05T06:28:15Z","title":"SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.08566","snapshot_observed_at":"2026-08-16T05:33:54.433300Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.433300Z"},"links":{"cited_paper":"/paper/2111.08566","citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:355354bfd8e511bf0bcbd7ed81d2cdc8133760361a6f952b8c5b3bb9c4e47305","observation_id":"ffae6a49-f932-4e84-bb6a-c175f29fab9e","resolution":{"observed_at":"2026-08-16T05:33:54.433300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16179","last_updated":"2024-12-18T17:36:36Z","snapshot_observed_at":"2026-08-16T13:07:19.528168Z","submitted_at":"2024-10-21T16:44:51Z","title":"MagicPIG: LSH Sampling for Efficient LLM Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16179","snapshot_observed_at":"2026-08-16T05:33:54.438647Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.438647Z"},"links":{"cited_paper":"/paper/2410.16179","citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:fab4a635d609f4c3c97b73789a2cc3afde46a959bdc59d553c190a458fed120e","observation_id":"785be2cd-2995-4a84-bbdd-c51d510a640f","resolution":{"observed_at":"2026-08-16T05:33:54.438647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:56.053801Z","title":null,"venue":null,"work_id":"9f0d68a9-8ae8-459a-a3c6-9ef3dcaa6eaf","year":2016},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.444408Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:cb2ce6945384d671b09e0a4c82b435fd73c62b1314788bb39f88105ada1de606","observation_id":"f25870b6-7b94-46c6-ac57-366808fe99d0","resolution":{"observed_at":"2026-08-16T05:33:56.058012Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:56.039175Z","title":null,"venue":null,"work_id":"06ae91af-80d1-469d-b15e-09cb36600ac8","year":2022},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.448927Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:ef1d4db59ce7c3d811fd74b39ef3407f599a825579ad8f400f8e049369f3f87e","observation_id":"63c419f3-4200-4273-a13a-44de7947544a","resolution":{"observed_at":"2026-08-16T05:33:56.043761Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:56.025387Z","title":null,"venue":null,"work_id":"028bd937-328f-4bf5-a6e8-cf5426abfcf3","year":2022},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.453236Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:b085fb94fe07ca950a01f4d29d10310a800b21fd5be9162f84527c5c818ae2e1","observation_id":"2d198f85-1dc0-4907-be1c-b8f3c3c7ec21","resolution":{"observed_at":"2026-08-16T05:33:56.029550Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:56.011895Z","title":null,"venue":null,"work_id":"02036370-2be7-4063-837c-4a96a3e31f04","year":2023},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.458800Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:0cdcc35d4c5956041a25af5028e0c97f9adbae937482a92a80aec2d388844834","observation_id":"d7add33a-092c-49a2-b093-e00a13037ff6","resolution":{"observed_at":"2026-08-16T05:33:56.015906Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.463063Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.463063Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:db9d81adbd425de52a478856ba7664b0224b253f012bbe0874087281ed6665f1","observation_id":"33477532-f0e8-407c-9377-65694e22322b","resolution":{"observed_at":"2026-08-16T05:33:54.463063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.988401Z","title":null,"venue":null,"work_id":"683c0e4b-0a11-4edd-acbe-958e98456126","year":2017},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.467617Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:c1b8299e1c79fd0e3111189cc3d453a99b9904d1a60323d129b24a88b42c6a9f","observation_id":"7f8328a4-25a5-4c15-ba75-1cb98939b584","resolution":{"observed_at":"2026-08-16T05:33:55.992901Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08281","snapshot_observed_at":"2026-08-16T05:33:54.473455Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.473455Z"},"links":{"cited_paper":"/paper/2401.08281","citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:789e98f3b14532a05033e2e2e8f94b6ce500c1b32f965eef5e8461aeb719b34c","observation_id":"5fd8bb18-376b-4993-89d8-a210f4ebff6e","resolution":{"observed_at":"2026-08-16T05:33:54.473455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.973728Z","title":null,"venue":null,"work_id":"8e367166-a86b-4418-b87a-cd9639332f91","year":2022},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.478004Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:08d129faedf24eac9a49d73eaf4a4d921282706dd5293a49f71de15e5d5db2cc","observation_id":"a98a8081-44fe-4a0e-ba64-ba72bac4a662","resolution":{"observed_at":"2026-08-16T05:33:55.978423Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07228","last_updated":"2016-12-03T06:31:31Z","snapshot_observed_at":"2026-08-18T21:01:08.242103Z","submitted_at":"2016-09-23T04:34:54Z","title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07228","snapshot_observed_at":"2026-08-16T05:33:54.482475Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.482475Z"},"links":{"cited_paper":"/paper/1609.07228","citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:7a516d6fef4b6d517d46b63f26864108119e6873074e2ab84aea61d095ef1d3b","observation_id":"eeaee1ac-5ce2-4133-bed7-a933bb35d71e","resolution":{"observed_at":"2026-08-16T05:33:54.482475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.487916Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.487916Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:edc1140c856adc6fbedd023a86c94b13cd672ca2d33f7ffcd90405b8f09de5bf","observation_id":"7a15353c-dade-4ae8-b136-3122568e1962","resolution":{"observed_at":"2026-08-16T05:33:54.487916Z","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-18T20:58:05.088726Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-16T05:33:54.492933Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.492933Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:0a80a3947f1fad45bb8b42fb21927a867c3e5ddb4224d7e8d1cc0cc765594bfd","observation_id":"5acdcdff-7269-41d0-ba7d-ca718f6e1c3d","resolution":{"observed_at":"2026-08-16T05:33:54.492933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.949277Z","title":null,"venue":null,"work_id":"5e30e7cd-5fa6-44e8-afb1-a3e1ad1e1efc","year":2013},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.499785Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:412a56437dc0551f4b4e8d34bf3cd18fb1004ef26bc43b4438e89f8aebd94c3e","observation_id":"50604ee0-0d71-4762-a306-9269a202583a","resolution":{"observed_at":"2026-08-16T05:33:55.953856Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.506078Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.506078Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:4f4e2a6aeeabf71d8dec9e24647519a231b635904669deb1bc0bb569d047c52c","observation_id":"e2c9e6ea-fb54-4679-9e89-72f60c34f850","resolution":{"observed_at":"2026-08-16T05:33:54.506078Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.511161Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.511161Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:c89919973f95f6c8ad27fd05f0861993eba4b51e0009bcca3dd967d4a42eb8fd","observation_id":"a3ace44d-b0a3-42d6-9373-ea75e7200e3d","resolution":{"observed_at":"2026-08-16T05:33:54.511161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.916288Z","title":null,"venue":null,"work_id":"5d571abe-5eb5-48eb-bdde-4e53ee7c1c5c","year":2011},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.517373Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:998f910897600db2ac5e89ed9072342042e9be07cd3d513dea90650d1e503844","observation_id":"6fd3fa1a-a0bf-4ebe-b004-a1a75ebfb539","resolution":{"observed_at":"2026-08-16T05:33:55.920659Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.902071Z","title":null,"venue":null,"work_id":"483a3b71-7468-49bb-89af-9b20d4a52618","year":2015},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.522653Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:2faaa996eed0e10ce912a2d7dc307643a0f17ecf1d175c0a9481e5ccd098d6d4","observation_id":"cab309a3-db00-4f17-ab92-63d35a367857","resolution":{"observed_at":"2026-08-16T05:33:55.906479Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.527669Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.527669Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:fd3c74a0cf061eb33ae74698e046335d05787f8c40abc7c2529831cde733e00d","observation_id":"adc631d3-7735-4a2d-9732-be347539bfaa","resolution":{"observed_at":"2026-08-16T05:33:54.527669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.877991Z","title":null,"venue":null,"work_id":"69d9064c-e3ec-4fe4-9984-0508da7e4405","year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.533971Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:569087a948a7aa42370ddbeec2d2b02c12d1fede463ab34b9593dd96dc0ba362","observation_id":"539241f1-92bd-4a84-ae1e-6c29e1098e28","resolution":{"observed_at":"2026-08-16T05:33:55.883318Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.865016Z","title":null,"venue":null,"work_id":"07bba5ef-b987-4706-991c-bf50a5ad692c","year":2023},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.540165Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:c7f37208780490b364aef8190b70efc2e53346c3cb2a676aebd84533bda73097","observation_id":"77335e3a-a729-4b61-922e-733d57f11df9","resolution":{"observed_at":"2026-08-16T05:33:55.868895Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.851630Z","title":null,"venue":null,"work_id":"c0003307-9778-47d1-a77e-c264af62e1ce","year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.545641Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:4e21aecabf408162341e66ed237dfadecda142312552a01f5b753cc69ccd2ab5","observation_id":"eca3ce57-0c19-491e-bc6d-deaa0ede46b6","resolution":{"observed_at":"2026-08-16T05:33:55.855720Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.550525Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.550525Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:7f575be560edbaa3129e11d87ea9fe2c8e784ebbf4d4e5b475980f1190fd0d5f","observation_id":"abae76da-0f1f-4f80-bc13-ad9a64f7681e","resolution":{"observed_at":"2026-08-16T05:33:54.550525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.827753Z","title":null,"venue":null,"work_id":"ab099b95-3125-4ffe-9436-19ba0380f341","year":2010},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.554765Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:63755fe6a1d39b69831cdfc63b7416833bddc7852387705fdd26199817c78a27","observation_id":"eec17613-a799-4982-ab21-10a8739db47f","resolution":{"observed_at":"2026-08-16T05:33:55.832331Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.558788Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.558788Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:e13811b4d3c702793a4f374b1a07b597554777914c0102a369ed7d7b459ef117","observation_id":"11073ddb-1a25-4e6d-99d6-162dc88e540d","resolution":{"observed_at":"2026-08-16T05:33:54.558788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.568384Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.568384Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:164fab49ea1970f71f56db4db11d1dbe57db184f547ad43056f33e69a45df0fd","observation_id":"53237b3b-53ec-48a7-b0bd-5b8b27d83fc0","resolution":{"observed_at":"2026-08-16T05:33:54.568384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.779091Z","title":null,"venue":null,"work_id":"251b096c-d683-4fb2-a0f7-bdbc13b3586d","year":2010},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.573804Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:ec1cd16b75d0d556a08740a92ae09f735ab3f3881c07f2a8ff06830fd5520801","observation_id":"8232b8a3-e8fa-4f74-a340-508be1c6eb9a","resolution":{"observed_at":"2026-08-16T05:33:55.783896Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.765116Z","title":null,"venue":null,"work_id":"32a0d2e6-4f65-45f6-9db5-b42ccf4be16c","year":2022},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.578135Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:fea72f6584b0df8f184d58ed4ec2ba6b5e39e943a96e3fd16814d58e987da7f0","observation_id":"0b69caec-80b5-4995-b4b9-62bddc6b26a3","resolution":{"observed_at":"2026-08-16T05:33:55.769424Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.583133Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.583133Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:0c1cffd55f69e7c6efced073dcc7c7a40a5dd57f0fe0f9d7f4613fb27798e0a7","observation_id":"cd00238b-dcb7-471d-a2f7-b2178ab1eaad","resolution":{"observed_at":"2026-08-16T05:33:54.583133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.741108Z","title":null,"venue":null,"work_id":"df9f2d0a-a9e9-4610-8822-973563664cab","year":2020},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.592321Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:c728e07899f0cf7e93123ac1cce66754c87a8beccf17610baeaa527ded0c3975","observation_id":"9817ce52-938f-41d5-8c5f-8ea07d5a877b","resolution":{"observed_at":"2026-08-16T05:33:55.745522Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11354","last_updated":"2024-07-10T17:05:43Z","snapshot_observed_at":"2026-08-16T14:17:43.134912Z","submitted_at":"2024-02-17T18:08:37Z","title":"Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.11354","snapshot_observed_at":"2026-08-16T05:33:54.597798Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.597798Z"},"links":{"cited_paper":"/paper/2402.11354","citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:4ebe4556404a58ba09aea3b223ed813d0728a3e85ae238e65885937b67d4022e","observation_id":"a22d5e87-e25a-4d08-b206-80ae10a844ed","resolution":{"observed_at":"2026-08-16T05:33:54.597798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.604389Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.604389Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:220c8c9ee328d6d5695348c4cc34945497739d0298f71228551c7406de47ed65","observation_id":"7fdcb397-2c1b-47ed-aa9f-86b3d55a6c7a","resolution":{"observed_at":"2026-08-16T05:33:54.604389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.718428Z","title":null,"venue":null,"work_id":"73cfc06c-5974-43fb-87ae-28cc298ea40a","year":2018},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.608924Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:6ba9e8ebc50e25113324653e65884e2466c5e3be7b9f2ff41053856c7554d07a","observation_id":"e03a6148-e5ab-49b1-b8f6-c05ea8f0c1ca","resolution":{"observed_at":"2026-08-16T05:33:55.722995Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.704589Z","title":null,"venue":null,"work_id":"4422c6a3-479c-4936-afa2-54b6b775aa49","year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.613557Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:0c0dca9c7f263cea171a5bc8f3392af54d9a6506a47f73c2ef3444ef0b11edc4","observation_id":"edcf9f59-16c0-4bcb-a5f2-a5eb713914e7","resolution":{"observed_at":"2026-08-16T05:33:55.708746Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.618013Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.618013Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:42b05fc671f1511bc7f0fb13b55ab8c3cb9e0f0d13e5e8feeb83ede35097ceb4","observation_id":"fba1a2ec-9441-4a15-8f60-1bb82dfe50f6","resolution":{"observed_at":"2026-08-16T05:33:54.618013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.682079Z","title":null,"venue":null,"work_id":"c8fac1c4-5fa7-49c7-81dc-b23559bbfa6a","year":2019},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.622326Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:9442dbf8e74e946ceb1f2af952b328e269541eeb444e2d4639be1dbf2277fda4","observation_id":"534a5d8c-c1f5-4645-902f-4e93126cde3a","resolution":{"observed_at":"2026-08-16T05:33:55.686320Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.667693Z","title":null,"venue":null,"work_id":"74783c0e-7ded-428d-a40d-8baec3ad4bc8","year":2023},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.626701Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:ca4614bfa7990960ae360dcefa3d8dfbf476a94b3a0fd9f0dbd83adf2fd2b398","observation_id":"66346280-2e0b-4538-bdde-c551928c3307","resolution":{"observed_at":"2026-08-16T05:33:55.672239Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.653483Z","title":null,"venue":null,"work_id":"4e92370f-2247-4638-8236-5ac08833d75d","year":2013},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.631711Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:74d6c54e6080090a8840fa8151850d3ac55d307e3d2cb27033d509a7852643f0","observation_id":"95adc5af-b445-40a6-86b6-11a2aacffcde","resolution":{"observed_at":"2026-08-16T05:33:55.657969Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15136","last_updated":"2024-07-09T02:41:11Z","snapshot_observed_at":"2026-08-18T18:55:55.229074Z","submitted_at":"2023-08-29T09:10:53Z","title":"CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15136","snapshot_observed_at":"2026-08-16T05:33:54.635878Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.635878Z"},"links":{"cited_paper":"/paper/2308.15136","citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:b9eb56f259a9569c6f0696effac59820c2dadd1adcd9affe4d19da4d0d26a7d6","observation_id":"5cba8a87-515b-461b-b584-1fd07f52838d","resolution":{"observed_at":"2026-08-16T05:33:54.635878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.638859Z","title":null,"venue":null,"work_id":"08660a7c-3dc6-4492-a556-ef667076235f","year":2023},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.640666Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:a74fa9ebb8157fa6be11d79c0a0670bd858f53d4add77d29a8cd4b99696f8813","observation_id":"ae0db7e4-b84b-464b-8314-1a02fd646c8a","resolution":{"observed_at":"2026-08-16T05:33:55.643504Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.624504Z","title":null,"venue":null,"work_id":"5ef813c1-e3e2-44a6-91f9-3e757f27c50c","year":2023},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.645054Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:bbd836d8479b3aebe345aa632ddd16817b8022511c3f92ba3d6b214e7920e193","observation_id":"accb3a44-f529-44d7-b549-4d4c189c4e45","resolution":{"observed_at":"2026-08-16T05:33:55.629069Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.610514Z","title":null,"venue":null,"work_id":"43d5657f-dd31-47b2-a392-eb7c2b9f41c7","year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.649524Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:a4cc2825ee3bc0a2c42deb9eaf46d1b395423dd245c34a0b284db4093ed107f3","observation_id":"0fb035a0-8859-484d-b4a2-73f0bcd882b3","resolution":{"observed_at":"2026-08-16T05:33:55.614603Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.597555Z","title":null,"venue":null,"work_id":"02ef9ed0-bd5c-451a-9d43-b78234e1866e","year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.654067Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:d36afa6190b0a6eeef5765adf700c1b6d10a62fbb756c76af026c68a142fdc9d","observation_id":"e5c31611-7c1a-425e-844d-ab4f15073cc7","resolution":{"observed_at":"2026-08-16T05:33:55.601465Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.584177Z","title":null,"venue":null,"work_id":"f96ba8fd-000b-4076-8177-2d422e501913","year":2023},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.658926Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:4d6a558dca996cc27f3637b60317ae59575dca5526def70be0b990a988c566fe","observation_id":"75112693-400f-4f00-81e1-d11ed27a516b","resolution":{"observed_at":"2026-08-16T05:33:55.588526Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.570753Z","title":null,"venue":null,"work_id":"2a878773-9b7c-4e77-b6a3-f6ee23546756","year":2020},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.663582Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:6489797b1c771759c345f67aa22cd89ad8f62dee6c32b44a6b8fb9c132606f5e","observation_id":"fceb0e6e-2eeb-412f-a0c7-205d3e69d311","resolution":{"observed_at":"2026-08-16T05:33:55.574951Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.556480Z","title":null,"venue":null,"work_id":"02b674b8-c404-4011-b2d4-7f2c32c9842f","year":2008},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.668176Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:0318e2bdcc5875577a9a4e8643026e076f53e32f700f4645c3e84e66850c734f","observation_id":"db2215bb-271f-4635-9878-9da324d49505","resolution":{"observed_at":"2026-08-16T05:33:55.560531Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.496739Z","title":null,"venue":null,"work_id":"4eb27326-fb1f-4d90-83a5-21ffce46c49b","year":2013},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.674242Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:a02e31e80e015783453961ca66839905748195407ba70e59f4897ab8cf282440","observation_id":"789489d2-68ab-4274-85a8-fa06140973d2","resolution":{"observed_at":"2026-08-16T05:33:55.547124Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.363636Z","title":", , Jingjia Luo, Mingxing Zhang, Kang Chen Xia Liao, Yingdi Shan, Jinlei Jiang, Yongwei Wu","venue":null,"work_id":"99d1597b-7e63-4550-b79c-fcdc2c228669","year":null},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.678253Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:018978fb364c9e898e8670d34c99ca8afe863de866fe420e45aebce090640a40","observation_id":"138e7c46-91ad-408c-a3f6-2e7b83dbb7ce","resolution":{"observed_at":"2026-08-16T05:33:55.382299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.332015Z","title":null,"venue":null,"work_id":"b1509d3b-7f85-4068-82f7-05ff2eb8dbda","year":2020},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.688192Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:8e3e3f4d1026374f5fd7d415cf2fae601bdd6457bc83b1a2f3fcded5b730a78a","observation_id":"f2a51f18-78ca-433c-b95d-9fddd587c8eb","resolution":{"observed_at":"2026-08-16T05:33:55.336302Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.692582Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.692582Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:9582c435a1b841a6eb8c354f712706e22da2480e400803e25fbf628774b55938","observation_id":"9e5bef8d-c810-4cd5-9bcf-bf3873cb4209","resolution":{"observed_at":"2026-08-16T05:33:54.692582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.306244Z","title":null,"venue":null,"work_id":"28ac72c4-5cc9-4b95-8f04-710f063cb5bb","year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.697744Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:1c417d6c6d9c6c76eb8181d0dd98d1c9b06e8a5696bd1aa72c1d345ca224e97f","observation_id":"dd30a57c-e81f-4036-8377-4e925726e920","resolution":{"observed_at":"2026-08-16T05:33:55.311196Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.290355Z","title":null,"venue":null,"work_id":"df461600-d1f0-4026-8d5a-3b95ffb015bc","year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.703104Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:c3cfff84d1ce204f6ed77c28a7c49834e6404d5c87840773349d1f3ebedabb48","observation_id":"34467b91-ab3b-4dca-aa2d-8e442343e4da","resolution":{"observed_at":"2026-08-16T05:33:55.295747Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.274331Z","title":null,"venue":null,"work_id":"4cf41c35-e13a-4d2f-8bd8-a26edda70fcf","year":2017},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.708124Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:3336667c7cf37ddc94ead925b769e396a75a4d32bf0259093e7fba20efb13829","observation_id":"0de1b343-3280-4126-9a36-77a0ec14e1da","resolution":{"observed_at":"2026-08-16T05:33:55.279156Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.234729Z","title":null,"venue":null,"work_id":"6218c4c6-c52b-4d2a-b7d0-ceea2f28d704","year":null},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.712460Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:e4cc9c54ae0b4c8d804233ef9fa6e9c170f19003336b6680dd7f76cb2b1ae506","observation_id":"cad45b1a-6b1f-40a2-acd5-0233ff3dd6af","resolution":{"observed_at":"2026-08-16T05:33:55.246740Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.717708Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.717708Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:a3b0e751d5b5318d71bef61582114de318e22d098968b9ce1757149e15606b10","observation_id":"e076cbe5-4477-4b93-956c-f87ba9b37162","resolution":{"observed_at":"2026-08-16T05:33:54.717708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.219866Z","title":null,"venue":null,"work_id":"81190a61-0c24-4b48-9718-8f91d3b19102","year":2022},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.722180Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:6860c7ffda8fb8093dca176fa8b83fde6d9a39cc3c03c8aac6fa7d1ee5de4485","observation_id":"51d9a9ed-68ce-4859-a98c-f5817428604d","resolution":{"observed_at":"2026-08-16T05:33:55.224468Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.205305Z","title":null,"venue":null,"work_id":"f55104bc-8a89-4d77-8196-0d4be704961f","year":2022},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.726367Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:5a12bd525b2820fac3f18f5441cdacd8d56a58e024f2277ba9cef4504c137c03","observation_id":"2bd45648-ae82-403d-90b7-c45653c360bf","resolution":{"observed_at":"2026-08-16T05:33:55.209606Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.04343","last_updated":"2025-03-02T19:44:37Z","snapshot_observed_at":"2026-08-17T04:15:37.543157Z","submitted_at":"2024-10-06T03:42:15Z","title":"Inference Scaling for Long-Context Retrieval Augmented Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.04343","snapshot_observed_at":"2026-08-16T05:33:54.730663Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.730663Z"},"links":{"cited_paper":"/paper/2410.04343","citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:99f749da3da12825725043cfb70ea9a6b11725f67d71887bb24a37d2240b9e08","observation_id":"7b581076-018e-4d34-945c-e147a5bc5017","resolution":{"observed_at":"2026-08-16T05:33:54.730663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12820","last_updated":"2025-03-30T08:13:50Z","snapshot_observed_at":"2026-08-17T00:49:15.253403Z","submitted_at":"2024-07-01T13:05:42Z","title":"PQCache: Product Quantization-based KVCache for Long Context LLM Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12820","snapshot_observed_at":"2026-08-16T05:33:54.735667Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.735667Z"},"links":{"cited_paper":"/paper/2407.12820","citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:94d6316ef5189a9f972d4f04b80d657ccab3a7f942fec324e6488de8fbdd9814","observation_id":"edf9dca0-ccde-488a-a0bf-9c5219ce3dce","resolution":{"observed_at":"2026-08-16T05:33:54.735667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.157678Z","title":null,"venue":null,"work_id":"ccf1dfdf-e04d-41e3-ab9d-2b7f2dcf7dec","year":2018},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.740234Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:2b731b13032c30b908245d9188b6c7aae03a6b0c3003c7af73f609dbf460dd97","observation_id":"0bc84bab-58d9-4f9f-9a0f-8a73ab33ac5d","resolution":{"observed_at":"2026-08-16T05:33:55.179597Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:54.745579Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.745579Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:54bf358f4a816ae0cbefd8f81afe2391f1f3c8d5211e4c7ee7697670130d0b6e","observation_id":"cc6fa91a-06fc-4c72-bf28-250e5f29c37f","resolution":{"observed_at":"2026-08-16T05:33:54.745579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.095526Z","title":null,"venue":null,"work_id":"b948630e-e482-4e8a-8c21-af46e5bd5b60","year":null},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.749935Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:1aac2d3894c9d839b0bd8abd76f813cd8c6828d30dc3dc1040f3f61a08d53e0b","observation_id":"c73a990c-19fd-4b6e-b477-9441b81d58a4","resolution":{"observed_at":"2026-08-16T05:33:55.118301Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.803301Z","title":"In 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","venue":null,"work_id":"59cc1b8a-514b-4af0-8fe5-b1d4add6b7fe","year":2011},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.564055Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:41a6198b490795a15753d3a5f9b5fb93d7dcf547eb3cfe15f8a71142e92c1867","observation_id":"6d316be5-38ae-45a2-83c0-064b270de01e","resolution":{"observed_at":"2026-08-16T05:33:55.808108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.346114Z","title":"In Proceedings of the 2021 International Conference on Management of Data","venue":null,"work_id":"e4628a39-0361-4328-9193-31f677835379","year":2021},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.683722Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:362a571692eba3a40f8dc3bd349d99931dc41932f2d78ec0ff6b3b5d679f7dbf","observation_id":"7c4e3175-e734-4d54-8e4a-95c693942604","resolution":{"observed_at":"2026-08-16T05:33:55.352245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:33:55.037722Z","title":null,"venue":null,"work_id":"c8c93782-37f1-4083-b79d-f655eda3243c","year":2023},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.755093Z"},"links":{"citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:e3bcfd00a44fee915bbb4e0cc21c8a83eda47b8c205d3636b40da950fc3e5c71","observation_id":"7f514457-83be-4776-b790-3e479edca74b","resolution":{"observed_at":"2026-08-16T05:33:55.065026Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.10516","last_updated":"2024-12-31T07:11:00Z","snapshot_observed_at":"2026-08-17T15:34:12.654681Z","submitted_at":"2024-09-16T17:59:52Z","title":"RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrieval","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.10516","snapshot_observed_at":"2026-08-16T05:33:54.587621Z","title":"arXiv preprint arXiv:2409.10516 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T05:33:54.587621Z"},"links":{"cited_paper":"/paper/2409.10516","citing_paper":"/paper/2504.20461"},"observation_digest":"sha256:4afe9299733992fe02edc0f165e45355dc847da4c5d0f6e7239330a985081b4a","observation_id":"66dc8508-4e68-48e1-9e95-256559bf92ce","resolution":{"observed_at":"2026-08-16T05:33:54.587621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.20461","last_updated":"2025-04-30T09:55:45Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-17T21:53:53.697402Z","submitted_at":"2025-04-29T06:50:20Z","title":"Efficient Graph-Based Approximate Nearest Neighbor Search Achieving: Low Latency Without Throughput Loss"},"reference_resolution":{"displayed":72,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":69,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":72},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 72 of 72 outbound references and 0 inbound Pith citation observations for arXiv:2504.20461."}