{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:65TL6CITSRT46DQ2SNF5YRDTVU","short_pith_number":"pith:65TL6CIT","canonical_record":{"source":{"id":"2505.14635","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-20T17:25:16Z","cross_cats_sorted":[],"title_canon_sha256":"032504b81bdbd47e5096cabac9144010f98a5b8dab15b23d9ec7ba16a8d1dc69","abstract_canon_sha256":"7f21c088ecfff17a042b5a91fa8ba84ae015ce30d5f27e191e1b8e1af0874cb1"},"schema_version":"1.0"},"canonical_sha256":"f766bf09139467cf0e1a934bdc4473ad09a9f01b9bc6a6a593cf5633331b7e9a","source":{"kind":"arxiv","id":"2505.14635","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.14635","created_at":"2026-07-05T11:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"2505.14635v2","created_at":"2026-07-05T11:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14635","created_at":"2026-07-05T11:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"65TL6CITSRT4","created_at":"2026-07-05T11:38:07Z"},{"alias_kind":"pith_short_16","alias_value":"65TL6CITSRT46DQ2","created_at":"2026-07-05T11:38:07Z"},{"alias_kind":"pith_short_8","alias_value":"65TL6CIT","created_at":"2026-07-05T11:38:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:65TL6CITSRT46DQ2SNF5YRDTVU","target":"record","payload":{"canonical_record":{"source":{"id":"2505.14635","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-20T17:25:16Z","cross_cats_sorted":[],"title_canon_sha256":"032504b81bdbd47e5096cabac9144010f98a5b8dab15b23d9ec7ba16a8d1dc69","abstract_canon_sha256":"7f21c088ecfff17a042b5a91fa8ba84ae015ce30d5f27e191e1b8e1af0874cb1"},"schema_version":"1.0"},"canonical_sha256":"f766bf09139467cf0e1a934bdc4473ad09a9f01b9bc6a6a593cf5633331b7e9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:07.292093Z","signature_b64":"elPbzFbg9HQPZbZvjFrPtnsCgdGPHKtGRQMIg30rSNLDKo9gxSsIziaeJOfdACzVY5O5b+9+Q/KLcm78MlxfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f766bf09139467cf0e1a934bdc4473ad09a9f01b9bc6a6a593cf5633331b7e9a","last_reissued_at":"2026-07-05T11:38:07.291539Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:07.291539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.14635","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-07-05T11:38:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohwvze0p8SIYeQDo08YYdIg+ZH1EE+1sGOeCgqjg6FCeHjHpxZVy6u/Tjyu79weLHX+Q2VdVcffhlOCQ6SURDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:48:49.179679Z"},"content_sha256":"0bab59d471d91afdf363a8408599b6aafd543f4616bb452b5c0712a0eacdd9a2","schema_version":"1.0","event_id":"sha256:0bab59d471d91afdf363a8408599b6aafd543f4616bb452b5c0712a0eacdd9a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:65TL6CITSRT46DQ2SNF5YRDTVU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bridging Predictive Coding and MDL: A Two-Part Code Framework for Deep Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abdul Malik Zekri, Ankur Mali, Benjamin Prada, Shion Matsumoto","submitted_at":"2025-05-20T17:25:16Z","abstract_excerpt":"We present the first theoretical framework that connects predictive coding (PC), a biologically inspired local learning rule, with the minimum description length (MDL) principle in deep networks. We prove that layerwise PC performs block-coordinate descent on the MDL two-part code objective, thereby jointly minimizing empirical risk and model complexity. Using Hoeffding's inequality and a prefix-code prior, we derive a novel generalization bound of the form $R(\\theta) \\le \\hat{R}(\\theta) + \\frac{L(\\theta)}{N}$, capturing the tradeoff between fit and compression. We further prove that each PC s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14635","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.14635/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-05T11:38:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g+vxPg8txUy1ILORRxIBmvI2Paeiho/mAhseGUk4HWLRZBd/U4VvLF4HHWsLqf3gp2VAL1esSD1KA0+dJKCnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T00:48:49.180201Z"},"content_sha256":"49cd02da1f972222682f2cf756dd4cbfb8aa837bac9ab1ad1f7a9244d1672306","schema_version":"1.0","event_id":"sha256:49cd02da1f972222682f2cf756dd4cbfb8aa837bac9ab1ad1f7a9244d1672306"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU/bundle.json","state_url":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65TL6CITSRT46DQ2SNF5YRDTVU/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-05T00:48:49Z","links":{"resolver":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU","bundle":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU/bundle.json","state":"https://pith.science/pith/65TL6CITSRT46DQ2SNF5YRDTVU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65TL6CITSRT46DQ2SNF5YRDTVU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:65TL6CITSRT46DQ2SNF5YRDTVU","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":"7f21c088ecfff17a042b5a91fa8ba84ae015ce30d5f27e191e1b8e1af0874cb1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-20T17:25:16Z","title_canon_sha256":"032504b81bdbd47e5096cabac9144010f98a5b8dab15b23d9ec7ba16a8d1dc69"},"schema_version":"1.0","source":{"id":"2505.14635","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.14635","created_at":"2026-07-05T11:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"2505.14635v2","created_at":"2026-07-05T11:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14635","created_at":"2026-07-05T11:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"65TL6CITSRT4","created_at":"2026-07-05T11:38:07Z"},{"alias_kind":"pith_short_16","alias_value":"65TL6CITSRT46DQ2","created_at":"2026-07-05T11:38:07Z"},{"alias_kind":"pith_short_8","alias_value":"65TL6CIT","created_at":"2026-07-05T11:38:07Z"}],"graph_snapshots":[{"event_id":"sha256:49cd02da1f972222682f2cf756dd4cbfb8aa837bac9ab1ad1f7a9244d1672306","target":"graph","created_at":"2026-07-05T11:38:07Z","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/2505.14635/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present the first theoretical framework that connects predictive coding (PC), a biologically inspired local learning rule, with the minimum description length (MDL) principle in deep networks. We prove that layerwise PC performs block-coordinate descent on the MDL two-part code objective, thereby jointly minimizing empirical risk and model complexity. Using Hoeffding's inequality and a prefix-code prior, we derive a novel generalization bound of the form $R(\\theta) \\le \\hat{R}(\\theta) + \\frac{L(\\theta)}{N}$, capturing the tradeoff between fit and compression. We further prove that each PC s","authors_text":"Abdul Malik Zekri, Ankur Mali, Benjamin Prada, Shion Matsumoto","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-20T17:25:16Z","title":"Bridging Predictive Coding and MDL: A Two-Part Code Framework for Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14635","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:0bab59d471d91afdf363a8408599b6aafd543f4616bb452b5c0712a0eacdd9a2","target":"record","created_at":"2026-07-05T11:38:07Z","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":"7f21c088ecfff17a042b5a91fa8ba84ae015ce30d5f27e191e1b8e1af0874cb1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-20T17:25:16Z","title_canon_sha256":"032504b81bdbd47e5096cabac9144010f98a5b8dab15b23d9ec7ba16a8d1dc69"},"schema_version":"1.0","source":{"id":"2505.14635","kind":"arxiv","version":2}},"canonical_sha256":"f766bf09139467cf0e1a934bdc4473ad09a9f01b9bc6a6a593cf5633331b7e9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f766bf09139467cf0e1a934bdc4473ad09a9f01b9bc6a6a593cf5633331b7e9a","first_computed_at":"2026-07-05T11:38:07.291539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:38:07.291539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"elPbzFbg9HQPZbZvjFrPtnsCgdGPHKtGRQMIg30rSNLDKo9gxSsIziaeJOfdACzVY5O5b+9+Q/KLcm78MlxfAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:38:07.292093Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.14635","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0bab59d471d91afdf363a8408599b6aafd543f4616bb452b5c0712a0eacdd9a2","sha256:49cd02da1f972222682f2cf756dd4cbfb8aa837bac9ab1ad1f7a9244d1672306"],"state_sha256":"65584a81e41a3b6313184e94e2b4dcc55982a296000344650f572580c2dc038d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPKnPQQCiWYE9yjgCQ2/+LG/jkpWBIW1YQFhq6MjfcjLezfl4xj2UQNi9sHDeXclbQRLKpUYZuzA7tAetg12DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T00:48:49.185638Z","bundle_sha256":"ff89ebeff7881f9f995d30be9c17219ddd613e627d1bbbfb3eae36bbd9deb123"}}