{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WQESFOSHPSQVJ4WEG6SNPEMYTF","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":"2f35115983ab8215957a5ac33efee3862e593918bfbec9fe69cd1f371308c3fd","cross_cats_sorted":["math.IT","math.MG","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-03-13T16:54:04Z","title_canon_sha256":"18f8935e158607764bbf7e15f474d377b2532aea16ffbe2e791f7e1b7b6ec6fc"},"schema_version":"1.0","source":{"id":"2303.07279","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.07279","created_at":"2026-07-05T11:08:37Z"},{"alias_kind":"arxiv_version","alias_value":"2303.07279v2","created_at":"2026-07-05T11:08:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.07279","created_at":"2026-07-05T11:08:37Z"},{"alias_kind":"pith_short_12","alias_value":"WQESFOSHPSQV","created_at":"2026-07-05T11:08:37Z"},{"alias_kind":"pith_short_16","alias_value":"WQESFOSHPSQVJ4WE","created_at":"2026-07-05T11:08:37Z"},{"alias_kind":"pith_short_8","alias_value":"WQESFOSH","created_at":"2026-07-05T11:08:37Z"}],"graph_snapshots":[{"event_id":"sha256:f0334771bbb8a5b76fd892fae88adae381be7e1b0d026e6e15fd824e787015cd","target":"graph","created_at":"2026-07-05T11:08:37Z","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/2303.07279/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study sequential probability assignment in the Gaussian setting, where the goal is to predict, or equivalently compress, a sequence of real-valued observations almost as well as the best Gaussian distribution with mean constrained to a given subset of $\\mathbb{R}^n$. First, in the case of a convex constraint set $K$, we express the hardness of the prediction problem (the minimax regret) in terms of the intrinsic volumes of $K$; specifically, it equals the logarithm of the Wills functional from convex geometry. We then establish a comparison inequality for the Wills functional in the general","authors_text":"Jaouad Mourtada","cross_cats":["math.IT","math.MG","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-03-13T16:54:04Z","title":"Universal coding, intrinsic volumes, and metric complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.07279","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:240cd119bdcbe982d11959fe672d2f6a1fc6ed1e01ac5cb0dc74c622154084d4","target":"record","created_at":"2026-07-05T11:08:37Z","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":"2f35115983ab8215957a5ac33efee3862e593918bfbec9fe69cd1f371308c3fd","cross_cats_sorted":["math.IT","math.MG","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-03-13T16:54:04Z","title_canon_sha256":"18f8935e158607764bbf7e15f474d377b2532aea16ffbe2e791f7e1b7b6ec6fc"},"schema_version":"1.0","source":{"id":"2303.07279","kind":"arxiv","version":2}},"canonical_sha256":"b40922ba477ca154f2c437a4d79198995daa3ef068282d88bd0175e03e96196d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b40922ba477ca154f2c437a4d79198995daa3ef068282d88bd0175e03e96196d","first_computed_at":"2026-07-05T11:08:37.362473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:37.362473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v4sH2qQTBUJj4aBmakIdTCsXRs9AesShxOdBMw2Wmt+r87LawYQVtQZ7pe/BHvbzCBDxCMb/3an5hQPhU2EHCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:37.363019Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.07279","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:240cd119bdcbe982d11959fe672d2f6a1fc6ed1e01ac5cb0dc74c622154084d4","sha256:f0334771bbb8a5b76fd892fae88adae381be7e1b0d026e6e15fd824e787015cd"],"state_sha256":"7b332828d299e7dee3346b72cd2a90d46b60e1cc5666f4f29a0367aa95e86725"}