{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JUMO4T2S6HBSR74ROR34H27ZJP","short_pith_number":"pith:JUMO4T2S","schema_version":"1.0","canonical_sha256":"4d18ee4f52f1c328ff917477c3ebf94beafa8b118ddb850750eca40bf9cfc6a5","source":{"kind":"arxiv","id":"1409.3040","version":5},"attestation_state":"computed","paper":{"title":"Towards Optimal Algorithms for Prediction with Expert Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.PR"],"primary_cat":"cs.LG","authors_text":"Balasubramanian Sivan, Nick Gravin, Yuval Peres","submitted_at":"2014-09-10T12:16:19Z","abstract_excerpt":"We study the classical problem of prediction with expert advice in the adversarial setting with a geometric stopping time. In 1965, Cover gave the optimal algorithm for the case of 2 experts. In this paper, we design the optimal algorithm, adversary and regret for the case of 3 experts. Further, we show that the optimal algorithm for $2$ and $3$ experts is a probability matching algorithm (analogous to Thompson sampling) against a particular randomized adversary. Remarkably, our proof shows that the probability matching algorithm is not only optimal against this particular randomized adversary"},"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":"1409.3040","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-10T12:16:19Z","cross_cats_sorted":["cs.GT","math.PR"],"title_canon_sha256":"c1d4e12028b47ea7aa34d41f828c31b366ca2019eb7b05fa99cffc10837629d1","abstract_canon_sha256":"f2c0044e45ed09e4fca78ff5b2ae331752abd7f753eaaaa1f5ae1a326f3c2002"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:18.536189Z","signature_b64":"+iKMoIW7oWyH/VXpEFqL4P3RlfOXIPIMu7jl0UX/9IpH/fl3vaWSCFyGMJ2N46NF3PrBjRQCGa3S3loKiszaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d18ee4f52f1c328ff917477c3ebf94beafa8b118ddb850750eca40bf9cfc6a5","last_reissued_at":"2026-05-18T01:11:18.535686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:18.535686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Optimal Algorithms for Prediction with Expert Advice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.PR"],"primary_cat":"cs.LG","authors_text":"Balasubramanian Sivan, Nick Gravin, Yuval Peres","submitted_at":"2014-09-10T12:16:19Z","abstract_excerpt":"We study the classical problem of prediction with expert advice in the adversarial setting with a geometric stopping time. In 1965, Cover gave the optimal algorithm for the case of 2 experts. In this paper, we design the optimal algorithm, adversary and regret for the case of 3 experts. Further, we show that the optimal algorithm for $2$ and $3$ experts is a probability matching algorithm (analogous to Thompson sampling) against a particular randomized adversary. Remarkably, our proof shows that the probability matching algorithm is not only optimal against this particular randomized adversary"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3040","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.3040","created_at":"2026-05-18T01:11:18.535766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.3040v5","created_at":"2026-05-18T01:11:18.535766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3040","created_at":"2026-05-18T01:11:18.535766+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUMO4T2S6HBS","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUMO4T2S6HBSR74R","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUMO4T2S","created_at":"2026-05-18T12:28:35.611951+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/JUMO4T2S6HBSR74ROR34H27ZJP","json":"https://pith.science/pith/JUMO4T2S6HBSR74ROR34H27ZJP.json","graph_json":"https://pith.science/api/pith-number/JUMO4T2S6HBSR74ROR34H27ZJP/graph.json","events_json":"https://pith.science/api/pith-number/JUMO4T2S6HBSR74ROR34H27ZJP/events.json","paper":"https://pith.science/paper/JUMO4T2S"},"agent_actions":{"view_html":"https://pith.science/pith/JUMO4T2S6HBSR74ROR34H27ZJP","download_json":"https://pith.science/pith/JUMO4T2S6HBSR74ROR34H27ZJP.json","view_paper":"https://pith.science/paper/JUMO4T2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.3040&json=true","fetch_graph":"https://pith.science/api/pith-number/JUMO4T2S6HBSR74ROR34H27ZJP/graph.json","fetch_events":"https://pith.science/api/pith-number/JUMO4T2S6HBSR74ROR34H27ZJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUMO4T2S6HBSR74ROR34H27ZJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUMO4T2S6HBSR74ROR34H27ZJP/action/storage_attestation","attest_author":"https://pith.science/pith/JUMO4T2S6HBSR74ROR34H27ZJP/action/author_attestation","sign_citation":"https://pith.science/pith/JUMO4T2S6HBSR74ROR34H27ZJP/action/citation_signature","submit_replication":"https://pith.science/pith/JUMO4T2S6HBSR74ROR34H27ZJP/action/replication_record"}},"created_at":"2026-05-18T01:11:18.535766+00:00","updated_at":"2026-05-18T01:11:18.535766+00:00"}