{"as_of":"2026-08-14T10:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b81fb70f8929681d36bae4595236845e7067b3396ac0628861de7eae3d71c120","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-14T06:32:32.682623+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-12T14:05:56.392246Z","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-12T14:05:56.747317Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.03571","last_updated":"2025-09-08T01:51:44Z","snapshot_observed_at":"2026-08-12T23:29:11.428593Z","submitted_at":"2024-07-04T01:46:07Z","title":"A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems","version":2},"cited_work":{"arxiv_id":"2407.03571","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.03571","snapshot_observed_at":"2026-08-12T14:05:56.747317Z","title":"A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems","venue":"math.OC","work_id":"8bef8358-fd23-4bd0-a7b0-1122802cf25e","year":2024},"citing_paper":{"arxiv_id":"2411.15769","last_updated":"2025-06-15T03:49:05Z","snapshot_observed_at":"2026-08-12T13:53:04.192376Z","submitted_at":"2024-11-24T09:46:36Z","title":"Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T14:05:56.392246Z"},"links":{"cited_paper":"/paper/2407.03571","citing_paper":"/paper/2411.15769"},"observation_digest":"sha256:805746a1db5a5556054c6166fe3c9e2d20ecfd7faa6637acfdef30e56dd0cd63","observation_id":"5298b7e4-9e7e-495a-b166-2cb5131cb98a","resolution":{"observed_at":"2026-08-12T14:05:56.754519Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.03571/citation-record","integrity":"/paper/2407.03571/integrity","json":"/paper/2407.03571/citation-record.json","paper":"/paper/2407.03571"},"outbound":[],"paper":{"arxiv_id":"2407.03571","last_updated":"2025-09-08T01:51:44Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-12T23:29:11.428593Z","submitted_at":"2024-07-04T01:46:07Z","title":"A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2407.03571."}