{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5GOOV567TT5FSZY2MDWTHVJTIM","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":"1de8ba069db8091f2ff1b1a216b89d1bd86d81ec25e2dc53fca6bda5fce64d62","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-22T17:26:34Z","title_canon_sha256":"2b9f737e9d8965023c871fe4d63b7fd70acda1d2443a96d2c8295a8a9115fb45"},"schema_version":"1.0","source":{"id":"2503.17823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.17823","created_at":"2026-07-05T10:37:55Z"},{"alias_kind":"arxiv_version","alias_value":"2503.17823v1","created_at":"2026-07-05T10:37:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.17823","created_at":"2026-07-05T10:37:55Z"},{"alias_kind":"pith_short_12","alias_value":"5GOOV567TT5F","created_at":"2026-07-05T10:37:55Z"},{"alias_kind":"pith_short_16","alias_value":"5GOOV567TT5FSZY2","created_at":"2026-07-05T10:37:55Z"},{"alias_kind":"pith_short_8","alias_value":"5GOOV567","created_at":"2026-07-05T10:37:55Z"}],"graph_snapshots":[{"event_id":"sha256:b563ec3664dce29401c0303f7bcf099d997e8ff90c702b4ad87ac17bbb4d87ac","target":"graph","created_at":"2026-07-05T10:37:55Z","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/2503.17823/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of sequential probability assignment under logarithmic loss, both with and without side information. Our objective is to analyze the minimax regret -- a notion extensively studied in the literature -- in terms of geometric quantities, such as covering numbers and scale-sensitive dimensions. We show that the minimax regret for the case of no side information (equivalently, the Shtarkov sum) can be upper bounded in terms of sequential square-root entropy, a notion closely related to Hellinger distance. For the problem of sequential probability assignment with side informatio","authors_text":"Alexander Rakhlin, Yury Polyanskiy, Zeyu Jia","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-22T17:26:34Z","title":"On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.17823","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:4c8e5e9ec88a8275fe54cfcc11629f01baf41a5923e539ada293541af9f94913","target":"record","created_at":"2026-07-05T10:37:55Z","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":"1de8ba069db8091f2ff1b1a216b89d1bd86d81ec25e2dc53fca6bda5fce64d62","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-22T17:26:34Z","title_canon_sha256":"2b9f737e9d8965023c871fe4d63b7fd70acda1d2443a96d2c8295a8a9115fb45"},"schema_version":"1.0","source":{"id":"2503.17823","kind":"arxiv","version":1}},"canonical_sha256":"e99ceaf7df9cfa59671a60ed33d53343007d63ed4d22fc45ef63e930235306ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e99ceaf7df9cfa59671a60ed33d53343007d63ed4d22fc45ef63e930235306ce","first_computed_at":"2026-07-05T10:37:55.756809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:37:55.756809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q207JwhSwp7hqUNu/68qSecd4HBs5s7Kqvvf7rKOGIqtY0zdUQjf6Q0hbI8K/Pvzl/w9sz/EhdoiMxu1mtTGBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:37:55.757745Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.17823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c8e5e9ec88a8275fe54cfcc11629f01baf41a5923e539ada293541af9f94913","sha256:b563ec3664dce29401c0303f7bcf099d997e8ff90c702b4ad87ac17bbb4d87ac"],"state_sha256":"fe8e64b8e9e641d7b7f95015bf4676b11cb4104ddff2652556053439c9913f6d"}