{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BKQ7BLPSYMAPGVHDVKIOOR3ZIX","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":"ef0f6ac12ab978976903ffbc6dde9e84e6fd2f4aac0fa312ce5ada0ea111d769","cross_cats_sorted":["cs.AI","cs.CR","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-14T20:40:46Z","title_canon_sha256":"a272f7f2e14644f0b39ef8b064e58705a270b75f51e12bdec63e825f16ad7212"},"schema_version":"1.0","source":{"id":"1710.05233","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05233","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05233v3","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05233","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"pith_short_12","alias_value":"BKQ7BLPSYMAP","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BKQ7BLPSYMAPGVHD","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BKQ7BLPS","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:7350676c0734511c2e96d8ae4133e11c7f32c286b1317270146a84532c068671","target":"graph","created_at":"2026-05-18T00:22:20Z","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":"We study learning algorithms that are restricted to using a small amount of information from their input sample. We introduce a category of learning algorithms we term $d$-bit information learners, which are algorithms whose output conveys at most $d$ bits of information of their input. A central theme in this work is that such algorithms generalize.\n  We focus on the learning capacity of these algorithms, and prove sample complexity bounds with tight dependencies on the confidence and error parameters. We also observe connections with well studied notions such as sample compression schemes, O","authors_text":"Amir Yehudayoff, Ido Nachum, Jonathan Shafer, Raef Bassily, Shay Moran","cross_cats":["cs.AI","cs.CR","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-14T20:40:46Z","title":"Learners that Use Little Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05233","kind":"arxiv","version":3},"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:3992fbbbd9d891acdeed1737c4a42d38ed8fccae26749d65f3e8256b1b656c03","target":"record","created_at":"2026-05-18T00:22:20Z","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":"ef0f6ac12ab978976903ffbc6dde9e84e6fd2f4aac0fa312ce5ada0ea111d769","cross_cats_sorted":["cs.AI","cs.CR","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-14T20:40:46Z","title_canon_sha256":"a272f7f2e14644f0b39ef8b064e58705a270b75f51e12bdec63e825f16ad7212"},"schema_version":"1.0","source":{"id":"1710.05233","kind":"arxiv","version":3}},"canonical_sha256":"0aa1f0adf2c300f354e3aa90e7477945ef29d3df87012cf23fd596101634a33c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0aa1f0adf2c300f354e3aa90e7477945ef29d3df87012cf23fd596101634a33c","first_computed_at":"2026-05-18T00:22:20.661845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:20.661845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dYHxMbEtpG7E/EA3IGtsAbNC+JXgYXmpFJSAjGZH5uogdTXHMZQsLv5es3GevpZaSS9wsnH0s+VECgp7nTywCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:20.662475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05233","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3992fbbbd9d891acdeed1737c4a42d38ed8fccae26749d65f3e8256b1b656c03","sha256:7350676c0734511c2e96d8ae4133e11c7f32c286b1317270146a84532c068671"],"state_sha256":"4f2b0b39cceaa80bac68eaf3c2c75a7c62ab9f728095ca64ba506f8e1a0e0251"}