{"as_of":"2026-08-23T03:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9f083277da7d5e070b19e9604763e043a197ff9ac0fdc58a7c78d91af2d39d2e","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-07-03T06:56:31.693595Z","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-07-03T06:57:42.564022Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.09532","last_updated":"2019-05-21T20:04:31Z","snapshot_observed_at":"2026-08-18T16:09:30.265003Z","submitted_at":"2019-04-21T02:41:07Z","title":"Optimal Adaptivity of Signed-Polygon Statistics for Network Testing","version":2},"cited_work":{"arxiv_id":"1904.09532","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.09532","snapshot_observed_at":"2026-07-03T06:57:42.564022Z","title":"Optimal Adaptivity of Signed-Polygon Statistics for Network Testing","venue":"math.ST","work_id":"1567117a-d8b1-42ba-bb2b-b2b70c716301","year":2019},"citing_paper":{"arxiv_id":"2607.02013","last_updated":"2026-07-02T10:45:46Z","snapshot_observed_at":"2026-08-17T18:08:52.657296Z","submitted_at":"2026-07-02T10:45:46Z","title":"Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the $d>n$ Regime","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-03T06:56:31.693595Z"},"links":{"cited_paper":"/paper/1904.09532","citing_paper":"/paper/2607.02013"},"observation_digest":"sha256:920de3362d4e97ba73ec749a61c5341275540a79c6126e7e6984cac410c77412","observation_id":"93b4c701-cf8f-42d1-a86d-1608df84d43d","resolution":{"observed_at":"2026-07-03T06:57:42.565461Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/1904.09532/citation-record","integrity":"/paper/1904.09532/integrity","json":"/paper/1904.09532/citation-record.json","paper":"/paper/1904.09532"},"outbound":[],"paper":{"arxiv_id":"1904.09532","last_updated":"2019-05-21T20:04:31Z","latest_version":2,"primary_category":"math.ST","snapshot_observed_at":"2026-08-18T16:09:30.265003Z","submitted_at":"2019-04-21T02:41:07Z","title":"Optimal Adaptivity of Signed-Polygon Statistics for Network Testing"},"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:1904.09532."}