{"as_of":"2026-08-15T21:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a56338a8a0b2b61d23728a5f165e1bdc49ba6e02fe8ad2b84551c046e88afb01","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-15T06:32:42.880941+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-06-25T21:14:35.154374Z","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-07-04T19:30:07.911558Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.11437","last_updated":"2024-07-21T12:08:15Z","snapshot_observed_at":"2026-08-13T00:52:16.864660Z","submitted_at":"2024-03-18T03:17:17Z","title":"Formalization of Complexity Analysis of the First-order Algorithms for Convex Optimization","version":3},"cited_work":{"arxiv_id":"2403.11437","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.11437","snapshot_observed_at":"2026-07-04T19:30:07.911558Z","title":"Formalization of complexity analysis of the first-order algorithms for convex optimization","venue":null,"work_id":"59604511-a72b-4988-8143-2aade9334ef1","year":2024},"citing_paper":{"arxiv_id":"2606.25412","last_updated":"2026-06-24T05:18:16Z","snapshot_observed_at":"2026-08-13T22:56:11.849718Z","submitted_at":"2026-06-24T05:18:16Z","title":"Formalization of Line Search Methods by Lean","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-25T21:14:35.154374Z"},"links":{"cited_paper":"/paper/2403.11437","citing_paper":"/paper/2606.25412"},"observation_digest":"sha256:292236796be1621c844359cbb6c565853b8d6ffc42e32f270d36d4f392c809c1","observation_id":"2597e06f-c06f-4da0-bf9e-aa85927a03b0","resolution":{"observed_at":"2026-07-04T19:30:07.913096Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.11437/citation-record","integrity":"/paper/2403.11437/integrity","json":"/paper/2403.11437/citation-record.json","paper":"/paper/2403.11437"},"outbound":[],"paper":{"arxiv_id":"2403.11437","last_updated":"2024-07-21T12:08:15Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T00:52:16.864660Z","submitted_at":"2024-03-18T03:17:17Z","title":"Formalization of Complexity Analysis of the First-order Algorithms for 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2403.11437."}