{"as_of":"2026-08-18T19:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b44314942e7327ee4d3f9fe84f5ad32c399b9da6fe5426eead792bf158ef737","coverage":[{"denominator":5,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:16:46.815436Z","state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2506.17698/citation-record","integrity":"/paper/2506.17698/integrity","json":"/paper/2506.17698/citation-record.json","paper":"/paper/2506.17698"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.10884","last_updated":"2025-01-18T21:32:26Z","snapshot_observed_at":"2026-08-18T16:11:50.507372Z","submitted_at":"2025-01-18T21:32:26Z","title":"Fixed Point Computation: Beating Brute Force with Smoothed Analysis","version":1},"cited_work":{"arxiv_id":"2501.10884","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.10884","snapshot_observed_at":"2026-08-15T19:16:46.900215Z","title":"Fixed Point Computation: Beating Brute Force with Smoothed Analysis","venue":"cs.GT","work_id":"78c12cc7-126e-450b-a697-6af3df69ecff","year":2025},"citing_paper":{"arxiv_id":"2506.17698","last_updated":"2026-07-10T04:53:12Z","snapshot_observed_at":"2026-08-18T05:26:46.806750Z","submitted_at":"2025-06-21T12:09:06Z","title":"Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T19:16:46.793040Z"},"links":{"cited_paper":"/paper/2501.10884","citing_paper":"/paper/2506.17698"},"observation_digest":"sha256:cef8942c7725ae8219f7d25bcb29941b624b31cb14285cdce0ea9cadec423c1b","observation_id":"ddb327b4-8bf4-48a7-be24-315260a4818b","resolution":{"observed_at":"2026-08-15T19:16:46.906694Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12139","last_updated":"2024-11-15T12:23:42Z","snapshot_observed_at":"2026-08-18T11:19:03.681058Z","submitted_at":"2023-10-18T17:50:13Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12139","snapshot_observed_at":"2026-08-15T19:16:46.810442Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization.arXiv preprint arXiv:2310.12139,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.17698","last_updated":"2026-07-10T04:53:12Z","snapshot_observed_at":"2026-08-18T05:26:46.806750Z","submitted_at":"2025-06-21T12:09:06Z","title":"Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T19:16:46.810442Z"},"links":{"cited_paper":"/paper/2310.12139","citing_paper":"/paper/2506.17698"},"observation_digest":"sha256:e899e62de45c35a89b7711c40561811cc93363172457cbbedafcba978fc9af43","observation_id":"5f88a7fa-6d32-4190-a379-5464b34a5826","resolution":{"observed_at":"2026-08-15T19:16:46.810442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.08150","last_updated":"2021-12-06T22:01:02Z","snapshot_observed_at":"2026-08-16T17:48:59.398620Z","submitted_at":"2021-10-15T15:26:32Z","title":"Halpern-Type Accelerated and Splitting Algorithms For Monotone Inclusions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.08150","snapshot_observed_at":"2026-08-15T19:16:46.815436Z","title":"Halpern-type accelerated and splitting algorithms for monotone inclu- sions.arXiv preprint arXiv:2110.08150,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.17698","last_updated":"2026-07-10T04:53:12Z","snapshot_observed_at":"2026-08-18T05:26:46.806750Z","submitted_at":"2025-06-21T12:09:06Z","title":"Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion","version":3},"reference_index":1987,"source":"pdf_text","source_observed_at":"2026-08-15T19:16:46.815436Z"},"links":{"cited_paper":"/paper/2110.08150","citing_paper":"/paper/2506.17698"},"observation_digest":"sha256:86d82e53e2b1de50fd57535f4ee1b0932daa309b312ed5291aee1efe213edbc7","observation_id":"65fe047b-7e44-4219-b739-85d80bd51e09","resolution":{"observed_at":"2026-08-15T19:16:46.815436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12338","last_updated":"2025-05-09T21:02:52Z","snapshot_observed_at":"2026-08-16T14:08:34.789482Z","submitted_at":"2024-03-19T01:07:35Z","title":"Stochastic Halpern iteration in normed spaces and applications to reinforcement learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12338","snapshot_observed_at":"2026-08-15T19:16:46.799350Z","title":"Stochastic Halpern iteration in normed spaces and applications to reinforcement learning.arXiv preprint arXiv:2403.12338,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.17698","last_updated":"2026-07-10T04:53:12Z","snapshot_observed_at":"2026-08-18T05:26:46.806750Z","submitted_at":"2025-06-21T12:09:06Z","title":"Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion","version":3},"reference_index":1996,"source":"pdf_text","source_observed_at":"2026-08-15T19:16:46.799350Z"},"links":{"cited_paper":"/paper/2403.12338","citing_paper":"/paper/2506.17698"},"observation_digest":"sha256:08eb90d8c8124321412049d9162a86693bd09b99cc3ba8e96ef5f8dcca84ebf3","observation_id":"04f45972-6d91-4ace-b650-6476b1914faa","resolution":{"observed_at":"2026-08-15T19:16:46.799350Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:16:46.917398Z","title":"Convergence of proximal splitting algorithms in CAT(κ) spaces and beyond.Fixed Point Theory and Algorithms for Sciences and Engineering, 2021(1):13,","venue":null,"work_id":"3f46c4b5-9e90-4b0b-8b82-fb2add229ecf","year":2021},"citing_paper":{"arxiv_id":"2506.17698","last_updated":"2026-07-10T04:53:12Z","snapshot_observed_at":"2026-08-18T05:26:46.806750Z","submitted_at":"2025-06-21T12:09:06Z","title":"Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T19:16:46.804726Z"},"links":{"citing_paper":"/paper/2506.17698"},"observation_digest":"sha256:b234d858cae4cf4264cb1848cb53e08f6f8d8990f13206f29cbc7f4160e96e60","observation_id":"36b89684-d07b-4ad3-8d83-85054b0a8d79","resolution":{"observed_at":"2026-08-15T19:16:46.922490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.17698","last_updated":"2026-07-10T04:53:12Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T05:26:46.806750Z","submitted_at":"2025-06-21T12:09:06Z","title":"Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion"},"reference_resolution":{"displayed":5,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":1},"total_outbound_references":5},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"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."}