{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:M4JUX4MBHLLHPFHYXZV5Y434UZ","short_pith_number":"pith:M4JUX4MB","canonical_record":{"source":{"id":"1307.2118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-07-08T15:03:03Z","cross_cats_sorted":[],"title_canon_sha256":"d22b30ae37dbf9d24b09915dd819a2c0c1b2c25be09e54ecb01f240088f4e31c","abstract_canon_sha256":"a946dd0432133fd2c688e70740badca7316e85a6304d8cbe7f05283198068388"},"schema_version":"1.0"},"canonical_sha256":"67134bf1813ad67794f8be6bdc737ca64fd5cf1f9c26dd2d93c23244ce7a2b8b","source":{"kind":"arxiv","id":"1307.2118","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2118","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2118v1","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2118","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"M4JUX4MBHLLH","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M4JUX4MBHLLHPFHY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M4JUX4MB","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:M4JUX4MBHLLHPFHYXZV5Y434UZ","target":"record","payload":{"canonical_record":{"source":{"id":"1307.2118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-07-08T15:03:03Z","cross_cats_sorted":[],"title_canon_sha256":"d22b30ae37dbf9d24b09915dd819a2c0c1b2c25be09e54ecb01f240088f4e31c","abstract_canon_sha256":"a946dd0432133fd2c688e70740badca7316e85a6304d8cbe7f05283198068388"},"schema_version":"1.0"},"canonical_sha256":"67134bf1813ad67794f8be6bdc737ca64fd5cf1f9c26dd2d93c23244ce7a2b8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:02.355802Z","signature_b64":"LdLtynzhXbfqUPa3zvFGiEiPK62xofjEnUF3xdFiR0h1NSamyRlJqoYJEmjbe3Dc1A5qwd9CmDal3Qgngg6ZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67134bf1813ad67794f8be6bdc737ca64fd5cf1f9c26dd2d93c23244ce7a2b8b","last_reissued_at":"2026-05-18T03:19:02.355385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:02.355385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.2118","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-18T03:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QcEjag9NeXNutQQNAkL9NSqqroR6m3XMbuE7m7Lhsnw5Quj6ka0U8KTD6b9G9QetoF31zNcOLzwFKOp3cOWFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T22:18:32.056331Z"},"content_sha256":"f932e4b7a3c0adfe0e79eb53f25d1c494221b8071d674b6ba6c20c503d1f1e42","schema_version":"1.0","event_id":"sha256:f932e4b7a3c0adfe0e79eb53f25d1c494221b8071d674b6ba6c20c503d1f1e42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:M4JUX4MBHLLHPFHYXZV5Y434UZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A PAC-Bayesian Tutorial with A Dropout Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David McAllester","submitted_at":"2013-07-08T15:03:03Z","abstract_excerpt":"This tutorial gives a concise overview of existing PAC-Bayesian theory focusing on three generalization bounds. The first is an Occam bound which handles rules with finite precision parameters and which states that generalization loss is near training loss when the number of bits needed to write the rule is small compared to the sample size. The second is a PAC-Bayesian bound providing a generalization guarantee for posterior distributions rather than for individual rules. The PAC-Bayesian bound naturally handles infinite precision rule parameters, $L_2$ regularization, {\\em provides a bound f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2118","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-18T03:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jxL7HYDAjo2NtrNjqwuj/5+/U8FfcjtczZwO59+jSNC53X4rLCu6xirt1MsRXdovdN+2mBKy8nOxdaXUSktTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T22:18:32.057022Z"},"content_sha256":"ef3d267415baff71470a1df67722abf4f547a186b5ca7082876b4b701dcad0ca","schema_version":"1.0","event_id":"sha256:ef3d267415baff71470a1df67722abf4f547a186b5ca7082876b4b701dcad0ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4JUX4MBHLLHPFHYXZV5Y434UZ/bundle.json","state_url":"https://pith.science/pith/M4JUX4MBHLLHPFHYXZV5Y434UZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4JUX4MBHLLHPFHYXZV5Y434UZ/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-24T22:18:32Z","links":{"resolver":"https://pith.science/pith/M4JUX4MBHLLHPFHYXZV5Y434UZ","bundle":"https://pith.science/pith/M4JUX4MBHLLHPFHYXZV5Y434UZ/bundle.json","state":"https://pith.science/pith/M4JUX4MBHLLHPFHYXZV5Y434UZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4JUX4MBHLLHPFHYXZV5Y434UZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:M4JUX4MBHLLHPFHYXZV5Y434UZ","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":"a946dd0432133fd2c688e70740badca7316e85a6304d8cbe7f05283198068388","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-07-08T15:03:03Z","title_canon_sha256":"d22b30ae37dbf9d24b09915dd819a2c0c1b2c25be09e54ecb01f240088f4e31c"},"schema_version":"1.0","source":{"id":"1307.2118","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2118","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2118v1","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2118","created_at":"2026-05-18T03:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"M4JUX4MBHLLH","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"M4JUX4MBHLLHPFHY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"M4JUX4MB","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:ef3d267415baff71470a1df67722abf4f547a186b5ca7082876b4b701dcad0ca","target":"graph","created_at":"2026-05-18T03:19:02Z","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":"This tutorial gives a concise overview of existing PAC-Bayesian theory focusing on three generalization bounds. The first is an Occam bound which handles rules with finite precision parameters and which states that generalization loss is near training loss when the number of bits needed to write the rule is small compared to the sample size. The second is a PAC-Bayesian bound providing a generalization guarantee for posterior distributions rather than for individual rules. The PAC-Bayesian bound naturally handles infinite precision rule parameters, $L_2$ regularization, {\\em provides a bound f","authors_text":"David McAllester","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-07-08T15:03:03Z","title":"A PAC-Bayesian Tutorial with A Dropout Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2118","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:f932e4b7a3c0adfe0e79eb53f25d1c494221b8071d674b6ba6c20c503d1f1e42","target":"record","created_at":"2026-05-18T03:19:02Z","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":"a946dd0432133fd2c688e70740badca7316e85a6304d8cbe7f05283198068388","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-07-08T15:03:03Z","title_canon_sha256":"d22b30ae37dbf9d24b09915dd819a2c0c1b2c25be09e54ecb01f240088f4e31c"},"schema_version":"1.0","source":{"id":"1307.2118","kind":"arxiv","version":1}},"canonical_sha256":"67134bf1813ad67794f8be6bdc737ca64fd5cf1f9c26dd2d93c23244ce7a2b8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67134bf1813ad67794f8be6bdc737ca64fd5cf1f9c26dd2d93c23244ce7a2b8b","first_computed_at":"2026-05-18T03:19:02.355385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:02.355385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LdLtynzhXbfqUPa3zvFGiEiPK62xofjEnUF3xdFiR0h1NSamyRlJqoYJEmjbe3Dc1A5qwd9CmDal3Qgngg6ZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:02.355802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2118","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f932e4b7a3c0adfe0e79eb53f25d1c494221b8071d674b6ba6c20c503d1f1e42","sha256:ef3d267415baff71470a1df67722abf4f547a186b5ca7082876b4b701dcad0ca"],"state_sha256":"997e73e30ca79313dace17f7e7eaf950fdd1a0c33b9b9d6151892b01a4fd2cff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bM5rR3JBWMY9OCGVin+kUGg6zKSE/nzq0NuE4yvtVYu8nLgt1X4I9SFbfaaH6SbOQl2mNuzCItYn+UBMMR82AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T22:18:32.060313Z","bundle_sha256":"b2ccfb5358f96f4cdd3562da2e665935bc533327397833d0d035e3ffa58147d3"}}