{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:O2AXDMB3BT66D7A47EMCGGNE3V","short_pith_number":"pith:O2AXDMB3","canonical_record":{"source":{"id":"2001.09122","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-24T18:13:04Z","cross_cats_sorted":["cs.CR","cs.DS","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"20f2501dd3373bb80472d07c86b0bbd96ad47be21a7583db29bb6b33e91e48f6","abstract_canon_sha256":"d480cdca34db9725bf29848afada07dbef3eab68aeab7bd85a8c5a2b281534bf"},"schema_version":"1.0"},"canonical_sha256":"768171b03b0cfde1fc1cf9182319a4dd5ac453042eca823ee820b164ca947891","source":{"kind":"arxiv","id":"2001.09122","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.09122","created_at":"2026-07-05T01:11:23Z"},{"alias_kind":"arxiv_version","alias_value":"2001.09122v3","created_at":"2026-07-05T01:11:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.09122","created_at":"2026-07-05T01:11:23Z"},{"alias_kind":"pith_short_12","alias_value":"O2AXDMB3BT66","created_at":"2026-07-05T01:11:23Z"},{"alias_kind":"pith_short_16","alias_value":"O2AXDMB3BT66D7A4","created_at":"2026-07-05T01:11:23Z"},{"alias_kind":"pith_short_8","alias_value":"O2AXDMB3","created_at":"2026-07-05T01:11:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:O2AXDMB3BT66D7A47EMCGGNE3V","target":"record","payload":{"canonical_record":{"source":{"id":"2001.09122","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-24T18:13:04Z","cross_cats_sorted":["cs.CR","cs.DS","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"20f2501dd3373bb80472d07c86b0bbd96ad47be21a7583db29bb6b33e91e48f6","abstract_canon_sha256":"d480cdca34db9725bf29848afada07dbef3eab68aeab7bd85a8c5a2b281534bf"},"schema_version":"1.0"},"canonical_sha256":"768171b03b0cfde1fc1cf9182319a4dd5ac453042eca823ee820b164ca947891","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:23.669807Z","signature_b64":"rH8oD/V1QyzLz76VNMsxFBdROHX94CeMejyBy4+/jN2CMdIMGP2yK+lQerR4Ug27ntLnrje5h7w1tBiSwOGYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"768171b03b0cfde1fc1cf9182319a4dd5ac453042eca823ee820b164ca947891","last_reissued_at":"2026-07-05T01:11:23.669325Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:23.669325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.09122","source_version":3,"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-05T01:11:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3DR+3AL+VxTS6hck2G47BcmYKxkKbwzH7/R6Xie+GEeoRo3+1/6pVksnZwJwufWyqfCV7C8uO6REDj+kkIIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:13:47.261753Z"},"content_sha256":"f7d7e2de3d56c3657ec8bfca5a29cffda2b565fa9df209141ff60570f8443eef","schema_version":"1.0","event_id":"sha256:f7d7e2de3d56c3657ec8bfca5a29cffda2b565fa9df209141ff60570f8443eef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:O2AXDMB3BT66D7A47EMCGGNE3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reasoning About Generalization via Conditional Mutual Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Lydia Zakynthinou, Thomas Steinke","submitted_at":"2020-01-24T18:13:04Z","abstract_excerpt":"We provide an information-theoretic framework for studying the generalization properties of machine learning algorithms. Our framework ties together existing approaches, including uniform convergence bounds and recent methods for adaptive data analysis. Specifically, we use Conditional Mutual Information (CMI) to quantify how well the input (i.e., the training data) can be recognized given the output (i.e., the trained model) of the learning algorithm. We show that bounds on CMI can be obtained from VC dimension, compression schemes, differential privacy, and other methods. We then show that b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.09122","kind":"arxiv","version":3},"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/2001.09122/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-05T01:11:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eHojlv13F0SXuszHJEbSdbzg2NV0H2Jc4ECvd8CFSWcr1OR19mzN6ejy98fFqmI+IcQhh+13/8GeMHdGcZVvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:13:47.262180Z"},"content_sha256":"3a5fce4e6ccb1892ff7905b63577253164def438f2aba3528935a18d36f313be","schema_version":"1.0","event_id":"sha256:3a5fce4e6ccb1892ff7905b63577253164def438f2aba3528935a18d36f313be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2AXDMB3BT66D7A47EMCGGNE3V/bundle.json","state_url":"https://pith.science/pith/O2AXDMB3BT66D7A47EMCGGNE3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2AXDMB3BT66D7A47EMCGGNE3V/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-07-07T10:13:47Z","links":{"resolver":"https://pith.science/pith/O2AXDMB3BT66D7A47EMCGGNE3V","bundle":"https://pith.science/pith/O2AXDMB3BT66D7A47EMCGGNE3V/bundle.json","state":"https://pith.science/pith/O2AXDMB3BT66D7A47EMCGGNE3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2AXDMB3BT66D7A47EMCGGNE3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:O2AXDMB3BT66D7A47EMCGGNE3V","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":"d480cdca34db9725bf29848afada07dbef3eab68aeab7bd85a8c5a2b281534bf","cross_cats_sorted":["cs.CR","cs.DS","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-24T18:13:04Z","title_canon_sha256":"20f2501dd3373bb80472d07c86b0bbd96ad47be21a7583db29bb6b33e91e48f6"},"schema_version":"1.0","source":{"id":"2001.09122","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.09122","created_at":"2026-07-05T01:11:23Z"},{"alias_kind":"arxiv_version","alias_value":"2001.09122v3","created_at":"2026-07-05T01:11:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.09122","created_at":"2026-07-05T01:11:23Z"},{"alias_kind":"pith_short_12","alias_value":"O2AXDMB3BT66","created_at":"2026-07-05T01:11:23Z"},{"alias_kind":"pith_short_16","alias_value":"O2AXDMB3BT66D7A4","created_at":"2026-07-05T01:11:23Z"},{"alias_kind":"pith_short_8","alias_value":"O2AXDMB3","created_at":"2026-07-05T01:11:23Z"}],"graph_snapshots":[{"event_id":"sha256:3a5fce4e6ccb1892ff7905b63577253164def438f2aba3528935a18d36f313be","target":"graph","created_at":"2026-07-05T01:11:23Z","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/2001.09122/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide an information-theoretic framework for studying the generalization properties of machine learning algorithms. Our framework ties together existing approaches, including uniform convergence bounds and recent methods for adaptive data analysis. Specifically, we use Conditional Mutual Information (CMI) to quantify how well the input (i.e., the training data) can be recognized given the output (i.e., the trained model) of the learning algorithm. We show that bounds on CMI can be obtained from VC dimension, compression schemes, differential privacy, and other methods. We then show that b","authors_text":"Lydia Zakynthinou, Thomas Steinke","cross_cats":["cs.CR","cs.DS","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-24T18:13:04Z","title":"Reasoning About Generalization via Conditional Mutual Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.09122","kind":"arxiv","version":3},"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:f7d7e2de3d56c3657ec8bfca5a29cffda2b565fa9df209141ff60570f8443eef","target":"record","created_at":"2026-07-05T01:11:23Z","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":"d480cdca34db9725bf29848afada07dbef3eab68aeab7bd85a8c5a2b281534bf","cross_cats_sorted":["cs.CR","cs.DS","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-24T18:13:04Z","title_canon_sha256":"20f2501dd3373bb80472d07c86b0bbd96ad47be21a7583db29bb6b33e91e48f6"},"schema_version":"1.0","source":{"id":"2001.09122","kind":"arxiv","version":3}},"canonical_sha256":"768171b03b0cfde1fc1cf9182319a4dd5ac453042eca823ee820b164ca947891","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"768171b03b0cfde1fc1cf9182319a4dd5ac453042eca823ee820b164ca947891","first_computed_at":"2026-07-05T01:11:23.669325Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:11:23.669325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rH8oD/V1QyzLz76VNMsxFBdROHX94CeMejyBy4+/jN2CMdIMGP2yK+lQerR4Ug27ntLnrje5h7w1tBiSwOGYAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:11:23.669807Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.09122","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7d7e2de3d56c3657ec8bfca5a29cffda2b565fa9df209141ff60570f8443eef","sha256:3a5fce4e6ccb1892ff7905b63577253164def438f2aba3528935a18d36f313be"],"state_sha256":"c7acd6135898b570f14a403a3a07f540b54042de863b4b701ae559835716e396"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tl6yhu1YJjNsCUDoTxgc7RL6WJJmd6viRnszEkYeJxI9jjBzrs5hM7HjcO0yMmMyIte+XRVl+h865b0BmlReBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:13:47.264267Z","bundle_sha256":"6d941f5620a1fedc22225970e4ce5dec5a3923ca90d0cd5780dca8cbf15c809b"}}