{"as_of":"2026-08-10T06:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:975ef1c5c5b4768605e9669a73b0118c6ecf83fbd26ff2fdaeb9345d2a67f580","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-10T06:31:04.303077+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-07T12:10:55.127531Z","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-12T11:01:31.811257Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2112.06188","last_updated":"2021-12-12T09:08:41Z","snapshot_observed_at":"2026-08-10T06:31:43.172136Z","submitted_at":"2021-12-12T09:08:41Z","title":"Parallel Batch-Dynamic $k$d-Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.06188","snapshot_observed_at":"2026-08-07T12:10:55.127531Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.00496","last_updated":"2025-05-31T10:27:54Z","snapshot_observed_at":"2026-08-09T09:16:48.532692Z","submitted_at":"2025-05-31T10:27:54Z","title":"Monitoring Robustness and Individual Fairness","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T12:10:55.127531Z"},"links":{"cited_paper":"/paper/2112.06188","citing_paper":"/paper/2506.00496"},"observation_digest":"sha256:1c883ac124e4675b5e689c3a1012e079c2a7cbb0681e4a4fb471d87e24c2bd35","observation_id":"489c16fb-25e2-4f2f-be24-33af66ecf7b0","resolution":{"observed_at":"2026-08-07T12:10:55.127531Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.06188","last_updated":"2021-12-12T09:08:41Z","snapshot_observed_at":"2026-08-10T06:31:43.172136Z","submitted_at":"2021-12-12T09:08:41Z","title":"Parallel Batch-Dynamic $k$d-Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.06188","snapshot_observed_at":"2026-08-02T22:27:05.369258Z","title":"Parallel batch-dynamic k-d trees.arXiv preprint arXiv:2112.06188, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.17811","last_updated":"2026-07-30T13:37:56Z","snapshot_observed_at":"2026-08-09T20:26:21.219033Z","submitted_at":"2026-02-19T20:26:07Z","title":"Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-02T22:27:05.369258Z"},"links":{"cited_paper":"/paper/2112.06188","citing_paper":"/paper/2602.17811"},"observation_digest":"sha256:cfcf4c3100167a15a4edc9fa190fac676f36bae554f253adead3dc7fb123a747","observation_id":"f93b6354-5e35-42ad-825e-68eef6af8ee2","resolution":{"observed_at":"2026-08-02T22:27:05.369258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.06188","last_updated":"2021-12-12T09:08:41Z","snapshot_observed_at":"2026-08-10T06:31:43.172136Z","submitted_at":"2021-12-12T09:08:41Z","title":"Parallel Batch-Dynamic $k$d-Trees","version":1},"cited_work":{"arxiv_id":"2112.06188","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.06188","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"594b0d4a-b26a-4b33-a929-ab894fcb7102","year":2021},"citing_paper":{"arxiv_id":"2605.03640","last_updated":"2026-05-05T11:12:22Z","snapshot_observed_at":"2026-07-06T23:16:30.147006Z","submitted_at":"2026-05-05T11:12:22Z","title":"In-memory Multidimensional Indexing Using the skd-tree","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-05-07T12:39:54.240991Z"},"links":{"cited_paper":"/paper/2112.06188","citing_paper":"/paper/2605.03640"},"observation_digest":"sha256:4df7b6c43a7109e7d2256c94d0a34665b3dc382db3799418ff904dde164e2847","observation_id":"48b66153-428a-42ff-bb84-3a2b79736e3d","resolution":{"observed_at":"2026-05-12T11:01:31.813403Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2112.06188/citation-record","integrity":"/paper/2112.06188/integrity","json":"/paper/2112.06188/citation-record.json","paper":"/paper/2112.06188"},"outbound":[],"paper":{"arxiv_id":"2112.06188","last_updated":"2021-12-12T09:08:41Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T06:31:43.172136Z","submitted_at":"2021-12-12T09:08:41Z","title":"Parallel Batch-Dynamic $k$d-Trees"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2112.06188."}