{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YYGESLD4WITLYBCHB4GX27HGW6","short_pith_number":"pith:YYGESLD4","canonical_record":{"source":{"id":"1311.6536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-26T01:23:45Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"7efc30ae73b670671ece26ce6faac5729ab8cf1a7c3772807f367f92e8b569fa","abstract_canon_sha256":"939fc2c4abb1031be714d3d040b86b07893e67c9678d0237fc9f9d01d19c9e3b"},"schema_version":"1.0"},"canonical_sha256":"c60c492c7cb226bc04470f0d7d7ce6b781e8ed61ac8e927005567d334e65f714","source":{"kind":"arxiv","id":"1311.6536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6536","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6536v1","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6536","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"YYGESLD4WITL","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YYGESLD4WITLYBCH","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YYGESLD4","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YYGESLD4WITLYBCHB4GX27HGW6","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-26T01:23:45Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"7efc30ae73b670671ece26ce6faac5729ab8cf1a7c3772807f367f92e8b569fa","abstract_canon_sha256":"939fc2c4abb1031be714d3d040b86b07893e67c9678d0237fc9f9d01d19c9e3b"},"schema_version":"1.0"},"canonical_sha256":"c60c492c7cb226bc04470f0d7d7ce6b781e8ed61ac8e927005567d334e65f714","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:12.429900Z","signature_b64":"ChR7VrYtqalI8+PKbi8wGWiC7eushUO3oDoKptwOujK65PySE7w5v/baFtDvodY3cY5GFT/nk1KnputiZ55OBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c60c492c7cb226bc04470f0d7d7ce6b781e8ed61ac8e927005567d334e65f714","last_reissued_at":"2026-05-18T03:06:12.429480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:12.429480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6536","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:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nixkdENAMdRtS/mzKCvaIIuQD6O3EI/9l1LeSiE9HZZVS2mYGheDAZefguJ0AVU+daAfJlvjiG3vl2mL94S3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:38:27.041084Z"},"content_sha256":"cf715fdcb17f535f9d5c4f0015b686752cfffffc6a5598f85889ebd02c32f02a","schema_version":"1.0","event_id":"sha256:cf715fdcb17f535f9d5c4f0015b686752cfffffc6a5598f85889ebd02c32f02a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YYGESLD4WITLYBCHB4GX27HGW6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Codes from Switching Strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Steven de Rooij, Wouter M. Koolen","submitted_at":"2013-11-26T01:23:45Z","abstract_excerpt":"We discuss algorithms for combining sequential prediction strategies, a task which can be viewed as a natural generalisation of the concept of universal coding. We describe a graphical language based on Hidden Markov Models for defining prediction strategies, and we provide both existing and new models as examples. The models include efficient, parameterless models for switching between the input strategies over time, including a model for the case where switches tend to occur in clusters, and finally a new model for the scenario where the prediction strategies have a known relationship, and w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6536","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:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2wpEUDHeUe5nOXeNve9Q43OUhriAetH7QSWRoVsRzhVpIyN+urmCH/7qvuxzwDazcXorVEfDeI6uEJZah6bCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:38:27.041824Z"},"content_sha256":"a237630b3d657e3f653a9af338db4dee9e49db3e0db625945cf99ee95f937f23","schema_version":"1.0","event_id":"sha256:a237630b3d657e3f653a9af338db4dee9e49db3e0db625945cf99ee95f937f23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYGESLD4WITLYBCHB4GX27HGW6/bundle.json","state_url":"https://pith.science/pith/YYGESLD4WITLYBCHB4GX27HGW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYGESLD4WITLYBCHB4GX27HGW6/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-27T01:38:27Z","links":{"resolver":"https://pith.science/pith/YYGESLD4WITLYBCHB4GX27HGW6","bundle":"https://pith.science/pith/YYGESLD4WITLYBCHB4GX27HGW6/bundle.json","state":"https://pith.science/pith/YYGESLD4WITLYBCHB4GX27HGW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYGESLD4WITLYBCHB4GX27HGW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YYGESLD4WITLYBCHB4GX27HGW6","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":"939fc2c4abb1031be714d3d040b86b07893e67c9678d0237fc9f9d01d19c9e3b","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-26T01:23:45Z","title_canon_sha256":"7efc30ae73b670671ece26ce6faac5729ab8cf1a7c3772807f367f92e8b569fa"},"schema_version":"1.0","source":{"id":"1311.6536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6536","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6536v1","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6536","created_at":"2026-05-18T03:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"YYGESLD4WITL","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YYGESLD4WITLYBCH","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YYGESLD4","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:a237630b3d657e3f653a9af338db4dee9e49db3e0db625945cf99ee95f937f23","target":"graph","created_at":"2026-05-18T03:06:12Z","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 discuss algorithms for combining sequential prediction strategies, a task which can be viewed as a natural generalisation of the concept of universal coding. We describe a graphical language based on Hidden Markov Models for defining prediction strategies, and we provide both existing and new models as examples. The models include efficient, parameterless models for switching between the input strategies over time, including a model for the case where switches tend to occur in clusters, and finally a new model for the scenario where the prediction strategies have a known relationship, and w","authors_text":"Steven de Rooij, Wouter M. Koolen","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-26T01:23:45Z","title":"Universal Codes from Switching Strategies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6536","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:cf715fdcb17f535f9d5c4f0015b686752cfffffc6a5598f85889ebd02c32f02a","target":"record","created_at":"2026-05-18T03:06:12Z","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":"939fc2c4abb1031be714d3d040b86b07893e67c9678d0237fc9f9d01d19c9e3b","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-26T01:23:45Z","title_canon_sha256":"7efc30ae73b670671ece26ce6faac5729ab8cf1a7c3772807f367f92e8b569fa"},"schema_version":"1.0","source":{"id":"1311.6536","kind":"arxiv","version":1}},"canonical_sha256":"c60c492c7cb226bc04470f0d7d7ce6b781e8ed61ac8e927005567d334e65f714","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c60c492c7cb226bc04470f0d7d7ce6b781e8ed61ac8e927005567d334e65f714","first_computed_at":"2026-05-18T03:06:12.429480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:12.429480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ChR7VrYtqalI8+PKbi8wGWiC7eushUO3oDoKptwOujK65PySE7w5v/baFtDvodY3cY5GFT/nk1KnputiZ55OBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:12.429900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf715fdcb17f535f9d5c4f0015b686752cfffffc6a5598f85889ebd02c32f02a","sha256:a237630b3d657e3f653a9af338db4dee9e49db3e0db625945cf99ee95f937f23"],"state_sha256":"01f5e48eba8359d940e29fe869b3747d26c125022b4f182efb92aee836372806"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5fNMI/7IA/05kNTxNK7ru6GMqUTZo2o46nfQf4XhMeNgWNJSBts6orHUrVuH7aAulXy90OUaaBseI7CTJoECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:38:27.047482Z","bundle_sha256":"292d9c8ed298fc8761c820bec6021739cf8189a193c0109bc6d943e1ab74befe"}}