{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OTHB6R25JDJ26TYNH6RALEHZYW","short_pith_number":"pith:OTHB6R25","canonical_record":{"source":{"id":"2505.17469","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-23T04:50:33Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"4a099f81d3640216c28b8b2c1188ca08b29d5cdf36b3f30208ed65dd410dab45","abstract_canon_sha256":"231083c30d03ded8305aea3e84afd27bc2b5b510325acdd7aa0d6048050f1a23"},"schema_version":"1.0"},"canonical_sha256":"74ce1f475d48d3af4f0d3fa20590f9c59eef5936af4edf1a11e67312445ffe51","source":{"kind":"arxiv","id":"2505.17469","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17469","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17469v2","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17469","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"OTHB6R25JDJ2","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"OTHB6R25JDJ26TYN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"OTHB6R25","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OTHB6R25JDJ26TYNH6RALEHZYW","target":"record","payload":{"canonical_record":{"source":{"id":"2505.17469","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-23T04:50:33Z","cross_cats_sorted":["cs.AI","cs.IT","math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"4a099f81d3640216c28b8b2c1188ca08b29d5cdf36b3f30208ed65dd410dab45","abstract_canon_sha256":"231083c30d03ded8305aea3e84afd27bc2b5b510325acdd7aa0d6048050f1a23"},"schema_version":"1.0"},"canonical_sha256":"74ce1f475d48d3af4f0d3fa20590f9c59eef5936af4edf1a11e67312445ffe51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:13.852748Z","signature_b64":"okW+c2DSJu0WuQcY4x1pHaXyHtxzgZEV9vVIV31x2YNTeUqGACdsk8YNAKBCiGD0LdVFNCCZwJ43a2MoZ/9/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74ce1f475d48d3af4f0d3fa20590f9c59eef5936af4edf1a11e67312445ffe51","last_reissued_at":"2026-05-18T02:45:13.852247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:13.852247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.17469","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-18T02:45:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1SqPIR35oclJ7FUjbcsquZYlmh7gJh+AKqMYk4SUSmigX1ptvUXCHGSrwHh5yu0s9U2UIY6UjjyXWAL/X1JeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:45:14.618155Z"},"content_sha256":"3ef2ac6605b77e1e5d02756c2f5401807abfb98646d454992c93120787dd13f5","schema_version":"1.0","event_id":"sha256:3ef2ac6605b77e1e5d02756c2f5401807abfb98646d454992c93120787dd13f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OTHB6R25JDJ26TYNH6RALEHZYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient compression of neural networks and datasets","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.IT","math.IT","math.OC","math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Lukas Silvester Barth, Paulo von Petersenn","submitted_at":"2025-05-23T04:50:33Z","abstract_excerpt":"Compression and generalization are fundamentally related through Solomonoff induction and the minimum description length principle (MDL), which predict that simpler models generalize better when data arises from low-complexity distributions. In this article, we combine insights from algorithmic information theory and techniques from neural network pruning to improve model generalization by identifying the most effective data compression method. Since exact MDL optimization is intractable, we cast it as $\\ell_0$ regularized learning and explain why parameter sparsity provides an effective compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17469","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-18T02:45:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjQyjwocHH4b7jdQVnplb0Iw4wRnf4HSMQb3qczRshUjyxF2yljsze+xLwuP3lZsdzBQhgKCicPdGidgQHBgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:45:14.618820Z"},"content_sha256":"3647a677e4a9e618fea3bd8b82c1eaa92463a68d1852c300c6995c1738ed1a6a","schema_version":"1.0","event_id":"sha256:3647a677e4a9e618fea3bd8b82c1eaa92463a68d1852c300c6995c1738ed1a6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTHB6R25JDJ26TYNH6RALEHZYW/bundle.json","state_url":"https://pith.science/pith/OTHB6R25JDJ26TYNH6RALEHZYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTHB6R25JDJ26TYNH6RALEHZYW/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-20T16:45:14Z","links":{"resolver":"https://pith.science/pith/OTHB6R25JDJ26TYNH6RALEHZYW","bundle":"https://pith.science/pith/OTHB6R25JDJ26TYNH6RALEHZYW/bundle.json","state":"https://pith.science/pith/OTHB6R25JDJ26TYNH6RALEHZYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTHB6R25JDJ26TYNH6RALEHZYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OTHB6R25JDJ26TYNH6RALEHZYW","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":"231083c30d03ded8305aea3e84afd27bc2b5b510325acdd7aa0d6048050f1a23","cross_cats_sorted":["cs.AI","cs.IT","math.IT","math.OC","math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-23T04:50:33Z","title_canon_sha256":"4a099f81d3640216c28b8b2c1188ca08b29d5cdf36b3f30208ed65dd410dab45"},"schema_version":"1.0","source":{"id":"2505.17469","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17469","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17469v2","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17469","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"OTHB6R25JDJ2","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"OTHB6R25JDJ26TYN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"OTHB6R25","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:3647a677e4a9e618fea3bd8b82c1eaa92463a68d1852c300c6995c1738ed1a6a","target":"graph","created_at":"2026-05-18T02:45:13Z","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":"Compression and generalization are fundamentally related through Solomonoff induction and the minimum description length principle (MDL), which predict that simpler models generalize better when data arises from low-complexity distributions. In this article, we combine insights from algorithmic information theory and techniques from neural network pruning to improve model generalization by identifying the most effective data compression method. Since exact MDL optimization is intractable, we cast it as $\\ell_0$ regularized learning and explain why parameter sparsity provides an effective compu","authors_text":"Lukas Silvester Barth, Paulo von Petersenn","cross_cats":["cs.AI","cs.IT","math.IT","math.OC","math.ST","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-23T04:50:33Z","title":"Efficient compression of neural networks and datasets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17469","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:3ef2ac6605b77e1e5d02756c2f5401807abfb98646d454992c93120787dd13f5","target":"record","created_at":"2026-05-18T02:45:13Z","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":"231083c30d03ded8305aea3e84afd27bc2b5b510325acdd7aa0d6048050f1a23","cross_cats_sorted":["cs.AI","cs.IT","math.IT","math.OC","math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-23T04:50:33Z","title_canon_sha256":"4a099f81d3640216c28b8b2c1188ca08b29d5cdf36b3f30208ed65dd410dab45"},"schema_version":"1.0","source":{"id":"2505.17469","kind":"arxiv","version":2}},"canonical_sha256":"74ce1f475d48d3af4f0d3fa20590f9c59eef5936af4edf1a11e67312445ffe51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74ce1f475d48d3af4f0d3fa20590f9c59eef5936af4edf1a11e67312445ffe51","first_computed_at":"2026-05-18T02:45:13.852247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:13.852247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"okW+c2DSJu0WuQcY4x1pHaXyHtxzgZEV9vVIV31x2YNTeUqGACdsk8YNAKBCiGD0LdVFNCCZwJ43a2MoZ/9/BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:13.852748Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.17469","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ef2ac6605b77e1e5d02756c2f5401807abfb98646d454992c93120787dd13f5","sha256:3647a677e4a9e618fea3bd8b82c1eaa92463a68d1852c300c6995c1738ed1a6a"],"state_sha256":"e4ecc913e66a63551c6c6045005de43bdc23957e391f4f084b0471bf3382bd46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vSYYcYs9LSUBvDi3ucXbOo/8wYk+b7sDMPhUGuX9u96iSpU+/nD0WrKWjvlAGgUdskqybEUFeMty7u/cvB+/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T16:45:14.621913Z","bundle_sha256":"d0d8dd794ead03e75f9e869b125062e5b222a3d143758d3a1170394c64555cb6"}}