{"as_of":"2026-08-15T15:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e17c660737fad37a4f8e95a38cface628d78e120e52c42b467f4e6bb23eb6c76","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:21:15.022280Z","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:43:44.794782Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1912.08957","last_updated":"2019-12-19T00:23:18Z","snapshot_observed_at":"2026-08-05T19:03:39.733993Z","submitted_at":"2019-12-19T00:23:18Z","title":"Optimization for deep learning: theory and algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.08957","snapshot_observed_at":"2026-08-10T21:11:06.954746Z","title":"Optimization for deep learning: theory and algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.06081","last_updated":"2025-01-10T16:15:25Z","snapshot_observed_at":"2026-08-12T07:42:05.890195Z","submitted_at":"2025-01-10T16:15:25Z","title":"Averaged Adam accelerates stochastic optimization in the training of deep neural network approximations for partial differential equation and optimal control problems","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T21:11:06.954746Z"},"links":{"cited_paper":"/paper/1912.08957","citing_paper":"/paper/2501.06081"},"observation_digest":"sha256:b9ffac0f18f8d8ad8754f17fec47a496fa9c0902afdd5560e08ec25a0108116f","observation_id":"a35a68bb-d5e5-4612-97aa-40bec71fbc9b","resolution":{"observed_at":"2026-08-10T21:11:06.954746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.08957","last_updated":"2019-12-19T00:23:18Z","snapshot_observed_at":"2026-08-05T19:03:39.733993Z","submitted_at":"2019-12-19T00:23:18Z","title":"Optimization for deep learning: theory and algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.08957","snapshot_observed_at":"2026-08-10T14:10:55.368199Z","title":"Optimization for deep learning: theory and algorithms","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.15646","last_updated":"2025-01-26T19:11:57Z","snapshot_observed_at":"2026-08-14T12:46:39.320894Z","submitted_at":"2025-01-26T19:11:57Z","title":"Mathematical analysis of the gradients in deep learning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T14:10:55.368199Z"},"links":{"cited_paper":"/paper/1912.08957","citing_paper":"/paper/2501.15646"},"observation_digest":"sha256:75ee7cc90eed4d74daa0954853de13f5584f8776113adf61b84721a8fda8ecbf","observation_id":"26fff830-1fc2-4193-a377-d46ca9e8f0c2","resolution":{"observed_at":"2026-08-10T14:10:55.368199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.08957","last_updated":"2019-12-19T00:23:18Z","snapshot_observed_at":"2026-08-05T19:03:39.733993Z","submitted_at":"2019-12-19T00:23:18Z","title":"Optimization for deep learning: theory and algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.08957","snapshot_observed_at":"2026-08-07T22:00:38.463850Z","title":null,"venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2502.09319","last_updated":"2025-02-13T13:33:45Z","snapshot_observed_at":"2026-08-14T22:56:40.282180Z","submitted_at":"2025-02-13T13:33:45Z","title":"Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T22:00:38.463850Z"},"links":{"cited_paper":"/paper/1912.08957","citing_paper":"/paper/2502.09319"},"observation_digest":"sha256:bc20ea8f275c32ad552c1ce1f5bd2e4308eb802b276851c06cd540f0d05b19c2","observation_id":"78d20b1f-17a6-45ad-9640-859b7bedfddf","resolution":{"observed_at":"2026-08-07T22:00:38.463850Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.08957","last_updated":"2019-12-19T00:23:18Z","snapshot_observed_at":"2026-08-05T19:03:39.733993Z","submitted_at":"2019-12-19T00:23:18Z","title":"Optimization for deep learning: theory and algorithms","version":1},"cited_work":{"arxiv_id":"1912.08957","doi":null,"metadata_source":"pith","pith_arxiv_id":"1912.08957","snapshot_observed_at":"2026-08-07T10:43:44.794782Z","title":"Optimization for deep learning: theory and algorithms","venue":"cs.LG","work_id":"e43d14d1-d979-47c5-aace-27070e316ccf","year":2019},"citing_paper":{"arxiv_id":"2506.04613","last_updated":"2025-06-13T15:43:02Z","snapshot_observed_at":"2026-08-11T17:34:58.303541Z","submitted_at":"2025-06-05T04:10:52Z","title":"DeePoly: A High-Order Accuracy Scientific Machine Learning Framework for Function Approximation and Solving PDEs","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T10:43:43.996289Z"},"links":{"cited_paper":"/paper/1912.08957","citing_paper":"/paper/2506.04613"},"observation_digest":"sha256:224071fb5b38e8f43659a8f649c9083da993c3ae247b56380a20923919d82846","observation_id":"09673eaf-1bd1-4f24-9fed-59568c47a922","resolution":{"observed_at":"2026-08-07T10:43:44.851511Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.08957","last_updated":"2019-12-19T00:23:18Z","snapshot_observed_at":"2026-08-05T19:03:39.733993Z","submitted_at":"2019-12-19T00:23:18Z","title":"Optimization for deep learning: theory and algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.08957","snapshot_observed_at":"2026-08-15T14:21:15.022280Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.11479","last_updated":"2026-08-11T22:43:50Z","snapshot_observed_at":"2026-08-15T15:10:22.608532Z","submitted_at":"2026-08-11T22:43:50Z","title":"Convergence Guarantees of Gradient Descent for Neural Networks via Generalized Lipschitz Smoothness","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T14:21:15.022280Z"},"links":{"cited_paper":"/paper/1912.08957","citing_paper":"/paper/2608.11479"},"observation_digest":"sha256:c19182a8534f527a46f01dbe236a08887d43ffe3c67b12636210f9bccd0cf51a","observation_id":"6755e76f-2d0b-404a-8fe5-51aa1dc66a6b","resolution":{"observed_at":"2026-08-15T14:21:15.022280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1912.08957/citation-record","integrity":"/paper/1912.08957/integrity","json":"/paper/1912.08957/citation-record.json","paper":"/paper/1912.08957"},"outbound":[],"paper":{"arxiv_id":"1912.08957","last_updated":"2019-12-19T00:23:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T19:03:39.733993Z","submitted_at":"2019-12-19T00:23:18Z","title":"Optimization for deep learning: theory and algorithms"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1912.08957."}