{"as_of":"2026-08-08T08:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b8db531627b689ac1db4bfd29b207ac6876241144916573f0cf2735d0ed87fed","coverage":[{"denominator":105,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:24:59.918306Z","state":"measured"},{"denominator":102,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":102,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T03:53:53.313934Z","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-12T03:16:18.931036Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.19001","snapshot_observed_at":"2026-08-03T03:53:53.313934Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.06721","last_updated":"2026-05-28T06:51:41Z","snapshot_observed_at":"2026-08-03T10:22:00.755057Z","submitted_at":"2026-02-06T14:14:00Z","title":"E2E: Efficient Filtered AKNN Search via Adaptive Termination","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T03:53:53.313934Z"},"links":{"cited_paper":"/paper/2505.19001","citing_paper":"/paper/2602.06721"},"observation_digest":"sha256:4d397faa17c1e24aed448186fb5924db14da91f4f3222541dc569aea0e4b70be","observation_id":"12bb2a0c-10dc-4b10-af17-8e528c26547f","resolution":{"observed_at":"2026-08-03T03:53:53.313934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"cited_work":{"arxiv_id":"2505.19001","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.19001","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"DARTH: Declara- tive Recall Through Early Termination for Approximate Nearest Neigh- bor Search","venue":null,"work_id":"df1e2f5a-788e-45a9-bbef-96a1223351a1","year":2025},"citing_paper":{"arxiv_id":"2605.10090","last_updated":"2026-05-11T07:09:29Z","snapshot_observed_at":"2026-08-02T22:38:45.569355Z","submitted_at":"2026-05-11T07:09:29Z","title":"CCD-Level and Load-Aware Thread Orchestration for In-Memory Vector ANNS on Multi-Core CPUs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-12T03:14:38.800785Z"},"links":{"cited_paper":"/paper/2505.19001","citing_paper":"/paper/2605.10090"},"observation_digest":"sha256:1a2597270dee07d88748a8a2d98c94dcf84875203ddd90184738a70968a05dfd","observation_id":"4bf02c37-46ed-4fc8-9e17-417ec9da6286","resolution":{"observed_at":"2026-05-12T03:16:18.932855Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.19001/citation-record","integrity":"/paper/2505.19001/integrity","json":"/paper/2505.19001/citation-record.json","paper":"/paper/2505.19001"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:24:53.920218Z","title":"pgvector","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:53.920218Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:712bab4b6879a9d20b98510ca136c6ae686540ad6ee783ab8b36ff500f058fd3","observation_id":"0a748c35-3a37-45bf-8727-e9be722fe70f","resolution":{"observed_at":"2026-08-07T14:24:53.920218Z","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-07T14:24:54.016420Z","title":"DARTH Artifacts","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.016420Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:2ad5ca68f5e89ea6d8992b15666b2dc6a9d5876a9c7307ce1193e2489f5ac2e5","observation_id":"7a569dd9-7e60-410f-b8e7-a906ff9ceafa","resolution":{"observed_at":"2026-08-07T14:24:54.016420Z","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-07T14:24:54.089023Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.089023Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:250100c6a33bf8590e4ab427a86661ec18d48cfe7142d91ace278383b6052417","observation_id":"ff21e90d-a26a-4723-880f-326b4a610a01","resolution":{"observed_at":"2026-08-07T14:24:54.089023Z","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-07T14:24:54.191987Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.191987Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:70d18a56bbf69695e0289fbfb8d1b4812641c0b26e633f1fbb6ec2807430c67f","observation_id":"9e5ab13d-05d1-4532-8930-8e140d7dc2ab","resolution":{"observed_at":"2026-08-07T14:24:54.191987Z","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-07T14:24:54.254746Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.254746Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:23554912bbafb281a306e16a6c6d613befb6820071e70b64412b4fb43b04ebcb","observation_id":"cbc05c02-7709-4bd2-9d83-c831c0b2298c","resolution":{"observed_at":"2026-08-07T14:24:54.254746Z","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-07T14:24:54.334441Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.334441Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:54354865b7c5e773328edbb2e3a6ab282f314d0ba5b8557622f4830402716d8e","observation_id":"f7e38130-ec77-4885-aa3d-51e3501c55d1","resolution":{"observed_at":"2026-08-07T14:24:54.334441Z","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-07T14:24:54.417368Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.417368Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:dbf744e0dc8cde83c53b14043410c4ab771fa6c3aab86669789aad45d09ba245","observation_id":"2d34ff7a-f29e-4aa0-ba80-b67d68586bed","resolution":{"observed_at":"2026-08-07T14:24:54.417368Z","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-07T14:24:54.493210Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.493210Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:e7cce591ad551aa1119b73dd57b5b9b21918735464ea55df5c8b29e253b33a12","observation_id":"59e28fd7-3bf3-4735-abb5-5c3bf5a71c97","resolution":{"observed_at":"2026-08-07T14:24:54.493210Z","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-07T14:24:54.566198Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.566198Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:776fde5a767618f78f5c63082de12e72e9a5f3f193584c02d70596f7a4585fb2","observation_id":"7fb8ddd9-7bf2-4f5f-9771-5e558e2f4dbb","resolution":{"observed_at":"2026-08-07T14:24:54.566198Z","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-07T14:24:54.643913Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.643913Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:59b922bed326b03cbded71bf6156f7841f6afed72c4b347ab218f501f1d08e80","observation_id":"45cbebc2-4dde-4935-a3b0-baca7e83ee8e","resolution":{"observed_at":"2026-08-07T14:24:54.643913Z","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-07T14:24:54.742893Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.742893Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:4350b5d0a1f2ebca9a5eff290a404307050d5f732b3daf24699dd77a79ea2d4e","observation_id":"02b3bda0-5d95-4b52-8f33-cdb9ed8389c6","resolution":{"observed_at":"2026-08-07T14:24:54.742893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.03006","last_updated":"2018-09-09T16:58:33Z","snapshot_observed_at":"2026-07-06T07:00:02.059075Z","submitted_at":"2018-09-09T16:58:33Z","title":"Performance Metrics (Error Measures) in Machine Learning Regression, Forecasting and Prognostics: Properties and Typology","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.03006","snapshot_observed_at":"2026-08-07T14:24:54.813271Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.813271Z"},"links":{"cited_paper":"/paper/1809.03006","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:14ecf38b3c661cc9dea649ad3ad2eac0ac7c52d2dae4a0bbd0522be7fd00d8a4","observation_id":"94ec454e-10f0-4949-b261-40352584d9a8","resolution":{"observed_at":"2026-08-07T14:24:54.813271Z","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-07T14:24:54.895594Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.895594Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:1e4c1415bd355cb6e18658cef96291243bcf85118e1863b70f9c06b88cb8c9e8","observation_id":"8c9126d2-5623-42c9-8b55-e7ffff23df6d","resolution":{"observed_at":"2026-08-07T14:24:54.895594Z","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-07T14:24:54.991936Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:54.991936Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:6b4ce5723ea387c2384ee242717b1dc70a2fd8d9fa9c8a2a96e97ee9785bc015","observation_id":"ea3efb50-23e3-40a5-bb85-ef79e09e6003","resolution":{"observed_at":"2026-08-07T14:24:54.991936Z","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-07T14:24:55.068118Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:55.068118Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:3622e252af6809c1cb23f428fd7da93382eb8ef058f03ef2eae3edceea500693","observation_id":"170c2c6a-a5a3-4663-99a1-0fd1cdebcdc4","resolution":{"observed_at":"2026-08-07T14:24:55.068118Z","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-07T14:24:55.154118Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:55.154118Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:3007ef83017cf29656571051a0e5229600e127b7daf06dde5668f470bce7f1a8","observation_id":"863d96ef-0556-456c-b4ef-867239337099","resolution":{"observed_at":"2026-08-07T14:24:55.154118Z","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-07T14:24:55.231574Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:55.231574Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:6d71e30bada161967d6b2c5d44576809c1c9bf595f26e52c7017f8d610187c9b","observation_id":"a8f23c0f-b4da-4e31-8850-45a5c44995ea","resolution":{"observed_at":"2026-08-07T14:24:55.231574Z","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-07T14:24:55.308701Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:55.308701Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:6fcb93b2e36f62b816e145e0b658d6e34f7fbd97a77dbfaf29d198fc4da077bc","observation_id":"0164ac24-6aea-4d8f-af3f-a5472d6d2ffe","resolution":{"observed_at":"2026-08-07T14:24:55.308701Z","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-07T14:24:55.407508Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:55.407508Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:ba3e1a037e452755af26017bd796f70c1ccb242088ee203231c7492db0962ede","observation_id":"38c3c83e-481d-456d-b84e-c329e09eae48","resolution":{"observed_at":"2026-08-07T14:24:55.407508Z","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-07T14:24:55.506182Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:55.506182Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:1986aaee5e60cb775a7ae270f77ea451deaf2fc765e21f5f5c9ab2c425f9856c","observation_id":"00c692f7-76b1-4989-8ebf-536ba574a32b","resolution":{"observed_at":"2026-08-07T14:24:55.506182Z","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-07T14:24:55.608650Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:55.608650Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:7e1b2c89468e3bdb6a82778291e7f546acb6abb00096af3310a52a0fcc24eb85","observation_id":"1d40083b-2cf9-471e-b5da-ce0addc131d7","resolution":{"observed_at":"2026-08-07T14:24:55.608650Z","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-07T14:24:55.700939Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:55.700939Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:0993df69c8986ab4f48ef380532278ecc1dd1de311c68dd8b5eba0c83edc898f","observation_id":"0a363fc4-9b5d-4fd6-aa29-b7d136f6c644","resolution":{"observed_at":"2026-08-07T14:24:55.700939Z","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-07T14:24:55.780445Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:55.780445Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:30c403bfa91974aad0ed25dec33b8190b7261e8af1c630cbe87ba238f8ec286d","observation_id":"15f77033-31a0-4f56-9014-6be14ef056e9","resolution":{"observed_at":"2026-08-07T14:24:55.780445Z","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-07T14:24:55.871783Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:55.871783Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:e315e657c97ddaea96b9a02a475c8f4f68b955ea4c4f4ce59d99fa9f13001861","observation_id":"187c6338-f0d9-4c32-bf29-e55cfed0fa0b","resolution":{"observed_at":"2026-08-07T14:24:55.871783Z","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-07T14:24:55.965951Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:55.965951Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:f22ef083f04d0e18f572691eef593c986970b0577271fb003be1c5306a2e6f9b","observation_id":"100ab8cb-44e6-4223-8508-872d42ec6f27","resolution":{"observed_at":"2026-08-07T14:24:55.965951Z","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-07T14:24:56.082133Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.082133Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:173593dd6d707cc55cfa9e14d82b78349384e62360e54b1a911303360524d7fc","observation_id":"fda71933-f2cd-4567-a6bd-9a3ea098a5fb","resolution":{"observed_at":"2026-08-07T14:24:56.082133Z","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-07T14:24:56.214943Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.214943Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:4c518e09534147e23ead5643d9ae7ca846bad416eed8bcdc971bbc90a536452b","observation_id":"1af46ce7-a126-4005-9029-6440f6f50977","resolution":{"observed_at":"2026-08-07T14:24:56.214943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.09426","last_updated":"2020-10-19T12:36:50Z","snapshot_observed_at":"2026-07-06T10:05:44.237499Z","submitted_at":"2020-10-19T12:36:50Z","title":"LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System","version":1},"cited_work":{"arxiv_id":"2010.09426","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.09426","snapshot_observed_at":"2026-08-07T14:25:00.807829Z","title":"LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System","venue":"cs.IR","work_id":"4db90b30-c83d-43a8-9b84-99a9d24174f2","year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.293339Z"},"links":{"cited_paper":"/paper/2010.09426","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:30792bb72469fb0b079e9310353fc6e48384b5f602b6dad496f099da16313288","observation_id":"1ba34a43-579a-42bd-9e06-2003ccc41b6f","resolution":{"observed_at":"2026-08-07T14:25:00.817415Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08281","last_updated":"2025-10-23T09:36:08Z","snapshot_observed_at":"2026-07-31T05:45:37.385210Z","submitted_at":"2024-01-16T11:12:36Z","title":"The Faiss library","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08281","snapshot_observed_at":"2026-08-07T14:24:56.360986Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.360986Z"},"links":{"cited_paper":"/paper/2401.08281","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:6ef5d6b1b75bb00ab16cc760698829df16a66e2a110dd6145ded960d4bfee318","observation_id":"5427fcca-3ca1-4567-a649-9db847e7909e","resolution":{"observed_at":"2026-08-07T14:24:56.360986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.13297","last_updated":"2022-12-26T21:00:10Z","snapshot_observed_at":"2026-08-06T22:34:48.437866Z","submitted_at":"2022-12-26T21:00:10Z","title":"Hercules Against Data Series Similarity Search","version":1},"cited_work":{"arxiv_id":"2212.13297","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.13297","snapshot_observed_at":"2026-08-07T14:25:00.717373Z","title":"Hercules Against Data Series Similarity Search","venue":"cs.DB","work_id":"6e41d108-e6a5-42b2-b074-e1c8a0ef171f","year":2022},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.450165Z"},"links":{"cited_paper":"/paper/2212.13297","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:0788790b0a8c52442936bd49cbfcf4d7c674511c33638af59209793578eb95c9","observation_id":"035b5c54-d4de-48d7-80b8-2e34478d1a8c","resolution":{"observed_at":"2026-08-07T14:25:00.723559Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:02.644070Z","title":null,"venue":null,"work_id":"7d5a906c-7a89-4ccf-8a10-be88833aa300","year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.500599Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:ffc3b03929db75abf14cbf9a9b8e6c13cb2e81e583296e7bacad6d29411c0ea7","observation_id":"9bdd2e9a-b32f-4504-88ff-ecffeeecf5c1","resolution":{"observed_at":"2026-08-07T14:25:02.655753Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:02.610796Z","title":null,"venue":null,"work_id":"99ae4df7-b23b-479f-ad8a-0e27666a0c12","year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.559618Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:1201b95c808640bbbeff3eab06dc010f4558e8cd23720095d1095b1d959a9d2b","observation_id":"4254dfd5-6f30-47dc-9d63-03ca1683c022","resolution":{"observed_at":"2026-08-07T14:25:02.619536Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.11459","last_updated":"2020-06-20T01:27:49Z","snapshot_observed_at":"2026-08-07T23:26:12.223941Z","submitted_at":"2020-06-20T01:27:49Z","title":"Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search","version":1},"cited_work":{"arxiv_id":"2006.11459","doi":null,"metadata_source":"pith","pith_arxiv_id":"2006.11459","snapshot_observed_at":"2026-08-07T14:25:00.656280Z","title":"Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search","venue":"cs.DB","work_id":"105903c1-a9ce-4490-b176-fa89157f1665","year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.618346Z"},"links":{"cited_paper":"/paper/2006.11459","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:bd60d8941d3a2a56cd1f50959bac491bdd1e82227fcbb467df50229471fddb27","observation_id":"f39134d7-c8e7-4233-ba6c-e68af3bf385c","resolution":{"observed_at":"2026-08-07T14:25:00.674777Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:02.583821Z","title":null,"venue":null,"work_id":"78d44a60-2cb4-491e-9e91-36977193ec43","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.677591Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:739bd9647a22baf41a5f421f6a4dd017a18f61f9f92d0813ddaf22d6f6ee7d4a","observation_id":"6779b428-1ec8-46c7-a914-a97e10d9b4f2","resolution":{"observed_at":"2026-08-07T14:25:02.592168Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:02.563518Z","title":null,"venue":null,"work_id":"858a4b09-db36-4d41-ba09-d48dac6c10eb","year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.730551Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:e86ede766b1db219f1902169851f9bc5565bb3e01f838e348ff8e96866b41bc8","observation_id":"5692120f-8ee8-46fe-bd5e-c7a7c20f3614","resolution":{"observed_at":"2026-08-07T14:25:02.569512Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:02.541041Z","title":null,"venue":null,"work_id":"490797e8-d259-455e-afd5-979cbc0093c9","year":2001},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.803921Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:bc5fe50ff690590ca3b52846b10537e4f240e205ca9873d2b3a82899b5967098","observation_id":"1a32293b-3537-45d3-b48f-3ea9e1c207a0","resolution":{"observed_at":"2026-08-07T14:25:02.549009Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:24:56.863503Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.863503Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:6adaa152f857fcd891268aa2865d30221142e964335f7c460e47b8a36b892bc5","observation_id":"6ed9f4fd-8af2-4b6b-87f5-d6e61ec2f6f2","resolution":{"observed_at":"2026-08-07T14:24:56.863503Z","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-07T14:25:02.509603Z","title":null,"venue":null,"work_id":"68409d4b-e61c-4e7f-a466-2ee43d1c4162","year":2002},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.920211Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:0ca5ea28415f76aa143b20be0a27e7db0bbb209eddcd4a1030a206ec42d74d0b","observation_id":"83fec7d4-f2f2-4a6b-ae59-fb044d2fe73f","resolution":{"observed_at":"2026-08-07T14:25:02.515380Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.00143","last_updated":"2025-07-06T11:35:42Z","snapshot_observed_at":"2026-07-06T05:49:21.582343Z","submitted_at":"2017-07-01T11:52:37Z","title":"Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.00143","snapshot_observed_at":"2026-08-07T14:24:56.978018Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:56.978018Z"},"links":{"cited_paper":"/paper/1707.00143","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:51d3270c89e0f3f48fc53818f425d2d4de17f96ec8dd55c1b5f02902dd2e45b3","observation_id":"95c2aede-d328-4d61-81e3-cbfc88860575","resolution":{"observed_at":"2026-08-07T14:24:56.978018Z","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-07T14:24:57.030973Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:57.030973Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:94e2758ee1687b86539b2d9db02a6d099ab38b5b29c1cc878d1ca402c205b8b1","observation_id":"45f32a2a-828c-47b8-b2ee-d3ee9769a9bb","resolution":{"observed_at":"2026-08-07T14:24:57.030973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10997","last_updated":"2024-03-27T09:16:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-18T07:47:33Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.10997","snapshot_observed_at":"2026-08-07T14:24:57.108009Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:57.108009Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:0fac4023cf7a6ecdc3d349cf661ea831ab64f558c96288437e4a18503ef23599","observation_id":"cecd1bcb-6430-4386-9b9e-3219e0005cd7","resolution":{"observed_at":"2026-08-07T14:24:57.108009Z","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-07T14:25:02.471191Z","title":null,"venue":null,"work_id":"f529dc89-0427-40be-b6fd-b3e144d56e35","year":null},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:57.168539Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:f05fc9c036ee1f8b683b481c1b74645217942c222f2d72be8108332bf80b69d4","observation_id":"71d48398-d37f-4401-b03e-e7d072cd22ca","resolution":{"observed_at":"2026-08-07T14:25:02.477919Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:24:57.242502Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:57.242502Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:78972068ed7c5bd14081d1d79eff4b605e8747b4dd31cfd95cea34c484f76c33","observation_id":"1f0b118a-d5ed-4499-a972-35b2bd44f5db","resolution":{"observed_at":"2026-08-07T14:24:57.242502Z","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-07T14:25:02.417425Z","title":null,"venue":null,"work_id":"d3408f05-66b6-4bd4-be67-1b13503560dd","year":2019},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:57.318737Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:a918664fd05d0154deb36b30d7e6ced2ce257f41494ecd8af7959a2f37bea7a9","observation_id":"47bae5bd-8071-4b39-a916-ebc93ca22d02","resolution":{"observed_at":"2026-08-07T14:25:02.424019Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:02.391820Z","title":null,"venue":null,"work_id":"4c16b0b1-8d14-46b9-bf14-80287c0aba21","year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:57.412466Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:fb3540d6b28a129921861962db0827ff7ee2d00d6cecab22c80d9ae80197909f","observation_id":"6af66f38-2b10-45de-80d5-2c42fc50f955","resolution":{"observed_at":"2026-08-07T14:25:02.400350Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:02.365648Z","title":null,"venue":null,"work_id":"00d5f2b8-603b-4579-8bb0-afb6e4bf3324","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:57.491651Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:ef48043224c8e64b99445dc8b39f2a58eaa51b4e5cac5352993d0793fc368b9b","observation_id":"2de706dc-d8a5-46ef-ae51-cd4e13c1233b","resolution":{"observed_at":"2026-08-07T14:25:02.374220Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12229","last_updated":"2024-11-19T04:51:08Z","snapshot_observed_at":"2026-08-07T01:35:46.884846Z","submitted_at":"2024-11-19T04:51:08Z","title":"SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2411.12229","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.12229","snapshot_observed_at":"2026-08-07T14:25:00.568943Z","title":"SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search","venue":"cs.DB","work_id":"79d8412f-f32a-4304-b870-2d8d957f1334","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:57.559440Z"},"links":{"cited_paper":"/paper/2411.12229","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:f635b75aca7d943c7da114c14614386759dc3c466dd02c7df99e915508bdbdde","observation_id":"e5c5b8cd-7646-4224-8a41-ac5322793672","resolution":{"observed_at":"2026-08-07T14:25:00.575040Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:24:57.615656Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:57.615656Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:7f98a946a0e3b2cf5e527b4fea1c178bd9b0458cd40009a194a8b0a5782b2194","observation_id":"68ad82ea-d854-45b9-895e-59cdc86b48c9","resolution":{"observed_at":"2026-08-07T14:24:57.615656Z","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-07T14:24:57.664642Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:57.664642Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:ce109d8aeb97d7be8fd74fb9ad3a75683cadd478c60e084ccef5099dbff4a8a1","observation_id":"a8b37b81-6e38-4fc4-a3be-aa340608023f","resolution":{"observed_at":"2026-08-07T14:24:57.664642Z","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-07T14:25:02.307725Z","title":null,"venue":null,"work_id":"4a73d62b-de41-45c4-af97-806e96cc3a30","year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:57.759498Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:eb1faf3cce444aeca8e52cedff7e83d75f296a49e8c82d4b56d48b1f80cd2714","observation_id":"d600c3a4-38e7-4892-944c-9680dbf43499","resolution":{"observed_at":"2026-08-07T14:25:02.318092Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:24:57.857788Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:57.857788Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:c47e2637eefde39147c63fdd8c63ed70afd3a26de75df0e564a8f65bb01fa7df","observation_id":"58aae4ca-635b-4333-ae83-73a18acb8105","resolution":{"observed_at":"2026-08-07T14:24:57.857788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12850","last_updated":"2022-11-30T11:14:07Z","snapshot_observed_at":"2026-07-31T18:00:43.513660Z","submitted_at":"2022-10-22T21:22:50Z","title":"OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12850","snapshot_observed_at":"2026-08-07T14:24:58.022540Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:58.022540Z"},"links":{"cited_paper":"/paper/2211.12850","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:0fb63df4b31f6334a8b48fc5f2accaddb1262ee4646068a986e239464b1be32e","observation_id":"67304b24-25c2-4bb7-a5f4-296d21334f4f","resolution":{"observed_at":"2026-08-07T14:24:58.022540Z","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-07T14:25:02.249679Z","title":null,"venue":null,"work_id":"7aeae736-0dc2-4800-b762-d34a2fc58815","year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:58.175615Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:fcc25dfe79b91d97c78a14ee70310ae6324b64c6bd84d21e682ee9e577121a54","observation_id":"998a8933-b58c-4ba5-be0f-c34b3c347894","resolution":{"observed_at":"2026-08-07T14:25:02.255624Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:02.204168Z","title":null,"venue":null,"work_id":"1811b633-c45b-46a6-bbaa-b08e82e9b9b8","year":null},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:58.331382Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:ef61a8063a9e39f1c8f3852d2c978cf6e685855c51305175a4b4a9e6a1325332","observation_id":"c350e4e9-0c41-4889-8915-b78e64eec900","resolution":{"observed_at":"2026-08-07T14:25:02.220214Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:24:58.663274Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:58.663274Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:8487362662464fddb2ab19e3b78b97291875393a3649902f19b460201d3b8737","observation_id":"c5458a32-1ddb-4f59-b57d-9c5d6868b69b","resolution":{"observed_at":"2026-08-07T14:24:58.663274Z","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-07T14:25:02.122270Z","title":null,"venue":null,"work_id":"4d54a708-7b11-416d-ac5c-f9f82e066c7b","year":2011},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:58.830954Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:f248384e93e9377385ab7b21dac45389edf19cecd03b7b03c1a001f2bc365898","observation_id":"5b544350-9701-4879-933f-566af426e1d6","resolution":{"observed_at":"2026-08-07T14:25:02.130870Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01763","last_updated":"2025-06-23T04:05:15Z","snapshot_observed_at":"2026-07-06T17:24:33.169277Z","submitted_at":"2024-01-30T23:35:28Z","title":"When Large Language Models Meet Vector Databases: A Survey","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01763","snapshot_observed_at":"2026-08-07T14:24:58.996812Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:58.996812Z"},"links":{"cited_paper":"/paper/2402.01763","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:54196c93cf1fe0cd26996118dc71b731286c4359031958f69e7076874c20ac5e","observation_id":"c32a7b35-9a0f-4e6f-9b96-792a9a7f5b7c","resolution":{"observed_at":"2026-08-07T14:24:58.996812Z","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-07T14:24:59.232009Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.232009Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:29c2f952f954d9dbc0f67e366bcddea0424700c06f7543107020c36f0e543310","observation_id":"195ce30c-11c5-4c50-bec1-19364a7b1eb3","resolution":{"observed_at":"2026-08-07T14:24:59.232009Z","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-07T14:24:59.425720Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.425720Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:36730c05b1292916d9394b1ad3bfa34d0381c7b5d28eb8c444d598c692682122","observation_id":"b2008679-4e9e-40f2-8501-5f4387520851","resolution":{"observed_at":"2026-08-07T14:24:59.425720Z","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-07T14:25:02.066875Z","title":null,"venue":null,"work_id":"f3ac27c5-71f4-4d5a-8fc1-4bc8140d236f","year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.565526Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:fd6e528070eba88374ac1c3365d5065b2d6286cf9dee86445e07722eae4fcf8b","observation_id":"92d37d5e-3aa8-4860-8b04-d552e399b61d","resolution":{"observed_at":"2026-08-07T14:25:02.075819Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.01110","last_updated":"2022-02-13T05:50:10Z","snapshot_observed_at":"2026-07-06T12:33:49.568397Z","submitted_at":"2022-02-02T16:18:41Z","title":"A Survey on Retrieval-Augmented Text Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.01110","snapshot_observed_at":"2026-08-07T14:24:59.615010Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.615010Z"},"links":{"cited_paper":"/paper/2202.01110","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:a3634291b47386f1ded1c8dff1d7729a63bb42730442e89363d4bfc440ec0a32","observation_id":"d160bdeb-e920-48bd-90a8-0e718f3a8358","resolution":{"observed_at":"2026-08-07T14:24:59.615010Z","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-07T14:24:59.629975Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.629975Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:2152b34618635018657abb76b61df4f3090afa7d51ff8cc7efc2a47e76caf2fb","observation_id":"88ce5e51-cbac-41ab-8cfb-00f82c493c7e","resolution":{"observed_at":"2026-08-07T14:24:59.629975Z","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-07T14:25:02.007312Z","title":null,"venue":null,"work_id":"ecb964fd-5a04-4ce1-94e1-def3dab939f9","year":2018},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.635694Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:7caac001b827e5baaf827d67759c903a9da87e7862b36370f328b15926d4dbe1","observation_id":"677d46ae-16f1-472e-a275-7bdcee35882c","resolution":{"observed_at":"2026-08-07T14:25:02.018681Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.981390Z","title":null,"venue":null,"work_id":"e4fc0567-b5f8-4fa2-afba-2e9bfbbb5d11","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.642109Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:66f4c9d6f8af32aaf89645794c48b15137eedd5215aee482b84259fc7248d406","observation_id":"8e13006b-130c-47e5-80f0-84185bdd4a0e","resolution":{"observed_at":"2026-08-07T14:25:01.986220Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.958993Z","title":null,"venue":null,"work_id":"95048592-8451-49e7-9a24-7a700e09c6be","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.649603Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:68482573a1d9859d388634d4c9ffc47f36408b6139428f0b8a3c00d82ffea864","observation_id":"24311f56-43f7-447a-9eab-44f2bfe020b9","resolution":{"observed_at":"2026-08-07T14:25:01.964387Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.930408Z","title":null,"venue":null,"work_id":"cf417445-6296-407f-9c78-13032d2c6991","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.655833Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:495185239d1e111df966f6e69d3186a58c2edfc040261b7ea410dd625a89e03f","observation_id":"0fcacc32-dfe3-42c9-ad48-b179604191cb","resolution":{"observed_at":"2026-08-07T14:25:01.940065Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.901308Z","title":null,"venue":null,"work_id":"7f0d8df2-c899-42e1-b0b2-3b859edfc53a","year":2013},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.661190Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:5d413af987a4dd4fe779696ecf23fd825978ca592c9af7929df6334eee2de007","observation_id":"4dda5d2c-b0b0-4aa8-a31f-81c3259af81f","resolution":{"observed_at":"2026-08-07T14:25:01.912484Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.870307Z","title":null,"venue":null,"work_id":"68c24758-d97c-4f1a-8cc0-d127a6e1413c","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.666948Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:c5552d4daf3f4b664c3b5e9e9ecb1113a35397b96b476949e591c318adc6519d","observation_id":"668f9d02-cf23-45b1-805e-ac209ed04dcb","resolution":{"observed_at":"2026-08-07T14:25:01.882556Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.840577Z","title":null,"venue":null,"work_id":"809e3662-5775-49a2-bf66-a09383c90831","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.675501Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:a111cbe3139db769e90633cfb17172e07d0ca65815e97d0810de06db7751032c","observation_id":"74ba9914-febf-4f48-b90f-a629112b0bc5","resolution":{"observed_at":"2026-08-07T14:25:01.850077Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.817498Z","title":null,"venue":null,"work_id":"dc4325b3-2348-48a7-9e8b-8fd709bb2b83","year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.681448Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:b40829c7650a20764e67faed6a4b7c8ddffcd009d909a5fcd732813d8583ad3a","observation_id":"d98d6f94-da20-4ca0-bc2f-7923237cf764","resolution":{"observed_at":"2026-08-07T14:25:01.822796Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.796186Z","title":null,"venue":null,"work_id":"c1058f16-bfbe-47c0-9a3b-94a972dbd797","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.688423Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:48cbccb5c9bd2f26da8c96845aeb5422cafcf59d7982b33e205141e0429a081e","observation_id":"4173144e-d715-4a5b-b5c4-6578c3cb6426","resolution":{"observed_at":"2026-08-07T14:25:01.801506Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.774925Z","title":null,"venue":null,"work_id":"e64ba325-82c2-447f-a8b4-6f88f0ea6ac8","year":2008},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.695836Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:51bbdc593f66820aab05bf009ee778361e77b87c1db56a53a57df1dbd0dbb3b2","observation_id":"b0ad683f-accf-42a0-875f-47e31b41a802","resolution":{"observed_at":"2026-08-07T14:25:01.780849Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.747633Z","title":null,"venue":null,"work_id":"3ce2643a-8b7a-4198-8bcf-90d20cc79e47","year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.700597Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:d209a3f727cde642c04c518b47aaeb675b80d567fc5e3c6d2c1bedf1757aa82d","observation_id":"7a3f02e9-4e09-4a9b-b7f9-ca4701180bcf","resolution":{"observed_at":"2026-08-07T14:25:01.753985Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.718631Z","title":null,"venue":null,"work_id":"5a8536a4-4f7e-4690-bae2-d512695e6fdc","year":2021},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.705567Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:cab1fbbfe5e5ea73b97c5ba8c75127cbd0f441c10830c7a7225e3d0f45fa9022","observation_id":"f10bd577-3634-4b49-bcf3-8253e9738dfd","resolution":{"observed_at":"2026-08-07T14:25:01.724632Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:24:59.714784Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.714784Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:5b00550d3ca29affcbda4bf348eed8e10d28618885d22461e969385d43de296a","observation_id":"f2945439-2a46-41e1-9885-71e2f4a070ae","resolution":{"observed_at":"2026-08-07T14:24:59.714784Z","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-07T14:25:01.678772Z","title":null,"venue":null,"work_id":"0e0f5eb2-af30-45a9-a501-8e7d04c9095a","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.727868Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:7adb7c0de179e718f8f9c9639b9a48bf1516149fb00255c65232ee424102cbed","observation_id":"68e14a09-8c66-4796-b1d5-816b8c8aa2b3","resolution":{"observed_at":"2026-08-07T14:25:01.684593Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.655407Z","title":null,"venue":null,"work_id":"ee767741-eb00-4660-b525-a6f448fb9efc","year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.734190Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:4ce03f04cdb850c3f83d49ba128e528730822793d81277d610e7d1e0dc121012","observation_id":"6944886a-b5b5-41d5-91ac-6e51b89c55ff","resolution":{"observed_at":"2026-08-07T14:25:01.662315Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:24:59.743050Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.743050Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:62dfb338b6601eef780bc27d80ca39f102d3631c5fec32de3619e30fb9e62a6c","observation_id":"91a192de-6eaa-4d82-95c4-5f29691aa238","resolution":{"observed_at":"2026-08-07T14:24:59.743050Z","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-07T14:25:01.605321Z","title":null,"venue":null,"work_id":"e4334929-7fb8-4d03-be51-96e4c9dfa5d4","year":2019},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.749088Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:2059a023b58007f0ae5dd4f6dab62add2c8d756a740b05322d1d6f10da569eab","observation_id":"dbe913f0-d2fa-4c0a-8992-5ccc5a246622","resolution":{"observed_at":"2026-08-07T14:25:01.616091Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:24:59.754369Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.754369Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:75299351c7090a7396301b4f2870f95da1147705f85c8db6e6b76c5a0b11662f","observation_id":"f08ffec1-bee6-427c-b27d-5efb4d5d23bc","resolution":{"observed_at":"2026-08-07T14:24:59.754369Z","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-07T14:25:01.586012Z","title":null,"venue":null,"work_id":"9607ac63-ed8c-42cb-a145-893eeb5e9a04","year":2017},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.762391Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:ba717aab9e60568ab765232c955ceb5ac3d9a6b552a94ef02ac0bc0369d68fd7","observation_id":"f5a95cea-fd1f-4165-b4ed-9db68c8313bb","resolution":{"observed_at":"2026-08-07T14:25:01.590906Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.557301Z","title":null,"venue":null,"work_id":"3c8afe80-62a7-4889-ae79-b98a414d9c34","year":2022},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.772292Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:0db7b2df34efdf363b91376ab45299c3013e6d4992fa14a51cd347fcc5ff018b","observation_id":"b1670ae9-3864-4576-89de-a57390ce2fd5","resolution":{"observed_at":"2026-08-07T14:25:01.567035Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.537655Z","title":null,"venue":null,"work_id":"5254548c-4bdd-4e67-b053-ac22d70db3b7","year":2019},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.780932Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:91c8ec338ad58b5bfc2084c18460f19c9f3edf8467a393add6a1cfacd12de2b8","observation_id":"01027e5f-f5c9-4db5-816f-d6d5ea815b36","resolution":{"observed_at":"2026-08-07T14:25:01.543485Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-07T14:24:59.790954Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.790954Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:bb2c79d739c329b08dcf8b5daf8835fadaaaa52e75acb124fecbe4cba5ca9a8b","observation_id":"92294519-7aba-497d-8fb6-be1091ec67f0","resolution":{"observed_at":"2026-08-07T14:24:59.790954Z","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-07T14:25:01.513830Z","title":null,"venue":null,"work_id":"7b3fc67e-0067-4de2-bb09-259323a4d5b2","year":2017},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.800889Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:adb707a961c3af29f3c7f62cdc3b5b0912ed815ca8d4acf29930e80af6f497f5","observation_id":"8186f356-b791-4872-816c-ae5dfb7da784","resolution":{"observed_at":"2026-08-07T14:25:01.518803Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.497064Z","title":null,"venue":null,"work_id":"d1874c54-18de-410c-be33-d8c52fe1527c","year":2021},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.812215Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:8b11c8a2813828f7a85d627867c7d6e89e5e29b013a5f12629cccdbb8f0e9947","observation_id":"555fb185-d5c4-41f9-bce5-e29e796a0977","resolution":{"observed_at":"2026-08-07T14:25:01.501989Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.12631","last_updated":"2021-05-10T08:54:16Z","snapshot_observed_at":"2026-07-06T10:36:50.762036Z","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-07T14:24:59.818976Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.818976Z"},"links":{"cited_paper":"/paper/2101.12631","citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:b1f9fd4f768856fc37f4b2f781c445b8ae0b7c7664bd1b88a78bcdadcef16ea5","observation_id":"f82dfc86-4986-4ff0-a641-3055e32145f1","resolution":{"observed_at":"2026-08-07T14:24:59.818976Z","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-07T14:25:01.466592Z","title":null,"venue":null,"work_id":"408a5289-30c4-409b-af3e-4874db5efe22","year":2025},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.824270Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:61816b53f764b3179c7ea23d9c3bb28345ab67e96848d671c074e915692fd303","observation_id":"2bb57098-576b-4084-a7f6-3ca2154ebf06","resolution":{"observed_at":"2026-08-07T14:25:01.475095Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.439541Z","title":null,"venue":null,"work_id":"d12add4d-3ca6-41a6-8982-deb8afabd92d","year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.832315Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:3daaafcda091cdfc2c2cfdf980569cd1c4bed0c4ba7cb187e1e5467c17c674ec","observation_id":"aff9e2e3-907c-4341-8765-e100907e785b","resolution":{"observed_at":"2026-08-07T14:25:01.449806Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.401128Z","title":null,"venue":null,"work_id":"4cd8f614-0f21-4d0e-8d23-7b211532a17b","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.838515Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:ca5e0d7c5d91f03ad08de72fbc3151c428aa1e65359c1973d77b08b1ee9b228e","observation_id":"b9f478ae-91ba-4f81-b42b-ac0ad14fca8a","resolution":{"observed_at":"2026-08-07T14:25:01.406405Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.370687Z","title":null,"venue":null,"work_id":"60213017-b723-4ec0-bde2-b4d2285854f8","year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.845714Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:4a2fcfe55e22c673d6098c3b60429f47f3262c5a57016d49bc7ad671cfbb0f3f","observation_id":"b2efe9fc-b022-49c9-80b6-e54eb624868a","resolution":{"observed_at":"2026-08-07T14:25:01.379655Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.341003Z","title":null,"venue":null,"work_id":"d2a2bee0-fea5-4daf-869d-fcd97e371851","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.852274Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:b3578a3130951e022d09fea5b59354bf0add0190cd6c48efaaec8bd23cc9c982","observation_id":"42ef03da-e78e-41ed-819a-26e8766117b3","resolution":{"observed_at":"2026-08-07T14:25:01.351525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.318543Z","title":null,"venue":null,"work_id":"add58d4c-6a5f-4e93-b07d-17262ce964d6","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.859685Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:2ac59bc673f13feadc8a0739fccab1015554b1be3e92fa70b7b5de7b4225f40a","observation_id":"6460ecd2-61dd-40e9-b49e-0c496f553533","resolution":{"observed_at":"2026-08-07T14:25:01.327403Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.287571Z","title":null,"venue":null,"work_id":"89cf1495-3055-4896-83c6-c8fd824dbb1c","year":null},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.873879Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:5cf28bf49f70a2d4dbc35fcda124c349829216b4341286761f2cd77651dc2465","observation_id":"46a46022-1795-421f-8bac-fd3baf676e34","resolution":{"observed_at":"2026-08-07T14:25:01.297632Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:24:59.880657Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.880657Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:959137cd73acf279f732fb89ff579448e3cd8dcb238753d79b15d8effa64f3b3","observation_id":"8e7dbfb7-aae6-4f98-aac8-92cf0d653037","resolution":{"observed_at":"2026-08-07T14:24:59.880657Z","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-07T14:25:01.232475Z","title":null,"venue":null,"work_id":"1755e8c1-dd47-40e5-b4a3-b74e3d208eaf","year":2025},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.889310Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:20807fc9b8e7799360159d1642eda3b5783c32035c645d26babc886e80ff6fb8","observation_id":"e2498467-f856-4935-87cd-0a99b1372357","resolution":{"observed_at":"2026-08-07T14:25:01.239337Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.202607Z","title":null,"venue":null,"work_id":"59fccdd1-278c-493a-8941-a0d6869ab601","year":2024},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.896687Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:b89cfded187c8068167faa57abd369dd7e50cb300151ae23217bd69fe0617fea","observation_id":"bcf52604-55c2-44c4-8503-8456706195bb","resolution":{"observed_at":"2026-08-07T14:25:01.209522Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.162282Z","title":null,"venue":null,"work_id":"72fe7dfd-1fa6-4b18-bc07-aa5508502b26","year":2023},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.903317Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:056f477566528f73697de9d87232399e23791c8236947af3fbab1874599e0d46","observation_id":"30a31735-5982-45d5-ba07-868e581c28e6","resolution":{"observed_at":"2026-08-07T14:25:01.180322Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.134312Z","title":null,"venue":null,"work_id":"02a27e4c-c8e1-4fa6-bcff-85717741d077","year":2017},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.912277Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:d165b2c513664555ee4bb56ca9a88823b94fcaa47cd4d7ea8d3125f9f32eae14","observation_id":"6fc181a5-6517-47d6-8daa-54272a4f4640","resolution":{"observed_at":"2026-08-07T14:25:01.144621Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:25:01.106759Z","title":null,"venue":null,"work_id":"dfcd4d14-c87f-4b11-bc5d-92f2e98c233d","year":2020},"citing_paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:59.918306Z"},"links":{"citing_paper":"/paper/2505.19001"},"observation_digest":"sha256:0d171881e566f41af6ff879136eec21ffa86791ac6291c56204f876b6aa2718d","observation_id":"805ac6ce-a713-480b-90f1-8f6848938d54","resolution":{"observed_at":"2026-08-07T14:25:01.118090Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.19001","last_updated":"2025-08-18T17:20:35Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-07T14:19:46.066488Z","submitted_at":"2025-05-25T06:45:53Z","title":"DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":96,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":105},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 100 of 105 outbound references and 2 inbound Pith citation observations for arXiv:2505.19001."}