{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MHKCU64BDNL76BD4AVXG2WTTVB","short_pith_number":"pith:MHKCU64B","canonical_record":{"source":{"id":"1302.0581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T04:56:21Z","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"d96367339e24c94c0ddcf81c201da324f796372d6e1f7117f38477d353cf1387","abstract_canon_sha256":"e21cd4728516bcb4bba93186593c4864090830f629615a32cce58d8b5431d458"},"schema_version":"1.0"},"canonical_sha256":"61d42a7b811b57ff047c056e6d5a73a84541223662df4abb828667b5ce8f4dcd","source":{"kind":"arxiv","id":"1302.0581","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0581","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0581v2","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0581","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"pith_short_12","alias_value":"MHKCU64BDNL7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MHKCU64BDNL76BD4","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MHKCU64B","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MHKCU64BDNL76BD4AVXG2WTTVB","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T04:56:21Z","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"d96367339e24c94c0ddcf81c201da324f796372d6e1f7117f38477d353cf1387","abstract_canon_sha256":"e21cd4728516bcb4bba93186593c4864090830f629615a32cce58d8b5431d458"},"schema_version":"1.0"},"canonical_sha256":"61d42a7b811b57ff047c056e6d5a73a84541223662df4abb828667b5ce8f4dcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:57.569440Z","signature_b64":"1uSWYFY3qlospZ6yxQQ8+Npv2iNy++37w2ctaiweLmuYji7DvUs+yiDkzB1m+ulVYSgTpkaUC4w0M1bH55LnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61d42a7b811b57ff047c056e6d5a73a84541223662df4abb828667b5ce8f4dcd","last_reissued_at":"2026-05-18T02:55:57.568763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:57.568763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0581","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-18T02:55:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bAZZEIwBX+hq6oTiHnOY43b5ueOTccRHfATDhif3E19IiBB8V5ExyUSP7ItJ0WY/ZEmYlTCXyxZSYKU0lvGRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:07:16.884881Z"},"content_sha256":"f43a87cd91140c60c206d0024151da6e52ebfb1f600806b9852351899af980f0","schema_version":"1.0","event_id":"sha256:f43a87cd91140c60c206d0024151da6e52ebfb1f600806b9852351899af980f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MHKCU64BDNL76BD4AVXG2WTTVB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SMML estimators for exponential families with continuous sufficient statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"James G. Dowty","submitted_at":"2013-02-04T04:56:21Z","abstract_excerpt":"The minimum message length principle is an information theoretic criterion that links data compression with statistical inference. This paper studies the strict minimum message length (SMML) estimator for $d$-dimensional exponential families with continuous sufficient statistics, for all $d \\ge 1$. The partition of an SMML estimator is shown to consist of convex polytopes (i.e. convex polygons when $d=2$) which can be described explicitly in terms of the assertions and coding probabilities. While this result is known, we give a new proof based on the calculus of variations, and this approach g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0581","kind":"arxiv","version":2},"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-18T02:55:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugFkB3vCdxxsFhQs6Y38JsFgzR16dMkbjSc1cqLRY4CDfk9RmX4BhF0ra3u5ni40mIfaLT//S20GnIcklJ/AAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:07:16.885250Z"},"content_sha256":"93946a47ba12d623cbba107d9c9af07ddf41e01489efbcefb310a83a55920190","schema_version":"1.0","event_id":"sha256:93946a47ba12d623cbba107d9c9af07ddf41e01489efbcefb310a83a55920190"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MHKCU64BDNL76BD4AVXG2WTTVB/bundle.json","state_url":"https://pith.science/pith/MHKCU64BDNL76BD4AVXG2WTTVB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MHKCU64BDNL76BD4AVXG2WTTVB/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-30T05:07:16Z","links":{"resolver":"https://pith.science/pith/MHKCU64BDNL76BD4AVXG2WTTVB","bundle":"https://pith.science/pith/MHKCU64BDNL76BD4AVXG2WTTVB/bundle.json","state":"https://pith.science/pith/MHKCU64BDNL76BD4AVXG2WTTVB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MHKCU64BDNL76BD4AVXG2WTTVB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MHKCU64BDNL76BD4AVXG2WTTVB","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":"e21cd4728516bcb4bba93186593c4864090830f629615a32cce58d8b5431d458","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T04:56:21Z","title_canon_sha256":"d96367339e24c94c0ddcf81c201da324f796372d6e1f7117f38477d353cf1387"},"schema_version":"1.0","source":{"id":"1302.0581","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0581","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0581v2","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0581","created_at":"2026-05-18T02:55:57Z"},{"alias_kind":"pith_short_12","alias_value":"MHKCU64BDNL7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MHKCU64BDNL76BD4","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MHKCU64B","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:93946a47ba12d623cbba107d9c9af07ddf41e01489efbcefb310a83a55920190","target":"graph","created_at":"2026-05-18T02:55:57Z","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":"The minimum message length principle is an information theoretic criterion that links data compression with statistical inference. This paper studies the strict minimum message length (SMML) estimator for $d$-dimensional exponential families with continuous sufficient statistics, for all $d \\ge 1$. The partition of an SMML estimator is shown to consist of convex polytopes (i.e. convex polygons when $d=2$) which can be described explicitly in terms of the assertions and coding probabilities. While this result is known, we give a new proof based on the calculus of variations, and this approach g","authors_text":"James G. Dowty","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T04:56:21Z","title":"SMML estimators for exponential families with continuous sufficient statistics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0581","kind":"arxiv","version":2},"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:f43a87cd91140c60c206d0024151da6e52ebfb1f600806b9852351899af980f0","target":"record","created_at":"2026-05-18T02:55:57Z","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":"e21cd4728516bcb4bba93186593c4864090830f629615a32cce58d8b5431d458","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-04T04:56:21Z","title_canon_sha256":"d96367339e24c94c0ddcf81c201da324f796372d6e1f7117f38477d353cf1387"},"schema_version":"1.0","source":{"id":"1302.0581","kind":"arxiv","version":2}},"canonical_sha256":"61d42a7b811b57ff047c056e6d5a73a84541223662df4abb828667b5ce8f4dcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61d42a7b811b57ff047c056e6d5a73a84541223662df4abb828667b5ce8f4dcd","first_computed_at":"2026-05-18T02:55:57.568763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:57.568763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1uSWYFY3qlospZ6yxQQ8+Npv2iNy++37w2ctaiweLmuYji7DvUs+yiDkzB1m+ulVYSgTpkaUC4w0M1bH55LnAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:57.569440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0581","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f43a87cd91140c60c206d0024151da6e52ebfb1f600806b9852351899af980f0","sha256:93946a47ba12d623cbba107d9c9af07ddf41e01489efbcefb310a83a55920190"],"state_sha256":"4bfa419649fe737faf6d6f63e1247b4bfaea2001480bf8f6aac056c8a93d4006"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+mXgV1eofAb8r/eM9QjWh9QcLp8URRvRRujIdHz1Zg7qYiNTaIVPbU5gnERb22GavGjeUj4mKJSuD9S9LZ+FDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:07:16.887411Z","bundle_sha256":"4a209ed6e812a07babc82f440293431cc68a586e782c2d5e33360de00e3fe130"}}