{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Q4Q7WFURQG4VFSKHOHW6NMHWGV","short_pith_number":"pith:Q4Q7WFUR","canonical_record":{"source":{"id":"1607.02834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-11T06:45:46Z","cross_cats_sorted":[],"title_canon_sha256":"ea25b76e5c3e4d38b34ee80eae4a9987271348f356168681e129de86b6cd75ee","abstract_canon_sha256":"f017b775e25b76e65df45ec8bdff93e288ec1dfd931e4c93e08932862fcb9935"},"schema_version":"1.0"},"canonical_sha256":"8721fb169181b952c94771ede6b0f635492a3f296d2c6dbaeb6efca5dc902b43","source":{"kind":"arxiv","id":"1607.02834","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02834","created_at":"2026-05-18T01:11:04Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02834v2","created_at":"2026-05-18T01:11:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02834","created_at":"2026-05-18T01:11:04Z"},{"alias_kind":"pith_short_12","alias_value":"Q4Q7WFURQG4V","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q4Q7WFURQG4VFSKH","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q4Q7WFUR","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Q4Q7WFURQG4VFSKHOHW6NMHWGV","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-11T06:45:46Z","cross_cats_sorted":[],"title_canon_sha256":"ea25b76e5c3e4d38b34ee80eae4a9987271348f356168681e129de86b6cd75ee","abstract_canon_sha256":"f017b775e25b76e65df45ec8bdff93e288ec1dfd931e4c93e08932862fcb9935"},"schema_version":"1.0"},"canonical_sha256":"8721fb169181b952c94771ede6b0f635492a3f296d2c6dbaeb6efca5dc902b43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:04.568945Z","signature_b64":"hIRYt0W1mE2aKympBAXm2G2gG89GcaLulWsX5QrNVfM+lLC5tMLUYgTVu3g2xsSOp938uPBtIQzWj6r98sYIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8721fb169181b952c94771ede6b0f635492a3f296d2c6dbaeb6efca5dc902b43","last_reissued_at":"2026-05-18T01:11:04.568307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:04.568307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02834","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCTPilEZoyvMjd4mGXEGU7HBeHJoLiDA/Arz2jASKM0ZtJ0d39zbMauhf90jEzpv3Qq1/LK0BQNxZQvaiNCgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:46:56.847611Z"},"content_sha256":"32f86b019fbc78f8f6625ad11ff95caa31e7af501bb865664a5fa0d4bf319f71","schema_version":"1.0","event_id":"sha256:32f86b019fbc78f8f6625ad11ff95caa31e7af501bb865664a5fa0d4bf319f71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Q4Q7WFURQG4VFSKHOHW6NMHWGV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Lower Bounds for Multiplicative Weights Algorithmic Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Balasubramanian Sivan, Nick Gravin, Yuval Peres","submitted_at":"2016-07-11T06:45:46Z","abstract_excerpt":"We study the fundamental problem of prediction with expert advice and develop regret lower bounds for a large family of algorithms for this problem. We develop simple adversarial primitives, that lend themselves to various combinations leading to sharp lower bounds for many algorithmic families. We use these primitives to show that the classic Multiplicative Weights Algorithm (MWA) has a regret of $\\sqrt{\\frac{T \\ln k}{2}}$, there by completely closing the gap between upper and lower bounds. We further show a regret lower bound of $\\frac{2}{3}\\sqrt{\\frac{T\\ln k}{2}}$ for a much more general fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02834","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ArOKQepcGVhEZungRJgQqGuPhM2EMrtf6m7GN4mVGHRns+yh/1EdybhSNfO4qHvRNSTPOo9CqRXRIqIe5NL0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:46:56.847948Z"},"content_sha256":"883977639dd721629af0ba54a8a270ad8687a6dfb27c2a519423b5f1293d6888","schema_version":"1.0","event_id":"sha256:883977639dd721629af0ba54a8a270ad8687a6dfb27c2a519423b5f1293d6888"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4Q7WFURQG4VFSKHOHW6NMHWGV/bundle.json","state_url":"https://pith.science/pith/Q4Q7WFURQG4VFSKHOHW6NMHWGV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4Q7WFURQG4VFSKHOHW6NMHWGV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T01:46:56Z","links":{"resolver":"https://pith.science/pith/Q4Q7WFURQG4VFSKHOHW6NMHWGV","bundle":"https://pith.science/pith/Q4Q7WFURQG4VFSKHOHW6NMHWGV/bundle.json","state":"https://pith.science/pith/Q4Q7WFURQG4VFSKHOHW6NMHWGV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4Q7WFURQG4VFSKHOHW6NMHWGV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q4Q7WFURQG4VFSKHOHW6NMHWGV","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":"f017b775e25b76e65df45ec8bdff93e288ec1dfd931e4c93e08932862fcb9935","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-11T06:45:46Z","title_canon_sha256":"ea25b76e5c3e4d38b34ee80eae4a9987271348f356168681e129de86b6cd75ee"},"schema_version":"1.0","source":{"id":"1607.02834","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02834","created_at":"2026-05-18T01:11:04Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02834v2","created_at":"2026-05-18T01:11:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02834","created_at":"2026-05-18T01:11:04Z"},{"alias_kind":"pith_short_12","alias_value":"Q4Q7WFURQG4V","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q4Q7WFURQG4VFSKH","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q4Q7WFUR","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:883977639dd721629af0ba54a8a270ad8687a6dfb27c2a519423b5f1293d6888","target":"graph","created_at":"2026-05-18T01:11:04Z","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"},"paper":{"abstract_excerpt":"We study the fundamental problem of prediction with expert advice and develop regret lower bounds for a large family of algorithms for this problem. We develop simple adversarial primitives, that lend themselves to various combinations leading to sharp lower bounds for many algorithmic families. We use these primitives to show that the classic Multiplicative Weights Algorithm (MWA) has a regret of $\\sqrt{\\frac{T \\ln k}{2}}$, there by completely closing the gap between upper and lower bounds. We further show a regret lower bound of $\\frac{2}{3}\\sqrt{\\frac{T\\ln k}{2}}$ for a much more general fa","authors_text":"Balasubramanian Sivan, Nick Gravin, Yuval Peres","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-11T06:45:46Z","title":"Tight Lower Bounds for Multiplicative Weights Algorithmic Families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02834","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:32f86b019fbc78f8f6625ad11ff95caa31e7af501bb865664a5fa0d4bf319f71","target":"record","created_at":"2026-05-18T01:11:04Z","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":"f017b775e25b76e65df45ec8bdff93e288ec1dfd931e4c93e08932862fcb9935","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-11T06:45:46Z","title_canon_sha256":"ea25b76e5c3e4d38b34ee80eae4a9987271348f356168681e129de86b6cd75ee"},"schema_version":"1.0","source":{"id":"1607.02834","kind":"arxiv","version":2}},"canonical_sha256":"8721fb169181b952c94771ede6b0f635492a3f296d2c6dbaeb6efca5dc902b43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8721fb169181b952c94771ede6b0f635492a3f296d2c6dbaeb6efca5dc902b43","first_computed_at":"2026-05-18T01:11:04.568307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:04.568307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hIRYt0W1mE2aKympBAXm2G2gG89GcaLulWsX5QrNVfM+lLC5tMLUYgTVu3g2xsSOp938uPBtIQzWj6r98sYIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:04.568945Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02834","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32f86b019fbc78f8f6625ad11ff95caa31e7af501bb865664a5fa0d4bf319f71","sha256:883977639dd721629af0ba54a8a270ad8687a6dfb27c2a519423b5f1293d6888"],"state_sha256":"f6cd8acfa515b7295dfd487b4181a48e08aecc2a8072f1eb573e8dcfc795bb34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHH7JZzspjTBJUveMdwIF6Qk6xrYxcUndVTn0PplCo2j74Wn7Swho2zXoLXZoXjIsMInQZwVdE2bGdhd/obfCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:46:56.849954Z","bundle_sha256":"ad5db8db7c98b924af08b5783286c5808e05c3f0c8d57d26545e9c4fa2888021"}}