{"as_of":"2026-08-17T19:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:46195363f0397ae0d9b44225b293896e18de86553c598f4e507b3f9a0af15525","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-17T06:30:58.91139+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-14T11:04:26.343886Z","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-14T11:04:26.598166Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.07830","last_updated":"2019-12-06T20:31:43Z","snapshot_observed_at":"2026-08-17T17:36:10.647413Z","submitted_at":"2019-04-16T17:15:15Z","title":"Scalable and Efficient Hypothesis Testing with Random Forests","version":3},"cited_work":{"arxiv_id":"1904.07830","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.07830","snapshot_observed_at":"2026-08-14T11:04:26.598166Z","title":"Scalable and Efficient Hypothesis Testing with Random Forests","venue":"stat.ME","work_id":"92db91ab-b591-4950-894c-cd1fba7a844e","year":2019},"citing_paper":{"arxiv_id":"1908.09967","last_updated":"2019-08-27T00:42:56Z","snapshot_observed_at":"2026-08-17T17:12:14.711726Z","submitted_at":"2019-08-27T00:42:56Z","title":"Locally Optimized Random Forests","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T11:04:26.343886Z"},"links":{"cited_paper":"/paper/1904.07830","citing_paper":"/paper/1908.09967"},"observation_digest":"sha256:16cb8c7dbf2db7e4a2dda785cf1c151a09a44e9b517787f6d1694133b3e148df","observation_id":"264168ab-6d8d-4f0e-abe6-954ff1cf8cf3","resolution":{"observed_at":"2026-08-14T11:04:26.603461Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1904.07830/citation-record","integrity":"/paper/1904.07830/integrity","json":"/paper/1904.07830/citation-record.json","paper":"/paper/1904.07830"},"outbound":[],"paper":{"arxiv_id":"1904.07830","last_updated":"2019-12-06T20:31:43Z","latest_version":3,"primary_category":"stat.ME","snapshot_observed_at":"2026-08-17T17:36:10.647413Z","submitted_at":"2019-04-16T17:15:15Z","title":"Scalable and Efficient Hypothesis Testing with Random Forests"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1904.07830."}