{"as_of":"2026-08-23T02:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:69a573db3dd70a8b8ee30e5b6f890bbc2e3bcbeb149a9acd91cd50e1696287b6","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:02:48.138534Z","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-15T19:02:48.224068Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.02379","last_updated":"2021-03-23T23:26:51Z","snapshot_observed_at":"2026-08-22T01:13:01.854828Z","submitted_at":"2020-10-05T22:50:33Z","title":"A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem","version":3},"cited_work":{"arxiv_id":"2010.02379","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.02379","snapshot_observed_at":"2026-08-15T19:02:48.224068Z","title":"A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem","venue":"cs.DS","work_id":"25e47a22-0dcf-4e4a-b884-5cd07349abb2","year":2020},"citing_paper":{"arxiv_id":"2506.18384","last_updated":"2025-06-23T08:16:46Z","snapshot_observed_at":"2026-08-21T15:25:33.220799Z","submitted_at":"2025-06-23T08:16:46Z","title":"Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T19:02:48.138534Z"},"links":{"cited_paper":"/paper/2010.02379","citing_paper":"/paper/2506.18384"},"observation_digest":"sha256:efffb48e42ce001873c64cab18bfc7b4a52c2acca7ef9085ac0fca1543fa7b7c","observation_id":"afabb625-ba66-4062-a7a5-208799ac15f7","resolution":{"observed_at":"2026-08-15T19:02:48.232626Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2010.02379/citation-record","integrity":"/paper/2010.02379/integrity","json":"/paper/2010.02379/citation-record.json","paper":"/paper/2010.02379"},"outbound":[],"paper":{"arxiv_id":"2010.02379","last_updated":"2021-03-23T23:26:51Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-22T01:13:01.854828Z","submitted_at":"2020-10-05T22:50:33Z","title":"A Parallel Batch-Dynamic Data Structure for the Closest Pair Problem"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2010.02379."}