{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:G2IWHOOPSFGIILKZIKHLB37JFL","short_pith_number":"pith:G2IWHOOP","schema_version":"1.0","canonical_sha256":"369163b9cf914c842d59428eb0efe92af26b67707e153cc190cc93aaaf6ec710","source":{"kind":"arxiv","id":"1311.2272","version":2},"attestation_state":"computed","paper":{"title":"From average case complexity to improper learning complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LG","authors_text":"Amit Daniely, Nati Linial, Shai Shalev-Shwartz","submitted_at":"2013-11-10T13:35:50Z","abstract_excerpt":"The basic problem in the PAC model of computational learning theory is to determine which hypothesis classes are efficiently learnable. There is presently a dearth of results showing hardness of learning problems. Moreover, the existing lower bounds fall short of the best known algorithms.\n  The biggest challenge in proving complexity results is to establish hardness of {\\em improper learning} (a.k.a. representation independent learning).The difficulty in proving lower bounds for improper learning is that the standard reductions from $\\mathbf{NP}$-hard problems do not seem to apply in this con"},"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":"1311.2272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-10T13:35:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"8192e03fa86378dbc25721d5696ce4c2629f24c553f996929c533439423ddf6f","abstract_canon_sha256":"bff7c702fee0d856294996c23361ed29a349fd78d54c8e2704b330908196e549"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:51.710539Z","signature_b64":"DG+73pib8reWg1tPrbni9z4IQNzWhSUyuSlz8ORUH1fsjy5/7Z1o0YTTolQa3NRY2FJ94bhZkUoa6K31LmPkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"369163b9cf914c842d59428eb0efe92af26b67707e153cc190cc93aaaf6ec710","last_reissued_at":"2026-05-18T02:56:51.710112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:51.710112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From average case complexity to improper learning complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LG","authors_text":"Amit Daniely, Nati Linial, Shai Shalev-Shwartz","submitted_at":"2013-11-10T13:35:50Z","abstract_excerpt":"The basic problem in the PAC model of computational learning theory is to determine which hypothesis classes are efficiently learnable. There is presently a dearth of results showing hardness of learning problems. Moreover, the existing lower bounds fall short of the best known algorithms.\n  The biggest challenge in proving complexity results is to establish hardness of {\\em improper learning} (a.k.a. representation independent learning).The difficulty in proving lower bounds for improper learning is that the standard reductions from $\\mathbf{NP}$-hard problems do not seem to apply in this con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2272","kind":"arxiv","version":2},"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":"1311.2272","created_at":"2026-05-18T02:56:51.710178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2272v2","created_at":"2026-05-18T02:56:51.710178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2272","created_at":"2026-05-18T02:56:51.710178+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2IWHOOPSFGI","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2IWHOOPSFGIILKZ","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2IWHOOP","created_at":"2026-05-18T12:27:45.050594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G2IWHOOPSFGIILKZIKHLB37JFL","json":"https://pith.science/pith/G2IWHOOPSFGIILKZIKHLB37JFL.json","graph_json":"https://pith.science/api/pith-number/G2IWHOOPSFGIILKZIKHLB37JFL/graph.json","events_json":"https://pith.science/api/pith-number/G2IWHOOPSFGIILKZIKHLB37JFL/events.json","paper":"https://pith.science/paper/G2IWHOOP"},"agent_actions":{"view_html":"https://pith.science/pith/G2IWHOOPSFGIILKZIKHLB37JFL","download_json":"https://pith.science/pith/G2IWHOOPSFGIILKZIKHLB37JFL.json","view_paper":"https://pith.science/paper/G2IWHOOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2272&json=true","fetch_graph":"https://pith.science/api/pith-number/G2IWHOOPSFGIILKZIKHLB37JFL/graph.json","fetch_events":"https://pith.science/api/pith-number/G2IWHOOPSFGIILKZIKHLB37JFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2IWHOOPSFGIILKZIKHLB37JFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2IWHOOPSFGIILKZIKHLB37JFL/action/storage_attestation","attest_author":"https://pith.science/pith/G2IWHOOPSFGIILKZIKHLB37JFL/action/author_attestation","sign_citation":"https://pith.science/pith/G2IWHOOPSFGIILKZIKHLB37JFL/action/citation_signature","submit_replication":"https://pith.science/pith/G2IWHOOPSFGIILKZIKHLB37JFL/action/replication_record"}},"created_at":"2026-05-18T02:56:51.710178+00:00","updated_at":"2026-05-18T02:56:51.710178+00:00"}