{"as_of":"2026-08-03T21:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:16ed27bca1e9e5e7e197bedc843952a22f87366dc917d8d12a31a2fc662da734","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-17T23:17:34.914457Z","state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-03T06:30:56.289259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T08:04:06.432613Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2511.07767","snapshot_observed_at":"2026-07-14T08:04:06.432613Z","title":"arXiv preprint arXiv:2511.07767 , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10959","last_updated":"2026-07-12T23:24:42Z","snapshot_observed_at":"2026-08-03T13:16:14.672928Z","submitted_at":"2026-07-12T23:24:42Z","title":"WSqD: A Horizon-Free Learning Rate Schedule for Large Model Training","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-14T08:04:06.432613Z"},"links":{"cited_paper":"/paper/2511.07767","citing_paper":"/paper/2607.10959"},"observation_digest":"sha256:149f9bbb1a04f267243ce743db2118a4cfdc27ad9143fdf325c220a3fb79dcb2","observation_id":"59937c91-802e-4155-afeb-3c5d252efd55","resolution":{"observed_at":"2026-07-14T08:04:06.432613Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2511.07767/citation-record","integrity":"/paper/2511.07767/integrity","json":"/paper/2511.07767/citation-record.json","paper":"/paper/2511.07767"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.06743","last_updated":"2025-08-08T22:54:35Z","snapshot_observed_at":"2026-08-03T18:12:54.446823Z","submitted_at":"2025-08-08T22:54:35Z","title":"Analysis of Schedule-Free Nonconvex Optimization","version":1},"cited_work":{"arxiv_id":"2508.06743","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.06743","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Analysis of schedule-free nonconvex optimization.arXiv preprint arXiv:2508.06743","venue":null,"work_id":"4b7d6dae-75b1-4b63-ab73-bb1fef8d6149","year":null},"citing_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-17T23:17:34.914457Z"},"links":{"cited_paper":"/paper/2508.06743","citing_paper":"/paper/2511.07767"},"observation_digest":"sha256:296a7e1b666543bb6d2a8d497ff8de5f0288c272828ce4ab14b3be5cd83e6e97","observation_id":"0cb2a3a8-a1f6-4130-a392-df937fbdb7af","resolution":{"observed_at":"2026-05-17T23:20:27.670616Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.07831","last_updated":"2024-10-29T22:57:44Z","snapshot_observed_at":"2026-07-06T16:31:29.379540Z","submitted_at":"2023-10-11T19:16:35Z","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","version":2},"cited_work":{"arxiv_id":"2310.07831","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.07831","snapshot_observed_at":"2026-06-30T07:14:21.713475Z","title":"arXiv preprint arXiv:2310.07831 , year=","venue":null,"work_id":"54cda9cb-6f26-4516-a2ee-7145edbfbab6","year":2023},"citing_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-17T23:17:34.914457Z"},"links":{"cited_paper":"/paper/2310.07831","citing_paper":"/paper/2511.07767"},"observation_digest":"sha256:c5ae8081677ab1f62dc141da74359f8138438786721f2226a828bbfdc9c0eb25","observation_id":"40131a86-20e5-4a41-9aeb-9c4b91d16687","resolution":{"observed_at":"2026-05-17T23:20:27.656986Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.00313","last_updated":"2022-08-02T17:48:25Z","snapshot_observed_at":"2026-07-06T07:49:44.506891Z","submitted_at":"2019-05-01T13:47:40Z","title":"Revisiting the Polyak step size","version":2},"cited_work":{"arxiv_id":"1905.00313","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.00313","snapshot_observed_at":"2026-07-04T06:59:37.573960Z","title":"Hazan and S","venue":null,"work_id":"1fafe5d3-69fe-46c5-b51a-9dfe1038d907","year":1905},"citing_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-17T23:17:34.914457Z"},"links":{"cited_paper":"/paper/1905.00313","citing_paper":"/paper/2511.07767"},"observation_digest":"sha256:4070826ecf1d33461c3c4d9daa44d8779ac56f0c8b9051b0302a41f220014b57","observation_id":"ad572987-0329-47f2-9c3a-459330515b2e","resolution":{"observed_at":"2026-05-17T23:20:27.652905Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":"1412.6980","doi":"10.1002/mrm.28086","metadata_source":"pith","pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Adam: A Method for Stochastic Optimization","venue":"cs.LG","work_id":"1910796d-9b52-4683-bf5c-de9632c1028b","year":2014},"citing_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-17T23:17:34.914457Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2511.07767"},"observation_digest":"sha256:092060042f15868a60263d9396145f233c2067bb864640f02226282fa3e5c763","observation_id":"83f267ac-c01c-45d5-a2c6-48429b8b73df","resolution":{"observed_at":"2026-05-17T23:20:27.661283Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10542","last_updated":"2021-03-22T14:53:59Z","snapshot_observed_at":"2026-07-06T08:59:44.955793Z","submitted_at":"2020-02-24T20:57:23Z","title":"Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergence","version":3},"cited_work":{"arxiv_id":"2002.10542","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.10542","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stochastic polyak step- size for sgd: An adaptive learning rate for fast convergence.arXiv:2002.10542","venue":null,"work_id":"04199f9c-1a48-4827-ba10-47d4683b0e85","year":2002},"citing_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-17T23:17:34.914457Z"},"links":{"cited_paper":"/paper/2002.10542","citing_paper":"/paper/2511.07767"},"observation_digest":"sha256:1491e31a2d185ce3a3d9f5d4d276b05e6241302ccd9a71ef16461365468fd251","observation_id":"70482cb0-1ab9-484b-bb32-05ad4accc180","resolution":{"observed_at":"2026-05-17T23:20:27.665986Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04142","last_updated":"2025-03-04T03:36:14Z","snapshot_observed_at":"2026-08-02T20:31:02.098203Z","submitted_at":"2024-06-06T15:08:06Z","title":"Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance","version":2},"cited_work":{"arxiv_id":"2406.04142","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.04142","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Oikonomou and N","venue":null,"work_id":"33bba44c-d0cd-46d6-8bcd-fb46ee84818d","year":2024},"citing_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-17T23:17:34.914457Z"},"links":{"cited_paper":"/paper/2406.04142","citing_paper":"/paper/2511.07767"},"observation_digest":"sha256:3aa6c7ac08612d8dc72e70ca86d8c318993684865e2c72140e9f7349a0672129","observation_id":"0158fb66-6af1-48d3-9c8e-ce2711480af9","resolution":{"observed_at":"2026-05-17T23:20:27.648172Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":"2 1.2 Contributions and Background","venue":null,"work_id":"55615e4b-740e-4617-95ad-1c20e6a10397","year":2024},"citing_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-17T23:17:34.914457Z"},"links":{"citing_paper":"/paper/2511.07767"},"observation_digest":"sha256:d6a48ca701f6cff7b813374b56d148bf2ee83eb9cca0b1b27cf5788fceb60bcd","observation_id":"14cf1a28-79f0-4f87-9f8a-26e502d0683b","resolution":{"observed_at":"2026-05-17T23:20:28.461794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":"TX t=1 wt⟨gt,z t −x ⋆⟩ # =E","venue":null,"work_id":"f937586d-057e-4133-95d4-d11c340b080c","year":2024},"citing_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-17T23:17:34.914457Z"},"links":{"citing_paper":"/paper/2511.07767"},"observation_digest":"sha256:016ad915e89947864f6e96c1d8e522e44413ac188d36fab1759d4172c47961f4","observation_id":"701e86da-37f1-4132-808b-97587a2599df","resolution":{"observed_at":"2026-05-17T23:20:28.468837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":"As mentioned in Section 4, this is to avoid the complication of writing custom BatchNorm code to approximate batch statistics of thexsequence ofSchedule-free","venue":null,"work_id":"5dcba638-f6e1-4f1f-9405-b823ced80e81","year":2024},"citing_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-17T23:17:34.914457Z"},"links":{"citing_paper":"/paper/2511.07767"},"observation_digest":"sha256:b9c15f93d868326c7445567d88377f5b2e5d34c15f80e11293c99c9326b4be22","observation_id":"588aee9c-543f-4d5b-8139-33f704d79661","resolution":{"observed_at":"2026-05-17T23:20:28.465447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"445ea98f-db02-43b6-b8ae-8589b3a389b9","year":2022},"citing_paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-17T23:17:34.914457Z"},"links":{"citing_paper":"/paper/2511.07767"},"observation_digest":"sha256:cf1d666622ad766045c14660551d6a20699a40d39597187fa1eb308ea2b49e49","observation_id":"f9d6f0b2-736e-4c59-9381-6cf2af32e7c3","resolution":{"observed_at":"2026-05-17T23:20:28.458597Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2511.07767","last_updated":"2026-05-12T15:05:44Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T18:37:31.673813Z","submitted_at":"2025-11-11T02:33:24Z","title":"Taking the Road Less Scheduled with Adaptive Polyak Steps"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":1,"verified_exact":4,"verified_fuzzy":3},"total_outbound_references":10},"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-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"thesis":"As of 3 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 1 inbound Pith citation observation for arXiv:2511.07767."}