{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R5OJVWHP5PLAPHWX674D6UFGCE","short_pith_number":"pith:R5OJVWHP","canonical_record":{"source":{"id":"1502.08009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-27T18:56:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a5226531b11e5d5029bc25dba9a211be8035ca5b0558543a951ff1d66d06f3e3","abstract_canon_sha256":"2f9bdc8a5d8f5f2bb40efabecd9aca61fd75ea0c1bf9f5742753006ac4f38a0d"},"schema_version":"1.0"},"canonical_sha256":"8f5c9ad8efebd6079ed7f7f83f50a6113ecb0c0f4fcb253f977c0aa18afb37e6","source":{"kind":"arxiv","id":"1502.08009","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.08009","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1502.08009v1","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.08009","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"R5OJVWHP5PLA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R5OJVWHP5PLAPHWX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R5OJVWHP","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R5OJVWHP5PLAPHWX674D6UFGCE","target":"record","payload":{"canonical_record":{"source":{"id":"1502.08009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-27T18:56:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a5226531b11e5d5029bc25dba9a211be8035ca5b0558543a951ff1d66d06f3e3","abstract_canon_sha256":"2f9bdc8a5d8f5f2bb40efabecd9aca61fd75ea0c1bf9f5742753006ac4f38a0d"},"schema_version":"1.0"},"canonical_sha256":"8f5c9ad8efebd6079ed7f7f83f50a6113ecb0c0f4fcb253f977c0aa18afb37e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:01.604631Z","signature_b64":"BPZ+TwFZ2RSV7/5dwIYEvHhamC+MQGM5UMIibTZiJv3sF/g84tjc6zNA0lZmWhtP84alVeSbOh74KliISIxIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f5c9ad8efebd6079ed7f7f83f50a6113ecb0c0f4fcb253f977c0aa18afb37e6","last_reissued_at":"2026-05-18T02:26:01.604217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:01.604217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.08009","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-18T02:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQc25VzcNLsJy07BO89xDfraWvPwAPs9d64ASlu3fhKJLWgMRA8/2i6AFicB4ByDdWjgjErkT8DhoZhKJs63Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:53:32.788980Z"},"content_sha256":"d8cd35545ac265ad5d48b4777b379f51281af70f5528a06d4d9c19b12e4fc287","schema_version":"1.0","event_id":"sha256:d8cd35545ac265ad5d48b4777b379f51281af70f5528a06d4d9c19b12e4fc287"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R5OJVWHP5PLAPHWX674D6UFGCE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Second-order Quantile Methods for Experts and Combinatorial Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Tim van Erven, Wouter M. Koolen","submitted_at":"2015-02-27T18:56:45Z","abstract_excerpt":"We aim to design strategies for sequential decision making that adjust to the difficulty of the learning problem. We study this question both in the setting of prediction with expert advice, and for more general combinatorial decision tasks. We are not satisfied with just guaranteeing minimax regret rates, but we want our algorithms to perform significantly better on easy data. Two popular ways to formalize such adaptivity are second-order regret bounds and quantile bounds. The underlying notions of 'easy data', which may be paraphrased as \"the learning problem has small variance\" and \"multipl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.08009","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-18T02:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XrRgOQFCdc/fJC0dRWhp6LpctlD1VsDRtU+0Ed2TwCSU1k1o5yoPmemw+y76WnxCIqamOg4woCJFCY0xbyWTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:53:32.789667Z"},"content_sha256":"358e8f3f9eb8e881f1a833dac8ec9903f0a1f5d417a3e21164338217338b9c41","schema_version":"1.0","event_id":"sha256:358e8f3f9eb8e881f1a833dac8ec9903f0a1f5d417a3e21164338217338b9c41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5OJVWHP5PLAPHWX674D6UFGCE/bundle.json","state_url":"https://pith.science/pith/R5OJVWHP5PLAPHWX674D6UFGCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5OJVWHP5PLAPHWX674D6UFGCE/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-05-25T18:53:32Z","links":{"resolver":"https://pith.science/pith/R5OJVWHP5PLAPHWX674D6UFGCE","bundle":"https://pith.science/pith/R5OJVWHP5PLAPHWX674D6UFGCE/bundle.json","state":"https://pith.science/pith/R5OJVWHP5PLAPHWX674D6UFGCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5OJVWHP5PLAPHWX674D6UFGCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R5OJVWHP5PLAPHWX674D6UFGCE","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":"2f9bdc8a5d8f5f2bb40efabecd9aca61fd75ea0c1bf9f5742753006ac4f38a0d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-27T18:56:45Z","title_canon_sha256":"a5226531b11e5d5029bc25dba9a211be8035ca5b0558543a951ff1d66d06f3e3"},"schema_version":"1.0","source":{"id":"1502.08009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.08009","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1502.08009v1","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.08009","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"R5OJVWHP5PLA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R5OJVWHP5PLAPHWX","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R5OJVWHP","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:358e8f3f9eb8e881f1a833dac8ec9903f0a1f5d417a3e21164338217338b9c41","target":"graph","created_at":"2026-05-18T02:26:01Z","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 aim to design strategies for sequential decision making that adjust to the difficulty of the learning problem. We study this question both in the setting of prediction with expert advice, and for more general combinatorial decision tasks. We are not satisfied with just guaranteeing minimax regret rates, but we want our algorithms to perform significantly better on easy data. Two popular ways to formalize such adaptivity are second-order regret bounds and quantile bounds. The underlying notions of 'easy data', which may be paraphrased as \"the learning problem has small variance\" and \"multipl","authors_text":"Tim van Erven, Wouter M. Koolen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-27T18:56:45Z","title":"Second-order Quantile Methods for Experts and Combinatorial Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.08009","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:d8cd35545ac265ad5d48b4777b379f51281af70f5528a06d4d9c19b12e4fc287","target":"record","created_at":"2026-05-18T02:26:01Z","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":"2f9bdc8a5d8f5f2bb40efabecd9aca61fd75ea0c1bf9f5742753006ac4f38a0d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-27T18:56:45Z","title_canon_sha256":"a5226531b11e5d5029bc25dba9a211be8035ca5b0558543a951ff1d66d06f3e3"},"schema_version":"1.0","source":{"id":"1502.08009","kind":"arxiv","version":1}},"canonical_sha256":"8f5c9ad8efebd6079ed7f7f83f50a6113ecb0c0f4fcb253f977c0aa18afb37e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f5c9ad8efebd6079ed7f7f83f50a6113ecb0c0f4fcb253f977c0aa18afb37e6","first_computed_at":"2026-05-18T02:26:01.604217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:01.604217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BPZ+TwFZ2RSV7/5dwIYEvHhamC+MQGM5UMIibTZiJv3sF/g84tjc6zNA0lZmWhtP84alVeSbOh74KliISIxIAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:01.604631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.08009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8cd35545ac265ad5d48b4777b379f51281af70f5528a06d4d9c19b12e4fc287","sha256:358e8f3f9eb8e881f1a833dac8ec9903f0a1f5d417a3e21164338217338b9c41"],"state_sha256":"e4ed040573e5c58c6ea23462d04af6194267db84ebcac3a11fe38103be0b9f47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xRLJk0dQYNxWaIysQ94FRpDiwWbizA79wnGOMRlXRDjxObpunisJr+EuB0bmicwU/HbSEiLSK+gCODtvXSMDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:53:32.793854Z","bundle_sha256":"91ec1e9e8d5ebfc9deaef5520aa74c463b3503633c188d41d064b3b146568a56"}}