{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XDVN64V5ALRYCB6CNCBXNX5YN2","short_pith_number":"pith:XDVN64V5","canonical_record":{"source":{"id":"1608.09014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-31T19:55:35Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"372cdb8833fdbbadea5eaaa6252cd5adb38c8d85a72cd3507c7167f753442b46","abstract_canon_sha256":"5ee19df46cdecbb1798c451deb65ccb030f73e6265449bb40f744f3bfc235cc8"},"schema_version":"1.0"},"canonical_sha256":"b8eadf72bd02e38107c2688376dfb86e99844b37be03fd668d1af35edef5c347","source":{"kind":"arxiv","id":"1608.09014","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.09014","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"arxiv_version","alias_value":"1608.09014v1","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.09014","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"pith_short_12","alias_value":"XDVN64V5ALRY","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XDVN64V5ALRYCB6C","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XDVN64V5","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XDVN64V5ALRYCB6CNCBXNX5YN2","target":"record","payload":{"canonical_record":{"source":{"id":"1608.09014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-31T19:55:35Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"372cdb8833fdbbadea5eaaa6252cd5adb38c8d85a72cd3507c7167f753442b46","abstract_canon_sha256":"5ee19df46cdecbb1798c451deb65ccb030f73e6265449bb40f744f3bfc235cc8"},"schema_version":"1.0"},"canonical_sha256":"b8eadf72bd02e38107c2688376dfb86e99844b37be03fd668d1af35edef5c347","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:39.445096Z","signature_b64":"u6qvJJS2SxbnA17q9F2/EleTcIvYbjybqVHB3tlZG2f4v2ExO2e76QxERxd9zoxR4e2vl3XYeYBUOj5yrChPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8eadf72bd02e38107c2688376dfb86e99844b37be03fd668d1af35edef5c347","last_reissued_at":"2026-05-18T01:06:39.444606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:39.444606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.09014","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-18T01:06:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ztuq50vlNj4x7TAXeIMndq7uvH4qC8/RzMTbLgX0sbOxN+ioSxop9MnwMfvzghCtI2LiCqNmYDU3j4ryIxmLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:43:14.066283Z"},"content_sha256":"bf17debcb74a7e836f98063e17c92d54f251592d840d3523eb5a44b34017d399","schema_version":"1.0","event_id":"sha256:bf17debcb74a7e836f98063e17c92d54f251592d840d3523eb5a44b34017d399"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XDVN64V5ALRYCB6CNCBXNX5YN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tutorial on Online Supervised Learning with Applications to Node Classification in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Karthik Sridharan","submitted_at":"2016-08-31T19:55:35Z","abstract_excerpt":"We revisit the elegant observation of T. Cover '65 which, perhaps, is not as well-known to the broader community as it should be. The first goal of the tutorial is to explain---through the prism of this elementary result---how to solve certain sequence prediction problems by modeling sets of solutions rather than the unknown data-generating mechanism. We extend Cover's observation in several directions and focus on computational aspects of the proposed algorithms. The applicability of the methods is illustrated on several examples, including node classification in a network.\n  The second aim o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.09014","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-18T01:06:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"phumxaMdaKSW1KhyJILKBA6AqFhSqTn3I54TwOTim5kJlElwziWSei0Hn4J05apsACl6Fge7lUYSGy1XsUNOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:43:14.067143Z"},"content_sha256":"b0af6a9adc182ce71ec1e042d8a3bd514fade5ed00e1841b6c077fbb546e32f1","schema_version":"1.0","event_id":"sha256:b0af6a9adc182ce71ec1e042d8a3bd514fade5ed00e1841b6c077fbb546e32f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDVN64V5ALRYCB6CNCBXNX5YN2/bundle.json","state_url":"https://pith.science/pith/XDVN64V5ALRYCB6CNCBXNX5YN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDVN64V5ALRYCB6CNCBXNX5YN2/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-05T14:43:14Z","links":{"resolver":"https://pith.science/pith/XDVN64V5ALRYCB6CNCBXNX5YN2","bundle":"https://pith.science/pith/XDVN64V5ALRYCB6CNCBXNX5YN2/bundle.json","state":"https://pith.science/pith/XDVN64V5ALRYCB6CNCBXNX5YN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDVN64V5ALRYCB6CNCBXNX5YN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XDVN64V5ALRYCB6CNCBXNX5YN2","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":"5ee19df46cdecbb1798c451deb65ccb030f73e6265449bb40f744f3bfc235cc8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-31T19:55:35Z","title_canon_sha256":"372cdb8833fdbbadea5eaaa6252cd5adb38c8d85a72cd3507c7167f753442b46"},"schema_version":"1.0","source":{"id":"1608.09014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.09014","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"arxiv_version","alias_value":"1608.09014v1","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.09014","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"pith_short_12","alias_value":"XDVN64V5ALRY","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XDVN64V5ALRYCB6C","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XDVN64V5","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:b0af6a9adc182ce71ec1e042d8a3bd514fade5ed00e1841b6c077fbb546e32f1","target":"graph","created_at":"2026-05-18T01:06:39Z","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 revisit the elegant observation of T. Cover '65 which, perhaps, is not as well-known to the broader community as it should be. The first goal of the tutorial is to explain---through the prism of this elementary result---how to solve certain sequence prediction problems by modeling sets of solutions rather than the unknown data-generating mechanism. We extend Cover's observation in several directions and focus on computational aspects of the proposed algorithms. The applicability of the methods is illustrated on several examples, including node classification in a network.\n  The second aim o","authors_text":"Alexander Rakhlin, Karthik Sridharan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-31T19:55:35Z","title":"A Tutorial on Online Supervised Learning with Applications to Node Classification in Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.09014","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:bf17debcb74a7e836f98063e17c92d54f251592d840d3523eb5a44b34017d399","target":"record","created_at":"2026-05-18T01:06:39Z","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":"5ee19df46cdecbb1798c451deb65ccb030f73e6265449bb40f744f3bfc235cc8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-31T19:55:35Z","title_canon_sha256":"372cdb8833fdbbadea5eaaa6252cd5adb38c8d85a72cd3507c7167f753442b46"},"schema_version":"1.0","source":{"id":"1608.09014","kind":"arxiv","version":1}},"canonical_sha256":"b8eadf72bd02e38107c2688376dfb86e99844b37be03fd668d1af35edef5c347","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8eadf72bd02e38107c2688376dfb86e99844b37be03fd668d1af35edef5c347","first_computed_at":"2026-05-18T01:06:39.444606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:39.444606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u6qvJJS2SxbnA17q9F2/EleTcIvYbjybqVHB3tlZG2f4v2ExO2e76QxERxd9zoxR4e2vl3XYeYBUOj5yrChPCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:39.445096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.09014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf17debcb74a7e836f98063e17c92d54f251592d840d3523eb5a44b34017d399","sha256:b0af6a9adc182ce71ec1e042d8a3bd514fade5ed00e1841b6c077fbb546e32f1"],"state_sha256":"e757205e87d84eadff34c4e85a76a97e20450b5296189a71085c3f3bb262fd3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3Ujt4JqyM9x37PtAhkYHGL6tscte/onNytjaGRLEqQoexGKFhi3Hc+aI08De1eEP6VpHqA2RIF5WvGD5Z+VBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:43:14.071126Z","bundle_sha256":"dd3f4a1f05c318ca1388604f723ebe407ba423fb274a667b0d6498621127af70"}}