{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Q6D3KNM6G2KTF7Z5Z36NTXXEGL","short_pith_number":"pith:Q6D3KNM6","canonical_record":{"source":{"id":"2605.30479","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T18:51:53Z","cross_cats_sorted":[],"title_canon_sha256":"8b77af6c54e0d89ed0e866d16368eb4d874f780d1c49c42429d716056c927e69","abstract_canon_sha256":"a93b9c44aa6620281c05dbfb173eed4f04893360b6e1fbcd23209f2f7de005c2"},"schema_version":"1.0"},"canonical_sha256":"8787b5359e369532ff3dcefcd9dee432e64b05c4af44c953d6bfcf19f5f410d8","source":{"kind":"arxiv","id":"2605.30479","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30479","created_at":"2026-06-01T01:02:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30479v1","created_at":"2026-06-01T01:02:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30479","created_at":"2026-06-01T01:02:56Z"},{"alias_kind":"pith_short_12","alias_value":"Q6D3KNM6G2KT","created_at":"2026-06-01T01:02:56Z"},{"alias_kind":"pith_short_16","alias_value":"Q6D3KNM6G2KTF7Z5","created_at":"2026-06-01T01:02:56Z"},{"alias_kind":"pith_short_8","alias_value":"Q6D3KNM6","created_at":"2026-06-01T01:02:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Q6D3KNM6G2KTF7Z5Z36NTXXEGL","target":"record","payload":{"canonical_record":{"source":{"id":"2605.30479","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T18:51:53Z","cross_cats_sorted":[],"title_canon_sha256":"8b77af6c54e0d89ed0e866d16368eb4d874f780d1c49c42429d716056c927e69","abstract_canon_sha256":"a93b9c44aa6620281c05dbfb173eed4f04893360b6e1fbcd23209f2f7de005c2"},"schema_version":"1.0"},"canonical_sha256":"8787b5359e369532ff3dcefcd9dee432e64b05c4af44c953d6bfcf19f5f410d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:02:56.420193Z","signature_b64":"vLb58sYRnV7Ht1HkRHao8w0l5cw3s+kqjUsA6WGbx0vQaIYKHgFnLWzDwX/FikbPAYFzLzgBGZLK7hLjKx2JBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8787b5359e369532ff3dcefcd9dee432e64b05c4af44c953d6bfcf19f5f410d8","last_reissued_at":"2026-06-01T01:02:56.419427Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:02:56.419427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.30479","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-06-01T01:02:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4NB7Qiwwxrb5fBPxF4RsLT6lVnSyA9cm1bav8F1nwwXEfKVa8TyWi9IFupwQ3LSecz2B1UaXo9cWIGxJUF7TAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T13:57:59.331462Z"},"content_sha256":"a57dd7651d34d2b7ec8579173c3ed96323c21089d2fa6bef9415e528c040b404","schema_version":"1.0","event_id":"sha256:a57dd7651d34d2b7ec8579173c3ed96323c21089d2fa6bef9415e528c040b404"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Q6D3KNM6G2KTF7Z5Z36NTXXEGL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Multiclass Transductive Online Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hongao Wang, Steve Hanneke","submitted_at":"2026-05-28T18:51:53Z","abstract_excerpt":"We consider the problem of universal transductive online classification with a possibly unbounded label space. This setting considers online learning, with the sequence of instances (without labels) known to the learner in advance. We say a concept class $\\mathcal{H}$ is learnable if there is a learning algorithm $\\mathcal{A}$, such that for every realizable sequence, the number of mistakes made by $\\mathcal{A}$ grows at most sublinearly with the number of predictions. We characterize the learnability of this setting and show that there are only two possible optimal rates for the learnable cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30479","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.30479/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-06-01T01:02:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCT9M5C+HwjU5L5Xg578jxKXi9s+GgwRW0GIX63DZITgP4MHIKdcnkRlZdUbQ1HR4vOLO9qMOHD3KLHNXmbECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T13:57:59.331962Z"},"content_sha256":"15a77abd421fd860aea02fcb1947c8510720d8804ebbdab348779600456cb8c4","schema_version":"1.0","event_id":"sha256:15a77abd421fd860aea02fcb1947c8510720d8804ebbdab348779600456cb8c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q6D3KNM6G2KTF7Z5Z36NTXXEGL/bundle.json","state_url":"https://pith.science/pith/Q6D3KNM6G2KTF7Z5Z36NTXXEGL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q6D3KNM6G2KTF7Z5Z36NTXXEGL/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-08-23T13:57:59Z","links":{"resolver":"https://pith.science/pith/Q6D3KNM6G2KTF7Z5Z36NTXXEGL","bundle":"https://pith.science/pith/Q6D3KNM6G2KTF7Z5Z36NTXXEGL/bundle.json","state":"https://pith.science/pith/Q6D3KNM6G2KTF7Z5Z36NTXXEGL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q6D3KNM6G2KTF7Z5Z36NTXXEGL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Q6D3KNM6G2KTF7Z5Z36NTXXEGL","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":"a93b9c44aa6620281c05dbfb173eed4f04893360b6e1fbcd23209f2f7de005c2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T18:51:53Z","title_canon_sha256":"8b77af6c54e0d89ed0e866d16368eb4d874f780d1c49c42429d716056c927e69"},"schema_version":"1.0","source":{"id":"2605.30479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30479","created_at":"2026-06-01T01:02:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30479v1","created_at":"2026-06-01T01:02:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30479","created_at":"2026-06-01T01:02:56Z"},{"alias_kind":"pith_short_12","alias_value":"Q6D3KNM6G2KT","created_at":"2026-06-01T01:02:56Z"},{"alias_kind":"pith_short_16","alias_value":"Q6D3KNM6G2KTF7Z5","created_at":"2026-06-01T01:02:56Z"},{"alias_kind":"pith_short_8","alias_value":"Q6D3KNM6","created_at":"2026-06-01T01:02:56Z"}],"graph_snapshots":[{"event_id":"sha256:15a77abd421fd860aea02fcb1947c8510720d8804ebbdab348779600456cb8c4","target":"graph","created_at":"2026-06-01T01:02:56Z","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/2605.30479/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of universal transductive online classification with a possibly unbounded label space. This setting considers online learning, with the sequence of instances (without labels) known to the learner in advance. We say a concept class $\\mathcal{H}$ is learnable if there is a learning algorithm $\\mathcal{A}$, such that for every realizable sequence, the number of mistakes made by $\\mathcal{A}$ grows at most sublinearly with the number of predictions. We characterize the learnability of this setting and show that there are only two possible optimal rates for the learnable cla","authors_text":"Hongao Wang, Steve Hanneke","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T18:51:53Z","title":"Universal Multiclass Transductive Online Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30479","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:a57dd7651d34d2b7ec8579173c3ed96323c21089d2fa6bef9415e528c040b404","target":"record","created_at":"2026-06-01T01:02:56Z","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":"a93b9c44aa6620281c05dbfb173eed4f04893360b6e1fbcd23209f2f7de005c2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-28T18:51:53Z","title_canon_sha256":"8b77af6c54e0d89ed0e866d16368eb4d874f780d1c49c42429d716056c927e69"},"schema_version":"1.0","source":{"id":"2605.30479","kind":"arxiv","version":1}},"canonical_sha256":"8787b5359e369532ff3dcefcd9dee432e64b05c4af44c953d6bfcf19f5f410d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8787b5359e369532ff3dcefcd9dee432e64b05c4af44c953d6bfcf19f5f410d8","first_computed_at":"2026-06-01T01:02:56.419427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:02:56.419427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vLb58sYRnV7Ht1HkRHao8w0l5cw3s+kqjUsA6WGbx0vQaIYKHgFnLWzDwX/FikbPAYFzLzgBGZLK7hLjKx2JBw==","signature_status":"signed_v1","signed_at":"2026-06-01T01:02:56.420193Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.30479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a57dd7651d34d2b7ec8579173c3ed96323c21089d2fa6bef9415e528c040b404","sha256:15a77abd421fd860aea02fcb1947c8510720d8804ebbdab348779600456cb8c4"],"state_sha256":"cac338c5a41b9b3eee9c5efe48657dcb4643073f57829371de38efd3d278adf0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZqeBxO7A9dWRJ4ufEYpJBz/B3wMcpoRyWOTCxnLjOlAtEQH2dK9sHXV5t/DKp8FnKd6FnaBX56dB8O/F9chAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T13:57:59.335674Z","bundle_sha256":"c3b6c6081c386cba0f5159f3f4c9d44b0e52f2f112a46648f964ec502b97b7c0"}}