{"as_of":"2026-08-13T11:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9a952c05e984a40378528b5335509bfcd70ca8b654b6d3affafb19040788a0e6","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:43:14.981809Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T15:54:52.791456Z","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-05-11T09:36:13.246489Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":"2506.13144","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.13144","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"EnhanceGraph: A continuously enhanced graph-based index for high-dimensional approximate nearest neighbor search","venue":null,"work_id":"a8cdd482-b649-42cb-a9b2-123f2b744775","year":2025},"citing_paper":{"arxiv_id":"2604.11274","last_updated":"2026-04-13T10:30:08Z","snapshot_observed_at":"2026-08-13T10:32:20.829463Z","submitted_at":"2026-04-13T10:30:08Z","title":"Mycelium-Index: A Streaming Approximate Nearest Neighbor Index with Myelial Edge Decay, Traffic-Driven Reinforcement, and Adaptive Living Hierarchy","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T15:54:52.791456Z"},"links":{"cited_paper":"/paper/2506.13144","citing_paper":"/paper/2604.11274"},"observation_digest":"sha256:1a2b9ba933f5b80e2fd3c716c352b0b3906f92fe71ddb32f0388dbd6b160c2aa","observation_id":"daf91c62-dfca-4b9a-b4b3-32c793e008ac","resolution":{"observed_at":"2026-05-11T09:36:13.315458Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.13144/citation-record","integrity":"/paper/2506.13144/integrity","json":"/paper/2506.13144/citation-record.json","paper":"/paper/2506.13144"},"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-07T00:43:15.523663Z","title":"Ongoing face recognition vendor test (frvt) part 2: Identification,","venue":null,"work_id":"fef2c2c4-a17a-46bd-9433-17edca9ac0c9","year":2018},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.812849Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:7c0dcc3d94baf603ac048fd6fd4fc2a12278dba1e3e16edeb17b08b20e16637b","observation_id":"1b2454e2-3cc0-49b4-b1f9-e295b006933d","resolution":{"observed_at":"2026-08-07T00:43:15.527486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.512434Z","title":"Full text search engine as scalable k-nearest neighbor recommendation system,","venue":null,"work_id":"debfe64c-2d9f-4a53-8661-bf440703114e","year":2010},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.817491Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:b8c2eb1e29020ffd355286497633d8345b8ff8e1ae1d74672bd74686c32a551c","observation_id":"02190f3d-35bb-4db6-bb17-4e3cdf068094","resolution":{"observed_at":"2026-08-07T00:43:15.516065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.498498Z","title":"High-throughput vector similarity search in knowledge graphs,","venue":null,"work_id":"f2761be0-e916-4230-a980-005f3d73284a","year":2023},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.821167Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:26822315fbba376efb884fd483766c8c43bb6effcf669935d13798b6b2f18615","observation_id":"b4a8431c-4e4d-4fa0-a897-43f836870626","resolution":{"observed_at":"2026-08-07T00:43:15.504068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.487222Z","title":"The curse of dimensionality in data mining and time series prediction,","venue":null,"work_id":"4b69275a-3d8f-4d1a-88d7-84c633eec216","year":2005},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.824795Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:d8b6b534635d4b5587c6d68c6ebd9bcff72786087dd9fb98f7ddad808aba627d","observation_id":"11f2107d-8086-466e-8fc8-fdb2fc41df11","resolution":{"observed_at":"2026-08-07T00:43:15.490766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.476586Z","title":"Approximate nearest neighbors: towards removing the curse of dimensionality,","venue":null,"work_id":"bf9c4d4c-c9c4-4e6b-acd5-d792c8c427b4","year":1998},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.828486Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:a48180cd34dadb643ca0e746ca85d19e761591c62ecf7b12b1fe7b804c36682b","observation_id":"bdafbba4-5579-40eb-ad7c-e2ed05bcfdca","resolution":{"observed_at":"2026-08-07T00:43:15.480323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.465890Z","title":"Fanng: Fast approximate nearest neighbour graphs,","venue":null,"work_id":"7315bb62-7b47-4c5f-ab1b-491a4c072f8e","year":2016},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.832315Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:fae51cda81cebcdf3a78be63c3e8dc91498d51dd61295417d377b75a36e03f0a","observation_id":"50f1a5ef-c9ab-45e0-9735-b1dabd409f9f","resolution":{"observed_at":"2026-08-07T00:43:15.469585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.454380Z","title":"Fast approximate nearest neighbor search with the navigating spreading-out graph,","venue":null,"work_id":"475b7d07-4301-41ba-a67b-ad543707b798","year":2019},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.835899Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:b3e719af0f7e77bb6f62acf5313d5d522660631141ff7a2234940e37bf302e3d","observation_id":"840a3450-5e44-4ca6-ab5e-9977fe0add56","resolution":{"observed_at":"2026-08-07T00:43:15.459015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.444039Z","title":"Filtered-diskann: Graph algorithms for approximate nearest neighbor search with filters,","venue":null,"work_id":"be96c765-4529-4b71-8b74-dd9d87dc8475","year":2023},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.839647Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:e2621ace693ae3256b2b9e3b4ca37b097d70f6c639ff77763cf311d9e2b8cf73","observation_id":"36783082-a269-4d3d-abd0-0139c42fda86","resolution":{"observed_at":"2026-08-07T00:43:15.447644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:14.842823Z","title":"Efficient and robust approxi- mate nearest neighbor search using hierarchical navigable small world graphs,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.842823Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:f1ff34a34aa2fa8dd96222015ab868d347db7a841d4c8dfa7c43b81912c8b44a","observation_id":"ee1344f3-4bb4-44fb-b859-b20476cc6ed5","resolution":{"observed_at":"2026-08-07T00:43:14.842823Z","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-07T00:43:15.426866Z","title":"An optimal algorithm for approximate nearest neighbor searching fixed dimensions,","venue":null,"work_id":"3304f932-8d55-48b5-83b9-cb1ecad90429","year":1998},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.845986Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:b4f1f188f2e41785cf6f4bf298ba9eb95a720cb6e7aee3077a435f36c66c8c8d","observation_id":"c417b6ee-0e7a-4f12-a141-a043ae6d97bd","resolution":{"observed_at":"2026-08-07T00:43:15.430449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.416796Z","title":"Revisiting kd-tree for nearest neighbor search,","venue":null,"work_id":"3e7d88e0-a84b-4d74-8942-f3131e302c9b","year":2019},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.850124Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:e070c39d68d42119ef4d7f11ce7eed59ae84ab13fec96587347b4189be20a5e4","observation_id":"17e5c66e-bdca-420c-a0bb-2fe067a3e027","resolution":{"observed_at":"2026-08-07T00:43:15.420449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.406319Z","title":"Spann: Highly-efficient billion-scale approximate nearest neighborhood search,","venue":null,"work_id":"4694d363-accc-4fbb-adfd-3e9b0a118396","year":2021},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.853596Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:4c43454009a96ad99b7c32cea2674b4e23de1b5a657c8e22f774a117a9bdb7cd","observation_id":"f4c85909-9bdb-4091-a69e-81fecd4f008c","resolution":{"observed_at":"2026-08-07T00:43:15.410011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.395240Z","title":"Multi- probe lsh: efficient indexing for high-dimensional similarity search,","venue":null,"work_id":"899c5da5-6756-4c29-82f9-89b30ed282d0","year":2007},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.856758Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:4d34f6bcb30629eeb443a3d624916a58bcb404b44f234f4fa6c7bad83fd61195","observation_id":"278f98c0-0bc1-47c6-95b0-e3c947041289","resolution":{"observed_at":"2026-08-07T00:43:15.399246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.384251Z","title":"A general and efficient querying method for learning to hash,","venue":null,"work_id":"68d9c55a-60fb-4eec-bac6-a8ef8c7bc729","year":2018},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.860315Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:a8bb4f2c8559fc0db6745aebc9a342cb1b5dd8701522f9ab4bcd58b7eaa94049","observation_id":"a2534c7a-8750-45cb-90e9-5f5977739dbd","resolution":{"observed_at":"2026-08-07T00:43:15.388031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.373476Z","title":"Towards efficient index construction and approximate nearest neighbor search in high- dimensional spaces,","venue":null,"work_id":"a64bcb5b-4aad-462a-8b6c-18906cb82cda","year":1979},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.863807Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:b3459cb7d8ac0904134eea8a6cab7ba3267ad59a856bbff8a705fb65b4f6244c","observation_id":"10570216-45ab-490e-9b09-051cd62ecd18","resolution":{"observed_at":"2026-08-07T00:43:15.377662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.362576Z","title":"Approximate nearest neighbor search on high dimensional data—experiments, analyses, and improvement,","venue":null,"work_id":"ca2c9514-f97e-4790-b8ae-54b6bf273d7a","year":2019},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.867487Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:eeb40ab61287a8f342ee10bf92049a7b5f8322c7f14c217e12b2eb974814153d","observation_id":"eed006a9-544b-43c6-8ea8-9ecda7463e50","resolution":{"observed_at":"2026-08-07T00:43:15.366703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.351083Z","title":"A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search,","venue":null,"work_id":"662d5cfd-d778-4004-9660-efc5369d3cb0","year":1964},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.870644Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:6cf3ecbfc9410036374f491be3f717fdaa385a915029a99e4739afe529c7e3be","observation_id":"491ff914-ba12-4514-9933-19af93a01e9e","resolution":{"observed_at":"2026-08-07T00:43:15.355089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.340569Z","title":"Fast approximate nearest-neighbor search with k-nearest neighbor graph,","venue":null,"work_id":"bd03b91d-543f-438a-87e0-b333fbeaac60","year":2011},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.873766Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:cb22a8b44a840789fa15127da924b3725f27b9ecf4b3d4d64eb4ca2d6ce91656","observation_id":"14b3c396-8287-49cd-95ff-7f8ce1c43619","resolution":{"observed_at":"2026-08-07T00:43:15.344255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.329797Z","title":"Fast and accurate hashing via iterative nearest neighbors expansion,","venue":null,"work_id":"20c194a6-b997-49a9-a2e7-497c7d9e27d0","year":2014},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.876729Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:efc679b75f08704ce3c460022b260da6693f11146fa9b416cc01b97332907d19","observation_id":"c931e514-93b0-4d25-b870-52ecefeee1f9","resolution":{"observed_at":"2026-08-07T00:43:15.333636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.319011Z","title":"The relative neighbourhood graph of a finite planar set,","venue":null,"work_id":"fe8e199e-1565-49ed-917f-ffeaf4fa31c3","year":1980},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.880366Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:ca27da973f04e358ebbc5b6a67ccbbee0efdde429502bf4ae422840fca81fd80","observation_id":"974c04c4-e693-479b-81d1-c2b900929453","resolution":{"observed_at":"2026-08-07T00:43:15.322739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.307973Z","title":"Approximate nearest neighbor search on high dimensional data — experiments, analyses, and improvement,","venue":null,"work_id":"913176ab-850b-4aa1-b44d-7c31877f3d8d","year":2020},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.883770Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:ba6950fafe6061acdecd8d7a166ef04078dc3c91ee2c0a7d00d3b47c073e061e","observation_id":"8cb67280-389c-4824-94d5-0f1fabeee85c","resolution":{"observed_at":"2026-08-07T00:43:15.311969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:14.887593Z","title":"High dimensional similarity search with satellite system graph: Efficiency, scalability, and unindexed query compatibility,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.887593Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:f1906676ff369ee68d275e5a2a30652df7bd87b028caf88e168bacc6f1314b2d","observation_id":"82c8f13b-aa38-4e79-a24b-f7d9169d2e83","resolution":{"observed_at":"2026-08-07T00:43:14.887593Z","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-07T00:43:15.290863Z","title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node,","venue":null,"work_id":"e7928d70-53c9-4fe4-acfe-4d0ff27283a9","year":2019},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.890947Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:d5f663c853a1cce8ca7a3a5998e8c097f5a9ad88cef197f87d9ffd6a9265c613","observation_id":"b63c3c49-fdb1-4b3b-94dd-f6189320a711","resolution":{"observed_at":"2026-08-07T00:43:15.294897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:14.894158Z","title":"Efficient approximate nearest neighbor search in multi-dimensional databases,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.894158Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:2018e2869d8e08a0e67ee98f6ada76322f531bb335894a4b8aff7c2d030a425b","observation_id":"97e61f46-fb49-4688-99bc-9e6828d5bc4d","resolution":{"observed_at":"2026-08-07T00:43:14.894158Z","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-07T00:43:15.272454Z","title":"High-dimensional approximate nearest neighbor search: with reliable and efficient distance comparison operations,","venue":null,"work_id":"d001da59-0bbe-47c0-bdb2-907cde1cd6f7","year":2023},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.897600Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:79a045e4fce103328d254167f70b6c70c5b742ee62b573bbab90a13ab6c97cbd","observation_id":"0737f157-f5c7-4788-b6ad-39b356cc77f1","resolution":{"observed_at":"2026-08-07T00:43:15.276982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.260798Z","title":"V oronoi diagrams and delaunay triangulations,","venue":null,"work_id":"16da5e03-26c7-4bdc-a97f-f72585cd555a","year":2017},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.900628Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:e2e7f423b51513a2a9e9c395ae8b8720981f8ed8fff9691e91cb69ba2a5feeb8","observation_id":"e253b671-a6b0-4030-b88d-c51bf149d891","resolution":{"observed_at":"2026-08-07T00:43:15.264354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.248072Z","title":"Two algorithms for constructing a delaunay triangulation,","venue":null,"work_id":"1fa3433e-9329-4b9d-b6dd-5fc9166f82b0","year":1980},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.903836Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:26cf0d671fd902fbefed598bfe8f07cb9a4ffb33f4930d79bd1f624b573eac44","observation_id":"9289673e-a8fb-4594-895b-8e56d71e8a92","resolution":{"observed_at":"2026-08-07T00:43:15.252745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.237958Z","title":"V oronoi diagrams—a survey of a fundamental ge- ometric data structure,","venue":null,"work_id":"2b3496fb-da7d-42b3-9c4f-071627c9a33e","year":1991},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.907135Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:43ea7a87e1458aaafc7ce668ae9d905bd6a114a3e2d0fa8279d06942706cc98f","observation_id":"cd817212-3ec3-4cc2-a235-518616e1c4a6","resolution":{"observed_at":"2026-08-07T00:43:15.241438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.227318Z","title":"Locally homogeneous geometric manifolds,","venue":null,"work_id":"89f32ad0-52f7-4bad-8679-1ca7c3237a33","year":2010},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.910460Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:ede2485cf3d1e891fd3780d2e0833e6e0bc9807962782cf4000aff665221cd4a","observation_id":"12c59051-f74c-47a0-9dff-206a75e79510","resolution":{"observed_at":"2026-08-07T00:43:15.230989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.205219Z","title":"Complaint-driven training data debugging for query 2.0,","venue":null,"work_id":"65604400-0b12-4100-8935-6f7e2daead52","year":2020},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.917455Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:8f1595f0a86509318394b8d7edc9100203739ecc013fce8802730f0a28eaa6d6","observation_id":"861f5695-a87e-4f0f-84b2-7ecb8142da17","resolution":{"observed_at":"2026-08-07T00:43:15.209313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:14.920649Z","title":"Understanding black-box predictions via influence functions,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.920649Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:5a3551a2e004b089e572baa2a48ba8d9e564163064db6ea65f1363094db0623c","observation_id":"e23c2df3-d0d8-4fa6-a552-150f438873c5","resolution":{"observed_at":"2026-08-07T00:43:14.920649Z","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-07T00:43:15.188081Z","title":"Revisiting facial-recognition payment: Old problems still lingering,","venue":null,"work_id":"fdd8ac66-7dfb-461c-9cc9-2aa4b94cc369","year":2022},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.923859Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:3ee55aa22a40c080c36af702e26f2cfb66a902189acb66f89aab117f26322e59","observation_id":"f5dcc423-a4de-4f1f-89e9-c50882468de6","resolution":{"observed_at":"2026-08-07T00:43:15.191610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.177300Z","title":"No card, no phone, no problem! alipay: Pay with your face, a balance between convenience, security and privacy,","venue":null,"work_id":"f76437c8-753f-4814-b7df-cb9c9a2868da","year":2020},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.927106Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:31a15927f0bce1b9beff49f1f2dec64c21aa66f8237e837e7ad5c18ffea33d1f","observation_id":"a0b39277-b0e9-4b5f-a7f3-210b32ce3b34","resolution":{"observed_at":"2026-08-07T00:43:15.181538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.166925Z","title":"Retrieval- augmented generation for knowledge-intensive nlp tasks,","venue":null,"work_id":"f686cb82-8a33-4b0c-8ad3-b3dac3b6f5bb","year":2020},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.930195Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:81cb893d19a3ed545faaebf2517840906f8077175abbd2e97e9e24ef6bee75e2","observation_id":"6a387ad5-4fe2-47ea-9eba-b720a4b5eb4d","resolution":{"observed_at":"2026-08-07T00:43:15.170655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.156964Z","title":"[online] openai embedding docs","venue":null,"work_id":"3c646c65-60db-4986-ac10-61986ee6f22c","year":2024},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.933518Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:e03001bdd3b9f2cbffcc23fc21a2562aa45ef0e681e399e22fd8df99da642cbd","observation_id":"d20f0344-64b7-457c-930f-ca8ea343f609","resolution":{"observed_at":"2026-08-07T00:43:15.160469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.147121Z","title":"[online] ann benchmarks","venue":null,"work_id":"472f3407-61a1-40e1-81fd-938691e1d5cb","year":2024},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.937660Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:46232ece63f1252631a1334ba0971c5f585ab539d5042061a52a1449b726c578","observation_id":"99adf570-00ae-4c9c-bc07-57b457c32523","resolution":{"observed_at":"2026-08-07T00:43:15.150346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.136610Z","title":"Mathematical analysis of random noise,","venue":null,"work_id":"8fd5d569-80a9-497f-b4c3-01f6bdd5c46d","year":1944},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.941062Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:4a90c6107eec4e774ce2b4082425714449e203717d0426bce635bf4c88ccd5ee","observation_id":"bd354c8a-498c-4927-bfbd-5563fe75254a","resolution":{"observed_at":"2026-08-07T00:43:15.140477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.125977Z","title":"Robustness of classifiers: from adversarial to random noise,","venue":null,"work_id":"701c0e69-965f-4d5b-8ba9-d674d0a771d2","year":2016},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.944696Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:765d5796916418c503b0e60f2da291278daa5a9b9fef17940e58f34a9c2fd5e1","observation_id":"5ac884ba-6f40-4d2e-ad1c-85238982114b","resolution":{"observed_at":"2026-08-07T00:43:15.129586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.115230Z","title":"Approximate nearest neighbor queries in fixed dimensions.,","venue":null,"work_id":"5650d4be-d4e3-47b4-a709-446c89fd12b1","year":1993},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.948072Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:ca61d255e3d7207949b3c2e49260f129a706eb95ff2575e5acc158921b4e86e3","observation_id":"e7f6551b-a9c2-46f5-a98c-335459b22217","resolution":{"observed_at":"2026-08-07T00:43:15.119771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.105669Z","title":"Ood-diskann: Efficient and scalable graph anns for out-of-distribution queries,","venue":null,"work_id":"ee4b0f30-89fb-41d1-a2df-b906a0e07682","year":2022},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.951259Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:3af31d5c42b51026aa2e94009852050313eea799435afafa27c04b122519ee2a","observation_id":"b34aaafc-201f-4643-b169-f3ae004d98ec","resolution":{"observed_at":"2026-08-07T00:43:15.109132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.095708Z","title":"Qd-tree: Learning data layouts for big data analytics,","venue":null,"work_id":"7d583cbc-6126-4e22-852b-98f66afbad76","year":2020},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.954413Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:1d3dd5652efe7d829e0f99636e726a12eeec0f28bf52d8b4a9acb38f456dd72b","observation_id":"17d4fdfb-ef5d-4f53-8fe6-d5daf150df20","resolution":{"observed_at":"2026-08-07T00:43:15.099415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.085561Z","title":"Sat: sampling acceleration tree for adaptive database repartition,","venue":null,"work_id":"b14fceb2-a25d-4190-baba-ed1f810894c0","year":2023},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.958284Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:41a0e4a93ba15c72049de0358edf212ca1acf021508477ee2e13ec7be652cf15","observation_id":"8eb6d20e-dfde-4cec-9b65-9b62d0052d49","resolution":{"observed_at":"2026-08-07T00:43:15.089098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.074787Z","title":"Computing nearest-neighbor fields via propagation- assisted kd-trees,","venue":null,"work_id":"9da17b22-c0e3-4039-beb5-9297425412c4","year":2012},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.961308Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:2bf17bb748def2952887bbe0142e4a8a6abfaa5f3ad4e98f4c7d0d9af0ba1410","observation_id":"19c220c3-80d6-4ef7-8dd7-d0f2ef9b6095","resolution":{"observed_at":"2026-08-07T00:43:15.079089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.064260Z","title":"Quicknn: Memory and per- formance optimization of k-d tree based nearest neighbor search for 3d point clouds,","venue":null,"work_id":"4725c779-466a-46a9-9db8-13db6dbea37e","year":2020},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.964744Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:5050e9ac99806f9825e2de9c70862b612496a188c29d220c151fb1483bde6986","observation_id":"0fe18676-8d57-4bb7-92cf-13062b08ee43","resolution":{"observed_at":"2026-08-07T00:43:15.068334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.053210Z","title":"Practical and optimal lsh for angular distance,","venue":null,"work_id":"15718397-17fd-40f2-b87f-7976dc3f2170","year":2015},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.968832Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:0cb689c23ba369e2caeb7a5e25413228210729948a7ef33da841b72144816593","observation_id":"d65c0ce9-067d-4239-8507-ff6ea4188eb4","resolution":{"observed_at":"2026-08-07T00:43:15.056919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.042535Z","title":"Approximate nearest neighbor search by residual vector quantization,","venue":null,"work_id":"56c936b7-66c5-4cfa-98d9-3582a84c515c","year":2010},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.972144Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:2384284e9fbc69160c648759337f4e067ea820f929324f0401eae1748df0fbc2","observation_id":"57332735-06d6-4303-92ed-5963212aab6a","resolution":{"observed_at":"2026-08-07T00:43:15.046377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.031666Z","title":"The curse of dimensionality,","venue":null,"work_id":"d43ef879-b5de-46c2-9959-1f342ee4e606","year":2000},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.975381Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:f84571210ffadeca0842e7b344826d94e7176ea701a1d55bf29180c4c889dc58","observation_id":"61053b28-1a7b-49b5-a5d0-70ae6d84c0f6","resolution":{"observed_at":"2026-08-07T00:43:15.035490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.020924Z","title":"Product quantization for nearest neighbor search,","venue":null,"work_id":"7854908b-0404-48f1-9a8b-7893b2507410","year":2010},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.978533Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:fa2de18ec9b1f886ebd545cd3a32100958575cf58a3edbff79e9512200e379a1","observation_id":"a6113d98-23fa-4164-a2e3-dd7b6c7d4f17","resolution":{"observed_at":"2026-08-07T00:43:15.024489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.006875Z","title":"Optimized product quantization for approximate nearest neighbor search,","venue":null,"work_id":"958d74f5-3649-4966-9042-6a7ec1a85d35","year":2013},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.981809Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:acdf03f99917b3fd076dacec856f2558c1b87f5dbd6b92c896469581621d65e0","observation_id":"e06b04e8-7cd9-4546-88d5-d2c70dcad805","resolution":{"observed_at":"2026-08-07T00:43:15.012761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:43:15.215938Z","title":"I: Plenary Lectures and Ceremonies Vols","venue":null,"work_id":"fb2cbf60-e3df-433b-a061-d9f0c6fa3dfb","year":2010},"citing_paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-07T00:43:14.913961Z"},"links":{"citing_paper":"/paper/2506.13144"},"observation_digest":"sha256:d852c21e9e939b5e42a8dcf4748ba6c515d9103142ee5730acbabb7e20c6659d","observation_id":"4853ee97-e582-4e6c-a10d-c348a6756611","resolution":{"observed_at":"2026-08-07T00:43:15.219592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.13144","last_updated":"2025-06-23T11:34:25Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-07T00:34:14.411099Z","submitted_at":"2025-06-16T06:57:33Z","title":"EnhanceGraph: A Continuously Enhanced Graph-based Index for High-dimensional Approximate Nearest Neighbor Search"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":46},"total_outbound_references":50},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 1 inbound Pith citation observation for arXiv:2506.13144."}