{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:DIVE4PATY2ALDRE6XP2MJGLVNE","short_pith_number":"pith:DIVE4PAT","canonical_record":{"source":{"id":"1011.1936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-11-08T22:41:14Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"a35abca5be7195117dd725edf1c75f0d404cc412b3797658d499b697ba7bb3ec","abstract_canon_sha256":"08559cab1d0ddc64860ee94d410f7c826745d1627799b1b48471ccfd1afe54de"},"schema_version":"1.0"},"canonical_sha256":"1a2a4e3c13c680b1c49ebbf4c49975691c3ec90c896e7839ec4730b4a7be4b89","source":{"kind":"arxiv","id":"1011.1936","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1936","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1936v1","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1936","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"DIVE4PATY2AL","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DIVE4PATY2ALDRE6","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DIVE4PAT","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:DIVE4PATY2ALDRE6XP2MJGLVNE","target":"record","payload":{"canonical_record":{"source":{"id":"1011.1936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-11-08T22:41:14Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"a35abca5be7195117dd725edf1c75f0d404cc412b3797658d499b697ba7bb3ec","abstract_canon_sha256":"08559cab1d0ddc64860ee94d410f7c826745d1627799b1b48471ccfd1afe54de"},"schema_version":"1.0"},"canonical_sha256":"1a2a4e3c13c680b1c49ebbf4c49975691c3ec90c896e7839ec4730b4a7be4b89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:42.898916Z","signature_b64":"JAI2zfE/8VUiFb3XANqPVB9OlTJNDAr65eM+u28CderXO55SCswYlNHbTPSfK4pROlp7Gha/3OFfHpM2GKnvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a2a4e3c13c680b1c49ebbf4c49975691c3ec90c896e7839ec4730b4a7be4b89","last_reissued_at":"2026-05-18T04:36:42.898429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:42.898429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.1936","source_version":1,"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-18T04:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBsE9X8zNl8maen+7nNE9uWZnXWDeClBNs9EfmWxB2tO5Z8+WldskDRAHAfOv+rb24QMLU0rNSDwZNVr3JMXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:49:28.064164Z"},"content_sha256":"539324e969c35ce6d00cc3e7af76070db15b088d8447bb52bbf95379ed1eac51","schema_version":"1.0","event_id":"sha256:539324e969c35ce6d00cc3e7af76070db15b088d8447bb52bbf95379ed1eac51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:DIVE4PATY2ALDRE6XP2MJGLVNE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blackwell Approachability and Low-Regret Learning are Equivalent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Jacob Abernethy, Peter L. Bartlett","submitted_at":"2010-11-08T22:41:14Z","abstract_excerpt":"We consider the celebrated Blackwell Approachability Theorem for two-player games with vector payoffs. We show that Blackwell's result is equivalent, via efficient reductions, to the existence of \"no-regret\" algorithms for Online Linear Optimization. Indeed, we show that any algorithm for one such problem can be efficiently converted into an algorithm for the other. We provide a useful application of this reduction: the first efficient algorithm for calibrated forecasting."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1936","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":""},"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-18T04:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAtWnI2LOxQJx4req3XVt0huIIzQpX5aV5trzzzAyHj63s6G2zEnP2goHtczp10Rb6al+SxjrVXPKe/ejuU3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:49:28.064829Z"},"content_sha256":"b75e26b43661ffd44133909028dc4d5814da49d534e5561503c7323b9a52d13b","schema_version":"1.0","event_id":"sha256:b75e26b43661ffd44133909028dc4d5814da49d534e5561503c7323b9a52d13b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DIVE4PATY2ALDRE6XP2MJGLVNE/bundle.json","state_url":"https://pith.science/pith/DIVE4PATY2ALDRE6XP2MJGLVNE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DIVE4PATY2ALDRE6XP2MJGLVNE/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-11T00:49:28Z","links":{"resolver":"https://pith.science/pith/DIVE4PATY2ALDRE6XP2MJGLVNE","bundle":"https://pith.science/pith/DIVE4PATY2ALDRE6XP2MJGLVNE/bundle.json","state":"https://pith.science/pith/DIVE4PATY2ALDRE6XP2MJGLVNE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DIVE4PATY2ALDRE6XP2MJGLVNE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DIVE4PATY2ALDRE6XP2MJGLVNE","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":"08559cab1d0ddc64860ee94d410f7c826745d1627799b1b48471ccfd1afe54de","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-11-08T22:41:14Z","title_canon_sha256":"a35abca5be7195117dd725edf1c75f0d404cc412b3797658d499b697ba7bb3ec"},"schema_version":"1.0","source":{"id":"1011.1936","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.1936","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1011.1936v1","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1936","created_at":"2026-05-18T04:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"DIVE4PATY2AL","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DIVE4PATY2ALDRE6","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DIVE4PAT","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:b75e26b43661ffd44133909028dc4d5814da49d534e5561503c7323b9a52d13b","target":"graph","created_at":"2026-05-18T04:36:42Z","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 consider the celebrated Blackwell Approachability Theorem for two-player games with vector payoffs. We show that Blackwell's result is equivalent, via efficient reductions, to the existence of \"no-regret\" algorithms for Online Linear Optimization. Indeed, we show that any algorithm for one such problem can be efficiently converted into an algorithm for the other. We provide a useful application of this reduction: the first efficient algorithm for calibrated forecasting.","authors_text":"Elad Hazan, Jacob Abernethy, Peter L. Bartlett","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-11-08T22:41:14Z","title":"Blackwell Approachability and Low-Regret Learning are Equivalent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1936","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:539324e969c35ce6d00cc3e7af76070db15b088d8447bb52bbf95379ed1eac51","target":"record","created_at":"2026-05-18T04:36:42Z","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":"08559cab1d0ddc64860ee94d410f7c826745d1627799b1b48471ccfd1afe54de","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-11-08T22:41:14Z","title_canon_sha256":"a35abca5be7195117dd725edf1c75f0d404cc412b3797658d499b697ba7bb3ec"},"schema_version":"1.0","source":{"id":"1011.1936","kind":"arxiv","version":1}},"canonical_sha256":"1a2a4e3c13c680b1c49ebbf4c49975691c3ec90c896e7839ec4730b4a7be4b89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a2a4e3c13c680b1c49ebbf4c49975691c3ec90c896e7839ec4730b4a7be4b89","first_computed_at":"2026-05-18T04:36:42.898429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:42.898429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JAI2zfE/8VUiFb3XANqPVB9OlTJNDAr65eM+u28CderXO55SCswYlNHbTPSfK4pROlp7Gha/3OFfHpM2GKnvAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:42.898916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.1936","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:539324e969c35ce6d00cc3e7af76070db15b088d8447bb52bbf95379ed1eac51","sha256:b75e26b43661ffd44133909028dc4d5814da49d534e5561503c7323b9a52d13b"],"state_sha256":"59975067e9ea91ec695a818d9bd7e4295bd440438288b2d016134f8401f00e75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LgGJ4FAQ7Xom8AFc7J9zQckK/Jf8o85EF7SDSOsDRx3joc4Mex1gmEYpu2VxGQAlrJgzHTFlvdsHjSFes9QqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:49:28.069123Z","bundle_sha256":"c1d8724bf4052a73127923de9fa807afaf611441f2ce857cd4177f368733bdb1"}}