{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MA3FEWI2WKLG3TB6DCXQEXRY7D","short_pith_number":"pith:MA3FEWI2","canonical_record":{"source":{"id":"1508.05170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-21T03:44:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5e81acfcd8585bc77e801b1d370c009f68b576064dd74354c5d7ec3dba78bae5","abstract_canon_sha256":"ab8384fe03e451fd02c687e1c75dc2614586cc6d4d0b7bf4bd90e08c04ec0724"},"schema_version":"1.0"},"canonical_sha256":"603652591ab2966dcc3e18af025e38f8c3d18e69016720fba981776c45746711","source":{"kind":"arxiv","id":"1508.05170","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05170","created_at":"2026-07-05T00:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05170v2","created_at":"2026-07-05T00:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05170","created_at":"2026-07-05T00:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"MA3FEWI2WKLG","created_at":"2026-07-05T00:40:21Z"},{"alias_kind":"pith_short_16","alias_value":"MA3FEWI2WKLG3TB6","created_at":"2026-07-05T00:40:21Z"},{"alias_kind":"pith_short_8","alias_value":"MA3FEWI2","created_at":"2026-07-05T00:40:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MA3FEWI2WKLG3TB6DCXQEXRY7D","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-21T03:44:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5e81acfcd8585bc77e801b1d370c009f68b576064dd74354c5d7ec3dba78bae5","abstract_canon_sha256":"ab8384fe03e451fd02c687e1c75dc2614586cc6d4d0b7bf4bd90e08c04ec0724"},"schema_version":"1.0"},"canonical_sha256":"603652591ab2966dcc3e18af025e38f8c3d18e69016720fba981776c45746711","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:21.965653Z","signature_b64":"tYF3RUxt2CvFF4trSqDScIpgSV3w5yuMeg6IyR4q6ody4FyxXEPqh8DsRveBk++5fbekEUYZTQ0H1wfBQ209Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"603652591ab2966dcc3e18af025e38f8c3d18e69016720fba981776c45746711","last_reissued_at":"2026-07-05T00:40:21.965164Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:21.965164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05170","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-07-05T00:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjVVNBiJct1zc6dvF0aHnUpaskWet/QwQyUxctfR2O2Nn9BK8chJykUTZBitrAhjmHFfJ2ajtLnF09chd5qpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:04:52.459820Z"},"content_sha256":"e0e97df5621292eba43a4aed81bf818b7a33cf7606bfe1f803930fba6b17c654","schema_version":"1.0","event_id":"sha256:e0e97df5621292eba43a4aed81bf818b7a33cf7606bfe1f803930fba6b17c654"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MA3FEWI2WKLG3TB6DCXQEXRY7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Online Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Dylan J. Foster, Karthik Sridharan","submitted_at":"2015-08-21T03:44:43Z","abstract_excerpt":"We propose a general framework for studying adaptive regret bounds in the online learning framework, including model selection bounds and data-dependent bounds. Given a data- or model-dependent bound we ask, \"Does there exist some algorithm achieving this bound?\" We show that modifications to recently introduced sequential complexity measures can be used to answer this question by providing sufficient conditions under which adaptive rates can be achieved. In particular each adaptive rate induces a set of so-called offset complexity measures, and obtaining small upper bounds on these quantities"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05170","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1508.05170/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5Yu+5nJWVhKzH+3b673E/e/cmIArqL3NbCsB2o2QRK68w4f8hLNt5UVxBA7NvE20l3S6vp5I04fNchSQz1UAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:04:52.460176Z"},"content_sha256":"080f2d0176023b2dd8dc2ed1094c7248e6d8ae7f20c9f1772c1f3d3574dc4f35","schema_version":"1.0","event_id":"sha256:080f2d0176023b2dd8dc2ed1094c7248e6d8ae7f20c9f1772c1f3d3574dc4f35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D/bundle.json","state_url":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D/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-07-05T09:04:52Z","links":{"resolver":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D","bundle":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D/bundle.json","state":"https://pith.science/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MA3FEWI2WKLG3TB6DCXQEXRY7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MA3FEWI2WKLG3TB6DCXQEXRY7D","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":"ab8384fe03e451fd02c687e1c75dc2614586cc6d4d0b7bf4bd90e08c04ec0724","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-21T03:44:43Z","title_canon_sha256":"5e81acfcd8585bc77e801b1d370c009f68b576064dd74354c5d7ec3dba78bae5"},"schema_version":"1.0","source":{"id":"1508.05170","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05170","created_at":"2026-07-05T00:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05170v2","created_at":"2026-07-05T00:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05170","created_at":"2026-07-05T00:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"MA3FEWI2WKLG","created_at":"2026-07-05T00:40:21Z"},{"alias_kind":"pith_short_16","alias_value":"MA3FEWI2WKLG3TB6","created_at":"2026-07-05T00:40:21Z"},{"alias_kind":"pith_short_8","alias_value":"MA3FEWI2","created_at":"2026-07-05T00:40:21Z"}],"graph_snapshots":[{"event_id":"sha256:080f2d0176023b2dd8dc2ed1094c7248e6d8ae7f20c9f1772c1f3d3574dc4f35","target":"graph","created_at":"2026-07-05T00:40:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1508.05170/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a general framework for studying adaptive regret bounds in the online learning framework, including model selection bounds and data-dependent bounds. Given a data- or model-dependent bound we ask, \"Does there exist some algorithm achieving this bound?\" We show that modifications to recently introduced sequential complexity measures can be used to answer this question by providing sufficient conditions under which adaptive rates can be achieved. In particular each adaptive rate induces a set of so-called offset complexity measures, and obtaining small upper bounds on these quantities","authors_text":"Alexander Rakhlin, Dylan J. Foster, Karthik Sridharan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-21T03:44:43Z","title":"Adaptive Online Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05170","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:e0e97df5621292eba43a4aed81bf818b7a33cf7606bfe1f803930fba6b17c654","target":"record","created_at":"2026-07-05T00:40:21Z","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":"ab8384fe03e451fd02c687e1c75dc2614586cc6d4d0b7bf4bd90e08c04ec0724","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-21T03:44:43Z","title_canon_sha256":"5e81acfcd8585bc77e801b1d370c009f68b576064dd74354c5d7ec3dba78bae5"},"schema_version":"1.0","source":{"id":"1508.05170","kind":"arxiv","version":2}},"canonical_sha256":"603652591ab2966dcc3e18af025e38f8c3d18e69016720fba981776c45746711","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"603652591ab2966dcc3e18af025e38f8c3d18e69016720fba981776c45746711","first_computed_at":"2026-07-05T00:40:21.965164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:40:21.965164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tYF3RUxt2CvFF4trSqDScIpgSV3w5yuMeg6IyR4q6ody4FyxXEPqh8DsRveBk++5fbekEUYZTQ0H1wfBQ209Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:40:21.965653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05170","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0e97df5621292eba43a4aed81bf818b7a33cf7606bfe1f803930fba6b17c654","sha256:080f2d0176023b2dd8dc2ed1094c7248e6d8ae7f20c9f1772c1f3d3574dc4f35"],"state_sha256":"7852eb328f65c94e2f0f6b2a35d1aaf47edfecd92f7890a10def0d467ee92242"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4G1rGJuIF1Fd4870AhuF+6Hsi3gvnJr3IuBhXHokH58xq5UfwBb7MEM4gdyNGcfqIARNenaRqseRfmoyPCjECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:04:52.462114Z","bundle_sha256":"76f2e9c8a20cbce6e7497f8ad959feb8d7bbed2caa1ecd0ffe1c3a10ec49af6b"}}