{"as_of":"2026-08-08T12:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:656770ca18eaf504891f55d0ea2f5751adc07945d2f612a4470eef88577f8a99","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-07T10:44:30.732726Z","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-07T10:44:31.680998Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.07922","last_updated":"2024-04-03T15:24:47Z","snapshot_observed_at":"2026-08-07T15:40:29.115226Z","submitted_at":"2023-10-11T22:31:42Z","title":"Polyak Minorant Method for Convex Optimization","version":4},"cited_work":{"arxiv_id":"2310.07922","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.07922","snapshot_observed_at":"2026-08-07T10:44:31.680998Z","title":"Polyak Minorant Method for Convex Optimization","venue":"math.OC","work_id":"09049a34-9631-4dfc-907e-32329353a3cb","year":2023},"citing_paper":{"arxiv_id":"2506.04866","last_updated":"2025-06-05T10:37:43Z","snapshot_observed_at":"2026-08-07T10:29:10.268821Z","submitted_at":"2025-06-05T10:37:43Z","title":"On the construction of a gradient method of quadratic optimization, optimal from the point of view of minimizing the distance to the exact solution","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:44:30.732726Z"},"links":{"cited_paper":"/paper/2310.07922","citing_paper":"/paper/2506.04866"},"observation_digest":"sha256:c28e347f7d2e2910db22b20067d4f8dec6b4e8f3b7489328a15abd3968726c9c","observation_id":"8eba5296-f12f-41b8-a70d-e49da117685b","resolution":{"observed_at":"2026-08-07T10:44:31.869054Z","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/2310.07922/citation-record","integrity":"/paper/2310.07922/integrity","json":"/paper/2310.07922/citation-record.json","paper":"/paper/2310.07922"},"outbound":[],"paper":{"arxiv_id":"2310.07922","last_updated":"2024-04-03T15:24:47Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T15:40:29.115226Z","submitted_at":"2023-10-11T22:31:42Z","title":"Polyak Minorant Method for Convex Optimization"},"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:2310.07922."}