{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6YRNMN2EMSFQYAU4PK56DEF5GU","short_pith_number":"pith:6YRNMN2E","canonical_record":{"source":{"id":"2605.02099","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-03T23:38:19Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"84873b3a30d08b4f73d3cb7a54b01efa0e77edb25746b829ac58c66a564750f1","abstract_canon_sha256":"87d39ae688331f7d4099c11e22b306fff206253ef0a9180a56f9552ebed52ad2"},"schema_version":"1.0"},"canonical_sha256":"f622d63744648b0c029c7abbe190bd3509cdcb552d119461be6200bd923aa7ef","source":{"kind":"arxiv","id":"2605.02099","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.02099","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.02099v2","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.02099","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"6YRNMN2EMSFQ","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_16","alias_value":"6YRNMN2EMSFQYAU4","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_8","alias_value":"6YRNMN2E","created_at":"2026-05-20T01:05:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6YRNMN2EMSFQYAU4PK56DEF5GU","target":"record","payload":{"canonical_record":{"source":{"id":"2605.02099","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-03T23:38:19Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"84873b3a30d08b4f73d3cb7a54b01efa0e77edb25746b829ac58c66a564750f1","abstract_canon_sha256":"87d39ae688331f7d4099c11e22b306fff206253ef0a9180a56f9552ebed52ad2"},"schema_version":"1.0"},"canonical_sha256":"f622d63744648b0c029c7abbe190bd3509cdcb552d119461be6200bd923aa7ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:15.187772Z","signature_b64":"uE4+GTufBRwkbAn7ZtT8r68fd4EFiViO8+HcDbDr1GE175Yod6FLt3Ct0QNveVuhlBSbXd3GxARovqQtTe6KDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f622d63744648b0c029c7abbe190bd3509cdcb552d119461be6200bd923aa7ef","last_reissued_at":"2026-05-20T01:05:15.187082Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:15.187082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.02099","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-05-20T01:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OIJstETCy3Of002gyDS7kMaZsFz3R3q9iDZnRy3fmjOjok4ANryu13cMM2C88GAoFVBSjTNy0nM4z/sOi4QDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:42:02.149250Z"},"content_sha256":"3466d23d0ad70570bfb3d3f41577de8c6b1c3dd9674c63377f09d1c4474146a9","schema_version":"1.0","event_id":"sha256:3466d23d0ad70570bfb3d3f41577de8c6b1c3dd9674c63377f09d1c4474146a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6YRNMN2EMSFQYAU4PK56DEF5GU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropic Strict Minimum Message Length and Its Connections to PAC-Bayes and NML","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Entropic SMML generalizes strict minimum message length into a tunable family that interpolates between Bayesian and minimax coding.","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Daniel F. Schmidt, Enes Makalic","submitted_at":"2026-05-03T23:38:19Z","abstract_excerpt":"We introduce entropic strict minimum message length (SMML), a risk-sensitive generalization of strict minimum message length coding. The proposed criterion replaces expected two-part codelength under the prior predictive distribution with an exponential certainty equivalent, thereby defining a one-parameter family of coding rules that interpolates between Bayesian average-case coding and worst-case minimax coding. We show that ordinary SMML is recovered in the risk-neutral limit, while the extreme risk-sensitive limit yields a minimax codelength criterion; when centered by the oracle maximum l"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that entropic SMML admits a variational characterization as a Kullback--Leibler-regularized worst-case expected codelength, giving it a PAC--Bayes-type interpretation. We establish a joint asymptotic theory linking the sample size n and the risk parameter τ, showing that in regular parametric models the transition between Bayesian, robust, and minimax coding regimes occurs on a logarithmic scale.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The joint asymptotic theory and the affine partition property hold only under the assumption of regular parametric models and regular exponential families; the paper does not specify how the results degrade when these regularity conditions are violated.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Entropic SMML defines a risk-sensitive family of coding rules bridging Bayesian MML, PAC-Bayes, and NML minimax-regret via exponential certainty equivalents and tilted centroids in exponential families.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Entropic SMML generalizes strict minimum message length into a tunable family that interpolates between Bayesian and minimax coding.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"cb055e2b13d48f69399c2650771879fb50558b86b5d9366068de73cfb85fb815"},"source":{"id":"2605.02099","kind":"arxiv","version":2},"verdict":{"id":"b0d8d8d8-63db-4f65-9622-d5f2c71a9c5d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T18:36:25.767126Z","strongest_claim":"We show that entropic SMML admits a variational characterization as a Kullback--Leibler-regularized worst-case expected codelength, giving it a PAC--Bayes-type interpretation. We establish a joint asymptotic theory linking the sample size n and the risk parameter τ, showing that in regular parametric models the transition between Bayesian, robust, and minimax coding regimes occurs on a logarithmic scale.","one_line_summary":"Entropic SMML defines a risk-sensitive family of coding rules bridging Bayesian MML, PAC-Bayes, and NML minimax-regret via exponential certainty equivalents and tilted centroids in exponential families.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The joint asymptotic theory and the affine partition property hold only under the assumption of regular parametric models and regular exponential families; the paper does not specify how the results degrade when these regularity conditions are violated.","pith_extraction_headline":"Entropic SMML generalizes strict minimum message length into a tunable family that interpolates between Bayesian and minimax coding."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.02099/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T16:40:11.652073Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"e212b1dae4db6e6d3b8118052cb7499db5e42d25b8a0ca3e0c133ab9341bcb17"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":3,"snapshot_sha256":"d94df8091ecbe77559d3eb3f23d5b130ba926bf6168773176b72a6709bc542eb"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"b0d8d8d8-63db-4f65-9622-d5f2c71a9c5d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4h+3C3qxRjDEEmFT4hXvpxVSqkpfCoBFA/K/5qmfCe+mymmu8Pixwc1H+JDADWc5o9n747YwhniNW0WHDG2EBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:42:02.149841Z"},"content_sha256":"4f9aa076c0ca6e5f72b9e79ce3af77336d614780a9bc7ea109f41e22fd100ebd","schema_version":"1.0","event_id":"sha256:4f9aa076c0ca6e5f72b9e79ce3af77336d614780a9bc7ea109f41e22fd100ebd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YRNMN2EMSFQYAU4PK56DEF5GU/bundle.json","state_url":"https://pith.science/pith/6YRNMN2EMSFQYAU4PK56DEF5GU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YRNMN2EMSFQYAU4PK56DEF5GU/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-06-20T20:42:02Z","links":{"resolver":"https://pith.science/pith/6YRNMN2EMSFQYAU4PK56DEF5GU","bundle":"https://pith.science/pith/6YRNMN2EMSFQYAU4PK56DEF5GU/bundle.json","state":"https://pith.science/pith/6YRNMN2EMSFQYAU4PK56DEF5GU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YRNMN2EMSFQYAU4PK56DEF5GU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6YRNMN2EMSFQYAU4PK56DEF5GU","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":"87d39ae688331f7d4099c11e22b306fff206253ef0a9180a56f9552ebed52ad2","cross_cats_sorted":["stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-03T23:38:19Z","title_canon_sha256":"84873b3a30d08b4f73d3cb7a54b01efa0e77edb25746b829ac58c66a564750f1"},"schema_version":"1.0","source":{"id":"2605.02099","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.02099","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.02099v2","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.02099","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"6YRNMN2EMSFQ","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_16","alias_value":"6YRNMN2EMSFQYAU4","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_8","alias_value":"6YRNMN2E","created_at":"2026-05-20T01:05:15Z"}],"graph_snapshots":[{"event_id":"sha256:4f9aa076c0ca6e5f72b9e79ce3af77336d614780a9bc7ea109f41e22fd100ebd","target":"graph","created_at":"2026-05-20T01:05:15Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that entropic SMML admits a variational characterization as a Kullback--Leibler-regularized worst-case expected codelength, giving it a PAC--Bayes-type interpretation. We establish a joint asymptotic theory linking the sample size n and the risk parameter τ, showing that in regular parametric models the transition between Bayesian, robust, and minimax coding regimes occurs on a logarithmic scale."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The joint asymptotic theory and the affine partition property hold only under the assumption of regular parametric models and regular exponential families; the paper does not specify how the results degrade when these regularity conditions are violated."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Entropic SMML defines a risk-sensitive family of coding rules bridging Bayesian MML, PAC-Bayes, and NML minimax-regret via exponential certainty equivalents and tilted centroids in exponential families."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Entropic SMML generalizes strict minimum message length into a tunable family that interpolates between Bayesian and minimax coding."}],"snapshot_sha256":"cb055e2b13d48f69399c2650771879fb50558b86b5d9366068de73cfb85fb815"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"d94df8091ecbe77559d3eb3f23d5b130ba926bf6168773176b72a6709bc542eb"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:40:11.652073Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.02099/integrity.json","findings":[],"snapshot_sha256":"e212b1dae4db6e6d3b8118052cb7499db5e42d25b8a0ca3e0c133ab9341bcb17","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce entropic strict minimum message length (SMML), a risk-sensitive generalization of strict minimum message length coding. The proposed criterion replaces expected two-part codelength under the prior predictive distribution with an exponential certainty equivalent, thereby defining a one-parameter family of coding rules that interpolates between Bayesian average-case coding and worst-case minimax coding. We show that ordinary SMML is recovered in the risk-neutral limit, while the extreme risk-sensitive limit yields a minimax codelength criterion; when centered by the oracle maximum l","authors_text":"Daniel F. Schmidt, Enes Makalic","cross_cats":["stat.TH"],"headline":"Entropic SMML generalizes strict minimum message length into a tunable family that interpolates between Bayesian and minimax coding.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-03T23:38:19Z","title":"Entropic Strict Minimum Message Length and Its Connections to PAC-Bayes and NML"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.02099","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T18:36:25.767126Z","id":"b0d8d8d8-63db-4f65-9622-d5f2c71a9c5d","model_set":{"reader":"grok-4.3"},"one_line_summary":"Entropic SMML defines a risk-sensitive family of coding rules bridging Bayesian MML, PAC-Bayes, and NML minimax-regret via exponential certainty equivalents and tilted centroids in exponential families.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Entropic SMML generalizes strict minimum message length into a tunable family that interpolates between Bayesian and minimax coding.","strongest_claim":"We show that entropic SMML admits a variational characterization as a Kullback--Leibler-regularized worst-case expected codelength, giving it a PAC--Bayes-type interpretation. We establish a joint asymptotic theory linking the sample size n and the risk parameter τ, showing that in regular parametric models the transition between Bayesian, robust, and minimax coding regimes occurs on a logarithmic scale.","weakest_assumption":"The joint asymptotic theory and the affine partition property hold only under the assumption of regular parametric models and regular exponential families; the paper does not specify how the results degrade when these regularity conditions are violated."}},"verdict_id":"b0d8d8d8-63db-4f65-9622-d5f2c71a9c5d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3466d23d0ad70570bfb3d3f41577de8c6b1c3dd9674c63377f09d1c4474146a9","target":"record","created_at":"2026-05-20T01:05:15Z","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":"87d39ae688331f7d4099c11e22b306fff206253ef0a9180a56f9552ebed52ad2","cross_cats_sorted":["stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-03T23:38:19Z","title_canon_sha256":"84873b3a30d08b4f73d3cb7a54b01efa0e77edb25746b829ac58c66a564750f1"},"schema_version":"1.0","source":{"id":"2605.02099","kind":"arxiv","version":2}},"canonical_sha256":"f622d63744648b0c029c7abbe190bd3509cdcb552d119461be6200bd923aa7ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f622d63744648b0c029c7abbe190bd3509cdcb552d119461be6200bd923aa7ef","first_computed_at":"2026-05-20T01:05:15.187082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:15.187082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uE4+GTufBRwkbAn7ZtT8r68fd4EFiViO8+HcDbDr1GE175Yod6FLt3Ct0QNveVuhlBSbXd3GxARovqQtTe6KDg==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:15.187772Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.02099","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3466d23d0ad70570bfb3d3f41577de8c6b1c3dd9674c63377f09d1c4474146a9","sha256:4f9aa076c0ca6e5f72b9e79ce3af77336d614780a9bc7ea109f41e22fd100ebd"],"state_sha256":"f857d62c1a86af6fab3358051280bb2a736b20ee51953f62a3f09764daa58e31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1zSCWL0TylDYs8f3fcujQb8Sts0qzxbUjViEcojHz4KELHZOKA09WusGacDnej2uhe4rPBwcvAYa8bmgVgCBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:42:02.152444Z","bundle_sha256":"f0b7253c9a8a1240fe732f5b3482a4e4acdbd3da2a938db474c6a80c08866c0a"}}