{"as_of":"2026-08-09T12:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e2de790e4470c61604990202bce73a181746158ca4bf9863aeea51c869600d12","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-09T06:31:02.800959+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-07T11:16:31.845865Z","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-07-06T18:05:20.955471Z","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-08T01:16:04.570452Z","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:e3c4992ad1988ca50be9fcccc7b32cd2e38e4c3e34fa871751a90426548df1a5","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-07-06T18:05:20.955471Z","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-03T10:22:00.755057Z","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:f03a133c6467276ef2cac645f3442c280cca1cbcac5dcf664f3503a377c1b341","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-07-06T18:05:20.955471Z","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-07-06T22:55:01.863342Z","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:9baa843254bd205c7d78fd35af06bd7d6a3a1b77d2b387f886b05bcd4f4551ab","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-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07-06T18:05:20.955471Z","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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2404.16322."}