{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:N5DTA76GUXJ4M4EZ6OW4YJ6RZK","short_pith_number":"pith:N5DTA76G","schema_version":"1.0","canonical_sha256":"6f47307fc6a5d3c67099f3adcc27d1cab0c5a81b2a7e2e3aa4debfe1dd4905a5","source":{"kind":"arxiv","id":"1204.4710","version":2},"attestation_state":"computed","paper":{"title":"Regret in Online Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"G\\'abor Lugosi, Jean-Yves Audibert, S\\'ebastien Bubeck","submitted_at":"2012-04-20T19:26:05Z","abstract_excerpt":"We address online linear optimization problems when the possible actions of the decision maker are represented by binary vectors. The regret of the decision maker is the difference between her realized loss and the best loss she would have achieved by picking, in hindsight, the best possible action. Our goal is to understand the magnitude of the best possible (minimax) regret. We study the problem under three different assumptions for the feedback the decision maker receives: full information, and the partial information models of the so-called \"semi-bandit\" and \"bandit\" problems. Combining th"},"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":"1204.4710","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-04-20T19:26:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ee6992eb120230b46a9d445903cf98b424a7f3874b767c37ae564ff4cc2ddb41","abstract_canon_sha256":"bcc86522a3a84f2030b9ea2d7a2e0656a39fbef8661de7a365aa4521f7a4021b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:27.627032Z","signature_b64":"DARHyWDnXWx+dVqlNNlpX8AIVZFoIC+RfypCkgRPqN1ibr17cL0APX2mo/5YoUnfJoB4dug6rpP3nM8t+UGSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f47307fc6a5d3c67099f3adcc27d1cab0c5a81b2a7e2e3aa4debfe1dd4905a5","last_reissued_at":"2026-05-18T03:29:27.626292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:27.626292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regret in Online Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"G\\'abor Lugosi, Jean-Yves Audibert, S\\'ebastien Bubeck","submitted_at":"2012-04-20T19:26:05Z","abstract_excerpt":"We address online linear optimization problems when the possible actions of the decision maker are represented by binary vectors. The regret of the decision maker is the difference between her realized loss and the best loss she would have achieved by picking, in hindsight, the best possible action. Our goal is to understand the magnitude of the best possible (minimax) regret. We study the problem under three different assumptions for the feedback the decision maker receives: full information, and the partial information models of the so-called \"semi-bandit\" and \"bandit\" problems. Combining th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4710","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.4710","created_at":"2026-05-18T03:29:27.626418+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4710v2","created_at":"2026-05-18T03:29:27.626418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4710","created_at":"2026-05-18T03:29:27.626418+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5DTA76GUXJ4","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5DTA76GUXJ4M4EZ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5DTA76G","created_at":"2026-05-18T12:27:16.716162+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/N5DTA76GUXJ4M4EZ6OW4YJ6RZK","json":"https://pith.science/pith/N5DTA76GUXJ4M4EZ6OW4YJ6RZK.json","graph_json":"https://pith.science/api/pith-number/N5DTA76GUXJ4M4EZ6OW4YJ6RZK/graph.json","events_json":"https://pith.science/api/pith-number/N5DTA76GUXJ4M4EZ6OW4YJ6RZK/events.json","paper":"https://pith.science/paper/N5DTA76G"},"agent_actions":{"view_html":"https://pith.science/pith/N5DTA76GUXJ4M4EZ6OW4YJ6RZK","download_json":"https://pith.science/pith/N5DTA76GUXJ4M4EZ6OW4YJ6RZK.json","view_paper":"https://pith.science/paper/N5DTA76G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4710&json=true","fetch_graph":"https://pith.science/api/pith-number/N5DTA76GUXJ4M4EZ6OW4YJ6RZK/graph.json","fetch_events":"https://pith.science/api/pith-number/N5DTA76GUXJ4M4EZ6OW4YJ6RZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5DTA76GUXJ4M4EZ6OW4YJ6RZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5DTA76GUXJ4M4EZ6OW4YJ6RZK/action/storage_attestation","attest_author":"https://pith.science/pith/N5DTA76GUXJ4M4EZ6OW4YJ6RZK/action/author_attestation","sign_citation":"https://pith.science/pith/N5DTA76GUXJ4M4EZ6OW4YJ6RZK/action/citation_signature","submit_replication":"https://pith.science/pith/N5DTA76GUXJ4M4EZ6OW4YJ6RZK/action/replication_record"}},"created_at":"2026-05-18T03:29:27.626418+00:00","updated_at":"2026-05-18T03:29:27.626418+00:00"}