{"as_of":"2026-08-19T14:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8c11ae4463d7d95f3945745e907c8dd1cc7d397fcd54ef6bf57c2abf8b85bfea","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T17:11:17.854303Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2512.10825/citation-record","integrity":"/paper/2512.10825/integrity","json":"/paper/2512.10825/citation-record.json","paper":"/paper/2512.10825"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T17:11:16.230315Z","title":"Smooth minimization of non-smooth functions.Math","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:16.230315Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:353b231c3e194898d6c4c64d16bc1622257a10499e9c01d7fcdfd864016a8a28","observation_id":"009d5af9-010e-4c1c-82ff-345f2207fef9","resolution":{"observed_at":"2026-08-03T17:11:16.230315Z","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-03T17:11:16.357388Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:16.357388Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:f6bf0142342d2329cfaffe5b9a2fdccf528360b97d5f808655137c39e483bdd0","observation_id":"9fc58377-a10b-41a3-b45f-9e5793d31ac6","resolution":{"observed_at":"2026-08-03T17:11:16.357388Z","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-03T17:11:16.500857Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:16.500857Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:57fd4a6fc577e08d45b35613fb4067f4bb66dce5ab239512d26321bc6da623ba","observation_id":"2d52df05-347b-4aa9-8aa6-946700555ab5","resolution":{"observed_at":"2026-08-03T17:11:16.500857Z","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-03T17:11:16.610751Z","title":"Smoothing and first order methods: A unified framework.SIAM Journal on Optimization, 22:557–580, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:16.610751Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:dd2f8dcdf12dd04d473613de613821286172518662eaa9136c55c58de8885e32","observation_id":"ed68b278-dfe4-47fc-8bf7-d3c528337821","resolution":{"observed_at":"2026-08-03T17:11:16.610751Z","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-03T17:11:16.685360Z","title":"A method of solving a convex programming problem with convergence rateo(1/k2)","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:16.685360Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:24cf752f2fcdadf791b321c5d558c9b2ca3e378275eedd254fd91beebf9a8812","observation_id":"8a5f2c29-613e-4311-a2f7-9c1cc68717c3","resolution":{"observed_at":"2026-08-03T17:11:16.685360Z","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-03T17:11:16.772297Z","title":"Gomez, Łukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:16.772297Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:6eaa76fc1b8886e95a7961d1277680696c28adf9fd7881a089859b63a8b22642","observation_id":"db0ad8ab-2e0d-494a-8014-5ebd923bbf7c","resolution":{"observed_at":"2026-08-03T17:11:16.772297Z","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-03T17:11:16.827314Z","title":"Optimal approxi- mation - smoothness tradeoffs for soft-max functions","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:16.827314Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:32e65729df65206ba6709ff818c17579b0915ed951355bbf765c11ff5640d23c","observation_id":"424a73ca-99e6-4b5b-b197-72f448c6a754","resolution":{"observed_at":"2026-08-03T17:11:16.827314Z","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-03T17:11:16.879396Z","title":"Helmbold, Robert E","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:16.879396Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:61e29e2e2b760203847e152ab02549da408d85e36365b3b7447fc8aaee84d734","observation_id":"ea5cd93a-5be7-4cb4-8130-0bc6372037af","resolution":{"observed_at":"2026-08-03T17:11:16.879396Z","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-03T17:11:16.954875Z","title":"Proximité et dualité dans un espace hilbertien.Bulletin de la Société Mathématique de France, 93:273–299, 1965","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:16.954875Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:cc0fd2491a78e61cd14e858eb7156fec4b6e59b0d9b1ed550dcd2cf70ddbebfb","observation_id":"66cc8407-37cc-479c-a826-27e65e4d47e3","resolution":{"observed_at":"2026-08-03T17:11:16.954875Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06681","last_updated":"2025-08-21T16:05:42Z","snapshot_observed_at":"2026-08-16T00:14:15.483118Z","submitted_at":"2025-08-08T20:08:36Z","title":"The Optimal Smoothings of Sublinear Functions and Convex Cones","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06681","snapshot_observed_at":"2026-08-03T17:11:17.015862Z","title":"The optimal smoothings of sublinear functions and convex cones.arXiv preprint arXiv:2508.06681, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:17.015862Z"},"links":{"cited_paper":"/paper/2508.06681","citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:98a869eedd299fa852ae9d2aaddffcfcd967ef6f62d865d3e901e0e8008c5b7c","observation_id":"68d4c3fd-4f55-4aaa-abfc-4596fb63919b","resolution":{"observed_at":"2026-08-03T17:11:17.015862Z","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-03T17:11:17.087128Z","title":"On lower complexity bounds for large-scale smooth convex optimization.Journal of Complexity, 31(1):1–14, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:17.087128Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:02044bba69dfd392d8851578505251b64338ee5bcc2021b67cc54ed65b942759","observation_id":"a0828547-e8af-40d1-ad68-0c57316711bb","resolution":{"observed_at":"2026-08-03T17:11:17.087128Z","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-03T17:11:17.204078Z","title":"The price of adaptivity in stochastic convex optimization.Mathematical Programming, Sep 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:17.204078Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:7f1b953160ae095ffb068866338281332a2a8303e134ef59069f50d8cdd843c9","observation_id":"4df8a0b7-784a-407b-a291-e9cb4bc8130d","resolution":{"observed_at":"2026-08-03T17:11:17.204078Z","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-03T17:11:17.349311Z","title":"Online learning and online convex optimization.Found","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:17.349311Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:f192c129eebb1308d444ed64b53d2a76f027ed7ce35153c0aa74bbb82b24b26a","observation_id":"058306c1-f9c8-4d3c-a665-ac0fa882d237","resolution":{"observed_at":"2026-08-03T17:11:17.349311Z","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-08-15T05:32:55.984958Z","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-03T17:11:17.463989Z","title":"A modern introduction to online learning.ArXiv, abs/1912.13213, 2019","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:17.463989Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:d60c5e0555f54428a575c4cb53d63d2a17dad6e2ef4a20e609574671bf49808d","observation_id":"425710ef-ff9f-40d4-95c4-5cd1607dd5f6","resolution":{"observed_at":"2026-08-03T17:11:17.463989Z","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-03T17:11:17.579217Z","title":"Accelerated first-order methods for hyperbolic programming.Math","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:17.579217Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:630b960e76a3a86de6151b5bbbedbf751acb1acb227f9d21e1a5b7689ffd99b0","observation_id":"a7b8057e-3852-4ff7-a545-c1048a8ab2b1","resolution":{"observed_at":"2026-08-03T17:11:17.579217Z","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-03T17:11:17.754657Z","title":"Radial duality part ii: applications and algorithms.Math","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:17.754657Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:8a78480d05639a4910b6ae661259a451bc76c5a4f548c3e26c5e71d5acd09ee0","observation_id":"4ded4b5e-5048-4e47-904b-bccb1eb00df2","resolution":{"observed_at":"2026-08-03T17:11:17.754657Z","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-03T17:11:17.854303Z","title":"Follow-the-Regularized-Leader","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T17:11:17.854303Z"},"links":{"citing_paper":"/paper/2512.10825"},"observation_digest":"sha256:ecb3869a77d6371bee9047194b9dabfa0c4cf7d3a2522f50f854e60ecf97d5fb","observation_id":"adea75bb-26de-4fd2-903c-e581d2f15bb9","resolution":{"observed_at":"2026-08-03T17:11:17.854303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2512.10825","last_updated":"2026-07-13T02:19:03Z","latest_version":3,"primary_category":"math.ST","snapshot_observed_at":"2026-08-16T16:42:17.475304Z","submitted_at":"2025-12-11T17:17:48Z","title":"An Elementary Proof of the Near Optimality of LogSumExp Smoothing"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":17},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2512.10825."}