{"as_of":"2026-08-22T01:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:61576363a0a8d1fa79cbde22a524857d4f63e5665bc8c8115f3ba331a4c75526","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T00:19:06.654629Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2602.11557/citation-record","integrity":"/paper/2602.11557/integrity","json":"/paper/2602.11557/citation-record.json","paper":"/paper/2602.11557"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:19:05.953554Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:05.953554Z"},"links":{"citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:44c58ef6522d7ee1ce95a90e49c8aae9a8254c545c217890d4a0332d52f16789","observation_id":"544b21a7-3484-4651-ba80-48e5ecd12f74","resolution":{"observed_at":"2026-08-03T00:19:05.953554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:19:05.735241Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:05.735241Z"},"links":{"citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:015f00681b222632415f9a1d50d9f880ce8ee8a82ed92875262cb50162af75df","observation_id":"6e37de04-10d4-40e0-b62e-c9f83d498947","resolution":{"observed_at":"2026-08-03T00:19:05.735241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:19:06.122583Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:06.122583Z"},"links":{"citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:862cc954abd3c530b8a4c2dd96016b6a907b1c836f26b816135ba9c6057b9760","observation_id":"09573839-9346-4066-a0ab-6a64f0dafa4e","resolution":{"observed_at":"2026-08-03T00:19:06.122583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:19:05.827367Z","title":"20 •Case II: Entry-wise p-norms.Using the consistency of vector and matrix norms: ∥vv⊤∥=∥v∥ 2 p ≤(∥∆∥∥x∥ ∗)2 ≤R 2∥∆∥2","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:05.827367Z"},"links":{"citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:629620208f74ee49c448ff02eeed1b7bc7b539aab5dd672e1a7b20cc26c653d3","observation_id":"ade1eb50-cfef-4266-947c-e56e9e640c8d","resolution":{"observed_at":"2026-08-03T00:19:05.827367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:19:06.043765Z","title":"Since t1 is a constant independent of n (determined only by ρ and curvature), for large n, the LHS is dominated by the sum up to t2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:06.043765Z"},"links":{"citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:18a46df237250b15ba89930cb09ccc82c4e63e053c1607a074155d7d72a6dd94","observation_id":"59d5fd22-cabd-4cd3-8f97-448430b04710","resolution":{"observed_at":"2026-08-03T00:19:06.043765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:19:06.185300Z","title":"Let Ss = Ps−1 τ=t 2 ητ","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:06.185300Z"},"links":{"citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:2d064ad70348555ae45b09a501f72b7f5711eea431dd20004892d3dbb89ceb1f","observation_id":"c63a7a71-f76e-4b18-a6f3-23e6efc7a166","resolution":{"observed_at":"2026-08-03T00:19:06.185300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:19:06.250556Z","title":"The contribu- tion to the sum is: t1,polyX s=0 ηs =O (ξ1/a)1−a =O ξ 1 a −1 .(Fora= 1 : logξ)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:06.250556Z"},"links":{"citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:a96aac099c3446459578f292899126405dcfeeff03676fb550787abbb2ccdc92","observation_id":"2b55e46b-f8b9-438c-89c9-6313ce4f7aa7","resolution":{"observed_at":"2026-08-03T00:19:06.250556Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:19:06.305190Z","title":"The contribution to the sum is: t1,expX s=0 ηs = Θ (log(1/β1))a−1 .(Fora= 1 : log( 1 log(1/β1) ))","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:06.305190Z"},"links":{"citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:706eb913b34dd548821d480a6a8809e77faa272bfb30035c156de2abf304428d","observation_id":"3c481eee-c4b2-49d8-8096-a378fb6765cd","resolution":{"observed_at":"2026-08-03T00:19:06.305190Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:19:06.393864Z","title":"The order of t0 is given in Eq","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:06.393864Z"},"links":{"citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:0ff900c8f2d84ce8de468019221e0b11c7e9d71364754e0ae629fdca7741e421","observation_id":"a01d3777-c756-4bc3-bd08-cbca11b03cea","resolution":{"observed_at":"2026-08-03T00:19:06.393864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:19:06.485493Z","title":"Since 1 − 1/a <0, the function y1−1/a logy is bounded on [1 ,∞ ), and hence there exists a constant Ca >0 such that L−1 log(1/L)≤C a L−1/a,∀L∈(0,1]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:06.485493Z"},"links":{"citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:88c93bc18a24609d593a5c2312aa1a1f7744a688fe441022c81184da283acd6b","observation_id":"e9f37ca2-e709-4136-a693-5ae5a4a538db","resolution":{"observed_at":"2026-08-03T00:19:06.485493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:19:06.574661Z","title":"Then, the accumulated error in epochris bounded by: ∥Er∥F ≤ nX k=1 |ηrn+k−1 −η rn|∥Msign σr(k)∥F ≤n· can (rn)a+1 CM = caCM n2 (rn)a+1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:06.574661Z"},"links":{"citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:89c920ef83e001384cfc6769f0b646d99f66095e205b141b98285fb8ec9b32d3","observation_id":"2fec5291-c55f-43b0-8bdf-d2050ece7131","resolution":{"observed_at":"2026-08-03T00:19:06.574661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:19:06.654629Z","title":"61 Proof","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:06.654629Z"},"links":{"citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:0ca0407cebfb26b0757c0be14f4962c199b861344b6f51000fdb68f6c8114693","observation_id":"45361c72-a9ea-47a8-bcb2-65e5780b8ba2","resolution":{"observed_at":"2026-08-03T00:19:06.654629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16982","last_updated":"2025-02-24T09:12:29Z","snapshot_observed_at":"2026-08-16T22:48:15.725816Z","submitted_at":"2025-02-24T09:12:29Z","title":"Muon is Scalable for LLM Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16982","snapshot_observed_at":"2026-08-03T00:19:05.635066Z","title":"Implicit bias of gradient descent for two-layer relu and leaky relu networks on nearly-orthogonal data.Advances in Neural Information Processing Systems, 36:30167–30221, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:05.635066Z"},"links":{"cited_paper":"/paper/2502.16982","citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:c787d4646e4f9dc341853a528a423fc9a4053621ccca0ca927d7a15c2b3f9169","observation_id":"de8bbbba-21aa-46eb-9ad5-cb83fd061767","resolution":{"observed_at":"2026-08-03T00:19:05.635066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00079","last_updated":"2024-06-16T10:29:01Z","snapshot_observed_at":"2026-08-19T23:06:18.671139Z","submitted_at":"2023-08-31T18:33:05Z","title":"On the Implicit Bias of Adam","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.00079","snapshot_observed_at":"2026-08-03T00:19:05.549126Z","title":"The implicit bias of batch normalization in linear models and two-layer linear convolutional neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T00:19:05.549126Z"},"links":{"cited_paper":"/paper/2309.00079","citing_paper":"/paper/2602.11557"},"observation_digest":"sha256:3c1a5d3de861d74ff44b6711044d5ac9cdd43fbcdb2ce07d038c0a8100c5cec3","observation_id":"514e274e-7f32-4e7e-8f2f-7b8658b0027b","resolution":{"observed_at":"2026-08-03T00:19:05.549126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.11557","last_updated":"2026-06-16T11:03:18Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T22:49:30.130132Z","submitted_at":"2026-02-12T04:25:38Z","title":"The Implicit Bias of Steepest Descent with Mini-batch Stochastic Gradient"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":14},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2602.11557."}