{"as_of":"2026-08-10T07:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7991f8aadb9a1fc83a9e09b888e255df8724b2f489bbe2811f12c3acc84af03c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:23:42.116435Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-04T22:49:22.814856Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.02891","last_updated":"2024-06-05T03:17:48Z","snapshot_observed_at":"2026-08-06T22:59:50.754481Z","submitted_at":"2024-06-05T03:17:48Z","title":"A Bi-metric Framework for Fast Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02891","snapshot_observed_at":"2026-08-07T15:23:42.116435Z","title":"A bi-metric framework for fast similarity search","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15636","last_updated":"2025-05-21T15:18:53Z","snapshot_observed_at":"2026-08-07T15:11:19.262770Z","submitted_at":"2025-05-21T15:18:53Z","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:42.116435Z"},"links":{"cited_paper":"/paper/2406.02891","citing_paper":"/paper/2505.15636"},"observation_digest":"sha256:9254cef8cce1c3e06fc4d518daf9b2a80155042caa8ac698dc6dc1592de805a4","observation_id":"e7bfca46-aef3-4a4a-89ea-f1f13fa639dc","resolution":{"observed_at":"2026-08-07T15:23:42.116435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02891","last_updated":"2024-06-05T03:17:48Z","snapshot_observed_at":"2026-08-06T22:59:50.754481Z","submitted_at":"2024-06-05T03:17:48Z","title":"A Bi-metric Framework for Fast Similarity Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02891","snapshot_observed_at":"2026-08-06T16:23:30.617105Z","title":"A bi-metric framework for fast similarity search","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.14060","last_updated":"2025-07-18T16:41:21Z","snapshot_observed_at":"2026-08-09T08:38:27.767282Z","submitted_at":"2025-07-18T16:41:21Z","title":"Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T16:23:30.617105Z"},"links":{"cited_paper":"/paper/2406.02891","citing_paper":"/paper/2507.14060"},"observation_digest":"sha256:9ae9fd74d5b6857ec4b82b389d9a6f65f5bfb4f6d8fa62102ad8f3e286d1e574","observation_id":"b90574ad-1c11-436d-aa30-332d36d88d5c","resolution":{"observed_at":"2026-08-06T16:23:30.617105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02891","last_updated":"2024-06-05T03:17:48Z","snapshot_observed_at":"2026-08-06T22:59:50.754481Z","submitted_at":"2024-06-05T03:17:48Z","title":"A Bi-metric Framework for Fast Similarity Search","version":1},"cited_work":{"arxiv_id":"2406.02891","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.02891","snapshot_observed_at":"2026-08-04T22:49:22.814856Z","title":"A Bi-metric Framework for Fast Similarity Search","venue":"cs.IR","work_id":"54658955-a663-4723-8db4-6d682b9b3ced","year":2024},"citing_paper":{"arxiv_id":"2509.07163","last_updated":"2025-09-08T19:24:09Z","snapshot_observed_at":"2026-08-08T16:43:29.648337Z","submitted_at":"2025-09-08T19:24:09Z","title":"Beyond Sequential Reranking: Reranker-Guided Search Improves Reasoning Intensive Retrieval","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T22:49:22.191802Z"},"links":{"cited_paper":"/paper/2406.02891","citing_paper":"/paper/2509.07163"},"observation_digest":"sha256:c7f571af9dbd06e7447bb353d7b5c8bc6d65a8a4596489343912b8e0f0905a79","observation_id":"565b6f76-8cb3-45b9-a3f9-cc6f13d7a167","resolution":{"observed_at":"2026-08-04T22:49:22.914872Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.02891/citation-record","integrity":"/paper/2406.02891/integrity","json":"/paper/2406.02891/citation-record.json","paper":"/paper/2406.02891"},"outbound":[],"paper":{"arxiv_id":"2406.02891","last_updated":"2024-06-05T03:17:48Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-06T22:59:50.754481Z","submitted_at":"2024-06-05T03:17:48Z","title":"A Bi-metric Framework for Fast Similarity Search"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2406.02891."}