{"as_of":"2026-08-09T03:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c8e4273e5025632cf22fab5ade28decd7385fb651bf1f16acce10cdc952631ab","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:03:52.739527Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T08:44:13.310548Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T05:16:39.497751Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":"2507.19802","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.19802","snapshot_observed_at":"2026-07-28T01:22:21.423250Z","title":null,"venue":null,"work_id":"575469bc-a8c6-448c-b57f-180705dd28ac","year":2025},"citing_paper":{"arxiv_id":"2605.11523","last_updated":"2026-05-12T04:47:48Z","snapshot_observed_at":"2026-08-03T00:26:17.876728Z","submitted_at":"2026-05-12T04:47:48Z","title":"NAVIS: Concurrent Search and Update with Low Position-Seeking Overhead in On-SSD Graph-Based Vector Search","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-05-13T01:46:21.916718Z"},"links":{"cited_paper":"/paper/2507.19802","citing_paper":"/paper/2605.11523"},"observation_digest":"sha256:6ba934ff8d429898f008bef88b2a8fc3fefc5fb0e72c65839bcdd30e2dbccb56","observation_id":"b8f58569-3461-4ea2-9c27-db727937c926","resolution":{"observed_at":"2026-07-28T01:22:21.423250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":"2507.19802","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.19802","snapshot_observed_at":"2026-07-28T01:22:21.423250Z","title":null,"venue":null,"work_id":"575469bc-a8c6-448c-b57f-180705dd28ac","year":2025},"citing_paper":{"arxiv_id":"2605.23887","last_updated":"2026-05-22T17:47:45Z","snapshot_observed_at":"2026-08-08T17:52:09.880645Z","submitted_at":"2026-05-22T17:47:45Z","title":"CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-05-25T02:14:13.160967Z"},"links":{"cited_paper":"/paper/2507.19802","citing_paper":"/paper/2605.23887"},"observation_digest":"sha256:98f1d7b2870db162f602812f40ef51a8a582825ec4c1c124fa8dda17f8821e26","observation_id":"e5d510d4-1d9f-4c3b-9b7d-303b49146887","resolution":{"observed_at":"2026-07-28T01:22:21.423250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":"2507.19802","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.19802","snapshot_observed_at":"2026-07-28T01:22:21.423250Z","title":null,"venue":null,"work_id":"575469bc-a8c6-448c-b57f-180705dd28ac","year":2025},"citing_paper":{"arxiv_id":"2606.02992","last_updated":"2026-06-02T00:59:39Z","snapshot_observed_at":"2026-08-06T19:36:50.731451Z","submitted_at":"2026-06-02T00:59:39Z","title":"Slipstream: Locality-Aware Graph Index Construction for Streaming Approximate Nearest Neighbor Search","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-06-28T08:44:13.310548Z"},"links":{"cited_paper":"/paper/2507.19802","citing_paper":"/paper/2606.02992"},"observation_digest":"sha256:893e112ef28b4c48756b1780583750d1bf20e011cdeb70bc2bed2022602a4fb9","observation_id":"5258c7ba-ef60-480b-9b2c-91b82d91370e","resolution":{"observed_at":"2026-07-28T01:22:21.423250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":"2507.19802","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.19802","snapshot_observed_at":"2026-07-28T01:22:21.423250Z","title":null,"venue":null,"work_id":"575469bc-a8c6-448c-b57f-180705dd28ac","year":2025},"citing_paper":{"arxiv_id":"2606.03151","last_updated":"2026-06-02T04:50:26Z","snapshot_observed_at":"2026-08-03T04:22:46.528336Z","submitted_at":"2026-06-02T04:50:26Z","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-28T08:21:33.893478Z"},"links":{"cited_paper":"/paper/2507.19802","citing_paper":"/paper/2606.03151"},"observation_digest":"sha256:bdd5af3293b22f014b1a9c21089c195b61da84f68b463df05b70baacf28be84f","observation_id":"95d6cfa4-def6-4f2e-9371-fd0d9a324002","resolution":{"observed_at":"2026-07-28T01:22:21.423250Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.19802/citation-record","integrity":"/paper/2507.19802/integrity","json":"/paper/2507.19802/citation-record.json","paper":"/paper/2507.19802"},"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-06T14:03:57.998254Z","title":null,"venue":null,"work_id":"ce2761d9-aef5-4f4e-b5dd-c2e0f0905c64","year":2024},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.007427Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:f48819f56b125a2786a7f03fc27e3a873c1f7af7b061f711ceb3de5e1324bc3c","observation_id":"6fee7114-35e2-4f87-b708-6fd12f988761","resolution":{"observed_at":"2026-08-06T14:03:58.070190Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:57.802094Z","title":null,"venue":null,"work_id":"5fb72e97-275a-4780-8996-d692056f81e4","year":2024},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.072633Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:3554a1f9aeaf3d0d50fa9745da04fe19f97c0fdb1017f350611044f8742f41a7","observation_id":"34d3247e-da8c-4f3b-9766-a44d5037d461","resolution":{"observed_at":"2026-08-06T14:03:57.873674Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.05614","last_updated":"2018-07-17T20:45:47Z","snapshot_observed_at":"2026-07-06T06:50:19.711232Z","submitted_at":"2018-07-15T21:25:55Z","title":"ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.05614","snapshot_observed_at":"2026-08-06T14:03:49.137691Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.137691Z"},"links":{"cited_paper":"/paper/1807.05614","citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:34df94c033ed3e49e723e799e4ca934c907e16f6caac18a2092909d91a2f01cc","observation_id":"9a7c1417-8bab-4c60-ab8a-a97f0b70f81c","resolution":{"observed_at":"2026-08-06T14:03:49.137691Z","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-06T14:03:57.649527Z","title":null,"venue":null,"work_id":"8f0c85df-f873-45dc-93bb-043791a7612e","year":2024},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.217848Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:4366f1f280244aa7ab10d01cb0a64595c4fa2062b1b0d07cf5ae2cd5de2286fd","observation_id":"5b25e9ad-74eb-45d5-a7e6-5a3c9c71caf2","resolution":{"observed_at":"2026-08-06T14:03:57.736066Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.08566","last_updated":"2021-11-05T06:28:15Z","snapshot_observed_at":"2026-07-06T12:09:08.635616Z","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-06T14:03:49.283567Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.283567Z"},"links":{"cited_paper":"/paper/2111.08566","citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:324393b62310a1af32bb4df99f2acbdf56512ef4429648c7471bec52dd67bc2a","observation_id":"be31ce9f-7539-4ad9-b06d-35687bac0417","resolution":{"observed_at":"2026-08-06T14:03:49.283567Z","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-06T14:03:57.474661Z","title":null,"venue":null,"work_id":"0187b2a0-510a-48b5-a4a2-642b35379528","year":2018},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.393305Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:2624352f3ee9ca75081a8079185a4762b756e98be39c780d62b5605a439d31f0","observation_id":"a7633e63-290f-4796-8165-ddedb983ccc0","resolution":{"observed_at":"2026-08-06T14:03:57.559718Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:57.285496Z","title":null,"venue":null,"work_id":"78cb90ca-1aa7-4820-9c07-7a244acad9c1","year":2023},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.445235Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:bb67219143be1b730afa8f2999b6d5ec677eaba3a2fcef5689db4ec2e4edc260","observation_id":"a7b23cb5-b4cc-4ef3-ac78-1f18fccc76d8","resolution":{"observed_at":"2026-08-06T14:03:57.377054Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:49.514548Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.514548Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:492e60a1c773ce4d1463b265feb4f09d354bf5a66d64a3c6ad5196abe4950bd2","observation_id":"4751376c-cde7-4780-afa8-818bb4176b47","resolution":{"observed_at":"2026-08-06T14:03:49.514548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-014-9885-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:52.926785Z","title":null,"venue":null,"work_id":"cb851a48-f587-4ea5-9722-4f47450b677c","year":2015},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.594816Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:568cca1af6852e769f35715e4a93684b5fa04eecef00358c01f496c63157e50f","observation_id":"69d2de96-04c2-43da-9928-2a9d1d1a4308","resolution":{"observed_at":"2026-08-06T14:03:52.994113Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7817.99785","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:55.466952Z","title":"Mirrokni","venue":null,"work_id":"3e19b38f-8881-45ee-a33c-ad6288df5c52","year":2004},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.663398Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:91f88819864230781786532fef90e64a31e004fba2db49440ec9ec7a6fde363e","observation_id":"a6ae8bf4-8a87-47f6-8126-d302b4260b78","resolution":{"observed_at":"2026-08-06T14:03:55.506463Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:49.807876Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.807876Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:f7d83e6f7cb81c2a8afc83513d1b4f42d8c7f03c4e9f9d598682f16bf058c538","observation_id":"97be7e43-6e68-426f-a50f-96115a0af362","resolution":{"observed_at":"2026-08-06T14:03:49.807876Z","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-06T14:03:57.130107Z","title":null,"venue":null,"work_id":"b9a43725-44fe-43ee-96ce-041058fd8a69","year":1999},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:49.918782Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:e702fce485ec6270f2244346bbebb31ae986087da4951d3658c0d4843e80e80e","observation_id":"8f4b70de-1da7-4b22-a3c2-f62ae4f433d9","resolution":{"observed_at":"2026-08-06T14:03:57.204351Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10396","last_updated":"2020-12-04T21:29:31Z","snapshot_observed_at":"2026-08-08T01:33:44.200370Z","submitted_at":"2019-08-27T18:27:17Z","title":"Accelerating Large-Scale Inference with Anisotropic Vector Quantization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10396","snapshot_observed_at":"2026-08-06T14:03:50.074410Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:50.074410Z"},"links":{"cited_paper":"/paper/1908.10396","citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:578bdc5a956418f25de1580822120ca33b5fd6092f84b8e7528a5392ac6122b9","observation_id":"c88995f3-3899-46b0-9ee8-919175a07ead","resolution":{"observed_at":"2026-08-06T14:03:50.074410Z","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-06T14:03:50.192647Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:50.192647Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:8aea1a586b449ee19da1bf7ed880f6c67db5b112dc746cb8631b76b8a4df8ccd","observation_id":"3586f9fe-cf8d-41ee-a9f2-51b739a7f937","resolution":{"observed_at":"2026-08-06T14:03:50.192647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.10479","last_updated":"2023-07-21T19:24:10Z","snapshot_observed_at":"2026-07-06T15:56:11.474781Z","submitted_at":"2023-07-19T22:20:06Z","title":"Fast Approximate Nearest Neighbor Search with a Dynamic Exploration Graph using Continuous Refinement","version":2},"cited_work":{"arxiv_id":"2307.10479","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.10479","snapshot_observed_at":"2026-08-06T14:03:55.256344Z","title":"Fast Approximate Nearest Neighbor Search with a Dynamic Exploration Graph using Continuous Refinement","venue":"cs.IR","work_id":"fa33e7de-de4e-401c-95ad-93784ffaf2e5","year":2023},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:50.290814Z"},"links":{"cited_paper":"/paper/2307.10479","citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:bc78d5187a372e1eade026e3344d493f29793c4eab1134c1cf68c6ed16767e40","observation_id":"63de5045-00d9-493d-bcf1-d518cec15a0a","resolution":{"observed_at":"2026-08-06T14:03:55.282618Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2015.71692","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:55.162282Z","title":null,"venue":null,"work_id":"033b8888-aa1b-4a93-90cd-266f401eb419","year":2015},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:50.407613Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:7414c72d11caa5248cad06ca866d4c2a0f8181cab3fb5b259bbbe15afcdedafb","observation_id":"23fb7c27-c29d-4c15-afad-cb903c41a8e6","resolution":{"observed_at":"2026-08-06T14:03:55.204927Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:56.980995Z","title":null,"venue":null,"work_id":"b7002b2b-718e-48ae-8a7d-6aaf33ceffb2","year":2024},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:50.502333Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:67c2d34b53d484a64556f9dbf314d64e4ca6470fb6ca0cc8b0604be1b7b677e2","observation_id":"cb74a245-bb90-4f24-b77c-222de028b875","resolution":{"observed_at":"2026-08-06T14:03:57.046352Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:50.582155Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:50.582155Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:5f9d92cf711d84e2104633ed71563b21ca22757db784e8d51fc73ebf80b6c875","observation_id":"133d2d75-ccce-47ae-8c44-149ce13721d4","resolution":{"observed_at":"2026-08-06T14:03:50.582155Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.07355","last_updated":"2018-10-17T02:22:34Z","snapshot_observed_at":"2026-08-07T19:48:53.448770Z","submitted_at":"2018-10-17T02:22:34Z","title":"Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.07355","snapshot_observed_at":"2026-08-06T14:03:50.664623Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:50.664623Z"},"links":{"cited_paper":"/paper/1810.07355","citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:f97d65c95056ada43245164ef623ab45f9e119b3b3d7838c1a4a31cf04d00199","observation_id":"395320a2-ab1f-4303-92d5-4da9a76875f3","resolution":{"observed_at":"2026-08-06T14:03:50.664623Z","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-06T14:03:56.850503Z","title":null,"venue":null,"work_id":"92b639ce-558b-443e-8be3-93f90951fa7f","year":2019},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:50.809504Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:b2817a3b2c223b17d1f6a7ddca33f9914b563e074aa45c878aa0cfd66c2db1cd","observation_id":"32aead02-8575-4bc9-b7af-3595d01e2f81","resolution":{"observed_at":"2026-08-06T14:03:56.911840Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:50.973908Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:50.973908Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:a71d9b2d797edbc39dfcd1f40765e3a6a41613bf2b8eeb1f3950ed9650db346c","observation_id":"471faf78-4ed6-4f47-8e66-eb98a579a7ca","resolution":{"observed_at":"2026-08-06T14:03:50.973908Z","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":"2017.83390","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:54.750604Z","title":null,"venue":null,"work_id":"182e0c36-cb88-49f4-b7a3-7c466fb5ad84","year":2017},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.076272Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:03342683d9ca2fc59b3a5346d5c484fd31211838b3370ef23ebe6204bd7835cd","observation_id":"54a7e65c-1138-429b-b44a-b1cee6ca4699","resolution":{"observed_at":"2026-08-06T14:03:54.856043Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:51.146529Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.146529Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:69220b8db5c965b916fcbad21fef1f3baadffd0aa6d012a7d547d108ce8c7dfb","observation_id":"d70fca6a-8c4a-45a0-a427-bdc24224785b","resolution":{"observed_at":"2026-08-06T14:03:51.146529Z","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-06T14:03:56.651513Z","title":null,"venue":null,"work_id":"044b4cb7-ab53-4e13-b1b7-264a452cef1e","year":2004},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.251078Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:858ff1edad92ed033282369fc182ad21af644a33c38035de28f96436a5a21039","observation_id":"78047a2d-14f0-4267-80df-2c577c3ec6f6","resolution":{"observed_at":"2026-08-06T14:03:56.739392Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1997.65211","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:54.539094Z","title":"Kuan and P","venue":null,"work_id":"bed0476b-a3b6-47ae-9170-9ada8365edcd","year":1997},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.312557Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:b03b3a6971127703f7aa2ed13268aa5c7fd120675a13d9194fb8b84a6b712edd","observation_id":"07dfa06d-7bf9-4917-8401-169bf9516552","resolution":{"observed_at":"2026-08-06T14:03:54.609855Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.11401","last_updated":"2021-04-12T15:42:18Z","snapshot_observed_at":"2026-08-07T05:44:30.677502Z","submitted_at":"2020-05-22T21:34:34Z","title":"Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.11401","snapshot_observed_at":"2026-08-06T14:03:51.398829Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.398829Z"},"links":{"cited_paper":"/paper/2005.11401","citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:b493a3b182252141eda7b77f659e9241f9a7c4e21cca83687a7be4cc4cccbb75","observation_id":"bc0fa2ed-3a25-4bba-8610-f7634abfe092","resolution":{"observed_at":"2026-08-06T14:03:51.398829Z","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-06T14:03:51.499997Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.499997Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:c70319ca64af3edcbc16704304af656857664fb7f676d1ef6a2e510d53043382","observation_id":"f430ddca-c831-4e25-b0b5-cb7f33c6c892","resolution":{"observed_at":"2026-08-06T14:03:51.499997Z","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-06T14:03:51.578217Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.578217Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:76a8caf4d389a2d8cba0aae5cc0f3bbf4b9005404cac144b6b659adf49048a1e","observation_id":"d8982623-56a7-40cf-b59c-4910f1d61e05","resolution":{"observed_at":"2026-08-06T14:03:51.578217Z","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-06T14:03:56.504078Z","title":null,"venue":null,"work_id":"8ec9fa40-d806-4d5f-9553-c134cda8d32e","year":2004},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.612650Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:a6de3f2e1188b7b0bfb68a4d9c36efdf2bb27fc01f23988c2f0846b174665afc","observation_id":"142c264c-2ee0-4a86-a1fd-8ab67ba2abe8","resolution":{"observed_at":"2026-08-06T14:03:56.559537Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:51.741565Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.741565Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:b5aa2196080f275127df46a655b0bc41afe897cf649f3c6f688bfe983f237c02","observation_id":"7777278b-2e42-40a7-89da-b1b6129eac27","resolution":{"observed_at":"2026-08-06T14:03:51.741565Z","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-06T14:03:51.811783Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.811783Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:99b8be7e5c3bdd3ef26e7e32d6436d585f9ed67764ad2aa6bc7e20d873a76e26","observation_id":"5779c8cd-b7ef-48df-9aa8-2bd22baaacbc","resolution":{"observed_at":"2026-08-06T14:03:51.811783Z","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-06T14:03:56.376389Z","title":"Malkov and D","venue":null,"work_id":"bee6c0cf-83fc-4d12-b42b-e8fc2a08caed","year":2020},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.905477Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:4503d5308bc14b32f484e6ad1ab49fe3aaff3563def96a7b9512330e05e9e0d8","observation_id":"f97e4f6f-61d8-491f-ae02-45ffaddc81ef","resolution":{"observed_at":"2026-08-06T14:03:56.444989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7535.36384","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:54.071751Z","title":null,"venue":null,"work_id":"fd9c6fcf-c88c-4128-af62-d5417dd19505","year":2024},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.001575Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:72b97c462115bcf94d749ef6dcf4f0f418d9ffb2ec0460200500b99874a29da0","observation_id":"abe86df4-6607-4c6f-957e-c231c9f83b5c","resolution":{"observed_at":"2026-08-06T14:03:54.192512Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7856.11378","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:53.733605Z","title":null,"venue":null,"work_id":"e057fb33-3ad1-4424-a629-bc36a7dcd6fd","year":2006},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.053903Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:09d99afc069a54130d5132a5a409bb994163d138db1b1eddbaa994cc99981ed1","observation_id":"29487cd2-e1da-4c9e-a4ed-f2da11a242d3","resolution":{"observed_at":"2026-08-06T14:03:53.833627Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21778","last_updated":"2024-07-31T17:50:54Z","snapshot_observed_at":"2026-08-06T04:16:29.279227Z","submitted_at":"2024-07-31T17:50:54Z","title":"Tulip Agent -- Enabling LLM-Based Agents to Solve Tasks Using Large Tool Libraries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21778","snapshot_observed_at":"2026-08-06T14:03:52.122800Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.122800Z"},"links":{"cited_paper":"/paper/2407.21778","citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:49a976e189e050889085e9c442b50c8e62d6b0fbf01ae89a792c3e38ae4872f9","observation_id":"937bad56-0ac2-49dc-a6c3-46d2b1f57ed9","resolution":{"observed_at":"2026-08-06T14:03:52.122800Z","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-06T14:03:56.272449Z","title":null,"venue":null,"work_id":"5425a56d-8f40-473b-960f-1f492f22c0d8","year":1997},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.200192Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:306f1e19d7ac4953641188948a8a99904737ed06303ada2d770c34ddd46388f1","observation_id":"0394ec92-a149-4b8a-b74a-0b383dbd0aac","resolution":{"observed_at":"2026-08-06T14:03:56.301326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:52.208047Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.208047Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:85523e2b33d8b5fcaf037affe6b560298002500d65b9aee3432f08e3ff3a711a","observation_id":"8a77f15e-3a09-4aeb-9163-98476c1af9be","resolution":{"observed_at":"2026-08-06T14:03:52.208047Z","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-06T14:03:56.137924Z","title":null,"venue":null,"work_id":"7b54c822-30a3-464e-9805-baa142b4fccd","year":2008},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.234355Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:9a23deb291ae30da6c955608075e053f45632d5256ac3e2b0554d13048086eff","observation_id":"f1c39378-3c67-4823-b8b0-46eb43a92dc3","resolution":{"observed_at":"2026-08-06T14:03:56.201977Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:52.261144Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.261144Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:b9ea2fdb999e40a7c72c4d05cabb86018a39bf8afb9f3b6a74ef6d552becf0ef","observation_id":"a40df5f9-eef8-4c1f-b2a5-374a8ee3a6fa","resolution":{"observed_at":"2026-08-06T14:03:52.261144Z","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-06T14:03:56.052045Z","title":null,"venue":null,"work_id":"dfdd7b22-fce1-4fd6-ab26-09cde8d705b3","year":2024},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.318352Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:f42a290f7cb82ad6fb2e529c21728feb5f52b2eedb8df2ae526ded2f58ece028","observation_id":"24db9421-6e05-446a-a551-c80fda5ae5a5","resolution":{"observed_at":"2026-08-06T14:03:56.098887Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:52.365275Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.365275Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:321aa4033474025421f2998061ac91bcdbd0df134a6878b1006576b1f4324fea","observation_id":"15202e38-29ea-4611-b7e2-d6795a10b954","resolution":{"observed_at":"2026-08-06T14:03:52.365275Z","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-06T14:03:55.960514Z","title":null,"venue":null,"work_id":"ea06aa2e-2d6c-40b6-8d5f-0264dbeb93bf","year":2018},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.381996Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:0204cdcfc37e8b7bb2c69918adb0ee503ee50e8e34a42bc1ee1d3cbb29b5c215","observation_id":"b346c779-6e67-487b-b3cd-ebdbe77caf5b","resolution":{"observed_at":"2026-08-06T14:03:55.984537Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T14:03:55.860965Z","title":null,"venue":null,"work_id":"c4a20d52-353a-4012-ad10-d2384e32bc9a","year":null},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.409467Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:97da08a64651b5b2e3d0b5243b77ce349cefbf2337be56fe8e76d3b1d59ee70f","observation_id":"43f5544e-201c-406c-b2d7-bd69d3aa49c6","resolution":{"observed_at":"2026-08-06T14:03:55.896928Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09613","last_updated":"2021-05-20T09:17:13Z","snapshot_observed_at":"2026-08-07T07:51:37.438902Z","submitted_at":"2021-05-20T09:17:13Z","title":"FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.09613","snapshot_observed_at":"2026-08-06T14:03:52.480904Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.480904Z"},"links":{"cited_paper":"/paper/2105.09613","citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:6a54c33a99afc8192ecb68e8794eb57865af842a0324dec22c93aa68cb9248a1","observation_id":"f0ec911e-ff60-466d-bb56-ab1c8f02d1b6","resolution":{"observed_at":"2026-08-06T14:03:52.480904Z","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-06T14:03:55.686313Z","title":null,"venue":null,"work_id":"d0bb5c4e-7ca5-4504-8840-d457c0d8dccb","year":2010},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.528171Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:8552bcf08fb9586e12080a6caa0ca46e5772057125c67b162d60c2ff2be893c0","observation_id":"1b0abbc4-ad3d-4998-ad7c-1999e91ccfd2","resolution":{"observed_at":"2026-08-06T14:03:55.753016Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.00774","last_updated":"2024-03-31T19:09:09Z","snapshot_observed_at":"2026-08-05T23:17:26.160347Z","submitted_at":"2024-03-31T19:09:09Z","title":"SOAR: Improved Indexing for Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.00774","snapshot_observed_at":"2026-08-06T14:03:52.537483Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.537483Z"},"links":{"cited_paper":"/paper/2404.00774","citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:de6208517dd1417e78e8ce60ff6eb517e75559fd8627827f5b892e76864cc824","observation_id":"cc8117ff-e9b3-4fd4-b16d-ff2ab7dbc2b9","resolution":{"observed_at":"2026-08-06T14:03:52.537483Z","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-06T14:03:52.564076Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.564076Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:82274e960ffa0ec9fea696e137d67847142159275f39eb70b1dfe3f18ecd0199","observation_id":"34adbbfe-ad1e-4283-8841-54d783a227f2","resolution":{"observed_at":"2026-08-06T14:03:52.564076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13826","last_updated":"2025-02-19T15:41:08Z","snapshot_observed_at":"2026-08-07T18:04:40.708988Z","submitted_at":"2025-02-19T15:41:08Z","title":"In-Place Updates of a Graph Index for Streaming Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13826","snapshot_observed_at":"2026-08-06T14:03:52.607795Z","title":"Bernstein, Badrish Chan- dramouli, Richard Wen, and Harsha Vardhan Simhadri","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.607795Z"},"links":{"cited_paper":"/paper/2502.13826","citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:ec58e8ce2367c2e56daeb73640c09aafa1a1d25f5ec8dec6381d063dd6f0563b","observation_id":"728fe753-7620-4b90-a336-1dfd742cd9dc","resolution":{"observed_at":"2026-08-06T14:03:52.607795Z","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-06T14:03:52.659687Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.659687Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:7fe9e4d39f3ca0e55cfa4bbc5ae5eb62262daccfd19878f9ed7f0c24ba3717fc","observation_id":"72cc28d9-02b3-4fee-b98f-456e4312fec1","resolution":{"observed_at":"2026-08-06T14:03:52.659687Z","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-06T14:03:52.690860Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.690860Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:d132e5254ff492280b362008d869afa6852251c525ca9e35c15ff98f0eb470b1","observation_id":"e2ceba8c-f9fb-4677-9e28-45501ff5f38e","resolution":{"observed_at":"2026-08-06T14:03:52.690860Z","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-06T14:03:52.739527Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.739527Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:e0b107bae9179e71ffb70cc50f75e0622e9f55939134411c9c2c3691359496fb","observation_id":"6e62031a-5204-4052-a1b2-c0b5f0e19f9e","resolution":{"observed_at":"2026-08-06T14:03:52.739527Z","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-06T14:03:51.953868Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":836,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.953868Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:a0af0524b3eaa25b52d30862cc4efbaf05b129f78a8b9c07069bb4eea1a8c972","observation_id":"9384ffe6-145e-47aa-bb52-27b69c9253b5","resolution":{"observed_at":"2026-08-06T14:03:51.953868Z","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-06T14:03:51.854040Z","title":"Information Systems 45 (2014), 61–68","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:51.854040Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:7a4d3853d7361e03e7dd6518411586d06b04bfd4b9b876586bdc677db6b140e5","observation_id":"ebae26f0-371d-4cb7-8557-7a96a0c80171","resolution":{"observed_at":"2026-08-06T14:03:51.854040Z","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-06T14:03:55.799539Z","title":"https://github.com/Microsoft/DiskANN","venue":null,"work_id":"2ad40be3-fec0-49f4-911e-d756446e7587","year":null},"citing_paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T14:03:52.448300Z"},"links":{"citing_paper":"/paper/2507.19802"},"observation_digest":"sha256:6d8a563856337cbde792f34c23c6f1f7e6d7890362e649df0a4e679ca6aa9d1a","observation_id":"3f61dec2-6ed1-45a7-86d8-0c14eeb5a633","resolution":{"observed_at":"2026-08-06T14:03:55.816705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.19802","last_updated":"2026-07-26T00:10:03Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-08T22:50:02.917839Z","submitted_at":"2025-07-26T05:27:32Z","title":"CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":2,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":44,"verified_exact":2,"verified_fuzzy":2},"total_outbound_references":54},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 4 inbound Pith citation observations for arXiv:2507.19802."}