{"as_of":"2026-08-07T15:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:542207eb9c926d2af8df2d7010d68ca969f91cf88dad385a944980ca3c164823","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T03:30:54.259100Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2607.27383/citation-record","integrity":"/paper/2607.27383/integrity","json":"/paper/2607.27383/citation-record.json","paper":"/paper/2607.27383"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.18199","last_updated":"2024-10-30T17:51:28Z","snapshot_observed_at":"2026-08-04T20:53:21.315273Z","submitted_at":"2024-05-28T14:08:04Z","title":"Adam with model exponential moving average is effective for nonconvex optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.18199","snapshot_observed_at":"2026-08-04T03:30:54.186249Z","title":"Adam with model exponential moving average is effective for nonconvex optimization.arXiv preprint arXiv:2405.18199,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.186249Z"},"links":{"cited_paper":"/paper/2405.18199","citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:43873160d38917f747884f7fb1dd10f1ef3abc3c13398440671446057720fbb9","observation_id":"057fc1c3-65aa-48c1-b948-718d23632291","resolution":{"observed_at":"2026-08-04T03:30:54.186249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04443","last_updated":"2025-08-14T11:55:47Z","snapshot_observed_at":"2026-07-06T18:26:46.402024Z","submitted_at":"2024-06-06T18:49:10Z","title":"Clipping Improves Adam-Norm and AdaGrad-Norm when the Noise Is Heavy-Tailed","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04443","snapshot_observed_at":"2026-08-04T03:30:54.201487Z","title":"Clipping improves adam-norm and adagrad-norm when the noise is heavy-tailed.arXiv preprint arXiv:2406.04443,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.201487Z"},"links":{"cited_paper":"/paper/2406.04443","citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:5a17b705f367987984f48c1bfb79477df0f62db441a2be5a252cd33cee6c7a3f","observation_id":"3f5ce516-822f-48ed-abe7-699a88d21185","resolution":{"observed_at":"2026-08-04T03:30:54.201487Z","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-04T03:30:54.206059Z","title":"Tight lower bounds and optimal algo- rithms for stochastic nonconvex optimization with heavy- tailed noise.arXiv preprint arXiv:2512.18713,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.206059Z"},"links":{"citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:48b4c5ca9ca1cd399ac49724a33367f990f96ec328d67107eda9c676bba591c6","observation_id":"2077a73f-f5ac-4a88-af18-2cb11ca908cb","resolution":{"observed_at":"2026-08-04T03:30:54.206059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-04T03:30:54.215541Z","title":"Adam: A method for stochastic opti- mization.arXiv preprint arXiv:1412.6980,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.215541Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:8c7a177c83a630bf73fcd57b60bfda293ef0abfc8ed1bb2a5118efbb7c4db45e","observation_id":"0fa4c358-96de-4de1-bab1-03b873491558","resolution":{"observed_at":"2026-08-04T03:30:54.215541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.01119","last_updated":"2023-04-04T17:27:53Z","snapshot_observed_at":"2026-08-03T14:28:17.886291Z","submitted_at":"2023-04-03T16:34:11Z","title":"Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tails","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.01119","snapshot_observed_at":"2026-08-04T03:30:54.224484Z","title":"Improved convergence in high probability of clipped gradient meth- ods with heavy tails.arXiv preprint arXiv:2304.01119,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.224484Z"},"links":{"cited_paper":"/paper/2304.01119","citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:dfaf7fe53cb0c4bda66b6dd8ebb55b34815fc2d3985aa2b6ce1e930235d7920f","observation_id":"5bc3bb81-7dd4-4301-b9cb-1ed16a0eff20","resolution":{"observed_at":"2026-08-04T03:30:54.224484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13213","last_updated":"2026-06-21T08:13:27Z","snapshot_observed_at":"2026-07-06T08:47:45.187408Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-08-04T03:30:54.229017Z","title":"A modern introduction to online learn- ing.arXiv preprint arXiv:1912.13213,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.229017Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:854818ea589bd94b12ae923f827f82d8a5a0f0317d8053092c53dca9ea95d67e","observation_id":"44966eed-a081-43ab-a8dd-abfce0d8fe99","resolution":{"observed_at":"2026-08-04T03:30:54.229017Z","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-04T03:30:54.253753Z","title":"nX t=1 βn−tξt # ≤D E","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.253753Z"},"links":{"citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:6d659a79c7ff0623be3a831306fb22a6ed801874fa1e3bf715933a1ab8f4866f","observation_id":"bfc4c456-b8f6-4af4-bda5-f58474b9621c","resolution":{"observed_at":"2026-08-04T03:30:54.253753Z","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-04T03:30:54.259100Z","title":"TX n=1 nX t=1 (1−β)β n−t F(x t)−F(x t−1) | {z } A # +E","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.259100Z"},"links":{"citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:12d56872ce5b067a4d0dc4cfd30e14a8240d558a56f4d508b068f89a251378f8","observation_id":"95ac23b0-01e3-4a7e-9433-4e62d1fb49e0","resolution":{"observed_at":"2026-08-04T03:30:54.259100Z","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-04T03:30:54.233552Z","title":"Gradient normaliza- tion provably benefits nonconvex sgd under heavy-tailed noise.arXiv preprint arXiv:2410.16561, page 5,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":1951,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.233552Z"},"links":{"citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:bbb62e38644b8d71b878bd2926892f2e7a350f1e786ed7bbbceee7b02c403648","observation_id":"bc59623a-1595-41db-8481-7ea3b8129fe2","resolution":{"observed_at":"2026-08-04T03:30:54.233552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.07425","last_updated":"2026-05-08T15:36:59Z","snapshot_observed_at":"2026-07-06T22:44:56.252955Z","submitted_at":"2026-02-07T07:47:14Z","title":"Sign-Based Optimizers Are Effective Under Heavy-Tailed Noise","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.07425","snapshot_observed_at":"2026-08-04T03:30:54.238431Z","title":"Sign-based optimizers are effective under heavy- tailed noise.arXiv preprint arXiv:2602.07425,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":1965,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.238431Z"},"links":{"cited_paper":"/paper/2602.07425","citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:126cdaa514fea7ce534b3eee95a66d5d52269b9d7d29a6ee6fcfe376fc3a822b","observation_id":"4272acfc-0d61-495e-b5f9-2535fc879119","resolution":{"observed_at":"2026-08-04T03:30:54.238431Z","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-04T03:30:54.220399Z","title":"Online convex optimization with heavy tails: Old algorithms, new regrets, and applications.arXiv preprint arXiv:2508.07473,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.220399Z"},"links":{"citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:952288b6fab41bbaee80d4c041e2d35fbfd513ba4d355a22bdbc3a045b255d13","observation_id":"ecc26b0c-424d-49a5-9fd4-394d553971f5","resolution":{"observed_at":"2026-08-04T03:30:54.220399Z","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-04T03:30:54.210427Z","title":"Complexity of normalized stochastic first-order methods with momentum under heavy-tailed noise.arXiv preprint arXiv:2506.11214,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.210427Z"},"links":{"citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:19f1df034df2141ec41d21bc96d8b53a83835cb7dfb1d78471a2a82c9f21ba20","observation_id":"ebb08232-41ec-4f63-b1f3-decb387c9692","resolution":{"observed_at":"2026-08-04T03:30:54.210427Z","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-04T03:30:54.248635Z","title":"Random scaling and mo- mentum for non-smooth non-convex optimization.arXiv preprint arXiv:2405.09742,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.248635Z"},"links":{"citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:ca5d69848e68e6c58a60191aeb99c8db8ca055c867d45c3965192e6f162d5e73","observation_id":"e0e9cb4b-09f8-4bce-b656-cf8b2f057ef0","resolution":{"observed_at":"2026-08-04T03:30:54.248635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.07061","last_updated":"2024-11-11T15:25:48Z","snapshot_observed_at":"2026-08-06T06:15:19.216332Z","submitted_at":"2024-11-11T15:25:48Z","title":"General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.07061","snapshot_observed_at":"2026-08-04T03:30:54.196645Z","title":"General framework for online-to-nonconvex conversion: Schedule-free sgd is also effective for nonconvex opti- mization.arXiv preprint arXiv:2411.07061, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.196645Z"},"links":{"cited_paper":"/paper/2411.07061","citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:3a1f46a7b9b5576f4b24d687e5ee53df469db0b9d64eeeff5e509ca6fc322c63","observation_id":"8009794d-f415-4b92-a176-1dd385029e5e","resolution":{"observed_at":"2026-08-04T03:30:54.196645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01082","last_updated":"2024-03-13T16:48:27Z","snapshot_observed_at":"2026-08-02T11:56:02.354026Z","submitted_at":"2023-10-02T10:48:42Z","title":"Linear attention is (maybe) all you need (to understand transformer optimization)","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01082","snapshot_observed_at":"2026-08-04T03:30:54.192015Z","title":"Linear attention is (maybe) all you need (to understand transformer optimization)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.192015Z"},"links":{"cited_paper":"/paper/2310.01082","citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:8eefa958d93051e8c45d7a8ffdee2847c900dfdddbd062362ce23b85a0f6c709","observation_id":"05b88bd0-d395-4f1b-8db1-dd7b93dd0aa7","resolution":{"observed_at":"2026-08-04T03:30:54.192015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.11881","last_updated":"2020-02-10T22:58:53Z","snapshot_observed_at":"2026-08-01T07:17:17.608304Z","submitted_at":"2019-05-28T15:23:12Z","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.11881","snapshot_observed_at":"2026-08-04T03:30:54.243075Z","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity.arXiv preprint arXiv:1905.11881,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise","version":2},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-04T03:30:54.243075Z"},"links":{"cited_paper":"/paper/1905.11881","citing_paper":"/paper/2607.27383"},"observation_digest":"sha256:e60829d5083975f2e799abc49abbdf0a7b3f13124af748f43f09cd8a8fb9ba23","observation_id":"94d398b3-5b16-44b0-ada8-31b52e053153","resolution":{"observed_at":"2026-08-04T03:30:54.243075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.27383","last_updated":"2026-08-02T16:57:14Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T04:42:39.406224Z","submitted_at":"2026-07-29T18:42:35Z","title":"The Convergence Behavior of Adam under Heavy-Tailed Noise"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":16},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2607.27383."}