{"as_of":"2026-08-16T16:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:52b4a89e273c98d4fb9692a1ca97ef11d2a08d4eda979f7ce9fb7e578f221e26","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:47:03.130179Z","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-15T16:41:53.209456Z","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-16T14:37:18.317072Z","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-15T16:47:03.130179Z","title":"Accelerated gradient algorithms with adaptive subspace search for instance-faster optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02526","last_updated":"2025-09-02T17:27:33Z","snapshot_observed_at":"2026-08-15T16:35:11.490132Z","submitted_at":"2025-09-02T17:27:33Z","title":"Reusing Samples in Variance Reduction","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T16:47:03.130179Z"},"links":{"cited_paper":"/paper/2312.03218","citing_paper":"/paper/2509.02526"},"observation_digest":"sha256:0b741f2aa907f0782b951a5213e1f14e364a624ea373b3449fcff57005db5598","observation_id":"327f99ef-e716-415b-95b5-2b55c9827e77","resolution":{"observed_at":"2026-08-15T16:47:03.130179Z","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-16T14:37:18.317072Z","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":"2312.03218","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.03218","snapshot_observed_at":"2026-08-15T16:41:53.209456Z","title":"Accelerated Gradient Algorithms with Adaptive Subspace Search for Instance-Faster Optimization","venue":"cs.LG","work_id":"419fae3a-9115-4e71-ace5-50c333d23122","year":2023},"citing_paper":{"arxiv_id":"2509.04426","last_updated":"2026-06-22T05:05:13Z","snapshot_observed_at":"2026-08-15T16:27:30.388816Z","submitted_at":"2025-09-04T17:46:48Z","title":"Solving Zero-Sum Games with Fewer Matrix-Vector Products","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T16:41:53.077046Z"},"links":{"cited_paper":"/paper/2312.03218","citing_paper":"/paper/2509.04426"},"observation_digest":"sha256:45c309bf77b1245ab6173f0e40940f919d42c1144109e96a5c9bdc6992e65073","observation_id":"60b089f6-30ec-4297-a927-19dc892648d4","resolution":{"observed_at":"2026-08-15T16:41:53.215810Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.03218","last_updated":"2023-12-06T01:16:10Z","snapshot_observed_at":"2026-08-16T14:37:18.317072Z","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-09T21:57:46.381886Z","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:2270ddb4c9e83c4e3c0586db8acef4cc074eb5899065bab850d8d52bc2df6456","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-16T14:37:18.317072Z","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-09T21:57:46.381886Z","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:fc61411bcd882c6018ef6344ff1aedcd2255c02c49f4a7a6c7d5af2cd588bbf8","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-16T14:37:18.317072Z","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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2312.03218."}