{"as_of":"2026-08-07T18:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eaec929ec36bddc951ee717641184f31604588407a1ef01c8169b212122c8ac1","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-07T06:34:17.273281+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-06T04:17:00.587149Z","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-06T04:17:01.378958Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.20116","last_updated":"2025-03-01T14:11:25Z","snapshot_observed_at":"2026-07-06T18:22:44.129954Z","submitted_at":"2024-05-30T14:52:14Z","title":"Complexity of Zeroth- and First-order Stochastic Trust-Region Algorithms","version":2},"cited_work":{"arxiv_id":"2405.20116","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.20116","snapshot_observed_at":"2026-08-06T04:17:01.378958Z","title":"Complexity of Zeroth- and First-order Stochastic Trust-Region Algorithms","venue":"math.OC","work_id":"1b804cc4-9ca5-4667-be5f-a3d8271994d9","year":2024},"citing_paper":{"arxiv_id":"2508.03901","last_updated":"2025-08-05T20:39:25Z","snapshot_observed_at":"2026-08-06T04:16:55.006349Z","submitted_at":"2025-08-05T20:39:25Z","title":"Multi-Fidelity Stochastic Trust Region Method with Adaptive Sampling","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T04:17:00.587149Z"},"links":{"cited_paper":"/paper/2405.20116","citing_paper":"/paper/2508.03901"},"observation_digest":"sha256:f4b77a6df09e2d12cbb15bbe6a9f4e1bd75e1b6a95fb66ec2ea3e385ca2998db","observation_id":"31265883-2fce-402f-b421-cfb0bdb87671","resolution":{"observed_at":"2026-08-06T04:17:01.459122Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.20116/citation-record","integrity":"/paper/2405.20116/integrity","json":"/paper/2405.20116/citation-record.json","paper":"/paper/2405.20116"},"outbound":[],"paper":{"arxiv_id":"2405.20116","last_updated":"2025-03-01T14:11:25Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T18:22:44.129954Z","submitted_at":"2024-05-30T14:52:14Z","title":"Complexity of Zeroth- and First-order Stochastic Trust-Region Algorithms"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2405.20116."}