{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VFPVAOQG5XPXJDXESC2EBMAFNU","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":"2eca10a9ccb5e76230c4d3d5447bcca7019a6c1e736e115fa46a76b6de0e7c5e","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T19:54:42Z","title_canon_sha256":"5facb5ded07eb5f7cbc2013988887320d32a8d4316964ad7a41dac7572c935ae"},"schema_version":"1.0","source":{"id":"1909.09706","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.09706","created_at":"2026-07-05T00:29:20Z"},{"alias_kind":"arxiv_version","alias_value":"1909.09706v2","created_at":"2026-07-05T00:29:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.09706","created_at":"2026-07-05T00:29:20Z"},{"alias_kind":"pith_short_12","alias_value":"VFPVAOQG5XPX","created_at":"2026-07-05T00:29:20Z"},{"alias_kind":"pith_short_16","alias_value":"VFPVAOQG5XPXJDXE","created_at":"2026-07-05T00:29:20Z"},{"alias_kind":"pith_short_8","alias_value":"VFPVAOQG","created_at":"2026-07-05T00:29:20Z"}],"graph_snapshots":[{"event_id":"sha256:f4d00d36340bb9c9d7d964839245913fa52a9ac520a99ac979778b013f0a1469","target":"graph","created_at":"2026-07-05T00:29: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.09706/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the most studied problems in machine learning is finding reasonable constraints that guarantee the generalization of a learning algorithm. These constraints are usually expressed as some simplicity assumptions on the target. For instance, in the Vapnik-Chervonenkis (VC) theory the space of possible hypotheses is considered to have a limited VC dimension. In this paper, the constraint on the entropy $H(X)$ of the input variable $X$ is studied as a simplicity assumption. It is proven that the sample complexity to achieve an $\\epsilon$-$\\delta$ Probably Approximately Correct (PAC) hypothes","authors_text":"Hassan Hafez-Kolahi, Mahdiyeh Soleymani-Baghshah, Shohreh Kasaei","cross_cats":["cs.AI","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T19:54:42Z","title":"Do Compressed Representations Generalize Better?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.09706","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:206e975835fc5befc8b94c3aeb1cd8812d4255aaf881294e48a885ec8013b569","target":"record","created_at":"2026-07-05T00:29: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":"2eca10a9ccb5e76230c4d3d5447bcca7019a6c1e736e115fa46a76b6de0e7c5e","cross_cats_sorted":["cs.AI","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T19:54:42Z","title_canon_sha256":"5facb5ded07eb5f7cbc2013988887320d32a8d4316964ad7a41dac7572c935ae"},"schema_version":"1.0","source":{"id":"1909.09706","kind":"arxiv","version":2}},"canonical_sha256":"a95f503a06eddf748ee490b440b0056d0f04732d81110fc1b231ef199da95665","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a95f503a06eddf748ee490b440b0056d0f04732d81110fc1b231ef199da95665","first_computed_at":"2026-07-05T00:29:20.708870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:29:20.708870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JK51Pg009TGeifn4AihA+9tCEI8dwRB8+PrPoRHVEYKfdQbBo0/JBnclzLIX/LwJQpQ/2tZ9e3eMzuCK1LVtDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:29:20.709244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.09706","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:206e975835fc5befc8b94c3aeb1cd8812d4255aaf881294e48a885ec8013b569","sha256:f4d00d36340bb9c9d7d964839245913fa52a9ac520a99ac979778b013f0a1469"],"state_sha256":"d531c3b0d8b720af374eb332036870ab924f37874661749a03a2007c3ab6e355"}