{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QWG5TE3THNVZ2KBNG7R5N2ZREJ","short_pith_number":"pith:QWG5TE3T","canonical_record":{"source":{"id":"1304.7577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-29T07:17:31Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"d23a68430658ed585ad762191290edeccd4cce60ff5faf3e6d25c6a7313fa239","abstract_canon_sha256":"90f9f99ed4bffd93529600ecd3b6479415a54dc72a7fd1bec6b318ba030e40fd"},"schema_version":"1.0"},"canonical_sha256":"858dd993733b6b9d282d37e3d6eb312273c1067304050d7ff64286f4ab5d4abc","source":{"kind":"arxiv","id":"1304.7577","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7577","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7577v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7577","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"QWG5TE3THNVZ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QWG5TE3THNVZ2KBN","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QWG5TE3T","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QWG5TE3THNVZ2KBNG7R5N2ZREJ","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-29T07:17:31Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"d23a68430658ed585ad762191290edeccd4cce60ff5faf3e6d25c6a7313fa239","abstract_canon_sha256":"90f9f99ed4bffd93529600ecd3b6479415a54dc72a7fd1bec6b318ba030e40fd"},"schema_version":"1.0"},"canonical_sha256":"858dd993733b6b9d282d37e3d6eb312273c1067304050d7ff64286f4ab5d4abc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:53.608571Z","signature_b64":"WGpmcA9i6DBSn5mg5XZcAih1Ma1CVAlswFoS9xDHPstZQCdLe/SlyDF6cSTpPowd2CAdYSGO88mJr9IzlWhcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"858dd993733b6b9d282d37e3d6eb312273c1067304050d7ff64286f4ab5d4abc","last_reissued_at":"2026-05-18T03:26:53.607844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:53.607844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7577","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-18T03:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEI8qRb9KmP2CaTW9X4lDNL7RvRvxe0F80bSJmZdepAndUUWOmtFusTlzgYcRW2JPeocIVYE5EM2VS7pI/RZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:29:49.077430Z"},"content_sha256":"2509a3a3d089844adda317bc3f0acee9423eb41e3ad1bf9753312b474c66e7c2","schema_version":"1.0","event_id":"sha256:2509a3a3d089844adda317bc3f0acee9423eb41e3ad1bf9753312b474c66e7c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QWG5TE3THNVZ2KBNG7R5N2ZREJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal amortized regret in every interval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Preyas Popat, Rina Panigrahy","submitted_at":"2013-04-29T07:17:31Z","abstract_excerpt":"Consider the classical problem of predicting the next bit in a sequence of bits. A standard performance measure is {\\em regret} (loss in payoff) with respect to a set of experts. For example if we measure performance with respect to two constant experts one that always predicts 0's and another that always predicts 1's it is well known that one can get regret $O(\\sqrt T)$ with respect to the best expert by using, say, the weighted majority algorithm. But this algorithm does not provide performance guarantee in any interval. There are other algorithms that ensure regret $O(\\sqrt {x \\log T})$ in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7577","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-18T03:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tzZSnfPlXVv0Ski40fskevU4KsaZ5L4LWITwRxeeAR1dadXbQbp127cowKUhsHQY55MchqbbvIm//TkYncVeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:29:49.078012Z"},"content_sha256":"01cd883e895b9e501e944b3d6411679c572215ae20d237c7581d9abf896bb8db","schema_version":"1.0","event_id":"sha256:01cd883e895b9e501e944b3d6411679c572215ae20d237c7581d9abf896bb8db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWG5TE3THNVZ2KBNG7R5N2ZREJ/bundle.json","state_url":"https://pith.science/pith/QWG5TE3THNVZ2KBNG7R5N2ZREJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWG5TE3THNVZ2KBNG7R5N2ZREJ/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-23T23:29:49Z","links":{"resolver":"https://pith.science/pith/QWG5TE3THNVZ2KBNG7R5N2ZREJ","bundle":"https://pith.science/pith/QWG5TE3THNVZ2KBNG7R5N2ZREJ/bundle.json","state":"https://pith.science/pith/QWG5TE3THNVZ2KBNG7R5N2ZREJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWG5TE3THNVZ2KBNG7R5N2ZREJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QWG5TE3THNVZ2KBNG7R5N2ZREJ","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":"90f9f99ed4bffd93529600ecd3b6479415a54dc72a7fd1bec6b318ba030e40fd","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-29T07:17:31Z","title_canon_sha256":"d23a68430658ed585ad762191290edeccd4cce60ff5faf3e6d25c6a7313fa239"},"schema_version":"1.0","source":{"id":"1304.7577","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7577","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7577v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7577","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"QWG5TE3THNVZ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QWG5TE3THNVZ2KBN","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QWG5TE3T","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:01cd883e895b9e501e944b3d6411679c572215ae20d237c7581d9abf896bb8db","target":"graph","created_at":"2026-05-18T03:26:53Z","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":"Consider the classical problem of predicting the next bit in a sequence of bits. A standard performance measure is {\\em regret} (loss in payoff) with respect to a set of experts. For example if we measure performance with respect to two constant experts one that always predicts 0's and another that always predicts 1's it is well known that one can get regret $O(\\sqrt T)$ with respect to the best expert by using, say, the weighted majority algorithm. But this algorithm does not provide performance guarantee in any interval. There are other algorithms that ensure regret $O(\\sqrt {x \\log T})$ in ","authors_text":"Preyas Popat, Rina Panigrahy","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-29T07:17:31Z","title":"Optimal amortized regret in every interval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7577","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:2509a3a3d089844adda317bc3f0acee9423eb41e3ad1bf9753312b474c66e7c2","target":"record","created_at":"2026-05-18T03:26:53Z","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":"90f9f99ed4bffd93529600ecd3b6479415a54dc72a7fd1bec6b318ba030e40fd","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-29T07:17:31Z","title_canon_sha256":"d23a68430658ed585ad762191290edeccd4cce60ff5faf3e6d25c6a7313fa239"},"schema_version":"1.0","source":{"id":"1304.7577","kind":"arxiv","version":1}},"canonical_sha256":"858dd993733b6b9d282d37e3d6eb312273c1067304050d7ff64286f4ab5d4abc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"858dd993733b6b9d282d37e3d6eb312273c1067304050d7ff64286f4ab5d4abc","first_computed_at":"2026-05-18T03:26:53.607844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:53.607844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WGpmcA9i6DBSn5mg5XZcAih1Ma1CVAlswFoS9xDHPstZQCdLe/SlyDF6cSTpPowd2CAdYSGO88mJr9IzlWhcAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:53.608571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7577","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2509a3a3d089844adda317bc3f0acee9423eb41e3ad1bf9753312b474c66e7c2","sha256:01cd883e895b9e501e944b3d6411679c572215ae20d237c7581d9abf896bb8db"],"state_sha256":"217dfe63c259222b4cc335c166d748a9e509d1750c2bd865889046677fdae978"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z+RRzjhthrFegDEANnJZSfYWCBm8gUhDMffUN6UbGNaQuQgs0LfsyBWwvXxTZ0QStF7rxeF41vzZ2a6CzRywAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T23:29:49.080685Z","bundle_sha256":"86295be4129cfa89f8d14d65035d5b4f06b85457b6e0db2fe98b74f8e2bd6b78"}}