{"as_of":"2026-08-17T14:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:de6a46dc157021b96a024cc894f83cf75cb604b9541e07e63d33793027378ba6","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-17T06:30:58.91139+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-16T23:03:31.506856Z","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-14T07:38:44.249228Z","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:a0a390fe487d0fdba374eede3fd72c078279075466a68516b7ddbe4cc270992b","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-16T23:03:31.506856Z","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-16T23:04:21.001837Z","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:136c7c7e9989d55e6812fdd5710fcc3d61f4eef3e864e81a59578d723b8ff900","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:bc3ea0cfe20494d8e165fe69f91e291ece4f752fae2cc554cbfbfdde77ad8e3e","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-16T23:03:31.506856Z","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:af6b9cc714ecfb9ad5958729d811ce18f0cf1d123801b1e0743e1a9d4db15dfe","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-16T23:03:31.506856Z","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:0c76ba327b1aac38d607fe5275f94b2ffde0d41a7fdc5c93ffed27a59f84b68a","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-16T23:03:31.506856Z","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:9909d0c45dca7f961df06d586d0c63a5c22bd866f1a152056ccd91eee5e13063","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-16T23:03:31.506856Z","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:f5e8462094c6c53cba68d6b5d8a695e9a574c0b22593cd6b94c2776220c6dd99","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-16T23:03:31.506856Z","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:4eaaaa91bcf6f57629c4ecc954ffac99d94faab781bce46691d4799f78ca4c6b","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-16T23:03:31.506856Z","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:b75996d27c2236619eb56d717d02cff3d48cbf0d610bf06d873b8806ca615584","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-16T23:03:31.506856Z","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:6dfc7e7023b29fb2ccab8398754bb4e0e1db72401d4d364ada520b52974c9ad7","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-16T23:03:31.506856Z","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:48297dd8e174895eaeb7824c509d6d89a521c54afdff1d29634e9a80df6473d6","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-16T23:03:31.506856Z","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:6a357a6048db6e475ba4bf332d1def0cb0cb04941bbaa6e8299b544419044887","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-16T23:03:31.506856Z","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:005b2f1bbc4aa6973a5f8d09ab6927ba5d7c24a2c9ca14e4fdb7ccb94ce17fe1","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-08-16T23:02:50.446291Z","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-16T23:03:31.506856Z","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:9470cf45cdb728d0f6dc1c14f443964d84833d82d54ca5fdd4e9a1376b5cec11","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-16T23:03:31.506856Z","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:ecefa2ce5472beae3b3cf56c5b72b096620862fde1a5905f248f7500308f78fb","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-16T23:03:31.506856Z","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:0c8e88479b36547c89b7914c68c93eae65d1c61d66918e41007aa54c81bf1307","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-16T23:03:31.506856Z","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:2e33262843f76abefb6e6668daf5fcf2de3064831dcbdc4ce760d47978306f84","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-16T23:03:31.506856Z","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:f1190a4857073fc7d8b8bfe74533d5fe76e5be500880445baa81830c7de0cc88","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-16T23:03:31.506856Z","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:acf812a94a560efa036bb1f5027e4d542b11d186f71d30489bb8a9e771700029","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-16T23:03:31.506856Z","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:387e1227832303580a57a48a6c469fcffef1b4031ab59b1a3613621e545b99e1","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-16T23:03:31.506856Z","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:0d7e7914e859812579da5e432a11d5d56839e37134e2c4c5bb27752c3d69f912","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-16T23:03:31.506856Z","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:39d29ca9d4f1e901e0129e0eb446447d68fedb1ef9b23bb3445d0a2ca09dadf6","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-16T23:03:31.506856Z","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:026aa12c3836088100ed212663003295a17db1c68223b1fd36797e2e29772262","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-16T23:03:31.506856Z","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:3a7de292e23b5392a47a236820d5afb52cc2d09cc659d81e5b9d9da31169cb1e","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-16T23:03:31.506856Z","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:a09ce59f930b4251774bb5948debd6899859b6132c0ea60bceaf80ce7274f61b","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-16T23:03:31.506856Z","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:bec4a2a9956b0950480748ec99bb63870af48eead62a2d3dd3c8fd0b03d80fa2","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-16T23:03:31.506856Z","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:26f85468eb3f1c19db1cb45f0a9abfb294c0fb4fcb15a5edc204c4872acd3c1c","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-16T23:03:31.506856Z","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:ea16422d4e27e8ba1203089f19ef8a9a0579d8ce25428584c1309a2988d0449e","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-16T23:03:31.506856Z","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:8d019da4a74bf17cce03b9e1dda5a77da15bab2d31dc0993c551a1e45cf7344d","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-08-16T19:12:28.855105Z","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-16T23:03:31.506856Z","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:af794ddd34475791c82d5eff42c004446ad501c2b4f20184a688cf3a4f249220","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:f62ca9e77242eb3bad6f5e4716e6433142b8fcb827c4918f03d096c65a6fcd76","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-16T16:05:55.636168Z","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-16T23:03:31.506856Z","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:a7d0b4a02b066731b36551df9c7486807d7d73562367ba82543f91306fa1c713","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:ec39d4fd4d8fbd58b7fd84e18c67d87cd30fbfd2c5cecba4e77b628018d77111","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:8d7ed718874dc03516bfa40d3a68d780c0609e809b28fe23918f2adfc36fa0f6","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T01:49:10.385822Z","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-16T23:03:31.506856Z","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:9151cbf76778ad8b5eb6749fe31df797fde5ead9212ff92ddaf63b90aa257056","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:d9210f6636c5ea538468bcf4db091256e828a6a57b25fcf014a13cb9cc88b9ec","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:03356909b09a88ab5dbff90cd87c5925cb3ec1a6b8e7a42f60072e320eaf719e","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:830ff9508e9f30cac1ccd70415111bb1f71b9620e36fefa63869196aae06fa16","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:e2a173d6dc151e943d95722b4780d0d1bc678444f69645f3819f6851f6777c2e","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-16T23:03:31.506856Z","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:c86d97047c39e3842f3114fedfb72d4b0cb4429fd0df273312502afacd9782ab","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-14T20:50:20.417720Z","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-16T23:03:31.506856Z","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:6a0a0cdc46b2eeff929266b501d49b5806fe514c29d9e99ad3b6a5f1b227ebf4","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-16T23:03:31.506856Z","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:322bc0de0a80104785b594f699717a805dfa53da2d81ab201be4c92ba3a8b03c","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-16T23:03:31.506856Z","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:f165795f8313ef8cc3954c9e7d7f5f58ca22ef36cc8b0cb460f557ae1b861736","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-16T23:03:31.506856Z","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:2fc401b428e02f766db885bd64070c4f55c728ee113e5508e7f3f7715587b529","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:029cedc5fc292d0763a99ae94d5c835dd346fdd2ac7ba60eb1da1eb857951d80","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-16T23:03:31.506856Z","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:e3e333d80b79652938cdce4e6e52f63e68d7416f1902ae5355fca800b995340e","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:6adbc602d52ec474c1b328881dd62fe69b8dfcc3f81b530e84011770e05cc98b","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:bb46e5e4180ed0714dfc54a5ecaea8258351ce8604b8e5e648eaf301ec1e3a80","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T07:02:31.648173Z","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-16T23:03:31.506856Z","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:2836ac9b8a449212e15e892432a94ef611ac9887ad9fe9e32cbe31fbfa71c6ce","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:a34eda22a7daa808485dde5db5c978469e7c8756020f1fbd816b50e7c36f1887","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-16T23:03:31.506856Z","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:9cb9a162fd7948187f9d938ecfff844cc9060e223d263db4adeb1f38a343dff0","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-16T23:03:31.506856Z","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:3f74366ee910c1038e905e7967061b6bffeb7bb7959326d65201fd30983b2287","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:a8a0760034d88213e6c8fab84de5a3738a460b2604765ab98441c3cffae49a7e","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-08-16T16:21:57.213885Z","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-16T23:03:31.506856Z","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:3bde8133a3d2eacde5603374d25ba6d84a790553beadeec42f7c650729d4c909","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-16T23:03:31.506856Z","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:1a33babd55cd4ebff8ce8298c59009b29bb4ee9189891e4fa75a3c88df62aabb","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:14a63ea87f4529230e51e0ccadef469071d377f672a658ecf45c23c23abedc62","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:c708b2fb25446ff7362f2fc0a3af00044ef6786e8da968bff2ae4e33331e58c9","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-16T23:03:31.506856Z","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:bb22eecbaf751578ab617788aa58a822f108dd91ee8f1084955e33ac46f45971","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T18:23:58.217072Z","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-16T23:03:31.506856Z","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:5a18cb8b97340448d7c35a86d5be231cc84e00c11a153263eeca5449facae678","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-16T23:03:31.506856Z","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:d2b7aedf1b7788547126673d92d58e75ae71b7ab4d086f041dd972514c3ba931","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-16T23:03:31.506856Z","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:e24b97edd577d8165e762a13e950f33e4ef55f81d586aeb07c8e16d78daf370e","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-16T23:03:31.506856Z","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:35d2def6413da7e8a009655bf5ffaf431f65fb4ba05766d44e5cdf1dbda23608","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-16T17:24:05.903185Z","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-16T23:03:31.506856Z","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:b96ab75149622b815b6cd3d4bf3a416c64b02ee64f4b987b60173c08029f7e9d","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-16T23:03:31.506856Z","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:d76fbf742381523e7eda9f669505d26482440a2b2d91aa1c469f9daa1286a203","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-16T23:03:31.506856Z","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:95d7517607f0c0caf0420ce7c221b5174a662c357de36a1cc1cca035fd4c94f1","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:659b0bb69999d02d993ae30b6fc813fba89d509c4f852fde8af9cd0521191419","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:cb850c9f74a417bbe0722a95ba05f1adcf95039549ebabdd94fa6cce4161c578","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:8073ced64cfb5ed0d5f4ac994004e34ed7f934cd8040801441d2280f54f61208","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:f4f216fdbb378f1ef07f641a34a77360743e32a6a0c0d8297171126fba4ad24b","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:fdf9e5d9df90b5726710b598826190f1e28f6f3ecd3117245295d77912a96661","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:60ec93f7468810de1c2a4718b943ea0c51ec4cb62e4def999ace8a13c1764fc2","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:e312d707c3f65cb2b5439647b46fc97ebfd365824ec73774570569edc225399c","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:78e60ce4a1e8915877b559e5bc4710f8155b9cf249be0862fad988f5a900bec6","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:b0f210168c32587ff74dde73795c2c7b9745ddf5c8c196711d6f9c4063e4ea6c","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:7774ca630708c32dd3bb7cfe11bcaed83fe0e34e4fab51b1bee5f7f78e3e9a97","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:a60cad3da356e68464ff7eae39886cbaed197d04b138e4576ab8c36a62a3dd99","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:6c3b6decb4e3711333a18b0418bf895fc9537f2161f66df559b0f7d17c2245d6","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-16T23:03:31.506856Z","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:ff6e19677e2f071687c5cba96eaf706d574f00c7a11341160b07f9cdcc041713","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:c70d4beaa6e97be234c5d619427779625773ea84db6240acc274beb9936574cd","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:84a215fb89f6c43c5e9bf54e9d9b9a03c0398e2827fa731acd779f9da2b0d1af","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-16T23:03:31.506856Z","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:787fc9c2d15cd27b45996515620c2c66b1c3eb2bfdd189ec2132c7e44a00887d","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:039cb8bebcf7cd62e6d7839bf85c778566c2ff8ca0c4f0dce84d704075abd8d5","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-16T23:03:31.506856Z","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:bef5e3c02e3e52eeb3c333ebab619559c9cb679039b257cfafe480da2f9cc879","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:bc096ee3b7a785d65b7ab4f7257547a072628525b350d2b6a4b175f4ae1e0b51","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:efcccd9eb3ec40c253b3405276716ddf190441f9a8ce6ee7fe089c316f4c7b46","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:1d8cdbcacb8e3433cad9aea8258178c949c1b79fbd8bc1b5bc3581d544b57b28","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-16T23:03:31.506856Z","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:dcfbaa3809c24967b682c3f48ce105f3ae0821120226234749594d8029efa041","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:9c4fe5bd721d967b981c742410f35a39bb8cc682b63bced7812d281f2ed23e25","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2101.12631","last_updated":"2021-05-10T08:54:16Z","snapshot_observed_at":"2026-08-17T05:28:51.542264Z","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-16T23:03:31.506856Z","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:85a26739f083d4ea163df852f6a511cfb8632b8b0397b49f5bafb07cb8a69f83","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-16T23:03:31.506856Z","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:00ca08e66ef4b2124c2c4ea520854e8eeffd47467d2187d1e6ff8315050908d4","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:dccbba04f039ce87b26c8f3c9ef84367df7e661519006545166d7a6109095d24","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:4451e0d38907d9c9f8331fc1fead98c82de64fc3941e439479ec2cf313c7f79a","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:fcd9594070f6a4f3449e2a8ec36cefd83e149f1a2cf37c5526b8292af76516c8","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:77239e7f3013c04d18a90723ed5b67a17a331528aa0ea23a025d86e7ea125ab3","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:c84f7b16b91d30828f710722c2a337bb05e53fcfbc4fbd6cd0114e75b51647da","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:3482bbf408c1422099a6d6d48c82883ace0bef9e3f442d0e4af3d08e79c77349","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:da0c40ddea3b7667c2e85f89bd88529db21d7d8c168e1338702ec5d4e116b8d7","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-16T23:03:31.506856Z","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:065272cdb9ae27df07372ba65c911fb8fd818d7e2956f368fc0039b7b6e42241","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:02c6cf6ef934598c39f4c6215136e7ab18a086a5818bf873573679f121d1ac22","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:022464bd4db51466180e390cc51259e97f571af471195ff0f7cf65bcf6dedbf6","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:a548845b7badb640b4f57d529f0a52ab04d500e2fa2c97d228db4ddfff209c69","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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:4df90df8bb9dec0282bd5b7a45a554fdb5b28a0f80c4af75427eb24455bf912d","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-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-16T23:03:31.506856Z","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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 100 of 105 outbound references and 2 inbound Pith citation observations for arXiv:2505.19001."}