{"as_of":"2026-08-18T03:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:12426d8bf41517dacefdc085cc9091545497abcf18147f92838d9e93b20e0eae","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-17T06:30:58.91139+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-15T22:00:43.178901Z","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-06T21:27:28.450340Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1009.3896","last_updated":"2012-11-26T06:42:25Z","snapshot_observed_at":"2026-08-15T05:08:18.811569Z","submitted_at":"2010-09-20T17:35:35Z","title":"Optimistic Rates for Learning with a Smooth Loss","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1009.3896","snapshot_observed_at":"2026-08-14T05:12:14.286074Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1909.02088","last_updated":"2021-04-08T22:02:42Z","snapshot_observed_at":"2026-08-17T15:53:39.440729Z","submitted_at":"2019-09-04T20:21:02Z","title":"On Least Squares Estimation under Heteroscedastic and Heavy-Tailed Errors","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-14T05:12:14.286074Z"},"links":{"cited_paper":"/paper/1009.3896","citing_paper":"/paper/1909.02088"},"observation_digest":"sha256:10efc610a4a4f1c970af23426d43e962dbe5a3c8ba4f835ca8908400640e38b2","observation_id":"7da0709a-324c-4356-be2e-47ebc6d880a0","resolution":{"observed_at":"2026-08-14T05:12:14.286074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1009.3896","last_updated":"2012-11-26T06:42:25Z","snapshot_observed_at":"2026-08-15T05:08:18.811569Z","submitted_at":"2010-09-20T17:35:35Z","title":"Optimistic Rates for Learning with a Smooth Loss","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1009.3896","snapshot_observed_at":"2026-08-15T22:00:43.178901Z","title":"Op timistic rates for learning with a smooth loss","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.08557","last_updated":"2025-05-13T13:33:36Z","snapshot_observed_at":"2026-08-15T21:49:35.191126Z","submitted_at":"2025-05-13T13:33:36Z","title":"Online Learning and Unlearning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T22:00:43.178901Z"},"links":{"cited_paper":"/paper/1009.3896","citing_paper":"/paper/2505.08557"},"observation_digest":"sha256:ac67947ddc88242ab3530ef384743748684120745b5820a37906c44168a5de9d","observation_id":"6b2b718a-47a5-4ed8-90f4-a84d87ab8737","resolution":{"observed_at":"2026-08-15T22:00:43.178901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1009.3896","last_updated":"2012-11-26T06:42:25Z","snapshot_observed_at":"2026-08-15T05:08:18.811569Z","submitted_at":"2010-09-20T17:35:35Z","title":"Optimistic Rates for Learning with a Smooth Loss","version":2},"cited_work":{"arxiv_id":"1009.3896","doi":null,"metadata_source":"pith","pith_arxiv_id":"1009.3896","snapshot_observed_at":"2026-08-06T21:27:28.450340Z","title":"Optimistic Rates for Learning with a Smooth Loss","venue":"cs.LG","work_id":"e48bae50-3470-4ee8-b703-9d042e0f9759","year":2010},"citing_paper":{"arxiv_id":"2507.00195","last_updated":"2025-06-30T19:06:02Z","snapshot_observed_at":"2026-08-09T03:15:45.988757Z","submitted_at":"2025-06-30T19:06:02Z","title":"What Makes Local Updates Effective: The Role of Data Heterogeneity and Smoothness","version":1},"reference_index":134,"source":"pdf_text","source_observed_at":"2026-08-06T21:27:28.183351Z"},"links":{"cited_paper":"/paper/1009.3896","citing_paper":"/paper/2507.00195"},"observation_digest":"sha256:528cf085b749397d00c2da2baad2454f26e85221c365a6341bc7f9f42296b24c","observation_id":"7cb86362-89e1-45a7-a50a-9a67626fb49e","resolution":{"observed_at":"2026-08-06T21:27:28.453123Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1009.3896","last_updated":"2012-11-26T06:42:25Z","snapshot_observed_at":"2026-08-15T05:08:18.811569Z","submitted_at":"2010-09-20T17:35:35Z","title":"Optimistic Rates for Learning with a Smooth Loss","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1009.3896","snapshot_observed_at":"2026-07-30T19:35:40.334534Z","title":"Smoothness, Low-Noise and Fast Rates","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.26838","last_updated":"2026-07-29T12:27:29Z","snapshot_observed_at":"2026-08-17T22:25:13.530564Z","submitted_at":"2026-07-29T12:27:29Z","title":"Tight Generalization Bound for AdaBoost","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-30T19:35:40.334534Z"},"links":{"cited_paper":"/paper/1009.3896","citing_paper":"/paper/2607.26838"},"observation_digest":"sha256:c119942bd1579b6d45241c6115cfe857e2f69815100a279b90d8798c5fddc412","observation_id":"f19a6159-0fc2-4790-b4ce-92768b5bde74","resolution":{"observed_at":"2026-07-30T19:35:40.334534Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1009.3896","last_updated":"2012-11-26T06:42:25Z","snapshot_observed_at":"2026-08-15T05:08:18.811569Z","submitted_at":"2010-09-20T17:35:35Z","title":"Optimistic Rates for Learning with a Smooth Loss","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1009.3896","snapshot_observed_at":"2026-08-12T15:33:58.147019Z","title":"Optimistic rates for learning with a smooth loss, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.147019Z"},"links":{"cited_paper":"/paper/1009.3896","citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:f7f5106a32cb7e12fd6c6bba7d5752c09396e2c41de62f491ac41e8a31483904","observation_id":"ed43ea2f-260a-4a00-a3bb-dd6d076de50e","resolution":{"observed_at":"2026-08-12T15:33:58.147019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1009.3896/citation-record","integrity":"/paper/1009.3896/integrity","json":"/paper/1009.3896/citation-record.json","paper":"/paper/1009.3896"},"outbound":[],"paper":{"arxiv_id":"1009.3896","last_updated":"2012-11-26T06:42:25Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T05:08:18.811569Z","submitted_at":"2010-09-20T17:35:35Z","title":"Optimistic Rates for Learning with a Smooth Loss"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:1009.3896."}