{"as_of":"2026-08-13T10:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db307968e80e8769e300bbe2f2771b738ef5adcca613bf37ffe99094dce0f89f","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:41:34.236995Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.14006/citation-record","integrity":"/paper/2411.14006/integrity","json":"/paper/2411.14006/citation-record.json","paper":"/paper/2411.14006"},"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-12T15:41:34.637203Z","title":"Sarwar, G","venue":null,"work_id":"23db8b52-5744-49a1-a99c-6d86956d60ef","year":2001},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.116557Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:f0f22b9fff4b1f08dfd6765ec40e30794e8948a7232f19e372217084b003925e","observation_id":"665870f1-a405-4daa-a142-b18fd11de419","resolution":{"observed_at":"2026-08-12T15:41:34.641740Z","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-12T15:41:34.622664Z","title":null,"venue":null,"work_id":"a821a12b-a82f-4abb-84a8-88f071d13e72","year":2006},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.122149Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:fda91911035df47df03452893a9e59005337cc7beb5f7b2c9b1544176caffb90","observation_id":"891f4810-58f8-4808-9f6e-f9a6de79ec25","resolution":{"observed_at":"2026-08-12T15:41:34.627473Z","resolver_source":"raw_fallback","status":"unresolved"},"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-12T15:41:34.608152Z","title":null,"venue":null,"work_id":"8358bea1-62c9-4ede-920c-6700e896be2b","year":2013},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.126877Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:44a64607e3290e92bd0273507399bb57ba12a0a141e414e7461a6f665c775e32","observation_id":"f702ef72-aebd-4c72-bf0a-42a9e1792d40","resolution":{"observed_at":"2026-08-12T15:41:34.612795Z","resolver_source":"raw_fallback","status":"unresolved"},"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-12T15:41:34.593872Z","title":"Jegou, M","venue":null,"work_id":"d4c4a11e-0d48-4304-af63-504cb48d8614","year":2010},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.131692Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:bb4e5c6ee8c1586d2524f7ab843b304c8fe9fab7dc5871ecc363d59c2e1d0103","observation_id":"d1be71bf-22b9-4361-a33e-279ea898e279","resolution":{"observed_at":"2026-08-12T15:41:34.598397Z","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":{"arxiv_id":"2301.02828","last_updated":"2023-01-17T08:02:58Z","snapshot_observed_at":"2026-08-08T15:19:09.044275Z","submitted_at":"2023-01-07T11:12:36Z","title":"Why do Nearest Neighbor Language Models Work?","version":2},"cited_work":{"arxiv_id":"2301.02828","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.02828","snapshot_observed_at":"2026-08-12T15:41:34.329046Z","title":"Why do Nearest Neighbor Language Models Work?","venue":"cs.CL","work_id":"916f01d2-fdf6-4aa4-99f7-5d57cb730119","year":2023},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.136515Z"},"links":{"cited_paper":"/paper/2301.02828","citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:fe45c20b79592dcb6e9888776a5afabe01390c45c654622214f4b54862be5b15","observation_id":"600bd4ea-41a5-41ab-9e81-9c643a92c62b","resolution":{"observed_at":"2026-08-12T15:41:34.333980Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:41:34.579889Z","title":"Banerjee, R","venue":null,"work_id":"ad779d4f-10d2-45d5-90e0-d36b212f29ec","year":2019},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.142222Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:bd34fb997e1c3191b9b1528ffb008137a8dc7d6f42ac5edfa246a1e86ec5d461","observation_id":"946202e4-a1e5-4997-ba6c-73d9571b068f","resolution":{"observed_at":"2026-08-12T15:41:34.584321Z","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-12T15:41:34.565619Z","title":null,"venue":null,"work_id":"4de9c1a4-1e7d-44d3-8e35-8db3dfce92c3","year":2007},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.147636Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:6fb103f49b6c07e45192ebc92eec21b5bb1b713d5c4bf3b387439d8bcc2cc028","observation_id":"ef274450-f5c9-4155-93b1-74238bd0c873","resolution":{"observed_at":"2026-08-12T15:41:34.570348Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.07607","last_updated":"2023-06-13T08:05:30Z","snapshot_observed_at":"2026-08-01T16:54:01.791456Z","submitted_at":"2023-06-13T08:05:30Z","title":"Practice with Graph-based ANN Algorithms on Sparse Data: Chi-square Two-tower model, HNSW, Sign Cauchy Projections","version":1},"cited_work":{"arxiv_id":"2306.07607","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.07607","snapshot_observed_at":"2026-08-12T15:41:34.303757Z","title":"Practice with Graph-based ANN Algorithms on Sparse Data: Chi-square Two-tower model, HNSW, Sign Cauchy Projections","venue":"cs.IR","work_id":"5b2f46d9-b7b6-47bb-9ce6-8ce01af304a3","year":2023},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.152306Z"},"links":{"cited_paper":"/paper/2306.07607","citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:ab66b39de710b2f9a228114ad73c6bdffcdb41b0835500aef7db8372c2b0fcdd","observation_id":"f2dc2bb6-7936-4d3c-9875-13c9ff4dda87","resolution":{"observed_at":"2026-08-12T15:41:34.311520Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:41:34.550895Z","title":"Terasawa, Y","venue":null,"work_id":"e146436a-7b3e-4ee2-a647-a3546f9251ba","year":2007},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.157205Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:2a0b2051c653bdbe5dcf30fc052f7a86704df5dd52352967a7d849250bb9ff7e","observation_id":"8a882ad8-ba01-4df3-a894-b5471068d49d","resolution":{"observed_at":"2026-08-12T15:41:34.555437Z","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":{"arxiv_id":"1804.06829","last_updated":"2018-04-23T13:13:00Z","snapshot_observed_at":"2026-08-10T08:25:12.943254Z","submitted_at":"2018-04-18T17:28:48Z","title":"HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.06829","snapshot_observed_at":"2026-08-12T15:41:34.161766Z","title":"Arora, S","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.161766Z"},"links":{"cited_paper":"/paper/1804.06829","citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:6dbfcf3680f8229a130f2c7103f2a09c619059b2665dadcb4f33d3816e2baac8","observation_id":"cc50bd28-d3a7-484b-85b5-3f44f0309e10","resolution":{"observed_at":"2026-08-12T15:41:34.161766Z","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-12T15:41:34.536773Z","title":"Zhang, Y","venue":null,"work_id":"7c5e2b17-4454-4c8e-9770-9936f1c2df10","year":2019},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.166656Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:98c66e86ec035f21d3fefc2b3b51aa48466ea7cadcad61c8cfa27274a8f1cdbf","observation_id":"fe7c014f-99a9-42fc-871a-b250bff8c7d9","resolution":{"observed_at":"2026-08-12T15:41:34.541153Z","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-12T15:41:34.521018Z","title":null,"venue":null,"work_id":"60b41cb7-35bc-4918-8788-d56441f1706f","year":2019},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.171458Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:0446bbf6a11bfd6c0e7e55932979585041512c1357a9fdd01677037165cf756f","observation_id":"b76f8544-44be-49e7-ab0e-03924a0f70b9","resolution":{"observed_at":"2026-08-12T15:41:34.526156Z","resolver_source":"raw_fallback","status":"unresolved"},"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-12T15:41:34.504475Z","title":null,"venue":null,"work_id":"b7b4cd2b-78f5-40e0-b388-0e56a33978d5","year":2018},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.176040Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:24a9e75518e180126c485423077ab4480196bd106aa351c30e510d497df87645","observation_id":"b95e730a-ef1b-43ea-ad0c-aed848d4038d","resolution":{"observed_at":"2026-08-12T15:41:34.509246Z","resolver_source":"raw_fallback","status":"unresolved"},"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-12T15:41:34.489501Z","title":"Subramanya, Suhas, et al., Diskann: Fast accurate billion-point nearest neighbor search on a single node, in: Advances in Neural Information Processing Systems 32, 2019","venue":null,"work_id":"98bce8eb-0071-4fec-81cc-e9073a3be27e","year":2019},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.180652Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:7244b26509e56b831c3baec33d31a3ec0d870e08818a81c8c54a7a95a7ae7126","observation_id":"6d585cea-7215-4a5d-8fb1-d7af2e51e69c","resolution":{"observed_at":"2026-08-12T15:41:34.494540Z","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-12T15:41:34.473939Z","title":"Cöster, M","venue":null,"work_id":"8e4f7d48-a1ca-45fb-890c-f6f53227dc61","year":2002},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.185028Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:83bf62ed0fd3b0d4477921b247483763f135ca3b9e62d1493ef7a1d72d7bf208","observation_id":"c12abf42-9529-41ec-87d3-c0bd101b3345","resolution":{"observed_at":"2026-08-12T15:41:34.478868Z","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-12T15:41:34.459378Z","title":"Dasgupta, R","venue":null,"work_id":"4857601e-656d-45a2-8065-c2a9fc4df086","year":2011},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.189489Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:1b87604b84874afa9f4c04d2e7f11cb1cfadd9de8013640578b194742b58bd22","observation_id":"3f8f8cde-37db-4152-9c77-63ae7e42efc6","resolution":{"observed_at":"2026-08-12T15:41:34.463936Z","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":{"arxiv_id":"2101.12631","last_updated":"2021-05-10T08:54:16Z","snapshot_observed_at":"2026-08-12T13:20:04.090354Z","submitted_at":"2021-01-29T15:12:35Z","title":"A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.12631","snapshot_observed_at":"2026-08-12T15:41:34.194173Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.194173Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:2b7a4b492ab168704d43a1d45c2159876fb906add53bf19f77962c0e7bbf06a9","observation_id":"14ea8ecc-59b6-40bb-ba25-3e42d666d01d","resolution":{"observed_at":"2026-08-12T15:41:34.194173Z","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-12T15:41:34.444291Z","title":"Jiang, P","venue":null,"work_id":"bf24dca8-f999-4365-9273-fadc48bc5364","year":2018},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.198937Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:b43fa86362fe2aee2506f0e37b4fac1b5f9db124656ddd8af74afb85c8398ffc","observation_id":"609fe486-80b8-4b38-9049-4fbeb37ed02e","resolution":{"observed_at":"2026-08-12T15:41:34.449684Z","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-12T15:41:34.203454Z","title":"Johnson, M","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.203454Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:dbf344677b67999fb514899eaa47fba65c633ea30831a5b71aad31d8a9401e43","observation_id":"3fa68c05-fdee-4bff-b8aa-700fdaf4c924","resolution":{"observed_at":"2026-08-12T15:41:34.203454Z","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-12T15:41:34.420012Z","title":null,"venue":null,"work_id":"2124d91b-a2fc-44c8-8850-fc118c49ce36","year":2023},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.208097Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:7bfd3f6f3e6a60ee7a43852cbf49224ef203d038cf47b4996a1e1d49246655cd","observation_id":"bf3ccc80-d1ec-473f-b0a2-f83e649ac4e9","resolution":{"observed_at":"2026-08-12T15:41:34.424680Z","resolver_source":"raw_fallback","status":"unresolved"},"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-12T15:41:34.212534Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.212534Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:c5b81d6ccb2746b575aab8f440f8bf803487ec29058907dc330e7915759502d7","observation_id":"097eddd8-4247-4947-90a0-7c30c483ba9f","resolution":{"observed_at":"2026-08-12T15:41:34.212534Z","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-12T15:41:34.217298Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.217298Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:7a2290bea4a85f4330c9ccb9e4dff9a910d22a16c4fddadb9a47d97827191201","observation_id":"620d36fa-e750-4267-8f90-a82f92e5f452","resolution":{"observed_at":"2026-08-12T15:41:34.217298Z","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-12T15:41:34.221937Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.221937Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:481e6959781604fb9be89db58bd4ead5a4f36442c15eda7cbdb129f2cb4fcd43","observation_id":"53fab8ee-b947-423c-9f44-bf5ba509757f","resolution":{"observed_at":"2026-08-12T15:41:34.221937Z","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-12T15:41:34.375183Z","title":"Nguyen, D","venue":null,"work_id":"03e45e9b-880f-4ee7-85ec-77349182be63","year":2024},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.227433Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:af880301ec869d47d57cef354d406b3f882f3da11542e3ca72968b91bd74b541","observation_id":"8efd6d28-84d7-4998-be22-86206bc1bba7","resolution":{"observed_at":"2026-08-12T15:41:34.379807Z","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-12T15:41:34.360057Z","title":null,"venue":null,"work_id":"5ed69ec8-2bd8-4a7e-8994-12c9fc8fe506","year":2018},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.232360Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:fc99d336215247055f8ac60c649b918294fc4de405474ddc0baf76d4a208efa4","observation_id":"5a239a88-3d7f-4c42-b963-46a8161d4d46","resolution":{"observed_at":"2026-08-12T15:41:34.364946Z","resolver_source":"raw_fallback","status":"unresolved"},"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-12T15:41:34.344923Z","title":"Kavalionak, C","venue":null,"work_id":"e7ef98f2-d1cc-4e23-b804-e01dcd226591","year":2019},"citing_paper":{"arxiv_id":"2411.14006","last_updated":"2024-11-21T10:41:24Z","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T15:41:34.236995Z"},"links":{"citing_paper":"/paper/2411.14006"},"observation_digest":"sha256:42cd6ae2f8825c1c59002f04cf000bcac609111f4967e66d16278263e832ff42","observation_id":"12bd2129-87d1-419f-9c6c-1f540c95e2fd","resolution":{"observed_at":"2026-08-12T15:41:34.349646Z","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":"2411.14006","last_updated":"2024-11-21T10:41:24Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T15:36:23.303310Z","submitted_at":"2024-11-21T10:41:24Z","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":2,"verified_fuzzy":11},"total_outbound_references":26},"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 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2411.14006."}