{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:COJEWYT3ED4FUBO773PXT4CIM7","short_pith_number":"pith:COJEWYT3","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"},"canonical_sha256":"13924b627b20f85a05dffedf79f04867ea84ad9f22bb55132cedf2f4d5cf102c","source":{"kind":"arxiv","id":"1811.09923","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09923","created_at":"2026-05-17T23:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09923v1","created_at":"2026-05-17T23:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09923","created_at":"2026-05-17T23:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"COJEWYT3ED4F","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"COJEWYT3ED4FUBO7","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"COJEWYT3","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:COJEWYT3ED4FUBO773PXT4CIM7","target":"record","payload":{"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"},"canonical_sha256":"13924b627b20f85a05dffedf79f04867ea84ad9f22bb55132cedf2f4d5cf102c","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"},"source_kind":"arxiv","source_id":"1811.09923","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7eFXaAGqSRmNhwTTtVwjszY0d1ccwr9hi3q7CLeBbamvNh9mEbjzBQbgz+248ufssA+iqUGepUahNMxex3lCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:33:07.407510Z"},"content_sha256":"c38a9c0ba2b1ec68e42b05e1447ca6963474cee5868b492438d805f82c222d1c","schema_version":"1.0","event_id":"sha256:c38a9c0ba2b1ec68e42b05e1447ca6963474cee5868b492438d805f82c222d1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:COJEWYT3ED4FUBO773PXT4CIM7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DHXocEkkOJlezHQIIAphd3UNFappvLEVN9I3H+Kg32vFhydgYsj9i7Vs+GYzNu1gT9cUrfk7umu51f7c17dEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:33:07.408761Z"},"content_sha256":"44d23b9be7ae3695363aa44a12abcd2a2add2441edadeea1f22204d0dd3daa31","schema_version":"1.0","event_id":"sha256:44d23b9be7ae3695363aa44a12abcd2a2add2441edadeea1f22204d0dd3daa31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7/bundle.json","state_url":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COJEWYT3ED4FUBO773PXT4CIM7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T07:33:07Z","links":{"resolver":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7","bundle":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7/bundle.json","state":"https://pith.science/pith/COJEWYT3ED4FUBO773PXT4CIM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COJEWYT3ED4FUBO773PXT4CIM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:COJEWYT3ED4FUBO773PXT4CIM7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2617be12ead7dfaf8fb274b301358dcca9fdd560bd53e8ea9b3920d006ada511","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-25T01:47:24Z","title_canon_sha256":"188b138f44c5ef0711d177340cf95f6e9c00737dc36443860ea65d8d870bc9fb"},"schema_version":"1.0","source":{"id":"1811.09923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09923","created_at":"2026-05-17T23:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09923v1","created_at":"2026-05-17T23:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09923","created_at":"2026-05-17T23:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"COJEWYT3ED4F","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"COJEWYT3ED4FUBO7","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"COJEWYT3","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:44d23b9be7ae3695363aa44a12abcd2a2add2441edadeea1f22204d0dd3daa31","target":"graph","created_at":"2026-05-17T23:59:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amir Yehudayoff, Ido Nachum","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-25T01:47:24Z","title":"Average-Case Information Complexity of Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09923","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c38a9c0ba2b1ec68e42b05e1447ca6963474cee5868b492438d805f82c222d1c","target":"record","created_at":"2026-05-17T23:59:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2617be12ead7dfaf8fb274b301358dcca9fdd560bd53e8ea9b3920d006ada511","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-25T01:47:24Z","title_canon_sha256":"188b138f44c5ef0711d177340cf95f6e9c00737dc36443860ea65d8d870bc9fb"},"schema_version":"1.0","source":{"id":"1811.09923","kind":"arxiv","version":1}},"canonical_sha256":"13924b627b20f85a05dffedf79f04867ea84ad9f22bb55132cedf2f4d5cf102c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13924b627b20f85a05dffedf79f04867ea84ad9f22bb55132cedf2f4d5cf102c","first_computed_at":"2026-05-17T23:59:59.112693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:59.112693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XoCJxvbXfPRzJNX3odm9OtgTFHq1Mh6Q1XdNWsxM+/T8c/PDl/h+/E8yByabIWYaBoIqfIND2L1WvkUq9RrtDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:59.113192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.09923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c38a9c0ba2b1ec68e42b05e1447ca6963474cee5868b492438d805f82c222d1c","sha256:44d23b9be7ae3695363aa44a12abcd2a2add2441edadeea1f22204d0dd3daa31"],"state_sha256":"ff4c0358aa620f28cc8cd3d115009ce926ad0d3d7e1c2669ba64b9a5e3338aae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qbwl1rY7kwPqO2X5mw92okdIWS0c6de7jPSV3Wnp62EGoMsk40NLg1U1Po8+5SjF9QyQMvcCg0wb2TISe8rSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:33:07.413140Z","bundle_sha256":"e8404b5c4fa089668e0b2575bd759a45527ce7c5a50cf629b20812162defb9ff"}}