{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TCRHGFZY3NFF3JMF6TMV57OXEI","short_pith_number":"pith:TCRHGFZY","canonical_record":{"source":{"id":"1610.03592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-12T03:46:00Z","cross_cats_sorted":["cs.DM","cs.LO","math.CO","math.LO"],"title_canon_sha256":"e848ebd25e1d7b0f31fb5c485d904c32fa1c43158e0097a370c207aa16cd32c7","abstract_canon_sha256":"0f63c1feb7afc207248e7779c0a1ba99350c9b030c93088c5d7ae6f338abf172"},"schema_version":"1.0"},"canonical_sha256":"98a2731738db4a5da585f4d95efdd72228ff5d809cfa22440cbffb037e217300","source":{"kind":"arxiv","id":"1610.03592","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03592","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03592v2","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03592","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"TCRHGFZY3NFF","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TCRHGFZY3NFF3JMF","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TCRHGFZY","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TCRHGFZY3NFF3JMF6TMV57OXEI","target":"record","payload":{"canonical_record":{"source":{"id":"1610.03592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-12T03:46:00Z","cross_cats_sorted":["cs.DM","cs.LO","math.CO","math.LO"],"title_canon_sha256":"e848ebd25e1d7b0f31fb5c485d904c32fa1c43158e0097a370c207aa16cd32c7","abstract_canon_sha256":"0f63c1feb7afc207248e7779c0a1ba99350c9b030c93088c5d7ae6f338abf172"},"schema_version":"1.0"},"canonical_sha256":"98a2731738db4a5da585f4d95efdd72228ff5d809cfa22440cbffb037e217300","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:41.988924Z","signature_b64":"+KHKpWSItxy5LJV1MXEwYKmFH8tU3YDPfpIkp4sgg16UXLRAh0eAUzQZG6xwQIq9JBe5evZ1/B27fqPX7QZsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98a2731738db4a5da585f4d95efdd72228ff5d809cfa22440cbffb037e217300","last_reissued_at":"2026-05-18T00:53:41.988490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:41.988490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.03592","source_version":2,"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-18T00:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITe7nPJlpgGS6PSvzVlFQFEMsE4VOJojsGeVrQqgZaq7+S09kS6k7jB2QqKxeZVewk2M1x1cdbZ72T1t0GjuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:47:20.592352Z"},"content_sha256":"9ea8f73a67b185d0e2a0b3ea0e9cde22af7febaf7662ed7ba0baabc02222fc3f","schema_version":"1.0","event_id":"sha256:9ea8f73a67b185d0e2a0b3ea0e9cde22af7febaf7662ed7ba0baabc02222fc3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TCRHGFZY3NFF3JMF6TMV57OXEI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On statistical learning via the lens of compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LO","math.CO","math.LO"],"primary_cat":"cs.LG","authors_text":"Amir Yehudayoff, Ofir David, Shay Moran","submitted_at":"2016-10-12T03:46:00Z","abstract_excerpt":"This work continues the study of the relationship between sample compression schemes and statistical learning, which has been mostly investigated within the framework of binary classification. The central theme of this work is establishing equivalences between learnability and compressibility, and utilizing these equivalences in the study of statistical learning theory.\n  We begin with the setting of multiclass categorization (zero/one loss). We prove that in this case learnability is equivalent to compression of logarithmic sample size, and that uniform convergence implies compression of cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03592","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"},"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-18T00:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MgNt7CsvHxaLXvaapCrc0QrRJA1ZAJQ3cSLv2+mj1+qsYxvtGXzj0ThpH/RkEVb1XHux0XogHcBHfosQbk6nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:47:20.592959Z"},"content_sha256":"4130eced025844506e01842f6a6307ba0c0363d8291c27af9d7267db727fe03d","schema_version":"1.0","event_id":"sha256:4130eced025844506e01842f6a6307ba0c0363d8291c27af9d7267db727fe03d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCRHGFZY3NFF3JMF6TMV57OXEI/bundle.json","state_url":"https://pith.science/pith/TCRHGFZY3NFF3JMF6TMV57OXEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCRHGFZY3NFF3JMF6TMV57OXEI/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-31T14:47:20Z","links":{"resolver":"https://pith.science/pith/TCRHGFZY3NFF3JMF6TMV57OXEI","bundle":"https://pith.science/pith/TCRHGFZY3NFF3JMF6TMV57OXEI/bundle.json","state":"https://pith.science/pith/TCRHGFZY3NFF3JMF6TMV57OXEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCRHGFZY3NFF3JMF6TMV57OXEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TCRHGFZY3NFF3JMF6TMV57OXEI","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":"0f63c1feb7afc207248e7779c0a1ba99350c9b030c93088c5d7ae6f338abf172","cross_cats_sorted":["cs.DM","cs.LO","math.CO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-12T03:46:00Z","title_canon_sha256":"e848ebd25e1d7b0f31fb5c485d904c32fa1c43158e0097a370c207aa16cd32c7"},"schema_version":"1.0","source":{"id":"1610.03592","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03592","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03592v2","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03592","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"TCRHGFZY3NFF","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TCRHGFZY3NFF3JMF","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TCRHGFZY","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:4130eced025844506e01842f6a6307ba0c0363d8291c27af9d7267db727fe03d","target":"graph","created_at":"2026-05-18T00:53:41Z","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":"This work continues the study of the relationship between sample compression schemes and statistical learning, which has been mostly investigated within the framework of binary classification. The central theme of this work is establishing equivalences between learnability and compressibility, and utilizing these equivalences in the study of statistical learning theory.\n  We begin with the setting of multiclass categorization (zero/one loss). We prove that in this case learnability is equivalent to compression of logarithmic sample size, and that uniform convergence implies compression of cons","authors_text":"Amir Yehudayoff, Ofir David, Shay Moran","cross_cats":["cs.DM","cs.LO","math.CO","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-12T03:46:00Z","title":"On statistical learning via the lens of compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03592","kind":"arxiv","version":2},"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:9ea8f73a67b185d0e2a0b3ea0e9cde22af7febaf7662ed7ba0baabc02222fc3f","target":"record","created_at":"2026-05-18T00:53:41Z","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":"0f63c1feb7afc207248e7779c0a1ba99350c9b030c93088c5d7ae6f338abf172","cross_cats_sorted":["cs.DM","cs.LO","math.CO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-12T03:46:00Z","title_canon_sha256":"e848ebd25e1d7b0f31fb5c485d904c32fa1c43158e0097a370c207aa16cd32c7"},"schema_version":"1.0","source":{"id":"1610.03592","kind":"arxiv","version":2}},"canonical_sha256":"98a2731738db4a5da585f4d95efdd72228ff5d809cfa22440cbffb037e217300","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98a2731738db4a5da585f4d95efdd72228ff5d809cfa22440cbffb037e217300","first_computed_at":"2026-05-18T00:53:41.988490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:41.988490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+KHKpWSItxy5LJV1MXEwYKmFH8tU3YDPfpIkp4sgg16UXLRAh0eAUzQZG6xwQIq9JBe5evZ1/B27fqPX7QZsCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:41.988924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03592","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ea8f73a67b185d0e2a0b3ea0e9cde22af7febaf7662ed7ba0baabc02222fc3f","sha256:4130eced025844506e01842f6a6307ba0c0363d8291c27af9d7267db727fe03d"],"state_sha256":"1337ab0fe59233138a280f6176ff061252258173e89c060abaade2f845da0f22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2FhF33beo+h4aWNrKaS18f78uKKBXRglm21N6SXpxLFhrof5HTlL1QOHHZlwGW1tL/yAjvv63il7QK2hHO0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:47:20.596550Z","bundle_sha256":"9c101034f6c7a1018635f4ef0cd042ff7b3b3b53da96182dc2fba5ba773d60f1"}}