{"as_of":"2026-08-22T05:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e5701b578d8089ccd5105e64d70103ebccb6e0147ffd5a8f4367fff96e12d98d","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:48:25.455617Z","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-02T00:56:24.050133Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.17386","last_updated":"2025-05-29T21:31:37Z","snapshot_observed_at":"2026-08-19T18:08:26.515120Z","submitted_at":"2024-04-26T13:02:20Z","title":"Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems","version":3},"cited_work":{"arxiv_id":"2404.17386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.17386","snapshot_observed_at":"2026-07-02T00:56:24.050133Z","title":"Ding and K.-C","venue":null,"work_id":"ccb35c64-fc4e-4c06-bc03-54e487a7e299","year":2024},"citing_paper":{"arxiv_id":"2409.04777","last_updated":"2026-05-20T09:55:40Z","snapshot_observed_at":"2026-08-18T12:19:50.366790Z","submitted_at":"2024-09-07T09:37:19Z","title":"Optimization Hyper-parameter Laws for Large Language Models","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-23T20:45:31.427677Z"},"links":{"cited_paper":"/paper/2404.17386","citing_paper":"/paper/2409.04777"},"observation_digest":"sha256:c9893cd482740fb8c311a7bf3466d1a52cd05a7bdc40439d17733c58e12b7eef","observation_id":"acffcd64-5776-47f1-b1ba-7b4b07a12ea9","resolution":{"observed_at":"2026-05-23T20:45:48.814838Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.17386","last_updated":"2025-05-29T21:31:37Z","snapshot_observed_at":"2026-08-19T18:08:26.515120Z","submitted_at":"2024-04-26T13:02:20Z","title":"Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.17386","snapshot_observed_at":"2026-08-06T15:48:25.455617Z","title":"Ding and K.-C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.15264","last_updated":"2025-07-25T05:02:24Z","snapshot_observed_at":"2026-08-21T16:33:58.502117Z","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":25,"source":"pdf_text","source_observed_at":"2026-08-06T15:48:25.455617Z"},"links":{"cited_paper":"/paper/2404.17386","citing_paper":"/paper/2507.15264"},"observation_digest":"sha256:675f62f700138eb06d166a7cf96e299ab63a4ecd109301875f72a05460cd9764","observation_id":"11fcb366-f8c2-43e2-bb77-5ca1b6c70dad","resolution":{"observed_at":"2026-08-06T15:48:25.455617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.17386","last_updated":"2025-05-29T21:31:37Z","snapshot_observed_at":"2026-08-19T18:08:26.515120Z","submitted_at":"2024-04-26T13:02:20Z","title":"Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems","version":3},"cited_work":{"arxiv_id":"2404.17386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.17386","snapshot_observed_at":"2026-07-02T00:56:24.050133Z","title":"Ding and K.-C","venue":null,"work_id":"ccb35c64-fc4e-4c06-bc03-54e487a7e299","year":2024},"citing_paper":{"arxiv_id":"2607.00300","last_updated":"2026-07-01T00:54:21Z","snapshot_observed_at":"2026-08-15T16:54:52.241366Z","submitted_at":"2026-07-01T00:54:21Z","title":"Fully Distributed T\\^atonnement for Chores Markets","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-02T00:56:19.792449Z"},"links":{"cited_paper":"/paper/2404.17386","citing_paper":"/paper/2607.00300"},"observation_digest":"sha256:4f79a6695831fc0dd12113a5a0a3964e1b110f32240fbd695ddb6e7da04ec1e7","observation_id":"060389c4-0554-46ac-a9e1-191a1357d6cd","resolution":{"observed_at":"2026-07-02T00:56:24.052411Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.17386/citation-record","integrity":"/paper/2404.17386/integrity","json":"/paper/2404.17386/citation-record.json","paper":"/paper/2404.17386"},"outbound":[],"paper":{"arxiv_id":"2404.17386","last_updated":"2025-05-29T21:31:37Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-19T18:08:26.515120Z","submitted_at":"2024-04-26T13:02:20Z","title":"Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex 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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2404.17386."}