{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XBGXSERMKSPK6LZ6HIMBM54EGY","short_pith_number":"pith:XBGXSERM","canonical_record":{"source":{"id":"1801.03705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-11T10:57:04Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"98d9c5e5173243a69aade41727dce6906d9a833fc4519c52ededca61ba2eb44e","abstract_canon_sha256":"96b0adac564bf4f61441a5653e388f41f97266b13d2db70de2842c0d0578025a"},"schema_version":"1.0"},"canonical_sha256":"b84d79122c549eaf2f3e3a181677843624f9ee66ff4fea718078fc8a754f138b","source":{"kind":"arxiv","id":"1801.03705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03705","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03705v1","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03705","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"XBGXSERMKSPK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XBGXSERMKSPK6LZ6","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XBGXSERM","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XBGXSERMKSPK6LZ6HIMBM54EGY","target":"record","payload":{"canonical_record":{"source":{"id":"1801.03705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-11T10:57:04Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"98d9c5e5173243a69aade41727dce6906d9a833fc4519c52ededca61ba2eb44e","abstract_canon_sha256":"96b0adac564bf4f61441a5653e388f41f97266b13d2db70de2842c0d0578025a"},"schema_version":"1.0"},"canonical_sha256":"b84d79122c549eaf2f3e3a181677843624f9ee66ff4fea718078fc8a754f138b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:13.645065Z","signature_b64":"OsPKljtPndoPRFiWf1TZ7c1LrXigT/UdNL0MGDAzEuWowp43R0mUwLDDOPi/odUHvqMsR2Dzm3tP8U4eEmGPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b84d79122c549eaf2f3e3a181677843624f9ee66ff4fea718078fc8a754f138b","last_reissued_at":"2026-05-18T00:26:13.644539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:13.644539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.03705","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-18T00:26:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZjCgjU8nV8B48kSo/yEL2J/i3mk/2QiYcal9hIh7Q8Kd6qKH/R13f5MqDlOOjcx1PVg12bHOk4D8jiDrVHdsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:32:36.921087Z"},"content_sha256":"e7022ec43a0a3929f8bd614185b0da0cef8388ec77651e613e50b3887f8317c0","schema_version":"1.0","event_id":"sha256:e7022ec43a0a3929f8bd614185b0da0cef8388ec77651e613e50b3887f8317c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XBGXSERMKSPK6LZ6HIMBM54EGY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Calculation of Normalized Maximum Likelihood Code Length Using Fourier Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Atsushi Suzuki, Kenji Yamanishi","submitted_at":"2018-01-11T10:57:04Z","abstract_excerpt":"The normalized maximum likelihood code length has been widely used in model selection, and its favorable properties, such as its consistency and the upper bound of its statistical risk, have been demonstrated. This paper proposes a novel methodology for calculating the normalized maximum likelihood code length on the basis of Fourier analysis. Our methodology provides an efficient non-asymptotic calculation formula for exponential family models and an asymptotic calculation formula for general parametric models with a weaker assumption compared to that in previous work."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03705","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-18T00:26:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9cFiXJb54BHc9+3nU2P4REUAV4rRdqhweEILOG41yaKjm3tK6d4bC+y8l7Ra3VqwCCb/Wn9ga+qb+25oMX+ICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:32:36.921444Z"},"content_sha256":"2759a5f4ee9105df2c269275d8a7fda9450a15b7e388e27cc8ac82512b5bad8d","schema_version":"1.0","event_id":"sha256:2759a5f4ee9105df2c269275d8a7fda9450a15b7e388e27cc8ac82512b5bad8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XBGXSERMKSPK6LZ6HIMBM54EGY/bundle.json","state_url":"https://pith.science/pith/XBGXSERMKSPK6LZ6HIMBM54EGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XBGXSERMKSPK6LZ6HIMBM54EGY/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-02T19:32:36Z","links":{"resolver":"https://pith.science/pith/XBGXSERMKSPK6LZ6HIMBM54EGY","bundle":"https://pith.science/pith/XBGXSERMKSPK6LZ6HIMBM54EGY/bundle.json","state":"https://pith.science/pith/XBGXSERMKSPK6LZ6HIMBM54EGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XBGXSERMKSPK6LZ6HIMBM54EGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XBGXSERMKSPK6LZ6HIMBM54EGY","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":"96b0adac564bf4f61441a5653e388f41f97266b13d2db70de2842c0d0578025a","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-11T10:57:04Z","title_canon_sha256":"98d9c5e5173243a69aade41727dce6906d9a833fc4519c52ededca61ba2eb44e"},"schema_version":"1.0","source":{"id":"1801.03705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03705","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03705v1","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03705","created_at":"2026-05-18T00:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"XBGXSERMKSPK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XBGXSERMKSPK6LZ6","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XBGXSERM","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:2759a5f4ee9105df2c269275d8a7fda9450a15b7e388e27cc8ac82512b5bad8d","target":"graph","created_at":"2026-05-18T00:26:13Z","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 normalized maximum likelihood code length has been widely used in model selection, and its favorable properties, such as its consistency and the upper bound of its statistical risk, have been demonstrated. This paper proposes a novel methodology for calculating the normalized maximum likelihood code length on the basis of Fourier analysis. Our methodology provides an efficient non-asymptotic calculation formula for exponential family models and an asymptotic calculation formula for general parametric models with a weaker assumption compared to that in previous work.","authors_text":"Atsushi Suzuki, Kenji Yamanishi","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-11T10:57:04Z","title":"Exact Calculation of Normalized Maximum Likelihood Code Length Using Fourier Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03705","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:e7022ec43a0a3929f8bd614185b0da0cef8388ec77651e613e50b3887f8317c0","target":"record","created_at":"2026-05-18T00:26:13Z","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":"96b0adac564bf4f61441a5653e388f41f97266b13d2db70de2842c0d0578025a","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-11T10:57:04Z","title_canon_sha256":"98d9c5e5173243a69aade41727dce6906d9a833fc4519c52ededca61ba2eb44e"},"schema_version":"1.0","source":{"id":"1801.03705","kind":"arxiv","version":1}},"canonical_sha256":"b84d79122c549eaf2f3e3a181677843624f9ee66ff4fea718078fc8a754f138b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b84d79122c549eaf2f3e3a181677843624f9ee66ff4fea718078fc8a754f138b","first_computed_at":"2026-05-18T00:26:13.644539Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:13.644539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OsPKljtPndoPRFiWf1TZ7c1LrXigT/UdNL0MGDAzEuWowp43R0mUwLDDOPi/odUHvqMsR2Dzm3tP8U4eEmGPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:13.645065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7022ec43a0a3929f8bd614185b0da0cef8388ec77651e613e50b3887f8317c0","sha256:2759a5f4ee9105df2c269275d8a7fda9450a15b7e388e27cc8ac82512b5bad8d"],"state_sha256":"7e2b72666472a0d3385ba89749484aeb3951e2825aa21138cebdefbb6099db9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"clmZyqF77UyySOq9LtBkzZ8BmqIfR1NNUBIuH8YiLSeqsRb7T4u6szSdJZZNO4gj7GcrSnuciVv7lUB0BdoSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:32:36.923372Z","bundle_sha256":"f75fd1883fb04be81ef2033d862cdfbf2192c9032b3977733af9279f32a66f89"}}