{"as_of":"2026-08-09T15:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:68b0ed58b63dab5fe6c2c4dc3ac3a67801724e8ce71fc1ba5b1a69677e8070e1","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-06T15:01:17.566867Z","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-06T15:01:17.682155Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.03940","last_updated":"2025-06-03T15:39:34Z","snapshot_observed_at":"2026-07-06T16:58:03.812619Z","submitted_at":"2023-12-06T22:43:50Z","title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search","version":3},"cited_work":{"arxiv_id":"2312.03940","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.03940","snapshot_observed_at":"2026-08-06T15:01:17.682155Z","title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search","venue":"cs.DS","work_id":"13b6fa1e-a14d-417a-9de4-4cf4b030abac","year":2023},"citing_paper":{"arxiv_id":"2507.17094","last_updated":"2025-07-23T00:19:27Z","snapshot_observed_at":"2026-08-08T11:06:13.689212Z","submitted_at":"2025-07-23T00:19:27Z","title":"PathWeaver: A High-Throughput Multi-GPU System for Graph-Based Approximate Nearest Neighbor Search","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T15:01:17.566867Z"},"links":{"cited_paper":"/paper/2312.03940","citing_paper":"/paper/2507.17094"},"observation_digest":"sha256:e64cf4f0e775f2c18d230403652e0e6c893a198002fb118f8e13e88d74220df4","observation_id":"aa74c2d3-c08a-4bba-951f-0332d12339e8","resolution":{"observed_at":"2026-08-06T15:01:17.692382Z","resolver_source":"local_arxiv","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":"2312.03940","last_updated":"2025-06-03T15:39:34Z","snapshot_observed_at":"2026-07-06T16:58:03.812619Z","submitted_at":"2023-12-06T22:43:50Z","title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.03940","snapshot_observed_at":"2026-07-31T21:58:59.869190Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24173","last_updated":"2026-07-27T08:55:09Z","snapshot_observed_at":"2026-08-09T12:42:25.589050Z","submitted_at":"2026-07-27T08:55:09Z","title":"Simple and Fast Algorithm for Graph-based Filtered Approximate Nearest Neighbor Search (Full Version)","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-31T21:58:59.869190Z"},"links":{"cited_paper":"/paper/2312.03940","citing_paper":"/paper/2607.24173"},"observation_digest":"sha256:adb05949ab53891dc9b7c20bfcc1fe155f6f0829b654fe639c1be552d9ad8d03","observation_id":"614de366-4f3b-44e7-beb7-f4b32b3b76ed","resolution":{"observed_at":"2026-07-31T21:58:59.869190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2312.03940/citation-record","integrity":"/paper/2312.03940/integrity","json":"/paper/2312.03940/citation-record.json","paper":"/paper/2312.03940"},"outbound":[],"paper":{"arxiv_id":"2312.03940","last_updated":"2025-06-03T15:39:34Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T16:58:03.812619Z","submitted_at":"2023-12-06T22:43:50Z","title":"PECANN: Parallel Efficient Clustering with Graph-Based 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:2312.03940."}