{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KDSRU4IPCTRX4ZZAJLAWGEDN6M","short_pith_number":"pith:KDSRU4IP","canonical_record":{"source":{"id":"1604.01854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-07T02:56:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2540399450472a943690d9fe2562788407fa11cd746df8cbbbe0d4c6d1dcc13b","abstract_canon_sha256":"03276aa96d3e0fefb6838f766bd40ef9b6c0a4b9e51c1cac9efb3d229545f800"},"schema_version":"1.0"},"canonical_sha256":"50e51a710f14e37e67204ac163106df31a0fb526605aa1db1835578400bb7ffc","source":{"kind":"arxiv","id":"1604.01854","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01854","created_at":"2026-05-18T01:11:31Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01854v2","created_at":"2026-05-18T01:11:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01854","created_at":"2026-05-18T01:11:31Z"},{"alias_kind":"pith_short_12","alias_value":"KDSRU4IPCTRX","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KDSRU4IPCTRX4ZZA","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KDSRU4IP","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KDSRU4IPCTRX4ZZAJLAWGEDN6M","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-07T02:56:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2540399450472a943690d9fe2562788407fa11cd746df8cbbbe0d4c6d1dcc13b","abstract_canon_sha256":"03276aa96d3e0fefb6838f766bd40ef9b6c0a4b9e51c1cac9efb3d229545f800"},"schema_version":"1.0"},"canonical_sha256":"50e51a710f14e37e67204ac163106df31a0fb526605aa1db1835578400bb7ffc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:31.132512Z","signature_b64":"YbdGsxssprEGhua62MaQ+pDvh2IFE4kliPtSYF1XnIKb9IihkQ0dJMQgH3jufc4chXqje//zmyVmDd/QLwHuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50e51a710f14e37e67204ac163106df31a0fb526605aa1db1835578400bb7ffc","last_reissued_at":"2026-05-18T01:11:31.132000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:31.132000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01854","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-05-18T01:11:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YwTE4+IH9cXp6UcVmUPATWcdnhYvJYup9qk/r7y75P6t+kwKbIkKirIIHuMf/jnv/P8VxjREySz9/5oN/ljVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T16:20:16.057631Z"},"content_sha256":"3c0453158d69cf41a874608057cc2a30fac4b7910d588aeb572cacd66cc7bf9e","schema_version":"1.0","event_id":"sha256:3c0453158d69cf41a874608057cc2a30fac4b7910d588aeb572cacd66cc7bf9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KDSRU4IPCTRX4ZZAJLAWGEDN6M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Building Ensembles of Adaptive Nested Dichotomies with Random-Pair Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bernhard Pfahringer, Eibe Frank, Tim Leathart","submitted_at":"2016-04-07T02:56:19Z","abstract_excerpt":"A system of nested dichotomies is a method of decomposing a multi-class problem into a collection of binary problems. Such a system recursively splits the set of classes into two subsets, and trains a binary classifier to distinguish between each subset. Even though ensembles of nested dichotomies with random structure have been shown to perform well in practice, using a more sophisticated class subset selection method can be used to improve classification accuracy. We investigate an approach to this problem called random-pair selection, and evaluate its effectiveness compared to other publish"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01854","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":""},"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:11:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTePhRuYZRZZTjvOb2hdfSbks87eCC47y9NgAiBDgK/V26aauztxu/fNdbFse41/wm0bQb5HDfpEAi3fn+iRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T16:20:16.057983Z"},"content_sha256":"b903885b5916e901649e195bff24af94d26902ce95e9c2e4a4a737838c45f087","schema_version":"1.0","event_id":"sha256:b903885b5916e901649e195bff24af94d26902ce95e9c2e4a4a737838c45f087"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDSRU4IPCTRX4ZZAJLAWGEDN6M/bundle.json","state_url":"https://pith.science/pith/KDSRU4IPCTRX4ZZAJLAWGEDN6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDSRU4IPCTRX4ZZAJLAWGEDN6M/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-02T16:20:16Z","links":{"resolver":"https://pith.science/pith/KDSRU4IPCTRX4ZZAJLAWGEDN6M","bundle":"https://pith.science/pith/KDSRU4IPCTRX4ZZAJLAWGEDN6M/bundle.json","state":"https://pith.science/pith/KDSRU4IPCTRX4ZZAJLAWGEDN6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDSRU4IPCTRX4ZZAJLAWGEDN6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KDSRU4IPCTRX4ZZAJLAWGEDN6M","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":"03276aa96d3e0fefb6838f766bd40ef9b6c0a4b9e51c1cac9efb3d229545f800","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-07T02:56:19Z","title_canon_sha256":"2540399450472a943690d9fe2562788407fa11cd746df8cbbbe0d4c6d1dcc13b"},"schema_version":"1.0","source":{"id":"1604.01854","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01854","created_at":"2026-05-18T01:11:31Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01854v2","created_at":"2026-05-18T01:11:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01854","created_at":"2026-05-18T01:11:31Z"},{"alias_kind":"pith_short_12","alias_value":"KDSRU4IPCTRX","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KDSRU4IPCTRX4ZZA","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KDSRU4IP","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:b903885b5916e901649e195bff24af94d26902ce95e9c2e4a4a737838c45f087","target":"graph","created_at":"2026-05-18T01:11:31Z","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":"A system of nested dichotomies is a method of decomposing a multi-class problem into a collection of binary problems. Such a system recursively splits the set of classes into two subsets, and trains a binary classifier to distinguish between each subset. Even though ensembles of nested dichotomies with random structure have been shown to perform well in practice, using a more sophisticated class subset selection method can be used to improve classification accuracy. We investigate an approach to this problem called random-pair selection, and evaluate its effectiveness compared to other publish","authors_text":"Bernhard Pfahringer, Eibe Frank, Tim Leathart","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-07T02:56:19Z","title":"Building Ensembles of Adaptive Nested Dichotomies with Random-Pair Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01854","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:3c0453158d69cf41a874608057cc2a30fac4b7910d588aeb572cacd66cc7bf9e","target":"record","created_at":"2026-05-18T01:11:31Z","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":"03276aa96d3e0fefb6838f766bd40ef9b6c0a4b9e51c1cac9efb3d229545f800","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-07T02:56:19Z","title_canon_sha256":"2540399450472a943690d9fe2562788407fa11cd746df8cbbbe0d4c6d1dcc13b"},"schema_version":"1.0","source":{"id":"1604.01854","kind":"arxiv","version":2}},"canonical_sha256":"50e51a710f14e37e67204ac163106df31a0fb526605aa1db1835578400bb7ffc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50e51a710f14e37e67204ac163106df31a0fb526605aa1db1835578400bb7ffc","first_computed_at":"2026-05-18T01:11:31.132000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:31.132000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YbdGsxssprEGhua62MaQ+pDvh2IFE4kliPtSYF1XnIKb9IihkQ0dJMQgH3jufc4chXqje//zmyVmDd/QLwHuCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:31.132512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01854","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c0453158d69cf41a874608057cc2a30fac4b7910d588aeb572cacd66cc7bf9e","sha256:b903885b5916e901649e195bff24af94d26902ce95e9c2e4a4a737838c45f087"],"state_sha256":"c6f75c60bbc392b1e876f2b8be28c8e53d88c9180640b0058d8da2a8978184a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WrwOa2JygC2Bfd1J9WrpVuU7z3gNtO7lD10pn/9yHcgtG84ni1LbUZTJqNgbgaYR9jljaSfHpsBA3eEloG4PDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T16:20:16.059901Z","bundle_sha256":"00290e9b7eaf646521ddb66a5b5c71bd6e5fb8989d2b6f43989b06d0528405f8"}}