{"as_of":"2026-08-08T10:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:687695e38b3ea1f5483a4b0c75b4230cbcf60d227cf58efec54d0ca203fc04c5","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:45:08.642109Z","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-22T08:11:17.426305Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-07-06T19:54:05.139608Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14601","snapshot_observed_at":"2026-08-06T21:45:08.642109Z","title":"and Borodich, E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.23803","last_updated":"2025-06-30T12:47:10Z","snapshot_observed_at":"2026-08-06T21:29:10.072225Z","submitted_at":"2025-06-30T12:47:10Z","title":"SGD with Adaptive Preconditioning: Unified Analysis and Momentum Acceleration","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T21:45:08.642109Z"},"links":{"cited_paper":"/paper/2411.14601","citing_paper":"/paper/2506.23803"},"observation_digest":"sha256:7ec725245b6c4a8000b6259ffb0184033562ed024d9426dab9416b39a84e2db5","observation_id":"df26c042-c11b-4139-9f0b-22c00883a741","resolution":{"observed_at":"2026-08-06T21:45:08.642109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-07-06T19:54:05.139608Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14601","snapshot_observed_at":"2026-08-06T17:59:06.823782Z","title":"and Borodich, E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.09823","last_updated":"2025-08-29T15:15:31Z","snapshot_observed_at":"2026-08-06T17:44:16.269487Z","submitted_at":"2025-07-13T23:07:45Z","title":"Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T17:59:06.823782Z"},"links":{"cited_paper":"/paper/2411.14601","citing_paper":"/paper/2507.09823"},"observation_digest":"sha256:acd80497c6d189398f0e82c7a3ab173753bd9c486706de709a92a9743c42def2","observation_id":"f9b028b8-6163-4c25-959f-4464acada25d","resolution":{"observed_at":"2026-08-06T17:59:06.823782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-07-06T19:54:05.139608Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"cited_work":{"arxiv_id":"2411.14601","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.14601","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2411.14601 , year=","venue":null,"work_id":"efb8a32a-d61e-43e6-9ef2-e554dc648236","year":null},"citing_paper":{"arxiv_id":"2604.02505","last_updated":"2026-04-02T21:02:10Z","snapshot_observed_at":"2026-07-06T22:51:53.458444Z","submitted_at":"2026-04-02T21:02:10Z","title":"Optimal Projection-Free Adaptive SGD for Matrix Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-13T20:56:41.466669Z"},"links":{"cited_paper":"/paper/2411.14601","citing_paper":"/paper/2604.02505"},"observation_digest":"sha256:f62ae21831d028121b16fcd42debc5c87d24c9435518843ff2f660b9be3a5a8a","observation_id":"0814005e-fb88-4157-91e9-099ce8e13f07","resolution":{"observed_at":"2026-05-13T20:58:15.721734Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","snapshot_observed_at":"2026-07-06T19:54:05.139608Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms","version":1},"cited_work":{"arxiv_id":"2411.14601","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.14601","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2411.14601 , year=","venue":null,"work_id":"efb8a32a-d61e-43e6-9ef2-e554dc648236","year":null},"citing_paper":{"arxiv_id":"2605.22644","last_updated":"2026-05-21T15:50:40Z","snapshot_observed_at":"2026-08-02T21:41:54.474589Z","submitted_at":"2026-05-21T15:50:40Z","title":"Why SGD is not Brownian Motion: A New Perspective on Stochastic Dynamics","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-05-22T08:06:52.309619Z"},"links":{"cited_paper":"/paper/2411.14601","citing_paper":"/paper/2605.22644"},"observation_digest":"sha256:9b7d9df362e68e645c71503ced605f545453b0ee3a8dd1aabfc93df13d35b93e","observation_id":"91d46fac-d12a-4b11-8e0a-c27661982f86","resolution":{"observed_at":"2026-05-22T08:11:17.429036Z","resolver_source":"arxiv_id","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/2411.14601/citation-record","integrity":"/paper/2411.14601/integrity","json":"/paper/2411.14601/citation-record.json","paper":"/paper/2411.14601"},"outbound":[],"paper":{"arxiv_id":"2411.14601","last_updated":"2024-11-21T22:06:25Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T19:54:05.139608Z","submitted_at":"2024-11-21T22:06:25Z","title":"On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal 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-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 4 inbound Pith citation observations for arXiv:2411.14601."}