{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QOWJTYBXBCSGHQSKS6OLDJ6F76","short_pith_number":"pith:QOWJTYBX","schema_version":"1.0","canonical_sha256":"83ac99e03708a463c24a979cb1a7c5ff819b57ea12bbb569e5c299c0271d285f","source":{"kind":"arxiv","id":"2605.21056","version":1},"attestation_state":"computed","paper":{"title":"On Unified and Sharpened CMI Bounds for Generalization Errors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jingge Zhu, Margreta Kuijper, Matthias Frey, Yang Lu","submitted_at":"2026-05-20T11:42:35Z","abstract_excerpt":"We present a new family of information-theoretic generalization bounds within the framework of conditional mutual information (CMI). Most of our results are established based on the leave-$m$-out (L$m$O) cross-validation error, with $m$ denoting the number of the hold-out supersamples. Under this setting, we propose a unified CMI-based bound, allowing to envelop and reproduce many known CMI-based bounds and also bridge the gap between the MI- and CMI-based bounds when $m$ tends to infinity. The proposed framework not only provides a unified description of the existing bounds but also develops "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.21056","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-20T11:42:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aefbd23a10fba5955513f602b9d4e966aecbe8368f04c01683ba8aeb8189def4","abstract_canon_sha256":"4470c34cba3ea899961b27ea526886c6c1a07a00aa2c48cc81c28c589927cd74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:34.378075Z","signature_b64":"w5o87Jg3BaMJX6Lc7APg0rqYiN3DS8oOlo5BdL2tvcH6SWwQlxmi6Jm637aGkGkUWn3bSGS9KSml3oN3aZIbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83ac99e03708a463c24a979cb1a7c5ff819b57ea12bbb569e5c299c0271d285f","last_reissued_at":"2026-05-21T01:05:34.377389Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:34.377389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Unified and Sharpened CMI Bounds for Generalization Errors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jingge Zhu, Margreta Kuijper, Matthias Frey, Yang Lu","submitted_at":"2026-05-20T11:42:35Z","abstract_excerpt":"We present a new family of information-theoretic generalization bounds within the framework of conditional mutual information (CMI). Most of our results are established based on the leave-$m$-out (L$m$O) cross-validation error, with $m$ denoting the number of the hold-out supersamples. Under this setting, we propose a unified CMI-based bound, allowing to envelop and reproduce many known CMI-based bounds and also bridge the gap between the MI- and CMI-based bounds when $m$ tends to infinity. The proposed framework not only provides a unified description of the existing bounds but also develops "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21056","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21056/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.21056","created_at":"2026-05-21T01:05:34.377499+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21056v1","created_at":"2026-05-21T01:05:34.377499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21056","created_at":"2026-05-21T01:05:34.377499+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOWJTYBXBCSG","created_at":"2026-05-21T01:05:34.377499+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOWJTYBXBCSGHQSK","created_at":"2026-05-21T01:05:34.377499+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOWJTYBX","created_at":"2026-05-21T01:05:34.377499+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QOWJTYBXBCSGHQSKS6OLDJ6F76","json":"https://pith.science/pith/QOWJTYBXBCSGHQSKS6OLDJ6F76.json","graph_json":"https://pith.science/api/pith-number/QOWJTYBXBCSGHQSKS6OLDJ6F76/graph.json","events_json":"https://pith.science/api/pith-number/QOWJTYBXBCSGHQSKS6OLDJ6F76/events.json","paper":"https://pith.science/paper/QOWJTYBX"},"agent_actions":{"view_html":"https://pith.science/pith/QOWJTYBXBCSGHQSKS6OLDJ6F76","download_json":"https://pith.science/pith/QOWJTYBXBCSGHQSKS6OLDJ6F76.json","view_paper":"https://pith.science/paper/QOWJTYBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21056&json=true","fetch_graph":"https://pith.science/api/pith-number/QOWJTYBXBCSGHQSKS6OLDJ6F76/graph.json","fetch_events":"https://pith.science/api/pith-number/QOWJTYBXBCSGHQSKS6OLDJ6F76/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOWJTYBXBCSGHQSKS6OLDJ6F76/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOWJTYBXBCSGHQSKS6OLDJ6F76/action/storage_attestation","attest_author":"https://pith.science/pith/QOWJTYBXBCSGHQSKS6OLDJ6F76/action/author_attestation","sign_citation":"https://pith.science/pith/QOWJTYBXBCSGHQSKS6OLDJ6F76/action/citation_signature","submit_replication":"https://pith.science/pith/QOWJTYBXBCSGHQSKS6OLDJ6F76/action/replication_record"}},"created_at":"2026-05-21T01:05:34.377499+00:00","updated_at":"2026-05-21T01:05:34.377499+00:00"}