{"as_of":"2026-08-08T16:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d9018db2699ac0f918e0632bf1df76df7d126aabf26fe84f7d761ff2a2c6cf9a","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-08T06:32:00.761636+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-07T05:20:08.196992Z","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-07T05:20:08.420167Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.13944","last_updated":"2024-07-15T05:27:38Z","snapshot_observed_at":"2026-07-06T17:20:17.051503Z","submitted_at":"2024-01-25T04:56:55Z","title":"Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization","version":2},"cited_work":{"arxiv_id":"2401.13944","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.13944","snapshot_observed_at":"2026-08-07T05:20:08.420167Z","title":"Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization","venue":"math.OC","work_id":"9b2fd474-8ae8-4d9b-8dc9-46d52d039ff6","year":2024},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.196992Z"},"links":{"cited_paper":"/paper/2401.13944","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:adf8260ba1a47184c667133a84c61cca9073136c30cbaacd21f98dfabc42a584","observation_id":"813db31e-38fd-488a-80a5-747b34011092","resolution":{"observed_at":"2026-08-07T05:20:08.428225Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.13944/citation-record","integrity":"/paper/2401.13944/integrity","json":"/paper/2401.13944/citation-record.json","paper":"/paper/2401.13944"},"outbound":[],"paper":{"arxiv_id":"2401.13944","last_updated":"2024-07-15T05:27:38Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T17:20:17.051503Z","submitted_at":"2024-01-25T04:56:55Z","title":"Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2401.13944."}