{"as_of":"2026-08-09T21:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0889338d2da569a8a96bfa3c267934811b0864af8e4079384c038b893ccca229","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-09T06:31:02.800959+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-06-28T23:11:02.699220Z","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-06-28T23:12:46.677051Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1909.00843","last_updated":"2019-09-02T19:47:47Z","snapshot_observed_at":"2026-08-02T20:54:09.031912Z","submitted_at":"2019-09-02T19:47:47Z","title":"Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent","version":1},"cited_work":{"arxiv_id":"1909.00843","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.00843","snapshot_observed_at":"2026-06-28T23:12:46.677051Z","title":"arXiv preprint arXiv:1909.00843 , year=","venue":null,"work_id":"0ce1f860-36ca-4d87-9497-bb0ec3c474e2","year":2019},"citing_paper":{"arxiv_id":"2605.07239","last_updated":"2026-05-08T04:52:59Z","snapshot_observed_at":"2026-07-06T23:19:35.885430Z","submitted_at":"2026-05-08T04:52:59Z","title":"Sample Complexity of Stochastic Optimization with Integer Variables","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-05-11T02:10:44.402412Z"},"links":{"cited_paper":"/paper/1909.00843","citing_paper":"/paper/2605.07239"},"observation_digest":"sha256:c8773a0dbcae7b84f7827290f8f6fee97fba1445397ada1841db96d43052b9eb","observation_id":"3e8e37cc-b055-4c9b-ba69-fcd82ed2ac51","resolution":{"observed_at":"2026-05-11T03:50:58.058694Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.00843","last_updated":"2019-09-02T19:47:47Z","snapshot_observed_at":"2026-08-02T20:54:09.031912Z","submitted_at":"2019-09-02T19:47:47Z","title":"Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent","version":1},"cited_work":{"arxiv_id":"1909.00843","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.00843","snapshot_observed_at":"2026-06-28T23:12:46.677051Z","title":"arXiv preprint arXiv:1909.00843 , year=","venue":null,"work_id":"0ce1f860-36ca-4d87-9497-bb0ec3c474e2","year":2019},"citing_paper":{"arxiv_id":"2605.20999","last_updated":"2026-05-20T10:38:08Z","snapshot_observed_at":"2026-07-06T23:31:32.577242Z","submitted_at":"2026-05-20T10:38:08Z","title":"Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise","version":1},"reference_index":216,"source":"arxiv_source","source_observed_at":"2026-05-21T02:27:24.989781Z"},"links":{"cited_paper":"/paper/1909.00843","citing_paper":"/paper/2605.20999"},"observation_digest":"sha256:7fc6d3ee6b03d04361933381a41041bfa10040d1ec3f5a98621a8586f2c360c2","observation_id":"c1e50c46-90fe-4333-b432-9c91bad7107f","resolution":{"observed_at":"2026-05-21T02:29:25.202488Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.00843","last_updated":"2019-09-02T19:47:47Z","snapshot_observed_at":"2026-08-02T20:54:09.031912Z","submitted_at":"2019-09-02T19:47:47Z","title":"Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent","version":1},"cited_work":{"arxiv_id":"1909.00843","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.00843","snapshot_observed_at":"2026-06-28T23:12:46.677051Z","title":"arXiv preprint arXiv:1909.00843 , year=","venue":null,"work_id":"0ce1f860-36ca-4d87-9497-bb0ec3c474e2","year":2019},"citing_paper":{"arxiv_id":"2605.31309","last_updated":"2026-05-29T13:41:01Z","snapshot_observed_at":"2026-08-02T14:22:06.907671Z","submitted_at":"2026-05-29T13:41:01Z","title":"Non-Asymptotic Convergence of Stochastic Iterative Algorithms: A Lyapunov Framework","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-28T23:11:02.699220Z"},"links":{"cited_paper":"/paper/1909.00843","citing_paper":"/paper/2605.31309"},"observation_digest":"sha256:316f745c26e6d230ffed41d47aa9cc80c439ca4f523699df81e39078c966488e","observation_id":"39043d7d-7c7d-4da8-9ad5-12ff19af82ff","resolution":{"observed_at":"2026-06-28T23:12:46.678577Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1909.00843/citation-record","integrity":"/paper/1909.00843/integrity","json":"/paper/1909.00843/citation-record.json","paper":"/paper/1909.00843"},"outbound":[],"paper":{"arxiv_id":"1909.00843","last_updated":"2019-09-02T19:47:47Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T20:54:09.031912Z","submitted_at":"2019-09-02T19:47:47Z","title":"Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1909.00843."}