{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WQESFOSHPSQVJ4WEG6SNPEMYTF","short_pith_number":"pith:WQESFOSH","schema_version":"1.0","canonical_sha256":"b40922ba477ca154f2c437a4d79198995daa3ef068282d88bd0175e03e96196d","source":{"kind":"arxiv","id":"2303.07279","version":2},"attestation_state":"computed","paper":{"title":"Universal coding, intrinsic volumes, and metric complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.MG","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Jaouad Mourtada","submitted_at":"2023-03-13T16:54:04Z","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"},"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":"2303.07279","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-03-13T16:54:04Z","cross_cats_sorted":["math.IT","math.MG","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"18f8935e158607764bbf7e15f474d377b2532aea16ffbe2e791f7e1b7b6ec6fc","abstract_canon_sha256":"2f35115983ab8215957a5ac33efee3862e593918bfbec9fe69cd1f371308c3fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:37.363019Z","signature_b64":"v4sH2qQTBUJj4aBmakIdTCsXRs9AesShxOdBMw2Wmt+r87LawYQVtQZ7pe/BHvbzCBDxCMb/3an5hQPhU2EHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b40922ba477ca154f2c437a4d79198995daa3ef068282d88bd0175e03e96196d","last_reissued_at":"2026-07-05T11:08:37.362473Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:37.362473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal coding, intrinsic volumes, and metric complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.MG","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Jaouad Mourtada","submitted_at":"2023-03-13T16:54:04Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.07279","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.07279/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":"2303.07279","created_at":"2026-07-05T11:08:37.362535+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.07279v2","created_at":"2026-07-05T11:08:37.362535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.07279","created_at":"2026-07-05T11:08:37.362535+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQESFOSHPSQV","created_at":"2026-07-05T11:08:37.362535+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQESFOSHPSQVJ4WE","created_at":"2026-07-05T11:08:37.362535+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQESFOSH","created_at":"2026-07-05T11:08:37.362535+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/WQESFOSHPSQVJ4WEG6SNPEMYTF","json":"https://pith.science/pith/WQESFOSHPSQVJ4WEG6SNPEMYTF.json","graph_json":"https://pith.science/api/pith-number/WQESFOSHPSQVJ4WEG6SNPEMYTF/graph.json","events_json":"https://pith.science/api/pith-number/WQESFOSHPSQVJ4WEG6SNPEMYTF/events.json","paper":"https://pith.science/paper/WQESFOSH"},"agent_actions":{"view_html":"https://pith.science/pith/WQESFOSHPSQVJ4WEG6SNPEMYTF","download_json":"https://pith.science/pith/WQESFOSHPSQVJ4WEG6SNPEMYTF.json","view_paper":"https://pith.science/paper/WQESFOSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.07279&json=true","fetch_graph":"https://pith.science/api/pith-number/WQESFOSHPSQVJ4WEG6SNPEMYTF/graph.json","fetch_events":"https://pith.science/api/pith-number/WQESFOSHPSQVJ4WEG6SNPEMYTF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQESFOSHPSQVJ4WEG6SNPEMYTF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQESFOSHPSQVJ4WEG6SNPEMYTF/action/storage_attestation","attest_author":"https://pith.science/pith/WQESFOSHPSQVJ4WEG6SNPEMYTF/action/author_attestation","sign_citation":"https://pith.science/pith/WQESFOSHPSQVJ4WEG6SNPEMYTF/action/citation_signature","submit_replication":"https://pith.science/pith/WQESFOSHPSQVJ4WEG6SNPEMYTF/action/replication_record"}},"created_at":"2026-07-05T11:08:37.362535+00:00","updated_at":"2026-07-05T11:08:37.362535+00:00"}