Paper Citation Record · LEDGER

An Elementary Proof of the Near Optimality of LogSumExp Smoothing

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2512.10825 v3

Coverage vector

measured 17 of 17 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T17:11:17.854303Z

measured 17 of 17 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

17 of 17 outbound references displayed

verified exact0
verified fuzzy0
unresolved17
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 009d5af9-010e-4c1c-82ff-345f2207fef9 · outbound

This paper cites Smooth minimization of non-smooth functions.Math.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Smooth minimization of non-smooth functions.Math

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:16.230315Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9fc58377-a10b-41a3-b45f-9e5793d31ac6 · outbound

This paper cites an unresolved cited work.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Unresolved cited work

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:16.357388Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2d52df05-347b-4aa9-8aa6-946700555ab5 · outbound

This paper cites an unresolved cited work.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Unresolved cited work

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:16.500857Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed68b278-dfe4-47fc-8bf7-d3c528337821 · outbound

This paper cites Smoothing and first order methods: A unified framework.SIAM Journal on Optimization, 22:557–580, 2012.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Smoothing and first order methods: A unified framework.SIAM Journal on Optimization, 22:557–580, 2012

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:16.610751Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a5f2c29-613e-4311-a2f7-9c1cc68717c3 · outbound

This paper cites A method of solving a convex programming problem with convergence rateo(1/k2).

An Elementary Proof of the Near Optimality of LogSumExp Smoothing A method of solving a convex programming problem with convergence rateo(1/k2)

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:16.685360Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation db0ad8ab-2e0d-494a-8014-5ebd923bbf7c · outbound

This paper cites Gomez, Łukasz Kaiser, and Illia Polosukhin.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Gomez, Łukasz Kaiser, and Illia Polosukhin

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:16.772297Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 424a73ca-99e6-4b5b-b197-72f448c6a754 · outbound

This paper cites Optimal approxi- mation - smoothness tradeoffs for soft-max functions.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Optimal approxi- mation - smoothness tradeoffs for soft-max functions

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:16.827314Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ea5cd93a-5be7-4cb4-8130-0bc6372037af · outbound

This paper cites Helmbold, Robert E.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Helmbold, Robert E

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:16.879396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 66cc8407-37cc-479c-a826-27e65e4d47e3 · outbound

This paper cites Proximité et dualité dans un espace hilbertien.Bulletin de la Société Mathématique de France, 93:273–299, 1965.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Proximité et dualité dans un espace hilbertien.Bulletin de la Société Mathématique de France, 93:273–299, 1965

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:16.954875Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 68d4c3fd-4f55-4aaa-abfc-4596fb63919b · outbound

This paper cites The Optimal Smoothings of Sublinear Functions and Convex Cones.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing The Optimal Smoothings of Sublinear Functions and Convex Cones

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:17.015862Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a0828547-e8af-40d1-ad68-0c57316711bb · outbound

This paper cites On lower complexity bounds for large-scale smooth convex optimization.Journal of Complexity, 31(1):1–14, 2015.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing On lower complexity bounds for large-scale smooth convex optimization.Journal of Complexity, 31(1):1–14, 2015

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:17.087128Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4df8a0b7-784a-407b-a291-e9cb4bc8130d · outbound

This paper cites The price of adaptivity in stochastic convex optimization.Mathematical Programming, Sep 2025.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing The price of adaptivity in stochastic convex optimization.Mathematical Programming, Sep 2025

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:17.204078Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 058306c1-f9c8-4d3c-a665-ac0fa882d237 · outbound

This paper cites Online learning and online convex optimization.Found.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Online learning and online convex optimization.Found

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:17.349311Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 425710ef-ff9f-40d4-95c4-5cd1607dd5f6 · outbound

This paper cites Online Learning: A Modern Introduction Using Convex Optimization.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Online Learning: A Modern Introduction Using Convex Optimization

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:17.463989Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7b8057e-3852-4ff7-a545-c1048a8ab2b1 · outbound

This paper cites Accelerated first-order methods for hyperbolic programming.Math.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Accelerated first-order methods for hyperbolic programming.Math

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:17.579217Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ded4b5e-5048-4e47-904b-bccb1eb00df2 · outbound

This paper cites Radial duality part ii: applications and algorithms.Math.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Radial duality part ii: applications and algorithms.Math

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:17.754657Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation adea75bb-26de-4fd2-903c-e581d2f15bb9 · outbound

This paper cites Follow-the-Regularized-Leader.

An Elementary Proof of the Near Optimality of LogSumExp Smoothing Follow-the-Regularized-Leader

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-03T17:11:17.854303Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.