{"as_of":"2026-08-13T22:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2ea6431905557bf30a8382f7ec76fb348df67f5ddc07e6303202ce9456ea6dfd","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T18:02:14.784239Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2412.08424/citation-record","integrity":"/paper/2412.08424/integrity","json":"/paper/2412.08424/citation-record.json","paper":"/paper/2412.08424"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:14.503359Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.503359Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:ba726ed630128a859a4bffcb47a959fa152a1a71e1b47eb29bd38039d6708472","observation_id":"81162ec5-2fd0-41ad-8440-e541aa3b351b","resolution":{"observed_at":"2026-08-11T18:02:14.503359Z","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-11T18:02:14.516317Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.516317Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:6ffb68ca1d89cdab9c96ea98f4c50247c03bb1d3611f0fc5ff11dcaf7f346b3e","observation_id":"b92f4d71-89ba-4ec4-9c38-39fe5a2d0798","resolution":{"observed_at":"2026-08-11T18:02:14.516317Z","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-11T18:02:14.527268Z","title":"T.; Suarez, F.; and Zhang, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.527268Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:0a13036ae9e1531ddb0a7177978de3e996c596d2b87414657e84b195be8faecc","observation_id":"4a17c42a-ab5e-4a53-80a2-8d60d1287c7b","resolution":{"observed_at":"2026-08-11T18:02:14.527268Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.616742Z","title":null,"venue":null,"work_id":"925b0a6f-3b52-4994-a85e-c45663ea7d1e","year":2022},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.532436Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:0f2d7975413b6e471765c5628b7766e5d793946b08372db7c4e74fa662f50d4d","observation_id":"c3e153b9-0c7c-4b20-861b-0c4529a95715","resolution":{"observed_at":"2026-08-11T18:02:15.624131Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:14.541831Z","title":"M.; and Nasrabadi, N","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.541831Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:56d34df54347bf3951389a623c3de0723cec8834f19421c5410698cfe00e3c67","observation_id":"ef4fd7e4-a22e-4723-90a8-c74c3d160c68","resolution":{"observed_at":"2026-08-11T18:02:14.541831Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.578788Z","title":null,"venue":null,"work_id":"e4d221ef-2540-45ba-a408-8a99074f89b6","year":1962},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.548817Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:2ca71c566e0f391d658b10c143ebccc8617b54288383f26b84df0f11c2e88ab3","observation_id":"4914d375-320f-4b38-915c-5f41a4d22109","resolution":{"observed_at":"2026-08-11T18:02:15.583792Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-11T18:02:14.555645Z","title":"B.; Mann, B.; Ryder, N.; Subbiah, M.; Kaplan, J.; Dhariwal, P.; Neelakantan, A.; Shyam, P.; Sastry, G.; Askell, A.; et al","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.555645Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:a72575a59ad3b1f5936e9e7a825458d07c766777f3caa9ca2f1656423b5931cf","observation_id":"5b1b7503-b06e-4166-8e23-0f8482e8efbe","resolution":{"observed_at":"2026-08-11T18:02:14.555645Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.560550Z","title":"C.; Hinder, O.; and Sidford, A","venue":null,"work_id":"874d3039-466c-46bb-bccc-81ca6ac31644","year":2020},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.562104Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:59118a3c3cccad7c3c9a36369c183371618ba6bed10e57a1527bdc54272f5bfe","observation_id":"142bc0db-e00d-4b01-91db-115e3a98984a","resolution":{"observed_at":"2026-08-11T18:02:15.566150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.04172","last_updated":"2023-07-26T10:48:54Z","snapshot_observed_at":"2026-08-13T22:04:42.351596Z","submitted_at":"2022-06-08T21:32:50Z","title":"Beyond the Edge of Stability via Two-step Gradient Updates","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.04172","snapshot_observed_at":"2026-08-11T18:02:14.584250Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.584250Z"},"links":{"cited_paper":"/paper/2206.04172","citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:5b63d5be846d502efaa5dd6a5521ccc6952789f0cf4102e170117d694143a9a9","observation_id":"dfd917ce-77bc-4c91-aec9-2b417c2e1f4f","resolution":{"observed_at":"2026-08-11T18:02:14.584250Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.544444Z","title":"Z.; and Talwalkar, A","venue":null,"work_id":"14cb6bc2-4286-4b84-87cf-9c0dcec7724d","year":2021},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.592539Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:eff597bc89629e36b818a6366fa5ecdf4f9e19078896a384eae2493ad73219f0","observation_id":"aacde653-2fd1-42a3-9451-935b659cc5b7","resolution":{"observed_at":"2026-08-11T18:02:15.550687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:14.600947Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.600947Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:66debed7b59c95c8371489aa2958a6bece2e074dfab0a8c58ea466f0c9aff741","observation_id":"b50ed7a0-e8ce-4315-8636-e56905b3ed62","resolution":{"observed_at":"2026-08-11T18:02:14.600947Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.511991Z","title":null,"venue":null,"work_id":"602dc57d-44ba-4e93-96ab-a90ddc5842a8","year":2023},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.608778Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:42e5012b59770ae157177dfc493b8de250329253787e03429d5f1f810c625db4","observation_id":"a79a305b-c511-4824-b041-04367ccb5d89","resolution":{"observed_at":"2026-08-11T18:02:15.518935Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.492540Z","title":null,"venue":null,"work_id":"2ae3990a-a5d3-427a-a069-860d73d022a2","year":2001},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.613114Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:a920646755c05be21494cda3914c7e28388299aa30208d740ec900cce34d35e0","observation_id":"6aaff382-1227-4ddc-8468-69a50f7fc8e7","resolution":{"observed_at":"2026-08-11T18:02:15.497058Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.473200Z","title":null,"venue":null,"work_id":"0f857b44-1bb9-40f0-847e-0380340730d5","year":2023},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.618618Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:cfd69dcceac7e7ba24cfcc16335ffff8de524686bb60c389fc93331390b2ea43","observation_id":"afbb8650-d2ef-4ce4-8065-2fc8fb35a535","resolution":{"observed_at":"2026-08-11T18:02:15.479436Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:14.626247Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.626247Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:a465501121390ba0e79ac0a1144aa26aca7600fe8e313ee9a9de89021de0dc5f","observation_id":"734104b4-583a-477d-bb1c-38ab209d3671","resolution":{"observed_at":"2026-08-11T18:02:14.626247Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.07300","last_updated":"2019-06-08T13:57:05Z","snapshot_observed_at":"2026-08-10T12:34:19.641462Z","submitted_at":"2018-03-20T08:47:27Z","title":"Risk and parameter convergence of logistic regression","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.07300","snapshot_observed_at":"2026-08-11T18:02:14.630695Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.630695Z"},"links":{"cited_paper":"/paper/1803.07300","citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:949b39213f4775ad1393168e1d8671dfa23f79bf7b3fd6af5d31dd504f7bb845","observation_id":"e579529e-bad6-4889-985c-46fba832b1be","resolution":{"observed_at":"2026-08-11T18:02:14.630695Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.432575Z","title":null,"venue":null,"work_id":"21b9c6fb-e97d-4edd-8a5d-8a2ff1354dbd","year":2013},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.637314Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:b32db2d7d44871513f83c530ee3d42d1dd55eac3638108871b8695f9bf1b1dbe","observation_id":"2dc22834-afa5-483c-b32a-144d874ee3ad","resolution":{"observed_at":"2026-08-11T18:02:15.439494Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.414380Z","title":"S.; Soudry, D.; and Carmon, Y","venue":null,"work_id":"be80a8cd-4fd5-4a1e-859d-ff5715ccc20b","year":2023},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.643131Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:bdec390131372bd685f5e1e64e70adffe5f82834b205618dd37a651de543ba91","observation_id":"a0434a85-73b0-4aa3-84dd-5708e1d1e7bc","resolution":{"observed_at":"2026-08-11T18:02:15.420877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.394654Z","title":null,"venue":null,"work_id":"17645181-61f2-4bde-91ff-9f0f55d0b503","year":2009},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.653522Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:044608160a3fd9a13eea44fdbdfd9915a5c3b214169aa36dd3098b3b8e8a3c9a","observation_id":"f1838dec-fc62-4242-9bff-834eba1b8fd3","resolution":{"observed_at":"2026-08-11T18:02:15.400647Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.374693Z","title":null,"venue":null,"work_id":"16e0baf9-4364-4f08-a8c8-616e54110cdd","year":2010},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.662816Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:b44337e1c3a9ca501f195f4b77fcf5eda2a3708c4dc3b826d1d31a2eeb993d9a","observation_id":"aeeecd92-fe14-4392-94fc-7c90cd143358","resolution":{"observed_at":"2026-08-11T18:02:15.379705Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.02218","last_updated":"2020-03-04T17:52:48Z","snapshot_observed_at":"2026-08-08T21:43:40.840815Z","submitted_at":"2020-03-04T17:52:48Z","title":"The large learning rate phase of deep learning: the catapult mechanism","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.02218","snapshot_observed_at":"2026-08-11T18:02:14.668108Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.668108Z"},"links":{"cited_paper":"/paper/2003.02218","citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:9e04ce00c041887486fdf381c9fb86fa30b341667c4c104489924087e2e275e7","observation_id":"d52c1988-c408-4d4a-8e64-07b5417d9eaa","resolution":{"observed_at":"2026-08-11T18:02:14.668108Z","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-11T18:02:14.676355Z","title":"C.; and Nocedal, J","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.676355Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:7fc0744f1c760d115d1a647f58310b46de22f74041a7052bc70802a73a132d10","observation_id":"82ae0e58-7537-49eb-a989-ca29fcd5b902","resolution":{"observed_at":"2026-08-11T18:02:14.676355Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.332212Z","title":null,"venue":null,"work_id":"375ecdd5-4d34-4927-97dc-af7d02cd5c5a","year":2022},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.683034Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:418da12f216b4ac82a9f814a80d6eefd539dba91c143d8c81e8ffa750f598317","observation_id":"148fbcc8-4cb2-4a7d-a61a-31c6e9afe5d5","resolution":{"observed_at":"2026-08-11T18:02:15.342484Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.11326","last_updated":"2022-06-22T15:59:21Z","snapshot_observed_at":"2026-08-13T15:57:00.440636Z","submitted_at":"2022-04-24T17:34:12Z","title":"Beyond the Quadratic Approximation: the Multiscale Structure of Neural Network Loss Landscapes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.11326","snapshot_observed_at":"2026-08-11T18:02:14.689511Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.689511Z"},"links":{"cited_paper":"/paper/2204.11326","citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:bea9786ad1267b7276acc42c38844556775a72bd0bac3de296921377f6b5621c","observation_id":"dd1d3d06-85ea-4a2d-8503-0eb99370ce27","resolution":{"observed_at":"2026-08-11T18:02:14.689511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.05033","last_updated":"2024-11-04T15:23:23Z","snapshot_observed_at":"2026-08-12T23:47:45.764680Z","submitted_at":"2024-06-07T15:53:06Z","title":"Gradient Descent on Logistic Regression with Non-Separable Data and Large Step Sizes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.05033","snapshot_observed_at":"2026-08-11T18:02:14.697546Z","title":"Y.; Orvieto, A.; Cao, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.697546Z"},"links":{"cited_paper":"/paper/2406.05033","citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:6db0c33d5b6ed84ed9045ebec2678116ab28e6780b3e57948ea32c9ba1e12038","observation_id":"18a4b269-26cf-474b-894c-b9185d607c31","resolution":{"observed_at":"2026-08-11T18:02:14.697546Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.299665Z","title":null,"venue":null,"work_id":"3eea06eb-b0fa-4527-9455-97013561f6c1","year":1983},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.711440Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:ff8c57d463599efa53caa847bfa524e22c1db0618f87b13562051e691d30b06d","observation_id":"f7177806-ee30-4017-ae64-1c53ae1e6cbe","resolution":{"observed_at":"2026-08-11T18:02:15.308481Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.280677Z","title":null,"venue":null,"work_id":"29bcff4c-b6a0-4402-b819-1179e0017293","year":2018},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.719466Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:b2d0a49a8dac4280792d7cc3ceaad2939cdf21d08aca3553469d27cdf0bbdf5d","observation_id":"c18016e4-f537-4646-afc4-42d45e0b9d50","resolution":{"observed_at":"2026-08-11T18:02:15.285962Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.259078Z","title":null,"venue":null,"work_id":"8e3aebaf-429e-43af-80e2-9ec7953f0d62","year":1962},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.725313Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:4dbb1cae1438a053923b667acf1015ea42f2fa40d60e4aa3b40f3623a79e2562","observation_id":"0c67d598-8f55-4609-8633-5b49ec77994d","resolution":{"observed_at":"2026-08-11T18:02:15.267693Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.230274Z","title":null,"venue":null,"work_id":"cfe3a831-49cf-4074-a6b1-2f4348ed8092","year":2024},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.731063Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:de537aa38a921b1371577ad4c806795a182535603bbb105cabe6444a16b05814","observation_id":"7215c4a9-e089-4f8a-b6ca-656e24867c09","resolution":{"observed_at":"2026-08-11T18:02:15.238456Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.179536Z","title":null,"venue":null,"work_id":"95cd5c2f-7faa-4772-a94e-fcf8e6d1cb91","year":1951},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.735577Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:262c07b10bd11675bbae8e7374c77a1a1a6f91873922f4f6319c97be834ee69b","observation_id":"da3bb608-e42f-4145-99f5-f078485e6e47","resolution":{"observed_at":"2026-08-11T18:02:15.186787Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.155123Z","title":null,"venue":null,"work_id":"df4a7d7a-cb49-46a3-8678-16c90738a088","year":2017},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.739998Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:7d981c53710dd3b3e088cddb647fe1d942915095f930b06d3e670dfa7aeb3a73","observation_id":"4bd65ef8-c9e7-4633-ae85-fc03cb83ca93","resolution":{"observed_at":"2026-08-11T18:02:15.161371Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.04204","last_updated":"2023-10-26T15:16:38Z","snapshot_observed_at":"2026-08-13T10:59:29.784750Z","submitted_at":"2023-07-09T15:16:45Z","title":"Trajectory Alignment: Understanding the Edge of Stability Phenomenon via Bifurcation Theory","version":2},"cited_work":{"arxiv_id":"2307.04204","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.04204","snapshot_observed_at":"2026-08-11T18:02:14.885399Z","title":"Trajectory Alignment: Understanding the Edge of Stability Phenomenon via Bifurcation Theory","venue":"cs.LG","work_id":"73e904be-4269-4a42-a210-e4f3ab01136c","year":2023},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.746290Z"},"links":{"cited_paper":"/paper/2307.04204","citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:ae91070cf35bc041d97af445dee80b18496a8fd1322f997bc82b209030d401dd","observation_id":"684fedf5-f126-4bf2-bd0e-cc9d81604991","resolution":{"observed_at":"2026-08-11T18:02:14.895923Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.130574Z","title":"S.; Gunasekar, S.; and Srebro, N","venue":null,"work_id":"44188d8a-a676-4c2e-bba9-665796a4d3bc","year":2018},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.754653Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:6982111a0df5e934f95febc9940d32cd55223912b6bb81a8753910a36aea9ad0","observation_id":"ab38217f-1ab0-44f7-a858-a531f6c1fe77","resolution":{"observed_at":"2026-08-11T18:02:15.135479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.107365Z","title":null,"venue":null,"work_id":"df68e416-247b-4a16-a129-90e4bdc2b328","year":2022},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.758820Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:4677feeb3e60576307f45e483581f78171ec501fd41c8958bbdfec5355d66466","observation_id":"2198e8bd-0114-4d28-8ac5-667fc09519fd","resolution":{"observed_at":"2026-08-11T18:02:15.113246Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.084494Z","title":"L.; Telgarsky, M.; and Yu, B","venue":null,"work_id":"7f798401-4899-40e1-b082-7e7b7966fb93","year":2024},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.763069Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:4c0af4f2fa111a9681434f2bea83d6e8868bcb3dbe9a7b62cb6a8375a9f0be2e","observation_id":"50791469-3b32-406a-b089-d5bc7a312e7f","resolution":{"observed_at":"2026-08-11T18:02:15.089390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T18:02:15.066962Z","title":null,"venue":null,"work_id":"7ab467dd-926a-40b3-b4c5-7ce283b4e33c","year":2024},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.770308Z"},"links":{"citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:b572f132a7d5e1a5f572a92f3243eadaa0b93084844be92dc069a23ec35cf121","observation_id":"18ce71b6-2ec0-495b-bead-9fc4bcc02210","resolution":{"observed_at":"2026-08-11T18:02:15.072910Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.07747","last_updated":"2017-09-15T21:29:49Z","snapshot_observed_at":"2026-08-13T15:13:33.081929Z","submitted_at":"2017-08-25T14:01:29Z","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.07747","snapshot_observed_at":"2026-08-11T18:02:14.778578Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.778578Z"},"links":{"cited_paper":"/paper/1708.07747","citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:221417bebfd9da3d9922515970ed51886ccf5daea61e903be0dc187fba043ca2","observation_id":"de4f00cf-82ec-4636-af3a-594080396db8","resolution":{"observed_at":"2026-08-11T18:02:14.778578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03294","last_updated":"2023-02-21T09:45:37Z","snapshot_observed_at":"2026-08-13T14:10:50.975192Z","submitted_at":"2022-10-07T02:57:05Z","title":"Understanding Edge-of-Stability Training Dynamics with a Minimalist Example","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03294","snapshot_observed_at":"2026-08-11T18:02:14.784239Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T18:02:14.784239Z"},"links":{"cited_paper":"/paper/2210.03294","citing_paper":"/paper/2412.08424"},"observation_digest":"sha256:114590478f0d6288611d7450e98fc753124dfd0b54922a346b55e7ad66bf91ad","observation_id":"35f5133a-53b5-48f7-bc20-3d5de36964ad","resolution":{"observed_at":"2026-08-11T18:02:14.784239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.08424","last_updated":"2024-12-11T14:43:39Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T21:51:37.924753Z","submitted_at":"2024-12-11T14:43:39Z","title":"From Logistic Regression to the Perceptron Algorithm: Exploring Gradient Descent with Large Step Sizes"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":38},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2412.08424."}