{"as_of":"2026-08-09T15:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e1f24e5340a4a11ed35cfa7b865d0892f4fe96a66e0b79931f887e6d891c3623","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-08T05:56:55.076094Z","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-12T01:47:20.124740Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.08933","last_updated":"2024-08-16T06:48:16Z","snapshot_observed_at":"2026-08-05T00:14:38.964661Z","submitted_at":"2024-08-16T06:48:16Z","title":"RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2408.08933","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.08933","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Roargraph: A projected bipartite graph for efficient cross-modal approx- imate nearest neighbor search","venue":null,"work_id":"53201b33-0365-43f9-a47a-059f89565923","year":2024},"citing_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},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-12T01:47:19.947054Z"},"links":{"cited_paper":"/paper/2408.08933","citing_paper":"/paper/2401.08281"},"observation_digest":"sha256:337c9d678a837761b4f2ea856952c6b1d25cf0646d1a68d48c0e8e7be8de049b","observation_id":"d56df06b-86b8-477d-b165-dd264058332f","resolution":{"observed_at":"2026-05-12T01:47:20.127224Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08933","last_updated":"2024-08-16T06:48:16Z","snapshot_observed_at":"2026-08-05T00:14:38.964661Z","submitted_at":"2024-08-16T06:48:16Z","title":"RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08933","snapshot_observed_at":"2026-08-08T05:56:55.076094Z","title":"Roargraph: A projected bipartite graph for efficient cross-modal approximate nearest neighbor search.arXiv preprint arXiv:2408.08933, 2024a","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.08246","last_updated":"2025-06-03T10:07:35Z","snapshot_observed_at":"2026-08-08T05:49:05.821041Z","submitted_at":"2025-02-12T09:39:54Z","title":"Inference-time sparse attention with asymmetric indexing","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-08T05:56:55.076094Z"},"links":{"cited_paper":"/paper/2408.08933","citing_paper":"/paper/2502.08246"},"observation_digest":"sha256:0ae52d28fedb6acdaeae5d2ee0e2ffbddc693200b5c049b90cae5e6763e1254c","observation_id":"434c7a4e-1764-49e0-a228-6388ec9b18d4","resolution":{"observed_at":"2026-08-08T05:56:55.076094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.08933/citation-record","integrity":"/paper/2408.08933/integrity","json":"/paper/2408.08933/citation-record.json","paper":"/paper/2408.08933"},"outbound":[],"paper":{"arxiv_id":"2408.08933","last_updated":"2024-08-16T06:48:16Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-05T00:14:38.964661Z","submitted_at":"2024-08-16T06:48:16Z","title":"RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal 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 2 inbound Pith citation observations for arXiv:2408.08933."}