{"as_of":"2026-08-16T09:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d89ff5f64a2f197db9a2577ea321454b19afcd00598dc7bd7f664091c22753f7","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:04:01.420861Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-10T21:49:03.981956Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1811.11378","last_updated":"2018-12-18T03:33:17Z","snapshot_observed_at":"2026-08-14T17:52:17.074751Z","submitted_at":"2018-11-28T04:25:17Z","title":"A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.11378","snapshot_observed_at":"2026-08-11T15:04:01.420861Z","title":"arXiv preprin t arXiv:1811.11378 (2018)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.11485","last_updated":"2025-06-02T05:44:07Z","snapshot_observed_at":"2026-08-13T17:50:07.645400Z","submitted_at":"2024-12-16T06:56:45Z","title":"Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T15:04:01.420861Z"},"links":{"cited_paper":"/paper/1811.11378","citing_paper":"/paper/2412.11485"},"observation_digest":"sha256:3f610746d7b4bffe33ab0831a805d5c16db7a5cb650380b68490eff6db5b8b7d","observation_id":"37027aec-6937-4e69-bb36-9cda6dd6db2b","resolution":{"observed_at":"2026-08-11T15:04:01.420861Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.11378","last_updated":"2018-12-18T03:33:17Z","snapshot_observed_at":"2026-08-14T17:52:17.074751Z","submitted_at":"2018-11-28T04:25:17Z","title":"A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems","version":2},"cited_work":{"arxiv_id":"1811.11378","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.11378","snapshot_observed_at":"2026-08-10T21:49:03.981956Z","title":"A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems","venue":"math.OC","work_id":"2bab999c-9ff8-46c8-978b-8f99f956e6e4","year":2018},"citing_paper":{"arxiv_id":"2501.04165","last_updated":"2025-01-07T22:25:40Z","snapshot_observed_at":"2026-08-10T21:37:43.773905Z","submitted_at":"2025-01-07T22:25:40Z","title":"Unifying restart accelerated gradient and proximal bundle methods","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T21:49:03.815096Z"},"links":{"cited_paper":"/paper/1811.11378","citing_paper":"/paper/2501.04165"},"observation_digest":"sha256:88c624f14276f7b14d53336634538d8067540dd7852f347a6a8163e01e13e94c","observation_id":"d44034b6-755d-4583-96d8-cd71093abe29","resolution":{"observed_at":"2026-08-10T21:49:03.987259Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1811.11378/citation-record","integrity":"/paper/1811.11378/integrity","json":"/paper/1811.11378/citation-record.json","paper":"/paper/1811.11378"},"outbound":[],"paper":{"arxiv_id":"1811.11378","last_updated":"2018-12-18T03:33:17Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T17:52:17.074751Z","submitted_at":"2018-11-28T04:25:17Z","title":"A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1811.11378."}