{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:USOC4LQJ7BMXE4PJ5PRJDIV2AA","short_pith_number":"pith:USOC4LQJ","schema_version":"1.0","canonical_sha256":"a49c2e2e09f8597271e9ebe291a2ba002906f3d283bc8ba4ba7befe3fc9906c7","source":{"kind":"arxiv","id":"1504.02191","version":1},"attestation_state":"computed","paper":{"title":"`local' vs. `global' parameters -- breaking the gaussian complexity barrier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Shahar Mendelson","submitted_at":"2015-04-09T04:54:29Z","abstract_excerpt":"We show that if $F$ is a convex class of functions that is $L$-subgaussian, the error rate of learning problems generated by independent noise is equivalent to a fixed point determined by `local' covering estimates of the class, rather than by the gaussian averages. To that end, we establish new sharp upper and lower estimates on the error rate for such problems."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1504.02191","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-09T04:54:29Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"df78bcf79dc4f25c9bfaea2feba50bbc8f4c673699cce5ee36e35e4ae62b963a","abstract_canon_sha256":"1f9a3be049344214f6d6042a3792675864842d1c4ca1a14eda52c5b31dead43f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:15.805038Z","signature_b64":"+h8kseu7IUpMCFtrA3A41irZ0PdTwZGNN6IldR1gDDG7f378/CXemVhnoIlSUB0B89CLassyt8YrrHWYrDlaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a49c2e2e09f8597271e9ebe291a2ba002906f3d283bc8ba4ba7befe3fc9906c7","last_reissued_at":"2026-05-18T02:19:15.804446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:15.804446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"`local' vs. `global' parameters -- breaking the gaussian complexity barrier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Shahar Mendelson","submitted_at":"2015-04-09T04:54:29Z","abstract_excerpt":"We show that if $F$ is a convex class of functions that is $L$-subgaussian, the error rate of learning problems generated by independent noise is equivalent to a fixed point determined by `local' covering estimates of the class, rather than by the gaussian averages. To that end, we establish new sharp upper and lower estimates on the error rate for such problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02191","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.02191","created_at":"2026-05-18T02:19:15.804546+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02191v1","created_at":"2026-05-18T02:19:15.804546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02191","created_at":"2026-05-18T02:19:15.804546+00:00"},{"alias_kind":"pith_short_12","alias_value":"USOC4LQJ7BMX","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"USOC4LQJ7BMXE4PJ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"USOC4LQJ","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02088","citing_title":"On Least Squares Estimation under Heteroscedastic and Heavy-Tailed Errors","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/USOC4LQJ7BMXE4PJ5PRJDIV2AA","json":"https://pith.science/pith/USOC4LQJ7BMXE4PJ5PRJDIV2AA.json","graph_json":"https://pith.science/api/pith-number/USOC4LQJ7BMXE4PJ5PRJDIV2AA/graph.json","events_json":"https://pith.science/api/pith-number/USOC4LQJ7BMXE4PJ5PRJDIV2AA/events.json","paper":"https://pith.science/paper/USOC4LQJ"},"agent_actions":{"view_html":"https://pith.science/pith/USOC4LQJ7BMXE4PJ5PRJDIV2AA","download_json":"https://pith.science/pith/USOC4LQJ7BMXE4PJ5PRJDIV2AA.json","view_paper":"https://pith.science/paper/USOC4LQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02191&json=true","fetch_graph":"https://pith.science/api/pith-number/USOC4LQJ7BMXE4PJ5PRJDIV2AA/graph.json","fetch_events":"https://pith.science/api/pith-number/USOC4LQJ7BMXE4PJ5PRJDIV2AA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USOC4LQJ7BMXE4PJ5PRJDIV2AA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USOC4LQJ7BMXE4PJ5PRJDIV2AA/action/storage_attestation","attest_author":"https://pith.science/pith/USOC4LQJ7BMXE4PJ5PRJDIV2AA/action/author_attestation","sign_citation":"https://pith.science/pith/USOC4LQJ7BMXE4PJ5PRJDIV2AA/action/citation_signature","submit_replication":"https://pith.science/pith/USOC4LQJ7BMXE4PJ5PRJDIV2AA/action/replication_record"}},"created_at":"2026-05-18T02:19:15.804546+00:00","updated_at":"2026-05-18T02:19:15.804546+00:00"}