Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-15T19:16:46.815436Z
Paper Citation Record · LEDGER
Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion
As of 18 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 0 inbound Pith citation observations for arXiv:2506.17698.
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-18T06:34:40.430872+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
5 of 5 outbound references displayed
- verified exact1
- verified fuzzy1
- unresolved3
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation ddb327b4-8bf4-48a7-be24-315260a4818b · outbound
This paper cites Fixed Point Computation: Beating Brute Force with Smoothed Analysis.
Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion Fixed Point Computation: Beating Brute Force with Smoothed Analysis
Reference 1
- Resolution
- verified exact
- local_arxiv, observed 2026-08-15T19:16:46.906694Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 5f88a7fa-6d32-4190-a379-5464b34a5826 · outbound
This paper cites Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization.
Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T19:16:46.810442Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 65fe047b-7e44-4219-b739-85d80bd51e09 · outbound
This paper cites Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions.
Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions
Reference 1987
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T19:16:46.815436Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 04f45972-6d91-4ace-b650-6476b1914faa · outbound
This paper cites Stochastic Halpern iteration in normed spaces and applications to reinforcement learning.
Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion Stochastic Halpern iteration in normed spaces and applications to reinforcement learning
Reference 1996
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T19:16:46.799350Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 36b89684-d07b-4ad3-8d83-85054b0a8d79 · outbound
This paper cites Convergence of proximal splitting algorithms in CAT(κ) spaces and beyond.Fixed Point Theory and Algorithms for Sciences and Engineering, 2021(1):13,.
Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion Convergence of proximal splitting algorithms in CAT(κ) spaces and beyond.Fixed Point Theory and Algorithms for Sciences and Engineering, 2021(1):13,
Reference 2021
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-15T19:16:46.922490Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Pith citing papers
No inbound Pith citation observations are available.