{"as_of":"2026-08-09T03:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:728b8472ffe223b5924551564fc04b126d08f14599c35246c3c461c47b764fde","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T01:55:00.945941Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.03218","last_updated":"2023-12-06T01:16:10Z","snapshot_observed_at":"2026-08-09T00:43:16.510343Z","submitted_at":"2023-12-06T01:16:10Z","title":"Accelerated Gradient Algorithms with Adaptive Subspace Search for Instance-Faster Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.03218","snapshot_observed_at":"2026-07-31T12:44:32.914467Z","title":"arXiv preprint arXiv:2312.03218 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24520","last_updated":"2026-07-31T08:05:57Z","snapshot_observed_at":"2026-08-06T16:56:21.845901Z","submitted_at":"2026-07-27T15:01:13Z","title":"Optimal Convex Optimization with Inexact Second-Order Oracles","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-07-31T12:44:32.914467Z"},"links":{"cited_paper":"/paper/2312.03218","citing_paper":"/paper/2607.24520"},"observation_digest":"sha256:d121c095e7a816c4219fbf51c0fba9c63090a4728a56c499ff2553513913f3f1","observation_id":"93c5f721-6b43-461e-8412-93c06eb5927b","resolution":{"observed_at":"2026-07-31T12:44:32.914467Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03218","last_updated":"2023-12-06T01:16:10Z","snapshot_observed_at":"2026-08-09T00:43:16.510343Z","submitted_at":"2023-12-06T01:16:10Z","title":"Accelerated Gradient Algorithms with Adaptive Subspace Search for Instance-Faster Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.03218","snapshot_observed_at":"2026-08-03T01:55:00.945941Z","title":"arXiv preprint arXiv:2312.03218 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24520","last_updated":"2026-07-31T08:05:57Z","snapshot_observed_at":"2026-08-06T16:56:21.845901Z","submitted_at":"2026-07-27T15:01:13Z","title":"Optimal Convex Optimization with Inexact Second-Order Oracles","version":3},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-03T01:55:00.945941Z"},"links":{"cited_paper":"/paper/2312.03218","citing_paper":"/paper/2607.24520"},"observation_digest":"sha256:df41174d364fdb9ec6944d6762daabeff56ac9aa5d2e3093090df9e3ddda4819","observation_id":"c015ed75-d01f-4fad-8dcc-ff24e49f85af","resolution":{"observed_at":"2026-08-03T01:55:00.945941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2312.03218/citation-record","integrity":"/paper/2312.03218/integrity","json":"/paper/2312.03218/citation-record.json","paper":"/paper/2312.03218"},"outbound":[],"paper":{"arxiv_id":"2312.03218","last_updated":"2023-12-06T01:16:10Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T00:43:16.510343Z","submitted_at":"2023-12-06T01:16:10Z","title":"Accelerated Gradient Algorithms with Adaptive Subspace Search for Instance-Faster 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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2312.03218."}