{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ONEMMV2ZWASHSXXNEMVMSTPKS2","short_pith_number":"pith:ONEMMV2Z","canonical_record":{"source":{"id":"2006.10189","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-06-17T22:45:14Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"34529680300f0083bc4a4c250ca638c0c40ce58c38716d6cf1e2e448be8be970","abstract_canon_sha256":"534d3713194ad4cf58ff86d466ed9d0d0cfe8195171319853fa3ba76d225c77c"},"schema_version":"1.0"},"canonical_sha256":"7348c65759b024795eed232ac94dea96a938f7dd30410a4b250e7e04877f3d4f","source":{"kind":"arxiv","id":"2006.10189","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.10189","created_at":"2026-07-05T07:00:17Z"},{"alias_kind":"arxiv_version","alias_value":"2006.10189v4","created_at":"2026-07-05T07:00:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.10189","created_at":"2026-07-05T07:00:17Z"},{"alias_kind":"pith_short_12","alias_value":"ONEMMV2ZWASH","created_at":"2026-07-05T07:00:17Z"},{"alias_kind":"pith_short_16","alias_value":"ONEMMV2ZWASHSXXN","created_at":"2026-07-05T07:00:17Z"},{"alias_kind":"pith_short_8","alias_value":"ONEMMV2Z","created_at":"2026-07-05T07:00:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ONEMMV2ZWASHSXXNEMVMSTPKS2","target":"record","payload":{"canonical_record":{"source":{"id":"2006.10189","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-06-17T22:45:14Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"34529680300f0083bc4a4c250ca638c0c40ce58c38716d6cf1e2e448be8be970","abstract_canon_sha256":"534d3713194ad4cf58ff86d466ed9d0d0cfe8195171319853fa3ba76d225c77c"},"schema_version":"1.0"},"canonical_sha256":"7348c65759b024795eed232ac94dea96a938f7dd30410a4b250e7e04877f3d4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:00:17.798856Z","signature_b64":"2AxPmmfMnOi64yMpak4Ugr4lLRkvNbeMODm+FNyyPkGt9DjwTCt/L/7nDilST2VFrrZJHkm3JfKYbFKIbKRcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7348c65759b024795eed232ac94dea96a938f7dd30410a4b250e7e04877f3d4f","last_reissued_at":"2026-07-05T07:00:17.798490Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:00:17.798490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.10189","source_version":4,"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-07-05T07:00:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJF64vJmaFS8yQFnXTX364A8oWPGA5EdSWQqhDh6ywlKTzufB7K4zIZDjmBrIL85pq1QsF+VqgYPr3bTdtmMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:32:23.110830Z"},"content_sha256":"68068316c7c4a928700a8259d770e33a3868f59128923e1808bf6446c5710433","schema_version":"1.0","event_id":"sha256:68068316c7c4a928700a8259d770e33a3868f59128923e1808bf6446c5710433"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ONEMMV2ZWASHSXXNEMVMSTPKS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting minimum description length complexity in overparameterized models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Bin Yu, Chandan Singh, Martin J. Wainwright, Raaz Dwivedi","submitted_at":"2020-06-17T22:45:14Z","abstract_excerpt":"Complexity is a fundamental concept underlying statistical learning theory that aims to inform generalization performance. Parameter count, while successful in low-dimensional settings, is not well-justified for overparameterized settings when the number of parameters is more than the number of training samples. We revisit complexity measures based on Rissanen's principle of minimum description length (MDL) and define a novel MDL-based complexity (MDL-COMP) that remains valid for overparameterized models. MDL-COMP is defined via an optimality criterion over the encodings induced by a good Ridg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.10189","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.10189/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:00:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSLH3Hb+o8jlu2ZywmNuTGpiVv/XZVQpQuQoTSny/WPL3sBIkKyDAWqvPI6F8Tk3ru64Zfs8VNhrWNmfil9nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:32:23.111827Z"},"content_sha256":"4192c5b38861bfa000d2c19c997ebb4a01ac9ae3151b6e005f218da7d07e6ff0","schema_version":"1.0","event_id":"sha256:4192c5b38861bfa000d2c19c997ebb4a01ac9ae3151b6e005f218da7d07e6ff0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONEMMV2ZWASHSXXNEMVMSTPKS2/bundle.json","state_url":"https://pith.science/pith/ONEMMV2ZWASHSXXNEMVMSTPKS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONEMMV2ZWASHSXXNEMVMSTPKS2/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-08-13T15:32:23Z","links":{"resolver":"https://pith.science/pith/ONEMMV2ZWASHSXXNEMVMSTPKS2","bundle":"https://pith.science/pith/ONEMMV2ZWASHSXXNEMVMSTPKS2/bundle.json","state":"https://pith.science/pith/ONEMMV2ZWASHSXXNEMVMSTPKS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONEMMV2ZWASHSXXNEMVMSTPKS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ONEMMV2ZWASHSXXNEMVMSTPKS2","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":"534d3713194ad4cf58ff86d466ed9d0d0cfe8195171319853fa3ba76d225c77c","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-06-17T22:45:14Z","title_canon_sha256":"34529680300f0083bc4a4c250ca638c0c40ce58c38716d6cf1e2e448be8be970"},"schema_version":"1.0","source":{"id":"2006.10189","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.10189","created_at":"2026-07-05T07:00:17Z"},{"alias_kind":"arxiv_version","alias_value":"2006.10189v4","created_at":"2026-07-05T07:00:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.10189","created_at":"2026-07-05T07:00:17Z"},{"alias_kind":"pith_short_12","alias_value":"ONEMMV2ZWASH","created_at":"2026-07-05T07:00:17Z"},{"alias_kind":"pith_short_16","alias_value":"ONEMMV2ZWASHSXXN","created_at":"2026-07-05T07:00:17Z"},{"alias_kind":"pith_short_8","alias_value":"ONEMMV2Z","created_at":"2026-07-05T07:00:17Z"}],"graph_snapshots":[{"event_id":"sha256:4192c5b38861bfa000d2c19c997ebb4a01ac9ae3151b6e005f218da7d07e6ff0","target":"graph","created_at":"2026-07-05T07:00:17Z","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/2006.10189/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Complexity is a fundamental concept underlying statistical learning theory that aims to inform generalization performance. Parameter count, while successful in low-dimensional settings, is not well-justified for overparameterized settings when the number of parameters is more than the number of training samples. We revisit complexity measures based on Rissanen's principle of minimum description length (MDL) and define a novel MDL-based complexity (MDL-COMP) that remains valid for overparameterized models. MDL-COMP is defined via an optimality criterion over the encodings induced by a good Ridg","authors_text":"Bin Yu, Chandan Singh, Martin J. Wainwright, Raaz Dwivedi","cross_cats":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-06-17T22:45:14Z","title":"Revisiting minimum description length complexity in overparameterized models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.10189","kind":"arxiv","version":4},"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:68068316c7c4a928700a8259d770e33a3868f59128923e1808bf6446c5710433","target":"record","created_at":"2026-07-05T07:00:17Z","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":"534d3713194ad4cf58ff86d466ed9d0d0cfe8195171319853fa3ba76d225c77c","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-06-17T22:45:14Z","title_canon_sha256":"34529680300f0083bc4a4c250ca638c0c40ce58c38716d6cf1e2e448be8be970"},"schema_version":"1.0","source":{"id":"2006.10189","kind":"arxiv","version":4}},"canonical_sha256":"7348c65759b024795eed232ac94dea96a938f7dd30410a4b250e7e04877f3d4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7348c65759b024795eed232ac94dea96a938f7dd30410a4b250e7e04877f3d4f","first_computed_at":"2026-07-05T07:00:17.798490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:00:17.798490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2AxPmmfMnOi64yMpak4Ugr4lLRkvNbeMODm+FNyyPkGt9DjwTCt/L/7nDilST2VFrrZJHkm3JfKYbFKIbKRcDA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:00:17.798856Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.10189","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68068316c7c4a928700a8259d770e33a3868f59128923e1808bf6446c5710433","sha256:4192c5b38861bfa000d2c19c997ebb4a01ac9ae3151b6e005f218da7d07e6ff0"],"state_sha256":"7f559050839ffeca724b3f037df3574222ca7e3c0ec22d5a015ae9f7712bb0af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"snGaP2AKFIQaX5+0cUYajIWKNCpaQ9Atk35ZBVowEaWybeWiwyVQUWCKaupgmhab0hz6R0OgoSy5uZhTUX5PAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T15:32:23.145753Z","bundle_sha256":"9b33e908ef2f61b8e2a3f457c4d201c885698ca79d4cfaf87927626b2711e688"}}