Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2410.19928.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-10T22:18:54.690640Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-01T12:45:44.759547Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation b3f455f3-8b19-4ba7-be6e-ebd043b8c6c6 · inbound
ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization cites this paper.
ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
Reference 36
- Resolution
- unresolved
- no resolver link, observed 2026-08-10T22:18:54.690640Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ed7d52af-1e50-4a5d-8021-d50cb580d511 · inbound
Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity cites this paper.
Minimizing Smooth Kurdyka-{\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T22:37:55.046638Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f73ab5ed-bab1-4265-9afc-8b3ada31d400 · inbound
On fundamental properties of high-order forward-backward envelope cites this paper.
On fundamental properties of high-order forward-backward envelope ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
Reference 23
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T22:38:47.501673Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation eecb3d21-0cb8-4388-889a-d6967c8383c9 · inbound
Speeding Up Nonsmooth Bayesian MCMC Sampling via Inexact Proximal Unadjusted Langevin Algorithm cites this paper.
Speeding Up Nonsmooth Bayesian MCMC Sampling via Inexact Proximal Unadjusted Langevin Algorithm ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
Reference 19
- Resolution
- verified exact
- arxiv_id, observed 2026-07-03T01:16:48.068285Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.
Observation 690cc631-ddf5-42d0-a74a-c1287ae38352 · inbound
Difference-of-Convex Optimization via Inexact Smoothing Descent Methods: Difference of High-Order Moreau Envelopes cites this paper.
Difference-of-Convex Optimization via Inexact Smoothing Descent Methods: Difference of High-Order Moreau Envelopes ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
Reference 21
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-07-03T01:16:48.068285Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.