{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:COJEWYT3ED4FUBO773PXT4CIM7","short_pith_number":"pith:COJEWYT3","schema_version":"1.0","canonical_sha256":"13924b627b20f85a05dffedf79f04867ea84ad9f22bb55132cedf2f4d5cf102c","source":{"kind":"arxiv","id":"1811.09923","version":1},"attestation_state":"computed","paper":{"title":"Average-Case Information Complexity of Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amir Yehudayoff, Ido Nachum","submitted_at":"2018-11-25T01:47:24Z","abstract_excerpt":"How many bits of information are revealed by a learning algorithm for a concept class of VC-dimension $d$? Previous works have shown that even for $d=1$ the amount of information may be unbounded (tend to $\\infty$ with the universe size). Can it be that all concepts in the class require leaking a large amount of information? We show that typically concepts do not require leakage. There exists a proper learning algorithm that reveals $O(d)$ bits of information for most concepts in the class. This result is a special case of a more general phenomenon we explore. If there is a low information lea"},"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":"1811.09923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-25T01:47:24Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"188b138f44c5ef0711d177340cf95f6e9c00737dc36443860ea65d8d870bc9fb","abstract_canon_sha256":"2617be12ead7dfaf8fb274b301358dcca9fdd560bd53e8ea9b3920d006ada511"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:59.113192Z","signature_b64":"XoCJxvbXfPRzJNX3odm9OtgTFHq1Mh6Q1XdNWsxM+/T8c/PDl/h+/E8yByabIWYaBoIqfIND2L1WvkUq9RrtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13924b627b20f85a05dffedf79f04867ea84ad9f22bb55132cedf2f4d5cf102c","last_reissued_at":"2026-05-17T23:59:59.112693Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:59.112693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average-Case Information Complexity of Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amir Yehudayoff, Ido Nachum","submitted_at":"2018-11-25T01:47:24Z","abstract_excerpt":"How many bits of information are revealed by a learning algorithm for a concept class of VC-dimension $d$? Previous works have shown that even for $d=1$ the amount of information may be unbounded (tend to $\\infty$ with the universe size). Can it be that all concepts in the class require leaking a large amount of information? We show that typically concepts do not require leakage. There exists a proper learning algorithm that reveals $O(d)$ bits of information for most concepts in the class. This result is a special case of a more general phenomenon we explore. If there is a low information lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09923","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":"1811.09923","created_at":"2026-05-17T23:59:59.112761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.09923v1","created_at":"2026-05-17T23:59:59.112761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09923","created_at":"2026-05-17T23:59:59.112761+00:00"},{"alias_kind":"pith_short_12","alias_value":"COJEWYT3ED4F","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"COJEWYT3ED4FUBO7","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"COJEWYT3","created_at":"2026-05-18T12:32:16.446611+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/COJEWYT3ED4FUBO773PXT4CIM7","json":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7.json","graph_json":"https://pith.science/api/pith-number/COJEWYT3ED4FUBO773PXT4CIM7/graph.json","events_json":"https://pith.science/api/pith-number/COJEWYT3ED4FUBO773PXT4CIM7/events.json","paper":"https://pith.science/paper/COJEWYT3"},"agent_actions":{"view_html":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7","download_json":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7.json","view_paper":"https://pith.science/paper/COJEWYT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.09923&json=true","fetch_graph":"https://pith.science/api/pith-number/COJEWYT3ED4FUBO773PXT4CIM7/graph.json","fetch_events":"https://pith.science/api/pith-number/COJEWYT3ED4FUBO773PXT4CIM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7/action/storage_attestation","attest_author":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7/action/author_attestation","sign_citation":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7/action/citation_signature","submit_replication":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7/action/replication_record"}},"created_at":"2026-05-17T23:59:59.112761+00:00","updated_at":"2026-05-17T23:59:59.112761+00:00"}