{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SKTTBCFICZPNIB44XUJIITE7MU","short_pith_number":"pith:SKTTBCFI","canonical_record":{"source":{"id":"1805.08562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T13:08:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"420707273b344d709b52747072bacb8662111c50f435c3f71230c621e5d0ac40","abstract_canon_sha256":"cff44bb2d6eef1bb349a375984347afdd36996f64ddeaaafab0a0123d23dd6bf"},"schema_version":"1.0"},"canonical_sha256":"92a73088a8165ed4079cbd12844c9f650c730dfd0f9a708e1b43d84468e17845","source":{"kind":"arxiv","id":"1805.08562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08562","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08562v1","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08562","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"pith_short_12","alias_value":"SKTTBCFICZPN","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SKTTBCFICZPNIB44","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SKTTBCFI","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SKTTBCFICZPNIB44XUJIITE7MU","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08562","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T13:08:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"420707273b344d709b52747072bacb8662111c50f435c3f71230c621e5d0ac40","abstract_canon_sha256":"cff44bb2d6eef1bb349a375984347afdd36996f64ddeaaafab0a0123d23dd6bf"},"schema_version":"1.0"},"canonical_sha256":"92a73088a8165ed4079cbd12844c9f650c730dfd0f9a708e1b43d84468e17845","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:26.008224Z","signature_b64":"Gv0nADuImsbfVOZDviSqDW5IWvv8uKnMMBzfJPHkZbwcAbDl2eqOXCoSxIF+ovXpYu+Sfy4obuC+Ba7oSTJRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92a73088a8165ed4079cbd12844c9f650c730dfd0f9a708e1b43d84468e17845","last_reissued_at":"2026-05-18T00:15:26.007283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:26.007283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08562","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-18T00:15:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FaD+8gWP/0Z5os1RSSElDr1vHmz4IRzgKlEPeG6K5MJLaFvgzUvolQHItfZzpGHZGA0+sEZAHQqlC+B0PM66Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:46:49.274879Z"},"content_sha256":"cf9c7e65b33153eaac4c82b684cc9a3d0f557a2c937cc05adea350236036fffe","schema_version":"1.0","event_id":"sha256:cf9c7e65b33153eaac4c82b684cc9a3d0f557a2c937cc05adea350236036fffe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SKTTBCFICZPNIB44XUJIITE7MU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Best of many worlds: Robust model selection for online supervised learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anant Sahai, Mitas Ray, Peter L. Bartlett, Vidya Muthukumar","submitted_at":"2018-05-22T13:08:41Z","abstract_excerpt":"We introduce algorithms for online, full-information prediction that are competitive with contextual tree experts of unknown complexity, in both probabilistic and adversarial settings. We show that by incorporating a probabilistic framework of structural risk minimization into existing adaptive algorithms, we can robustly learn not only the presence of stochastic structure when it exists (leading to constant as opposed to $\\mathcal{O}(\\sqrt{T})$ regret), but also the correct model order. We thus obtain regret bounds that are competitive with the regret of an optimal algorithm that possesses st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08562","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-18T00:15:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uYB0CW8htkTJ6I4rzPD0oKPAhZC713yHW6Lh18G1QYWrSh6KK/6Em+dKOgb2uygoTfKsCbrzUxONCSvTBdEKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:46:49.275612Z"},"content_sha256":"23c65f2f2d1f54b466ea7cefa77a273a5387f99f3dec3c9b635db257bd20465f","schema_version":"1.0","event_id":"sha256:23c65f2f2d1f54b466ea7cefa77a273a5387f99f3dec3c9b635db257bd20465f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKTTBCFICZPNIB44XUJIITE7MU/bundle.json","state_url":"https://pith.science/pith/SKTTBCFICZPNIB44XUJIITE7MU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKTTBCFICZPNIB44XUJIITE7MU/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-07T20:46:49Z","links":{"resolver":"https://pith.science/pith/SKTTBCFICZPNIB44XUJIITE7MU","bundle":"https://pith.science/pith/SKTTBCFICZPNIB44XUJIITE7MU/bundle.json","state":"https://pith.science/pith/SKTTBCFICZPNIB44XUJIITE7MU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKTTBCFICZPNIB44XUJIITE7MU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SKTTBCFICZPNIB44XUJIITE7MU","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":"cff44bb2d6eef1bb349a375984347afdd36996f64ddeaaafab0a0123d23dd6bf","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T13:08:41Z","title_canon_sha256":"420707273b344d709b52747072bacb8662111c50f435c3f71230c621e5d0ac40"},"schema_version":"1.0","source":{"id":"1805.08562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08562","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08562v1","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08562","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"pith_short_12","alias_value":"SKTTBCFICZPN","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SKTTBCFICZPNIB44","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SKTTBCFI","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:23c65f2f2d1f54b466ea7cefa77a273a5387f99f3dec3c9b635db257bd20465f","target":"graph","created_at":"2026-05-18T00:15:26Z","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 introduce algorithms for online, full-information prediction that are competitive with contextual tree experts of unknown complexity, in both probabilistic and adversarial settings. We show that by incorporating a probabilistic framework of structural risk minimization into existing adaptive algorithms, we can robustly learn not only the presence of stochastic structure when it exists (leading to constant as opposed to $\\mathcal{O}(\\sqrt{T})$ regret), but also the correct model order. We thus obtain regret bounds that are competitive with the regret of an optimal algorithm that possesses st","authors_text":"Anant Sahai, Mitas Ray, Peter L. Bartlett, Vidya Muthukumar","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T13:08:41Z","title":"Best of many worlds: Robust model selection for online supervised learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08562","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:cf9c7e65b33153eaac4c82b684cc9a3d0f557a2c937cc05adea350236036fffe","target":"record","created_at":"2026-05-18T00:15:26Z","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":"cff44bb2d6eef1bb349a375984347afdd36996f64ddeaaafab0a0123d23dd6bf","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T13:08:41Z","title_canon_sha256":"420707273b344d709b52747072bacb8662111c50f435c3f71230c621e5d0ac40"},"schema_version":"1.0","source":{"id":"1805.08562","kind":"arxiv","version":1}},"canonical_sha256":"92a73088a8165ed4079cbd12844c9f650c730dfd0f9a708e1b43d84468e17845","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92a73088a8165ed4079cbd12844c9f650c730dfd0f9a708e1b43d84468e17845","first_computed_at":"2026-05-18T00:15:26.007283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:26.007283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gv0nADuImsbfVOZDviSqDW5IWvv8uKnMMBzfJPHkZbwcAbDl2eqOXCoSxIF+ovXpYu+Sfy4obuC+Ba7oSTJRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:26.008224Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf9c7e65b33153eaac4c82b684cc9a3d0f557a2c937cc05adea350236036fffe","sha256:23c65f2f2d1f54b466ea7cefa77a273a5387f99f3dec3c9b635db257bd20465f"],"state_sha256":"9933b35c07af1a3225f01f22d8e39bd50f98007865b9687de5786264b89bc017"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvVxEjwOrpita1UJuo9nzgngx/umHp4EdcSWcBtoc7AfhGTX/PxiLuBJt+mwniY52GvHpcQ+VoYXQnkvePjPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:46:49.279574Z","bundle_sha256":"a435d07b80ef2dc1999220ad2395032a3c7d846688514cd3a264ef6f6b5e19f5"}}