{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5GOOV567TT5FSZY2MDWTHVJTIM","short_pith_number":"pith:5GOOV567","schema_version":"1.0","canonical_sha256":"e99ceaf7df9cfa59671a60ed33d53343007d63ed4d22fc45ef63e930235306ce","source":{"kind":"arxiv","id":"2503.17823","version":1},"attestation_state":"computed","paper":{"title":"On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Yury Polyanskiy, Zeyu Jia","submitted_at":"2025-03-22T17:26:34Z","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"},"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":"2503.17823","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-22T17:26:34Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"2b9f737e9d8965023c871fe4d63b7fd70acda1d2443a96d2c8295a8a9115fb45","abstract_canon_sha256":"1de8ba069db8091f2ff1b1a216b89d1bd86d81ec25e2dc53fca6bda5fce64d62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:55.757745Z","signature_b64":"Q207JwhSwp7hqUNu/68qSecd4HBs5s7Kqvvf7rKOGIqtY0zdUQjf6Q0hbI8K/Pvzl/w9sz/EhdoiMxu1mtTGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e99ceaf7df9cfa59671a60ed33d53343007d63ed4d22fc45ef63e930235306ce","last_reissued_at":"2026-07-05T10:37:55.756809Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:55.756809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Yury Polyanskiy, Zeyu Jia","submitted_at":"2025-03-22T17:26:34Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.17823","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.17823/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":"2503.17823","created_at":"2026-07-05T10:37:55.756925+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.17823v1","created_at":"2026-07-05T10:37:55.756925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.17823","created_at":"2026-07-05T10:37:55.756925+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GOOV567TT5F","created_at":"2026-07-05T10:37:55.756925+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GOOV567TT5FSZY2","created_at":"2026-07-05T10:37:55.756925+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GOOV567","created_at":"2026-07-05T10:37:55.756925+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/5GOOV567TT5FSZY2MDWTHVJTIM","json":"https://pith.science/pith/5GOOV567TT5FSZY2MDWTHVJTIM.json","graph_json":"https://pith.science/api/pith-number/5GOOV567TT5FSZY2MDWTHVJTIM/graph.json","events_json":"https://pith.science/api/pith-number/5GOOV567TT5FSZY2MDWTHVJTIM/events.json","paper":"https://pith.science/paper/5GOOV567"},"agent_actions":{"view_html":"https://pith.science/pith/5GOOV567TT5FSZY2MDWTHVJTIM","download_json":"https://pith.science/pith/5GOOV567TT5FSZY2MDWTHVJTIM.json","view_paper":"https://pith.science/paper/5GOOV567","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.17823&json=true","fetch_graph":"https://pith.science/api/pith-number/5GOOV567TT5FSZY2MDWTHVJTIM/graph.json","fetch_events":"https://pith.science/api/pith-number/5GOOV567TT5FSZY2MDWTHVJTIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GOOV567TT5FSZY2MDWTHVJTIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GOOV567TT5FSZY2MDWTHVJTIM/action/storage_attestation","attest_author":"https://pith.science/pith/5GOOV567TT5FSZY2MDWTHVJTIM/action/author_attestation","sign_citation":"https://pith.science/pith/5GOOV567TT5FSZY2MDWTHVJTIM/action/citation_signature","submit_replication":"https://pith.science/pith/5GOOV567TT5FSZY2MDWTHVJTIM/action/replication_record"}},"created_at":"2026-07-05T10:37:55.756925+00:00","updated_at":"2026-07-05T10:37:55.756925+00:00"}