{"as_of":"2026-08-08T12:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:856335cde522586c6bff59100f2925fe5c125bdc043cc6ef4c5c8c31c5b6a060","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-08T06:32:00.761636+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-08-07T05:31:40.956601Z","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-05T15:43:57.315372Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.12860","last_updated":"2026-06-01T16:45:39Z","snapshot_observed_at":"2026-08-07T12:22:12.311103Z","submitted_at":"2022-10-23T21:24:37Z","title":"Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.12860","snapshot_observed_at":"2026-08-07T05:31:40.956601Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.08362","last_updated":"2025-06-10T02:20:48Z","snapshot_observed_at":"2026-08-08T03:27:35.810197Z","submitted_at":"2025-06-10T02:20:48Z","title":"Solving Convex-Concave Problems with $\\tilde{\\mathcal{O}}(\\epsilon^{-4/7})$ Second-Order Oracle Complexity","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T05:31:40.956601Z"},"links":{"cited_paper":"/paper/2210.12860","citing_paper":"/paper/2506.08362"},"observation_digest":"sha256:df5dcd6163d4315bfc45ebc9e360700731f8eae25a8938464aed615094ad2da4","observation_id":"c0019c11-5868-45ee-bd2a-41672cf5b1ea","resolution":{"observed_at":"2026-08-07T05:31:40.956601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.12860","last_updated":"2026-06-01T16:45:39Z","snapshot_observed_at":"2026-08-07T12:22:12.311103Z","submitted_at":"2022-10-23T21:24:37Z","title":"Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis","version":8},"cited_work":{"arxiv_id":"2210.12860","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.12860","snapshot_observed_at":"2026-08-05T15:43:57.315372Z","title":"Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis","venue":"math.OC","work_id":"530e2c55-b5bb-4d1f-8ede-e90b20568169","year":2022},"citing_paper":{"arxiv_id":"2508.19712","last_updated":"2025-08-27T09:18:51Z","snapshot_observed_at":"2026-08-07T12:21:30.603022Z","submitted_at":"2025-08-27T09:18:51Z","title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T15:43:57.019664Z"},"links":{"cited_paper":"/paper/2210.12860","citing_paper":"/paper/2508.19712"},"observation_digest":"sha256:01f7189c06c48023623478033dfecc9862aa3099694222c402065b0b4d2208c0","observation_id":"5734c7ec-a7f8-4cb5-b7f1-43cc2befb09d","resolution":{"observed_at":"2026-08-05T15:43:57.318881Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2210.12860","last_updated":"2026-06-01T16:45:39Z","snapshot_observed_at":"2026-08-07T12:22:12.311103Z","submitted_at":"2022-10-23T21:24:37Z","title":"Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.12860","snapshot_observed_at":"2026-08-04T00:40:46.423674Z","title":"Explicit second-order min-max optimization methods with optimal convergence guarantee.arXiv preprint arXiv:2210.12860, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.00680","last_updated":"2026-07-07T03:07:53Z","snapshot_observed_at":"2026-08-08T05:24:32.371213Z","submitted_at":"2025-11-01T19:48:08Z","title":"Accelerating Trust-Region Methods: An Attempt to Balance Global and Local Efficiency","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T00:40:46.423674Z"},"links":{"cited_paper":"/paper/2210.12860","citing_paper":"/paper/2511.00680"},"observation_digest":"sha256:b2a8827dedfefe6e3a58ea34be65819fc97db9d9346b10b616523c0dde510550","observation_id":"78f22018-e2ad-481a-95b8-70318cd0e02f","resolution":{"observed_at":"2026-08-04T00:40:46.423674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2210.12860/citation-record","integrity":"/paper/2210.12860/integrity","json":"/paper/2210.12860/citation-record.json","paper":"/paper/2210.12860"},"outbound":[],"paper":{"arxiv_id":"2210.12860","last_updated":"2026-06-01T16:45:39Z","latest_version":8,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T12:22:12.311103Z","submitted_at":"2022-10-23T21:24:37Z","title":"Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis"},"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 3 inbound Pith citation observations for arXiv:2210.12860."}