{"as_of":"2026-08-06T20:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:95db3cdbf06c5952d558d88e0cb33caeb5ead3e163dc86ff5dc157fff572a9b2","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-06T06:34:29.942622+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-06-27T04:33:10.554853Z","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-07-03T17:08:43.656388Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1901.00451","last_updated":"2019-01-02T17:09:45Z","snapshot_observed_at":"2026-07-06T07:24:33.774552Z","submitted_at":"2019-01-02T17:09:45Z","title":"SGD Converges to Global Minimum in Deep Learning via Star-convex Path","version":1},"cited_work":{"arxiv_id":"1901.00451","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.00451","snapshot_observed_at":"2026-07-03T17:08:43.656388Z","title":"SGD Converges to Global Minimum in Deep Learning via Star-convex Path","venue":"cs.LG","work_id":"6319804a-fee6-4ca8-a32a-fd48e1c21166","year":2019},"citing_paper":{"arxiv_id":"2503.02129","last_updated":"2026-04-08T09:14:02Z","snapshot_observed_at":"2026-08-02T17:02:46.297669Z","submitted_at":"2025-03-03T23:34:12Z","title":"Path Regularization: A Near-Complete and Optimal Nonasymptotic Generalization Theory for Multilayer Neural Networks and Double Descent Phenomenon","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-23T01:03:39.897679Z"},"links":{"cited_paper":"/paper/1901.00451","citing_paper":"/paper/2503.02129"},"observation_digest":"sha256:106774e135f8d8d2abde80928f3caa11cb542221245552b3c7b3a90aba7806ce","observation_id":"23fc618c-3eb2-4735-88f4-68569a925af2","resolution":{"observed_at":"2026-05-23T01:05:16.097192Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.00451","last_updated":"2019-01-02T17:09:45Z","snapshot_observed_at":"2026-07-06T07:24:33.774552Z","submitted_at":"2019-01-02T17:09:45Z","title":"SGD Converges to Global Minimum in Deep Learning via Star-convex Path","version":1},"cited_work":{"arxiv_id":"1901.00451","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.00451","snapshot_observed_at":"2026-07-03T17:08:43.656388Z","title":"SGD Converges to Global Minimum in Deep Learning via Star-convex Path","venue":"cs.LG","work_id":"6319804a-fee6-4ca8-a32a-fd48e1c21166","year":2019},"citing_paper":{"arxiv_id":"2505.23737","last_updated":"2026-07-28T01:40:23Z","snapshot_observed_at":"2026-07-31T23:54:11.554863Z","submitted_at":"2025-05-29T17:58:01Z","title":"On the Convergence Analysis of Muon","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-19T13:19:37.035526Z"},"links":{"cited_paper":"/paper/1901.00451","citing_paper":"/paper/2505.23737"},"observation_digest":"sha256:0fbb331bac6d83ce68f00196edc046108b3482f5731abf2795abdb62394514a6","observation_id":"d8414747-005b-4e89-85b0-5e966fccb4c2","resolution":{"observed_at":"2026-05-19T13:22:19.100758Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.00451","last_updated":"2019-01-02T17:09:45Z","snapshot_observed_at":"2026-07-06T07:24:33.774552Z","submitted_at":"2019-01-02T17:09:45Z","title":"SGD Converges to Global Minimum in Deep Learning via Star-convex Path","version":1},"cited_work":{"arxiv_id":"1901.00451","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.00451","snapshot_observed_at":"2026-07-03T17:08:43.656388Z","title":"SGD Converges to Global Minimum in Deep Learning via Star-convex Path","venue":"cs.LG","work_id":"6319804a-fee6-4ca8-a32a-fd48e1c21166","year":2019},"citing_paper":{"arxiv_id":"2604.14017","last_updated":"2026-04-15T15:57:34Z","snapshot_observed_at":"2026-08-02T09:54:16.481199Z","submitted_at":"2026-04-15T15:57:34Z","title":"Stochastic Trust-Region Methods for Over-parameterized Models","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-10T12:32:32.628692Z"},"links":{"cited_paper":"/paper/1901.00451","citing_paper":"/paper/2604.14017"},"observation_digest":"sha256:35b7513ca76c9667aaefe25738676b59b3e9d4a04764958d2b14d7c1ad325eb5","observation_id":"0e0584b0-1d76-4bdb-81f9-1890ccd448a9","resolution":{"observed_at":"2026-05-11T11:51:00.897853Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.00451","last_updated":"2019-01-02T17:09:45Z","snapshot_observed_at":"2026-07-06T07:24:33.774552Z","submitted_at":"2019-01-02T17:09:45Z","title":"SGD Converges to Global Minimum in Deep Learning via Star-convex Path","version":1},"cited_work":{"arxiv_id":"1901.00451","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.00451","snapshot_observed_at":"2026-07-03T17:08:43.656388Z","title":"SGD Converges to Global Minimum in Deep Learning via Star-convex Path","venue":"cs.LG","work_id":"6319804a-fee6-4ca8-a32a-fd48e1c21166","year":2019},"citing_paper":{"arxiv_id":"2605.15522","last_updated":"2026-05-26T17:45:23Z","snapshot_observed_at":"2026-08-02T14:53:38.254198Z","submitted_at":"2026-05-15T01:43:22Z","title":"Stochastic Non-Smooth Convex Optimization with Unbounded Gradients","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-19T15:17:01.028675Z"},"links":{"cited_paper":"/paper/1901.00451","citing_paper":"/paper/2605.15522"},"observation_digest":"sha256:00d63bda69450a5ac039e9c760b3d311c07031baa0f1be8fc03742cac4403f1c","observation_id":"12a50de9-a4b4-4d02-8195-77d554d981aa","resolution":{"observed_at":"2026-05-19T15:17:39.232168Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.00451","last_updated":"2019-01-02T17:09:45Z","snapshot_observed_at":"2026-07-06T07:24:33.774552Z","submitted_at":"2019-01-02T17:09:45Z","title":"SGD Converges to Global Minimum in Deep Learning via Star-convex Path","version":1},"cited_work":{"arxiv_id":"1901.00451","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.00451","snapshot_observed_at":"2026-07-03T17:08:43.656388Z","title":"SGD Converges to Global Minimum in Deep Learning via Star-convex Path","venue":"cs.LG","work_id":"6319804a-fee6-4ca8-a32a-fd48e1c21166","year":2019},"citing_paper":{"arxiv_id":"2606.14970","last_updated":"2026-06-22T08:40:27Z","snapshot_observed_at":"2026-07-06T23:52:28.557859Z","submitted_at":"2026-06-12T21:46:54Z","title":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","version":2},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-06-27T04:33:10.554853Z"},"links":{"cited_paper":"/paper/1901.00451","citing_paper":"/paper/2606.14970"},"observation_digest":"sha256:f1ab3a47fbfbc51a8d8fc65eca8e29c33083d91cbc26aad7e3fa6e5bf65d118d","observation_id":"fa4142f4-1264-4abf-b1dc-27d5133953ce","resolution":{"observed_at":"2026-07-03T17:08:43.657832Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1901.00451/citation-record","integrity":"/paper/1901.00451/integrity","json":"/paper/1901.00451/citation-record.json","paper":"/paper/1901.00451"},"outbound":[],"paper":{"arxiv_id":"1901.00451","last_updated":"2019-01-02T17:09:45Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:24:33.774552Z","submitted_at":"2019-01-02T17:09:45Z","title":"SGD Converges to Global Minimum in Deep Learning via Star-convex Path"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1901.00451."}