{"as_of":"2026-08-20T04:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c15c29e73d826bf392b8c6d9c4a881355af127343ebe4dcb694fcb7e1a84f4d1","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:17:12.431871Z","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-11T06:36:02.987587Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.16322","last_updated":"2025-01-17T13:55:51Z","snapshot_observed_at":"2026-08-18T21:55:24.134364Z","submitted_at":"2024-04-25T04:00:52Z","title":"Effective and General Distance Computation for Approximate Nearest Neighbor Search","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16322","snapshot_observed_at":"2026-08-12T17:53:50.812031Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.12229","last_updated":"2024-11-19T04:51:08Z","snapshot_observed_at":"2026-08-18T12:57:24.853143Z","submitted_at":"2024-11-19T04:51:08Z","title":"SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-12T17:53:50.812031Z"},"links":{"cited_paper":"/paper/2404.16322","citing_paper":"/paper/2411.12229"},"observation_digest":"sha256:68f531c53dccc15af7355cc5a94bb30e768bad3a941622c3a0e0c2fcbe7e37cc","observation_id":"14378746-77e4-4707-be89-3ebfc60644e3","resolution":{"observed_at":"2026-08-12T17:53:50.812031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16322","last_updated":"2025-01-17T13:55:51Z","snapshot_observed_at":"2026-08-18T21:55:24.134364Z","submitted_at":"2024-04-25T04:00:52Z","title":"Effective and General Distance Computation for Approximate Nearest Neighbor Search","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16322","snapshot_observed_at":"2026-08-15T22:17:12.431871Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07621","last_updated":"2025-05-12T14:44:21Z","snapshot_observed_at":"2026-08-16T14:30:07.481934Z","submitted_at":"2025-05-12T14:44:21Z","title":"Bang for the Buck: Vector Search on Cloud CPUs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T22:17:12.431871Z"},"links":{"cited_paper":"/paper/2404.16322","citing_paper":"/paper/2505.07621"},"observation_digest":"sha256:79fb674a45b08880ca07cc678a176c8c93a559cfc5782fda7721746c69fe6a09","observation_id":"4607cd6c-6436-4178-819a-d484c9641de3","resolution":{"observed_at":"2026-08-15T22:17:12.431871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16322","last_updated":"2025-01-17T13:55:51Z","snapshot_observed_at":"2026-08-18T21:55:24.134364Z","submitted_at":"2024-04-25T04:00:52Z","title":"Effective and General Distance Computation for Approximate Nearest Neighbor Search","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16322","snapshot_observed_at":"2026-08-07T11:16:31.845865Z","title":"arXiv:2404.16322","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.05387","last_updated":"2025-06-11T16:08:29Z","snapshot_observed_at":"2026-08-13T07:03:43.882155Z","submitted_at":"2025-06-03T14:25:23Z","title":"Advancing Decoding Strategies: Enhancements in Locally Typical Sampling for LLMs","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-07T11:16:31.845865Z"},"links":{"cited_paper":"/paper/2404.16322","citing_paper":"/paper/2506.05387"},"observation_digest":"sha256:63512d856b5253bdac130fb44402ab9868a53abbcfde21d7fe262128553123be","observation_id":"c29dc68d-2462-4fd9-b044-cbf18e374562","resolution":{"observed_at":"2026-08-07T11:16:31.845865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16322","last_updated":"2025-01-17T13:55:51Z","snapshot_observed_at":"2026-08-18T21:55:24.134364Z","submitted_at":"2024-04-25T04:00:52Z","title":"Effective and General Distance Computation for Approximate Nearest Neighbor Search","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16322","snapshot_observed_at":"2026-08-03T03:53:57.536611Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.06721","last_updated":"2026-05-28T06:51:41Z","snapshot_observed_at":"2026-08-17T22:29:37.591153Z","submitted_at":"2026-02-06T14:14:00Z","title":"E2E: Efficient Filtered AKNN Search via Adaptive Termination","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T03:53:57.536611Z"},"links":{"cited_paper":"/paper/2404.16322","citing_paper":"/paper/2602.06721"},"observation_digest":"sha256:d13756ca28fa09407a856cdc0e45e983e930c8e1ca67c5e293d191f0ca8ff9a5","observation_id":"5c21ce96-15e1-41aa-9ba6-e6d2a757b6a9","resolution":{"observed_at":"2026-08-03T03:53:57.536611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16322","last_updated":"2025-01-17T13:55:51Z","snapshot_observed_at":"2026-08-18T21:55:24.134364Z","submitted_at":"2024-04-25T04:00:52Z","title":"Effective and General Distance Computation for Approximate Nearest Neighbor Search","version":4},"cited_work":{"arxiv_id":"2404.16322","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.16322","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4537cae1-aab8-4fbb-9756-85994eef497e","year":2024},"citing_paper":{"arxiv_id":"2604.06616","last_updated":"2026-04-30T00:32:29Z","snapshot_observed_at":"2026-08-13T21:00:16.056784Z","submitted_at":"2026-04-08T02:49:55Z","title":"CubeGraph: Efficient Retrieval-Augmented Generation for Spatial and Temporal Data","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-10T17:34:24.958030Z"},"links":{"cited_paper":"/paper/2404.16322","citing_paper":"/paper/2604.06616"},"observation_digest":"sha256:45a60f2c2072d493be570c7a8f05afb85c0b77b32c5ca2109aae8565d86ab8e6","observation_id":"105e46ed-f18d-490a-ba60-1935c2cf4423","resolution":{"observed_at":"2026-05-11T06:36:03.003094Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.16322/citation-record","integrity":"/paper/2404.16322/integrity","json":"/paper/2404.16322/citation-record.json","paper":"/paper/2404.16322"},"outbound":[],"paper":{"arxiv_id":"2404.16322","last_updated":"2025-01-17T13:55:51Z","latest_version":4,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-18T21:55:24.134364Z","submitted_at":"2024-04-25T04:00:52Z","title":"Effective and General Distance Computation for Approximate Nearest Neighbor 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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2404.16322."}