{"as_of":"2026-08-08T08:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ec36a2995ec6ef5c4bfcadc8d00920389075bcee971810f7c9bd17b6373e3328","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-08T06:32:00.761636+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-07T05:31:40.944633Z","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-07T05:31:41.206728Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.17488","last_updated":"2026-07-13T07:56:18Z","snapshot_observed_at":"2026-07-16T23:18:30.593411Z","submitted_at":"2025-01-29T08:57:02Z","title":"Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity","version":3},"cited_work":{"arxiv_id":"2501.17488","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.17488","snapshot_observed_at":"2026-08-07T05:31:41.206728Z","title":"Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity","venue":"math.OC","work_id":"62fa126a-82c2-4d98-a3db-9dfec60d18a9","year":2025},"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":2024,"source":"pdf_text","source_observed_at":"2026-08-07T05:31:40.944633Z"},"links":{"cited_paper":"/paper/2501.17488","citing_paper":"/paper/2506.08362"},"observation_digest":"sha256:4d468fb0573158c3e81b7c094660bbd54672fdb2cbee3087cfd510c630883c0d","observation_id":"d856ae25-6d2e-45de-924e-09cd94bb4fd8","resolution":{"observed_at":"2026-08-07T05:31:41.211654Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2501.17488/citation-record","integrity":"/paper/2501.17488/integrity","json":"/paper/2501.17488/citation-record.json","paper":"/paper/2501.17488"},"outbound":[],"paper":{"arxiv_id":"2501.17488","last_updated":"2026-07-13T07:56:18Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-07-16T23:18:30.593411Z","submitted_at":"2025-01-29T08:57:02Z","title":"Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity"},"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 1 inbound Pith citation observation for arXiv:2501.17488."}