{"as_of":"2026-08-13T04:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5a72ac8d153868e4a274d3569bf9e35b2aa5d9b0233b67372f92f78fe78f0bd","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T05:45:41.905519Z","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-05-25T05:46:39.655562Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.13965","last_updated":"2026-06-06T14:09:50Z","snapshot_observed_at":"2026-08-07T16:55:44.725931Z","submitted_at":"2025-03-18T06:57:36Z","title":"First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts","version":5},"cited_work":{"arxiv_id":"2503.13965","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.13965","snapshot_observed_at":"2026-06-09T02:06:02.463959Z","title":"First-order projected algorithms with the same linear convergence rate bounds as their unconstrained counterparts","venue":null,"work_id":"bdc11ff8-2547-4d7a-be61-1bd1538b79a9","year":2025},"citing_paper":{"arxiv_id":"2604.02762","last_updated":"2026-04-03T06:10:33Z","snapshot_observed_at":"2026-08-11T15:43:04.261886Z","submitted_at":"2026-04-03T06:10:33Z","title":"A Canonical Structure for Constructing Projected First-Order Algorithms With Delayed Feedback","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-13T19:26:05.821774Z"},"links":{"cited_paper":"/paper/2503.13965","citing_paper":"/paper/2604.02762"},"observation_digest":"sha256:7e81c65a0fb83dd088ae406999ba57a9ddf62a2750fcb0d6a251438938fc275c","observation_id":"d6c9589d-6696-4cac-9075-ca5dfeba1fa1","resolution":{"observed_at":"2026-06-09T02:06:02.463959Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13965","last_updated":"2026-06-06T14:09:50Z","snapshot_observed_at":"2026-08-07T16:55:44.725931Z","submitted_at":"2025-03-18T06:57:36Z","title":"First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts","version":5},"cited_work":{"arxiv_id":"2503.13965","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.13965","snapshot_observed_at":"2026-06-09T02:06:02.463959Z","title":"First-order projected algorithms with the same linear convergence rate bounds as their unconstrained counterparts","venue":null,"work_id":"bdc11ff8-2547-4d7a-be61-1bd1538b79a9","year":2025},"citing_paper":{"arxiv_id":"2604.15624","last_updated":"2026-04-17T02:03:44Z","snapshot_observed_at":"2026-08-07T11:30:33.583449Z","submitted_at":"2026-04-17T02:03:44Z","title":"A Common Lyapunov Matrix Approach to the Exponential Stability of Augmented Primal-Dual Gradient Flow as LPV Systems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T09:15:37.114650Z"},"links":{"cited_paper":"/paper/2503.13965","citing_paper":"/paper/2604.15624"},"observation_digest":"sha256:fe0f77c882f01af4471f50c3ebb32cc2bea2edae18b59871b1fda929cb59449a","observation_id":"26086c73-fffd-4b06-bfeb-e3300a89a0f8","resolution":{"observed_at":"2026-06-09T02:06:02.463959Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.13965","last_updated":"2026-06-06T14:09:50Z","snapshot_observed_at":"2026-08-07T16:55:44.725931Z","submitted_at":"2025-03-18T06:57:36Z","title":"First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts","version":5},"cited_work":{"arxiv_id":"2503.13965","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.13965","snapshot_observed_at":"2026-06-09T02:06:02.463959Z","title":"First-order projected algorithms with the same linear convergence rate bounds as their unconstrained counterparts","venue":null,"work_id":"bdc11ff8-2547-4d7a-be61-1bd1538b79a9","year":2025},"citing_paper":{"arxiv_id":"2605.22929","last_updated":"2026-05-21T18:06:17Z","snapshot_observed_at":"2026-08-03T09:17:15.892372Z","submitted_at":"2026-05-21T18:06:17Z","title":"An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-25T05:45:41.905519Z"},"links":{"cited_paper":"/paper/2503.13965","citing_paper":"/paper/2605.22929"},"observation_digest":"sha256:40ca4c873f28140aa268f15da075f87e7ca4ff4de612fffc9fc426e25e2de21e","observation_id":"9e8220c7-6319-4ea7-97f9-952e706b0d3c","resolution":{"observed_at":"2026-06-09T02:06:02.463959Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.13965/citation-record","integrity":"/paper/2503.13965/integrity","json":"/paper/2503.13965/citation-record.json","paper":"/paper/2503.13965"},"outbound":[],"paper":{"arxiv_id":"2503.13965","last_updated":"2026-06-06T14:09:50Z","latest_version":5,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T16:55:44.725931Z","submitted_at":"2025-03-18T06:57:36Z","title":"First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2503.13965."}