{"as_of":"2026-08-09T22:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:12c5cae8eecafde3078b53028997c3b3a750a91d88ca5cd07e67b36b6e20e6ce","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-09T06:31:02.800959+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-07T13:10:09.008540Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T21:10:38.773594Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.01803","last_updated":"2024-11-05T21:16:44Z","snapshot_observed_at":"2026-08-01T02:48:11.871788Z","submitted_at":"2024-11-04T05:04:18Z","title":"Gradient Methods with Online Scaling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01803","snapshot_observed_at":"2026-08-07T13:10:09.008540Z","title":"Gradient methods with online scaling.arXiv preprint arXiv:2411.01803, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23081","last_updated":"2025-09-05T02:19:47Z","snapshot_observed_at":"2026-08-08T05:47:28.129882Z","submitted_at":"2025-05-29T04:35:21Z","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:09.008540Z"},"links":{"cited_paper":"/paper/2411.01803","citing_paper":"/paper/2505.23081"},"observation_digest":"sha256:b7c462e0ebb4a5c12ce422e5174fd5af7d10130c667e51f50e60766ba2e3d7b9","observation_id":"3ea42a4d-5fdf-4220-b05e-a03902fc660f","resolution":{"observed_at":"2026-08-07T13:10:09.008540Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01803","last_updated":"2024-11-05T21:16:44Z","snapshot_observed_at":"2026-08-01T02:48:11.871788Z","submitted_at":"2024-11-04T05:04:18Z","title":"Gradient Methods with Online Scaling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01803","snapshot_observed_at":"2026-08-06T23:35:24.034634Z","title":"Gradient methods with online scaling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.17650","last_updated":"2025-06-21T09:20:30Z","snapshot_observed_at":"2026-08-09T02:43:52.647254Z","submitted_at":"2025-06-21T09:20:30Z","title":"Enhanced PDHG for Linear Programming with Online Preconditioning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T23:35:24.034634Z"},"links":{"cited_paper":"/paper/2411.01803","citing_paper":"/paper/2506.17650"},"observation_digest":"sha256:2f189ba13886c468582d61777997211eac5881aea2d16f36b2ed341592a27352","observation_id":"e8c89bf7-c7bd-4509-83aa-2b04b4e347c3","resolution":{"observed_at":"2026-08-06T23:35:24.034634Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01803","last_updated":"2024-11-05T21:16:44Z","snapshot_observed_at":"2026-08-01T02:48:11.871788Z","submitted_at":"2024-11-04T05:04:18Z","title":"Gradient Methods with Online Scaling","version":2},"cited_work":{"arxiv_id":"2411.01803","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.01803","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gradient methods with online scaling.arXiv preprint arXiv:2411.01803","venue":null,"work_id":"9f6abc18-7c23-4163-8831-e07a370bd6b8","year":2024},"citing_paper":{"arxiv_id":"2510.10777","last_updated":"2026-05-16T11:31:52Z","snapshot_observed_at":"2026-07-06T22:32:27.698678Z","submitted_at":"2025-10-12T19:39:41Z","title":"Preconditioned Norms: A Unified Framework for Steepest Descent, Quasi-Newton and Adaptive Methods","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-21T21:05:49.844436Z"},"links":{"cited_paper":"/paper/2411.01803","citing_paper":"/paper/2510.10777"},"observation_digest":"sha256:d5657c732e29d1573a496e62fa14faaf7ef5235e25557d2c09debf4a01f86284","observation_id":"5e89cc8e-bae4-42cd-8adb-a09c3c5f8df7","resolution":{"observed_at":"2026-05-21T21:10:38.776036Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01803","last_updated":"2024-11-05T21:16:44Z","snapshot_observed_at":"2026-08-01T02:48:11.871788Z","submitted_at":"2024-11-04T05:04:18Z","title":"Gradient Methods with Online Scaling","version":2},"cited_work":{"arxiv_id":"2411.01803","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.01803","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gradient methods with online scaling.arXiv preprint arXiv:2411.01803","venue":null,"work_id":"9f6abc18-7c23-4163-8831-e07a370bd6b8","year":2024},"citing_paper":{"arxiv_id":"2605.13473","last_updated":"2026-05-13T12:59:26Z","snapshot_observed_at":"2026-08-02T14:44:34.058937Z","submitted_at":"2026-05-13T12:59:26Z","title":"OSDN: Improving Delta Rule with Provable Online Preconditioning in Linear Attention","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-14T19:08:18.768344Z"},"links":{"cited_paper":"/paper/2411.01803","citing_paper":"/paper/2605.13473"},"observation_digest":"sha256:f8c2ed5271672e3f2ab169c32c98dcb063e52732d8ad80acdc7ab73163adb02a","observation_id":"179524cd-0c4a-4d1c-8fd8-5fd2e8f6b635","resolution":{"observed_at":"2026-05-14T19:09:23.271819Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.01803/citation-record","integrity":"/paper/2411.01803/integrity","json":"/paper/2411.01803/citation-record.json","paper":"/paper/2411.01803"},"outbound":[],"paper":{"arxiv_id":"2411.01803","last_updated":"2024-11-05T21:16:44Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-01T02:48:11.871788Z","submitted_at":"2024-11-04T05:04:18Z","title":"Gradient Methods with Online Scaling"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2411.01803."}