{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:LKAXABR3F2LFHAXGUAKFCR7CH6","short_pith_number":"pith:LKAXABR3","canonical_record":{"source":{"id":"2012.09608","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-14T18:44:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c84f7f00c02f14690139e11f68f50ece02479fa842b0539228ff1a30fc31444f","abstract_canon_sha256":"37fbe4b1cb242e95dfa062622d720c5c26b7f4d8b1bdb2e86ed699b95ead4b6b"},"schema_version":"1.0"},"canonical_sha256":"5a8170063b2e965382e6a0145147e23fae8fa08b41beac1f586cedd55fe0eea3","source":{"kind":"arxiv","id":"2012.09608","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.09608","created_at":"2026-07-05T02:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"2012.09608v2","created_at":"2026-07-05T02:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09608","created_at":"2026-07-05T02:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"LKAXABR3F2LF","created_at":"2026-07-05T02:00:34Z"},{"alias_kind":"pith_short_16","alias_value":"LKAXABR3F2LFHAXG","created_at":"2026-07-05T02:00:34Z"},{"alias_kind":"pith_short_8","alias_value":"LKAXABR3","created_at":"2026-07-05T02:00:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:LKAXABR3F2LFHAXGUAKFCR7CH6","target":"record","payload":{"canonical_record":{"source":{"id":"2012.09608","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-14T18:44:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c84f7f00c02f14690139e11f68f50ece02479fa842b0539228ff1a30fc31444f","abstract_canon_sha256":"37fbe4b1cb242e95dfa062622d720c5c26b7f4d8b1bdb2e86ed699b95ead4b6b"},"schema_version":"1.0"},"canonical_sha256":"5a8170063b2e965382e6a0145147e23fae8fa08b41beac1f586cedd55fe0eea3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:00:34.126417Z","signature_b64":"vYVuk4/SSCmPBB4DvgM2rrnM5N9n9sjylH8WltnzH+hG8Pvj9DJRmHo4iMLh9UkhvFBxAbD/436lf88xFV9rBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a8170063b2e965382e6a0145147e23fae8fa08b41beac1f586cedd55fe0eea3","last_reissued_at":"2026-07-05T02:00:34.125968Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:00:34.125968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.09608","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-07-05T02:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HCkATbfN/lfUS3s9uqumVdopw5x0dWawMN5KbHiXV/jGvX20xQEvLLZm8UI7+IkGYVEiRmZRwnciv9HCMt+2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:45:14.426026Z"},"content_sha256":"5aca25b64dce0b641b4667b3507dd7000d655fedbe2710a4064bed0b7ba53336","schema_version":"1.0","event_id":"sha256:5aca25b64dce0b641b4667b3507dd7000d655fedbe2710a4064bed0b7ba53336"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:LKAXABR3F2LFHAXGUAKFCR7CH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Meinolf Sellmann, Tapan Shah","submitted_at":"2020-12-14T18:44:51Z","abstract_excerpt":"We consider the dynamic classifier selection (DCS) problem: Given an ensemble of classifiers, we are to choose which classifier to use depending on the particular input vector that we get to classify. The problem is a special case of the general algorithm selection problem where we have multiple different algorithms we can employ to process a given input. We investigate if a method developed for general algorithm selection named cost-sensitive hierarchical clustering (CSHC) is suited for DCS. We introduce some additions to the original CSHC method for the special case of choosing a classificat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09608","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.09608/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-07-05T02:00:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQYpLD7LeC5u7o5KnQZbs+CGSAdJztdfF3byUME6KueD/XveuC55oEOgYZSFfwZCc6J2q8n5Bi8E2G+8vasuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:45:14.426685Z"},"content_sha256":"e5c106c09f7087e37f07be8a04030708f7e8a6dbf55d7c2579117023c769834b","schema_version":"1.0","event_id":"sha256:e5c106c09f7087e37f07be8a04030708f7e8a6dbf55d7c2579117023c769834b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKAXABR3F2LFHAXGUAKFCR7CH6/bundle.json","state_url":"https://pith.science/pith/LKAXABR3F2LFHAXGUAKFCR7CH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKAXABR3F2LFHAXGUAKFCR7CH6/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-05T15:45:14Z","links":{"resolver":"https://pith.science/pith/LKAXABR3F2LFHAXGUAKFCR7CH6","bundle":"https://pith.science/pith/LKAXABR3F2LFHAXGUAKFCR7CH6/bundle.json","state":"https://pith.science/pith/LKAXABR3F2LFHAXGUAKFCR7CH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKAXABR3F2LFHAXGUAKFCR7CH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:LKAXABR3F2LFHAXGUAKFCR7CH6","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":"37fbe4b1cb242e95dfa062622d720c5c26b7f4d8b1bdb2e86ed699b95ead4b6b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-14T18:44:51Z","title_canon_sha256":"c84f7f00c02f14690139e11f68f50ece02479fa842b0539228ff1a30fc31444f"},"schema_version":"1.0","source":{"id":"2012.09608","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.09608","created_at":"2026-07-05T02:00:34Z"},{"alias_kind":"arxiv_version","alias_value":"2012.09608v2","created_at":"2026-07-05T02:00:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09608","created_at":"2026-07-05T02:00:34Z"},{"alias_kind":"pith_short_12","alias_value":"LKAXABR3F2LF","created_at":"2026-07-05T02:00:34Z"},{"alias_kind":"pith_short_16","alias_value":"LKAXABR3F2LFHAXG","created_at":"2026-07-05T02:00:34Z"},{"alias_kind":"pith_short_8","alias_value":"LKAXABR3","created_at":"2026-07-05T02:00:34Z"}],"graph_snapshots":[{"event_id":"sha256:e5c106c09f7087e37f07be8a04030708f7e8a6dbf55d7c2579117023c769834b","target":"graph","created_at":"2026-07-05T02:00:34Z","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/2012.09608/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the dynamic classifier selection (DCS) problem: Given an ensemble of classifiers, we are to choose which classifier to use depending on the particular input vector that we get to classify. The problem is a special case of the general algorithm selection problem where we have multiple different algorithms we can employ to process a given input. We investigate if a method developed for general algorithm selection named cost-sensitive hierarchical clustering (CSHC) is suited for DCS. We introduce some additions to the original CSHC method for the special case of choosing a classificat","authors_text":"Meinolf Sellmann, Tapan Shah","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-14T18:44:51Z","title":"Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09608","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:5aca25b64dce0b641b4667b3507dd7000d655fedbe2710a4064bed0b7ba53336","target":"record","created_at":"2026-07-05T02:00:34Z","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":"37fbe4b1cb242e95dfa062622d720c5c26b7f4d8b1bdb2e86ed699b95ead4b6b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-12-14T18:44:51Z","title_canon_sha256":"c84f7f00c02f14690139e11f68f50ece02479fa842b0539228ff1a30fc31444f"},"schema_version":"1.0","source":{"id":"2012.09608","kind":"arxiv","version":2}},"canonical_sha256":"5a8170063b2e965382e6a0145147e23fae8fa08b41beac1f586cedd55fe0eea3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a8170063b2e965382e6a0145147e23fae8fa08b41beac1f586cedd55fe0eea3","first_computed_at":"2026-07-05T02:00:34.125968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:00:34.125968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vYVuk4/SSCmPBB4DvgM2rrnM5N9n9sjylH8WltnzH+hG8Pvj9DJRmHo4iMLh9UkhvFBxAbD/436lf88xFV9rBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:00:34.126417Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.09608","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5aca25b64dce0b641b4667b3507dd7000d655fedbe2710a4064bed0b7ba53336","sha256:e5c106c09f7087e37f07be8a04030708f7e8a6dbf55d7c2579117023c769834b"],"state_sha256":"c9c86bcc3f551b5b35ad9d520956160001eb2d485a982cb56334b97c67b1fc86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FI76VlVUUfMgJJxshK+ltYuUWiKLWrXrIptmyif8hnDcQgel/oFIqyhQGEFIWjAgXyfjRB4v+Iev/CHCXX9XAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:45:14.430132Z","bundle_sha256":"cf3961935fe2965b7884c1e0c9df39535907cae11b460b624bd9d5e9540296fa"}}