{"as_of":"2026-08-09T21:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6753f5a04bfce80127a232091e08eadf505db4e11a0cfccf8fd380a1567abd4e","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-06T14:49:55.586866Z","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-17T00:01:22.779631Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.01797","last_updated":"2024-03-04T07:37:09Z","snapshot_observed_at":"2026-07-31T04:52:30.911927Z","submitted_at":"2024-03-04T07:37:09Z","title":"Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.01797","snapshot_observed_at":"2026-08-06T14:49:55.586866Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.17647","last_updated":"2025-07-23T16:09:10Z","snapshot_observed_at":"2026-08-06T14:41:59.248157Z","submitted_at":"2025-07-23T16:09:10Z","title":"SHINE: A Scalable HNSW Index in Disaggregated Memory","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T14:49:55.586866Z"},"links":{"cited_paper":"/paper/2403.01797","citing_paper":"/paper/2507.17647"},"observation_digest":"sha256:1402bbe3db827fa7710e29b45c214096459367ad82050640a323aed06665ded2","observation_id":"2c4aee9a-7394-4ebe-b193-69d9c934dc70","resolution":{"observed_at":"2026-08-06T14:49:55.586866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01797","last_updated":"2024-03-04T07:37:09Z","snapshot_observed_at":"2026-07-31T04:52:30.911927Z","submitted_at":"2024-03-04T07:37:09Z","title":"Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.01797","snapshot_observed_at":"2026-08-05T04:38:33.076265Z","title":"Unleashing graph partitioning for large-scale nearest neighbor search, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.06046","last_updated":"2025-09-07T13:13:02Z","snapshot_observed_at":"2026-08-06T14:45:49.925169Z","submitted_at":"2025-09-07T13:13:02Z","title":"DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T04:38:33.076265Z"},"links":{"cited_paper":"/paper/2403.01797","citing_paper":"/paper/2509.06046"},"observation_digest":"sha256:cfba6c1909c31893247cdc197295273c87639c828f408ccbf21e71f641b0d68a","observation_id":"dcbdb107-3cbb-4818-86de-e85426951a7a","resolution":{"observed_at":"2026-08-05T04:38:33.076265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01797","last_updated":"2024-03-04T07:37:09Z","snapshot_observed_at":"2026-07-31T04:52:30.911927Z","submitted_at":"2024-03-04T07:37:09Z","title":"Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search","version":1},"cited_work":{"arxiv_id":"2403.01797","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.01797","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"05b66dcc-657d-471e-873d-3de457831ffe","year":2024},"citing_paper":{"arxiv_id":"2512.09331","last_updated":"2026-04-04T09:04:44Z","snapshot_observed_at":"2026-07-06T22:38:35.387503Z","submitted_at":"2025-12-10T05:38:59Z","title":"Passing the Baton: High Throughput Distributed Disk-Based Vector Search with BatANN","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-17T00:01:17.281452Z"},"links":{"cited_paper":"/paper/2403.01797","citing_paper":"/paper/2512.09331"},"observation_digest":"sha256:fcbaf342a619069272e5f0dd3e8e23a159b229f8ec551c346884b8f11bfdf9c8","observation_id":"60fc7218-a058-4e74-beb5-ecca2d0c98ed","resolution":{"observed_at":"2026-05-17T00:01:22.783183Z","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/2403.01797/citation-record","integrity":"/paper/2403.01797/integrity","json":"/paper/2403.01797/citation-record.json","paper":"/paper/2403.01797"},"outbound":[],"paper":{"arxiv_id":"2403.01797","last_updated":"2024-03-04T07:37:09Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-31T04:52:30.911927Z","submitted_at":"2024-03-04T07:37:09Z","title":"Unleashing Graph Partitioning for Large-Scale 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:2403.01797."}