{"as_of":"2026-08-18T20:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:91ae907e11def7f20ef23e3498705da72a81ae4930617b3c29f958ab37acc942","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":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":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:18:54.690640Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T12:45:44.759547Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.19928","last_updated":"2026-07-01T20:44:17Z","snapshot_observed_at":"2026-08-16T13:05:52.006198Z","submitted_at":"2024-10-25T18:54:35Z","title":"ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19928","snapshot_observed_at":"2026-08-10T22:18:54.690640Z","title":"URL https://doi.org/10.48550/arXiv.2410.19928","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.02155","last_updated":"2025-01-04T01:16:34Z","snapshot_observed_at":"2026-08-18T05:43:05.041670Z","submitted_at":"2025-01-04T01:16:34Z","title":"ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T22:18:54.690640Z"},"links":{"cited_paper":"/paper/2410.19928","citing_paper":"/paper/2501.02155"},"observation_digest":"sha256:916b871db6042279f03827366f7b3513ba418f4f8d351724a020e8d71e99f4fa","observation_id":"b3f455f3-8b19-4ba7-be6e-ebd043b8c6c6","resolution":{"observed_at":"2026-08-10T22:18:54.690640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19928","last_updated":"2026-07-01T20:44:17Z","snapshot_observed_at":"2026-08-16T13:05:52.006198Z","submitted_at":"2024-10-25T18:54:35Z","title":"ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19928","snapshot_observed_at":"2026-08-03T22:37:55.046638Z","title":"arXiv (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.10414","last_updated":"2026-06-05T14:08:24Z","snapshot_observed_at":"2026-08-11T16:50:14.898022Z","submitted_at":"2025-11-13T15:34:17Z","title":"Minimizing Smooth Kurdyka-{\\L}ojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T22:37:55.046638Z"},"links":{"cited_paper":"/paper/2410.19928","citing_paper":"/paper/2511.10414"},"observation_digest":"sha256:8b660508c09949896c8eba61fc986da99454dfc877a19fb2c7a8d44916ce747a","observation_id":"ed7d52af-1e50-4a5d-8021-d50cb580d511","resolution":{"observed_at":"2026-08-03T22:37:55.046638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19928","last_updated":"2026-07-01T20:44:17Z","snapshot_observed_at":"2026-08-16T13:05:52.006198Z","submitted_at":"2024-10-25T18:54:35Z","title":"ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.19928","snapshot_observed_at":"2026-08-03T22:38:47.501673Z","title":"arXiv URLhttps://arxiv.org/abs/2410.19928","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.10421","last_updated":"2026-06-22T23:23:17Z","snapshot_observed_at":"2026-08-09T07:43:45.217959Z","submitted_at":"2025-11-13T15:42:55Z","title":"On fundamental properties of high-order forward-backward envelope","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T22:38:47.501673Z"},"links":{"cited_paper":"/paper/2410.19928","citing_paper":"/paper/2511.10421"},"observation_digest":"sha256:3b858f44450f2ee45f3887f2a140e2cc2dc60b0e30fbbc248a6b020663d0e50c","observation_id":"f73ab5ed-bab1-4265-9afc-8b3ada31d400","resolution":{"observed_at":"2026-08-03T22:38:47.501673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.19928","last_updated":"2026-07-01T20:44:17Z","snapshot_observed_at":"2026-08-16T13:05:52.006198Z","submitted_at":"2024-10-25T18:54:35Z","title":"ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope","version":5},"cited_work":{"arxiv_id":"2410.19928","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.19928","snapshot_observed_at":"2026-07-03T01:16:48.068285Z","title":"Kabgani and M","venue":null,"work_id":"86f1b2ea-19ff-48a1-8dab-f7b06d5f57d7","year":2024},"citing_paper":{"arxiv_id":"2605.17306","last_updated":"2026-05-17T07:48:28Z","snapshot_observed_at":"2026-08-03T10:16:57.491058Z","submitted_at":"2026-05-17T07:48:28Z","title":"Speeding Up Nonsmooth Bayesian MCMC Sampling via Inexact Proximal Unadjusted Langevin Algorithm","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-19T22:51:12.440406Z"},"links":{"cited_paper":"/paper/2410.19928","citing_paper":"/paper/2605.17306"},"observation_digest":"sha256:31589caa410cba6737787c24685efa5cd5d3f938699abd79004214c472c1f95c","observation_id":"eecb3d21-0cb8-4388-889a-d6967c8383c9","resolution":{"observed_at":"2026-07-03T01:16:48.068285Z","resolver_source":"arxiv_id","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":"2410.19928","last_updated":"2026-07-01T20:44:17Z","snapshot_observed_at":"2026-08-16T13:05:52.006198Z","submitted_at":"2024-10-25T18:54:35Z","title":"ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope","version":5},"cited_work":{"arxiv_id":"2410.19928","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.19928","snapshot_observed_at":"2026-07-03T01:16:48.068285Z","title":"Kabgani and M","venue":null,"work_id":"86f1b2ea-19ff-48a1-8dab-f7b06d5f57d7","year":2024},"citing_paper":{"arxiv_id":"2606.30991","last_updated":"2026-06-30T00:05:35Z","snapshot_observed_at":"2026-08-09T17:12:03.642889Z","submitted_at":"2026-06-30T00:05:35Z","title":"Difference-of-Convex Optimization via Inexact Smoothing Descent Methods: Difference of High-Order Moreau Envelopes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-01T01:46:04.938241Z"},"links":{"cited_paper":"/paper/2410.19928","citing_paper":"/paper/2606.30991"},"observation_digest":"sha256:a4ed07cfd4a6150846005399fbfc34bb5e244f34ad11d87e9c76d0a57eee5a6a","observation_id":"690cc631-ddf5-42d0-a74a-c1287ae38352","resolution":{"observed_at":"2026-07-03T01:16:48.068285Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2410.19928/citation-record","integrity":"/paper/2410.19928/integrity","json":"/paper/2410.19928/citation-record.json","paper":"/paper/2410.19928"},"outbound":[],"paper":{"arxiv_id":"2410.19928","last_updated":"2026-07-01T20:44:17Z","latest_version":5,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T13:05:52.006198Z","submitted_at":"2024-10-25T18:54:35Z","title":"ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope"},"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-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 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2410.19928."}