{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ULW3FWFX4ACLWX74XJTDXN5SAB","short_pith_number":"pith:ULW3FWFX","canonical_record":{"source":{"id":"1906.11148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-26T15:05:24Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"fb5e04ec724b75b325e353305dd7eebdaa5f8440d9bdc824ddf4a049499617c8","abstract_canon_sha256":"92126e0e6dc74a0c5a3e7863c8f33581d7e10b219f24c097635bb360f296f390"},"schema_version":"1.0"},"canonical_sha256":"a2edb2d8b7e004bb5ffcba663bb7b2006538b8fd1b6e68d17b984ee344a564fa","source":{"kind":"arxiv","id":"1906.11148","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11148","created_at":"2026-05-17T23:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11148v1","created_at":"2026-05-17T23:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11148","created_at":"2026-05-17T23:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"ULW3FWFX4ACL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"ULW3FWFX4ACLWX74","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"ULW3FWFX","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ULW3FWFX4ACLWX74XJTDXN5SAB","target":"record","payload":{"canonical_record":{"source":{"id":"1906.11148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-26T15:05:24Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"fb5e04ec724b75b325e353305dd7eebdaa5f8440d9bdc824ddf4a049499617c8","abstract_canon_sha256":"92126e0e6dc74a0c5a3e7863c8f33581d7e10b219f24c097635bb360f296f390"},"schema_version":"1.0"},"canonical_sha256":"a2edb2d8b7e004bb5ffcba663bb7b2006538b8fd1b6e68d17b984ee344a564fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:09.686237Z","signature_b64":"iv30MHpIiKxoEXmCmZv2BO8kN+OSNgEIkpwOfHKVjHAgoRjec3SZv0Beez6QNgYitIxit2RVqqYknA+vknbaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2edb2d8b7e004bb5ffcba663bb7b2006538b8fd1b6e68d17b984ee344a564fa","last_reissued_at":"2026-05-17T23:42:09.685413Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:09.685413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.11148","source_version":1,"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-17T23:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8elA1JdZF80t6QnY/xG2SlZuNNFQzlCPyYIwnStaAo7oRgPKTxr0giceJHCzlstoOIvVFgDc2UDgWXQxa2XCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:13:58.407417Z"},"content_sha256":"798c773d2a822b8d53271e6a16fd649668f4863cf1f15d77e5d2fab0ff6b3110","schema_version":"1.0","event_id":"sha256:798c773d2a822b8d53271e6a16fd649668f4863cf1f15d77e5d2fab0ff6b3110"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ULW3FWFX4ACLWX74XJTDXN5SAB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chaining Meets Chain Rule: Multilevel Entropic Regularization and Training of Neural Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amir R. Asadi, Emmanuel Abbe","submitted_at":"2019-06-26T15:05:24Z","abstract_excerpt":"We derive generalization and excess risk bounds for neural nets using a family of complexity measures based on a multilevel relative entropy. The bounds are obtained by introducing the notion of generated hierarchical coverings of neural nets and by using the technique of chaining mutual information introduced in Asadi et al. NeurIPS'18. The resulting bounds are algorithm-dependent and exploit the multilevel structure of neural nets. This, in turn, leads to an empirical risk minimization problem with a multilevel entropic regularization. The minimization problem is resolved by introducing a mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11148","kind":"arxiv","version":1},"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-17T23:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLLk3vSov+1rrmK3g59TxRgevxpDSwaMoxSm9H2+vQhSpAV4cRscpWzO4jcWSUJ8db1ZVLHXY+Ixae0ESJDbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:13:58.408058Z"},"content_sha256":"4cdc77d2f697997a7d246a7ec4d63e433086ac3257e7de045aa84fc0e532ec35","schema_version":"1.0","event_id":"sha256:4cdc77d2f697997a7d246a7ec4d63e433086ac3257e7de045aa84fc0e532ec35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULW3FWFX4ACLWX74XJTDXN5SAB/bundle.json","state_url":"https://pith.science/pith/ULW3FWFX4ACLWX74XJTDXN5SAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULW3FWFX4ACLWX74XJTDXN5SAB/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-31T15:13:58Z","links":{"resolver":"https://pith.science/pith/ULW3FWFX4ACLWX74XJTDXN5SAB","bundle":"https://pith.science/pith/ULW3FWFX4ACLWX74XJTDXN5SAB/bundle.json","state":"https://pith.science/pith/ULW3FWFX4ACLWX74XJTDXN5SAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULW3FWFX4ACLWX74XJTDXN5SAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ULW3FWFX4ACLWX74XJTDXN5SAB","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":"92126e0e6dc74a0c5a3e7863c8f33581d7e10b219f24c097635bb360f296f390","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-26T15:05:24Z","title_canon_sha256":"fb5e04ec724b75b325e353305dd7eebdaa5f8440d9bdc824ddf4a049499617c8"},"schema_version":"1.0","source":{"id":"1906.11148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11148","created_at":"2026-05-17T23:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11148v1","created_at":"2026-05-17T23:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11148","created_at":"2026-05-17T23:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"ULW3FWFX4ACL","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"ULW3FWFX4ACLWX74","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"ULW3FWFX","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:4cdc77d2f697997a7d246a7ec4d63e433086ac3257e7de045aa84fc0e532ec35","target":"graph","created_at":"2026-05-17T23:42:09Z","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":"We derive generalization and excess risk bounds for neural nets using a family of complexity measures based on a multilevel relative entropy. The bounds are obtained by introducing the notion of generated hierarchical coverings of neural nets and by using the technique of chaining mutual information introduced in Asadi et al. NeurIPS'18. The resulting bounds are algorithm-dependent and exploit the multilevel structure of neural nets. This, in turn, leads to an empirical risk minimization problem with a multilevel entropic regularization. The minimization problem is resolved by introducing a mu","authors_text":"Amir R. Asadi, Emmanuel Abbe","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-26T15:05:24Z","title":"Chaining Meets Chain Rule: Multilevel Entropic Regularization and Training of Neural Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11148","kind":"arxiv","version":1},"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:798c773d2a822b8d53271e6a16fd649668f4863cf1f15d77e5d2fab0ff6b3110","target":"record","created_at":"2026-05-17T23:42:09Z","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":"92126e0e6dc74a0c5a3e7863c8f33581d7e10b219f24c097635bb360f296f390","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-26T15:05:24Z","title_canon_sha256":"fb5e04ec724b75b325e353305dd7eebdaa5f8440d9bdc824ddf4a049499617c8"},"schema_version":"1.0","source":{"id":"1906.11148","kind":"arxiv","version":1}},"canonical_sha256":"a2edb2d8b7e004bb5ffcba663bb7b2006538b8fd1b6e68d17b984ee344a564fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2edb2d8b7e004bb5ffcba663bb7b2006538b8fd1b6e68d17b984ee344a564fa","first_computed_at":"2026-05-17T23:42:09.685413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:09.685413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iv30MHpIiKxoEXmCmZv2BO8kN+OSNgEIkpwOfHKVjHAgoRjec3SZv0Beez6QNgYitIxit2RVqqYknA+vknbaDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:09.686237Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:798c773d2a822b8d53271e6a16fd649668f4863cf1f15d77e5d2fab0ff6b3110","sha256:4cdc77d2f697997a7d246a7ec4d63e433086ac3257e7de045aa84fc0e532ec35"],"state_sha256":"64775d2ed3699ddbf0d3cce501f97ea7bcc3d875f461d3c18a722619812afc07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TSBc8GuIeImYWL+78Z7L0uZpwlONg+14mKGKm4GSNGN3VvWvjibB0E5XJCTlygrjiyhLV+w5KIhFCY+jymyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:13:58.411671Z","bundle_sha256":"f196f19d922a47de5346c96c113fe97c469764bf07273655c74d3f3662efb966"}}