{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VUCGUDHWCLWDFOYGJ5BVLZJJON","short_pith_number":"pith:VUCGUDHW","schema_version":"1.0","canonical_sha256":"ad046a0cf612ec32bb064f4355e529735b62adc5dc4f6ad47bb0e3305cb533fa","source":{"kind":"arxiv","id":"1011.5668","version":1},"attestation_state":"computed","paper":{"title":"On Theorem 2.3 in \"Prediction, Learning, and Games\" by Cesa-Bianchi and Lugosi","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexey Chernov","submitted_at":"2010-11-25T18:52:30Z","abstract_excerpt":"The note presents a modified proof of a loss bound for the exponentially weighted average forecaster with time-varying potential. The regret term of the algorithm is upper-bounded by sqrt{n ln(N)} (uniformly in n), where N is the number of experts and n is the number of steps."},"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":"1011.5668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-11-25T18:52:30Z","cross_cats_sorted":[],"title_canon_sha256":"e4d90177accc68b8eaedfcf099f16ae3059509090c5a6e2e083269964114ba16","abstract_canon_sha256":"4006174fd19adae89f8d73988d99154b620487fdd742994cc537f107f47e02a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:45.396070Z","signature_b64":"QqrrgySbDp5tKIu4b4J0WrzBLM3zvVyc+ZUF+VJERsRfPXthi3u0Z02oPzUTvXkahh8GAzbpZzA3vCH/dauHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad046a0cf612ec32bb064f4355e529735b62adc5dc4f6ad47bb0e3305cb533fa","last_reissued_at":"2026-05-18T04:34:45.395642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:45.395642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Theorem 2.3 in \"Prediction, Learning, and Games\" by Cesa-Bianchi and Lugosi","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexey Chernov","submitted_at":"2010-11-25T18:52:30Z","abstract_excerpt":"The note presents a modified proof of a loss bound for the exponentially weighted average forecaster with time-varying potential. The regret term of the algorithm is upper-bounded by sqrt{n ln(N)} (uniformly in n), where N is the number of experts and n is the number of steps."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5668","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.5668","created_at":"2026-05-18T04:34:45.395707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5668v1","created_at":"2026-05-18T04:34:45.395707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5668","created_at":"2026-05-18T04:34:45.395707+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUCGUDHWCLWD","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUCGUDHWCLWDFOYG","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUCGUDHW","created_at":"2026-05-18T12:26:15.391820+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/VUCGUDHWCLWDFOYGJ5BVLZJJON","json":"https://pith.science/pith/VUCGUDHWCLWDFOYGJ5BVLZJJON.json","graph_json":"https://pith.science/api/pith-number/VUCGUDHWCLWDFOYGJ5BVLZJJON/graph.json","events_json":"https://pith.science/api/pith-number/VUCGUDHWCLWDFOYGJ5BVLZJJON/events.json","paper":"https://pith.science/paper/VUCGUDHW"},"agent_actions":{"view_html":"https://pith.science/pith/VUCGUDHWCLWDFOYGJ5BVLZJJON","download_json":"https://pith.science/pith/VUCGUDHWCLWDFOYGJ5BVLZJJON.json","view_paper":"https://pith.science/paper/VUCGUDHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5668&json=true","fetch_graph":"https://pith.science/api/pith-number/VUCGUDHWCLWDFOYGJ5BVLZJJON/graph.json","fetch_events":"https://pith.science/api/pith-number/VUCGUDHWCLWDFOYGJ5BVLZJJON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUCGUDHWCLWDFOYGJ5BVLZJJON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUCGUDHWCLWDFOYGJ5BVLZJJON/action/storage_attestation","attest_author":"https://pith.science/pith/VUCGUDHWCLWDFOYGJ5BVLZJJON/action/author_attestation","sign_citation":"https://pith.science/pith/VUCGUDHWCLWDFOYGJ5BVLZJJON/action/citation_signature","submit_replication":"https://pith.science/pith/VUCGUDHWCLWDFOYGJ5BVLZJJON/action/replication_record"}},"created_at":"2026-05-18T04:34:45.395707+00:00","updated_at":"2026-05-18T04:34:45.395707+00:00"}