{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:G4BXG6YRDNZCPADL32DVJ2KUBE","short_pith_number":"pith:G4BXG6YR","canonical_record":{"source":{"id":"1205.2265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-08T23:06:06Z","cross_cats_sorted":[],"title_canon_sha256":"e7935880443e584658d853d0786b0ff8da9378a9d0b0d9edb2c6201235fbedd2","abstract_canon_sha256":"c2fcb19240bfa530e32bb12838cd5d2e8e41ba4f69a3a25a8b140d1cd3bca78a"},"schema_version":"1.0"},"canonical_sha256":"3703737b111b7227806bde8754e95409102f5c0859222a4c82a909e4514bde06","source":{"kind":"arxiv","id":"1205.2265","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2265","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2265v2","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2265","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"G4BXG6YRDNZC","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"G4BXG6YRDNZCPADL","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"G4BXG6YR","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:G4BXG6YRDNZCPADL32DVJ2KUBE","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-08T23:06:06Z","cross_cats_sorted":[],"title_canon_sha256":"e7935880443e584658d853d0786b0ff8da9378a9d0b0d9edb2c6201235fbedd2","abstract_canon_sha256":"c2fcb19240bfa530e32bb12838cd5d2e8e41ba4f69a3a25a8b140d1cd3bca78a"},"schema_version":"1.0"},"canonical_sha256":"3703737b111b7227806bde8754e95409102f5c0859222a4c82a909e4514bde06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:04.440309Z","signature_b64":"/Gmkfyl7ZQ6QFyXCPvu5G9LgY9zjTPmnWDsmP8s3exSr3HajrZEsVV8K3os8Rmx04ht5yqXhmtayZW9PNUVJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3703737b111b7227806bde8754e95409102f5c0859222a4c82a909e4514bde06","last_reissued_at":"2026-05-18T03:44:04.439374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:04.439374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2265","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-18T03:44:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1EtgeYQ2lo8dy1NDXZSPjuuJVvK6luTnoT+fjq0Dl8KBgtMvN2z4x1tZO7BAd7tnlIKHFmQrX1dDSn0JJzn8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:56:46.325937Z"},"content_sha256":"442ac8b2f8c2fb55cccee4e17461e807dc5b2a1dbafc6736fcfdb836530fbc3f","schema_version":"1.0","event_id":"sha256:442ac8b2f8c2fb55cccee4e17461e807dc5b2a1dbafc6736fcfdb836530fbc3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:G4BXG6YRDNZCPADL32DVJ2KUBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Constrained Regret Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Mehrdad Mahdavi, Rong Jin, Tianbao Yang","submitted_at":"2012-05-08T23:06:06Z","abstract_excerpt":"Online learning constitutes a mathematical and compelling framework to analyze sequential decision making problems in adversarial environments. The learner repeatedly chooses an action, the environment responds with an outcome, and then the learner receives a reward for the played action. The goal of the learner is to maximize his total reward. However, there are situations in which, in addition to maximizing the cumulative reward, there are some additional constraints on the sequence of decisions that must be satisfied on average by the learner. In this paper we study an extension to the onli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2265","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-18T03:44:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DHGAoOBNR9Ggx2A4VSD7EDnRQRmoz89pv87pLNdXjBeFH2v00Yk4tJ7JKSJd0/MZP9BAy01lM4qfodPDfoeABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:56:46.326418Z"},"content_sha256":"087016313f56494f25ecbb36d523467c396bf9e1beb132358990b4c6b97ca560","schema_version":"1.0","event_id":"sha256:087016313f56494f25ecbb36d523467c396bf9e1beb132358990b4c6b97ca560"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4BXG6YRDNZCPADL32DVJ2KUBE/bundle.json","state_url":"https://pith.science/pith/G4BXG6YRDNZCPADL32DVJ2KUBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4BXG6YRDNZCPADL32DVJ2KUBE/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-06T18:56:46Z","links":{"resolver":"https://pith.science/pith/G4BXG6YRDNZCPADL32DVJ2KUBE","bundle":"https://pith.science/pith/G4BXG6YRDNZCPADL32DVJ2KUBE/bundle.json","state":"https://pith.science/pith/G4BXG6YRDNZCPADL32DVJ2KUBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4BXG6YRDNZCPADL32DVJ2KUBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:G4BXG6YRDNZCPADL32DVJ2KUBE","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":"c2fcb19240bfa530e32bb12838cd5d2e8e41ba4f69a3a25a8b140d1cd3bca78a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-08T23:06:06Z","title_canon_sha256":"e7935880443e584658d853d0786b0ff8da9378a9d0b0d9edb2c6201235fbedd2"},"schema_version":"1.0","source":{"id":"1205.2265","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2265","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2265v2","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2265","created_at":"2026-05-18T03:44:04Z"},{"alias_kind":"pith_short_12","alias_value":"G4BXG6YRDNZC","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"G4BXG6YRDNZCPADL","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"G4BXG6YR","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:087016313f56494f25ecbb36d523467c396bf9e1beb132358990b4c6b97ca560","target":"graph","created_at":"2026-05-18T03:44: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":"Online learning constitutes a mathematical and compelling framework to analyze sequential decision making problems in adversarial environments. The learner repeatedly chooses an action, the environment responds with an outcome, and then the learner receives a reward for the played action. The goal of the learner is to maximize his total reward. However, there are situations in which, in addition to maximizing the cumulative reward, there are some additional constraints on the sequence of decisions that must be satisfied on average by the learner. In this paper we study an extension to the onli","authors_text":"Mehrdad Mahdavi, Rong Jin, Tianbao Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-08T23:06:06Z","title":"Efficient Constrained Regret Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2265","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:442ac8b2f8c2fb55cccee4e17461e807dc5b2a1dbafc6736fcfdb836530fbc3f","target":"record","created_at":"2026-05-18T03:44: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":"c2fcb19240bfa530e32bb12838cd5d2e8e41ba4f69a3a25a8b140d1cd3bca78a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-08T23:06:06Z","title_canon_sha256":"e7935880443e584658d853d0786b0ff8da9378a9d0b0d9edb2c6201235fbedd2"},"schema_version":"1.0","source":{"id":"1205.2265","kind":"arxiv","version":2}},"canonical_sha256":"3703737b111b7227806bde8754e95409102f5c0859222a4c82a909e4514bde06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3703737b111b7227806bde8754e95409102f5c0859222a4c82a909e4514bde06","first_computed_at":"2026-05-18T03:44:04.439374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:04.439374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Gmkfyl7ZQ6QFyXCPvu5G9LgY9zjTPmnWDsmP8s3exSr3HajrZEsVV8K3os8Rmx04ht5yqXhmtayZW9PNUVJDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:04.440309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2265","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:442ac8b2f8c2fb55cccee4e17461e807dc5b2a1dbafc6736fcfdb836530fbc3f","sha256:087016313f56494f25ecbb36d523467c396bf9e1beb132358990b4c6b97ca560"],"state_sha256":"923676ed93cef3649b17e201b25167ff01e5e480f885913e1639b981bbe2f449"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0zezxOCc4yS6hk+PXwxwGvdpJb3lw2Ha+1VSYIFZSll3VbXTw0iQlyeCbe/wazGTXuxwHgknyHE+Jp0gqAfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:56:46.328775Z","bundle_sha256":"bd66382dbf681c210ef040d9160085c1039a6dd7869f85c6f16d8912dfcdccd2"}}