{"as_of":"2026-08-11T04:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6fdab99265e44ca6e66f8b276d93febf6a6a7f46ebae343d95c785c52b359c37","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:10:55.387153Z","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-03T08:57:47.431961Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.03938","last_updated":"2024-02-19T07:59:56Z","snapshot_observed_at":"2026-07-06T15:24:04.050068Z","submitted_at":"2023-05-06T05:35:56Z","title":"Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03938","snapshot_observed_at":"2026-08-10T14:10:55.387153Z","title":"Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.15646","last_updated":"2025-01-26T19:11:57Z","snapshot_observed_at":"2026-08-10T20:20:19.983137Z","submitted_at":"2025-01-26T19:11:57Z","title":"Mathematical analysis of the gradients in deep learning","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T14:10:55.387153Z"},"links":{"cited_paper":"/paper/2305.03938","citing_paper":"/paper/2501.15646"},"observation_digest":"sha256:bb6f324b8a173b6bbcef4724039944feaf0a963d2ad58ec462fff13191ae424a","observation_id":"18d67b15-0b65-4b23-84f4-71b7548b57a3","resolution":{"observed_at":"2026-08-10T14:10:55.387153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03938","last_updated":"2024-02-19T07:59:56Z","snapshot_observed_at":"2026-07-06T15:24:04.050068Z","submitted_at":"2023-05-06T05:35:56Z","title":"Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03938","snapshot_observed_at":"2026-08-06T15:48:30.436126Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.15264","last_updated":"2025-07-25T05:02:24Z","snapshot_observed_at":"2026-08-09T13:13:51.158159Z","submitted_at":"2025-07-21T05:58:52Z","title":"On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T15:48:30.436126Z"},"links":{"cited_paper":"/paper/2305.03938","citing_paper":"/paper/2507.15264"},"observation_digest":"sha256:c2a39f3e3de09a4122518ea2e25376ec2351ad40ffb413c4072b331d2a6f271c","observation_id":"c9bcd6b8-5b68-4203-a46f-0721cbb8f4a2","resolution":{"observed_at":"2026-08-06T15:48:30.436126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03938","last_updated":"2024-02-19T07:59:56Z","snapshot_observed_at":"2026-07-06T15:24:04.050068Z","submitted_at":"2023-05-06T05:35:56Z","title":"Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":"2305.03938","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.03938","snapshot_observed_at":"2026-07-03T08:57:47.431961Z","title":"Adam-family methods for nonsmooth optimization with convergence guarantees.arXiv preprint arXiv:2305.03938, 2023","venue":null,"work_id":"6d8238ad-f102-4366-baf1-51a52832f49e","year":2023},"citing_paper":{"arxiv_id":"2604.17060","last_updated":"2026-04-18T16:29:25Z","snapshot_observed_at":"2026-07-06T23:04:14.688737Z","submitted_at":"2026-04-18T16:29:25Z","title":"On convergence rates of subgradient descent on semialgebraic functions","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-10T06:38:02.975663Z"},"links":{"cited_paper":"/paper/2305.03938","citing_paper":"/paper/2604.17060"},"observation_digest":"sha256:b6b0433275440abcc462009b3fea15565097eaee25ad91a0e6b47c4ed5744127","observation_id":"e15fddb0-a32e-41cd-8bd9-8fd0a4e26943","resolution":{"observed_at":"2026-05-10T06:41:36.779229Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03938","last_updated":"2024-02-19T07:59:56Z","snapshot_observed_at":"2026-07-06T15:24:04.050068Z","submitted_at":"2023-05-06T05:35:56Z","title":"Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees","version":2},"cited_work":{"arxiv_id":"2305.03938","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.03938","snapshot_observed_at":"2026-07-03T08:57:47.431961Z","title":"Adam-family methods for nonsmooth optimization with convergence guarantees.arXiv preprint arXiv:2305.03938, 2023","venue":null,"work_id":"6d8238ad-f102-4366-baf1-51a52832f49e","year":2023},"citing_paper":{"arxiv_id":"2607.01755","last_updated":"2026-07-02T06:11:38Z","snapshot_observed_at":"2026-08-09T21:04:55.602033Z","submitted_at":"2026-07-02T06:11:38Z","title":"Decentralized Stochastic Subgradient-type Methods with Communication Compression for Nonsmooth Nonconvex Optimization","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-03T08:48:04.553667Z"},"links":{"cited_paper":"/paper/2305.03938","citing_paper":"/paper/2607.01755"},"observation_digest":"sha256:5a92e0ca76e33de6dce07f09bd53907760692864db9333df8992d459b2bd0df8","observation_id":"c827a6df-31d6-41aa-b86c-b2dd48b89437","resolution":{"observed_at":"2026-07-03T08:57:47.433477Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2305.03938/citation-record","integrity":"/paper/2305.03938/integrity","json":"/paper/2305.03938/citation-record.json","paper":"/paper/2305.03938"},"outbound":[],"paper":{"arxiv_id":"2305.03938","last_updated":"2024-02-19T07:59:56Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T15:24:04.050068Z","submitted_at":"2023-05-06T05:35:56Z","title":"Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2305.03938."}