{"as_of":"2026-08-11T16:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e7d91b2208c9d98027c18622c6d6d527842ee2e2d4f270446798f982340f80ec","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:35:13.864280Z","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:35:14.525363Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.05218","last_updated":"2019-09-10T15:42:38Z","snapshot_observed_at":"2026-07-06T06:44:41.329034Z","submitted_at":"2018-06-13T18:44:17Z","title":"Line Search and Trust-Region Methods for Convex-Composite Optimization","version":2},"cited_work":{"arxiv_id":"1806.05218","doi":null,"metadata_source":"pith","pith_arxiv_id":"1806.05218","snapshot_observed_at":"2026-08-10T21:35:14.525363Z","title":"Line Search and Trust-Region Methods for Convex-Composite Optimization","venue":"math.OC","work_id":"10605510-9b4e-4a81-8a3c-2f594ddc3736","year":2018},"citing_paper":{"arxiv_id":"2501.04889","last_updated":"2025-01-09T00:05:31Z","snapshot_observed_at":"2026-08-10T21:20:40.811816Z","submitted_at":"2025-01-09T00:05:31Z","title":"Projected proximal gradient trust-region algorithm for nonsmooth optimization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T21:35:13.864280Z"},"links":{"cited_paper":"/paper/1806.05218","citing_paper":"/paper/2501.04889"},"observation_digest":"sha256:4b7c4e433ed91f668dbabd8bb25415d8a661c21d47fc2ce351ee86ddeff44161","observation_id":"0af898c1-bf79-4672-808d-3a623a976db9","resolution":{"observed_at":"2026-08-10T21:35:14.632575Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1806.05218/citation-record","integrity":"/paper/1806.05218/integrity","json":"/paper/1806.05218/citation-record.json","paper":"/paper/1806.05218"},"outbound":[],"paper":{"arxiv_id":"1806.05218","last_updated":"2019-09-10T15:42:38Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T06:44:41.329034Z","submitted_at":"2018-06-13T18:44:17Z","title":"Line Search and Trust-Region Methods for Convex-Composite Optimization"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1806.05218."}