{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Q4SBJ52WUBBYNGWEDTDV3LAMI5","short_pith_number":"pith:Q4SBJ52W","schema_version":"1.0","canonical_sha256":"872414f756a043869ac41cc75dac0c476e9790d9bfc580ac0b0e0ae7f72b62e9","source":{"kind":"arxiv","id":"2205.12729","version":1},"attestation_state":"computed","paper":{"title":"Deep interpretable ensembles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andrea G\\\"otschi, Beate Sick, Lucas Kook, Philipp FM Baumann, Torsten Hothorn","submitted_at":"2022-05-25T12:39:39Z","abstract_excerpt":"Ensembles improve prediction performance and allow uncertainty quantification by aggregating predictions from multiple models. In deep ensembling, the individual models are usually black box neural networks, or recently, partially interpretable semi-structured deep transformation models. However, interpretability of the ensemble members is generally lost upon aggregation. This is a crucial drawback of deep ensembles in high-stake decision fields, in which interpretable models are desired. We propose a novel transformation ensemble which aggregates probabilistic predictions with the guarantee t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2205.12729","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2022-05-25T12:39:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a3176cdbab862bf19d143b3f78a6a8dec63b2fe021f16876636600f70c4d7eee","abstract_canon_sha256":"833ff119e6ef029b69e072951c238dd67fe0e8c3a6d4ee5298922de7f90259f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:29.286166Z","signature_b64":"+MCNRJjyimpXGK8QOd2LASNg5q8P3/CncyivwZ30VGAgEP5HdYB6W08XremJNK8iJPiDFG11bN0GF9G5llX8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"872414f756a043869ac41cc75dac0c476e9790d9bfc580ac0b0e0ae7f72b62e9","last_reissued_at":"2026-07-05T04:26:29.285640Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:29.285640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep interpretable ensembles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Andrea G\\\"otschi, Beate Sick, Lucas Kook, Philipp FM Baumann, Torsten Hothorn","submitted_at":"2022-05-25T12:39:39Z","abstract_excerpt":"Ensembles improve prediction performance and allow uncertainty quantification by aggregating predictions from multiple models. In deep ensembling, the individual models are usually black box neural networks, or recently, partially interpretable semi-structured deep transformation models. However, interpretability of the ensemble members is generally lost upon aggregation. This is a crucial drawback of deep ensembles in high-stake decision fields, in which interpretable models are desired. We propose a novel transformation ensemble which aggregates probabilistic predictions with the guarantee t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12729","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/2205.12729/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2205.12729","created_at":"2026-07-05T04:26:29.285696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.12729v1","created_at":"2026-07-05T04:26:29.285696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12729","created_at":"2026-07-05T04:26:29.285696+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4SBJ52WUBBY","created_at":"2026-07-05T04:26:29.285696+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4SBJ52WUBBYNGWE","created_at":"2026-07-05T04:26:29.285696+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4SBJ52W","created_at":"2026-07-05T04:26:29.285696+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09826","citing_title":"Bridging Neural Networks and Dynamic Time Warping for Adaptive Time Series Classification","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q4SBJ52WUBBYNGWEDTDV3LAMI5","json":"https://pith.science/pith/Q4SBJ52WUBBYNGWEDTDV3LAMI5.json","graph_json":"https://pith.science/api/pith-number/Q4SBJ52WUBBYNGWEDTDV3LAMI5/graph.json","events_json":"https://pith.science/api/pith-number/Q4SBJ52WUBBYNGWEDTDV3LAMI5/events.json","paper":"https://pith.science/paper/Q4SBJ52W"},"agent_actions":{"view_html":"https://pith.science/pith/Q4SBJ52WUBBYNGWEDTDV3LAMI5","download_json":"https://pith.science/pith/Q4SBJ52WUBBYNGWEDTDV3LAMI5.json","view_paper":"https://pith.science/paper/Q4SBJ52W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.12729&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4SBJ52WUBBYNGWEDTDV3LAMI5/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4SBJ52WUBBYNGWEDTDV3LAMI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4SBJ52WUBBYNGWEDTDV3LAMI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4SBJ52WUBBYNGWEDTDV3LAMI5/action/storage_attestation","attest_author":"https://pith.science/pith/Q4SBJ52WUBBYNGWEDTDV3LAMI5/action/author_attestation","sign_citation":"https://pith.science/pith/Q4SBJ52WUBBYNGWEDTDV3LAMI5/action/citation_signature","submit_replication":"https://pith.science/pith/Q4SBJ52WUBBYNGWEDTDV3LAMI5/action/replication_record"}},"created_at":"2026-07-05T04:26:29.285696+00:00","updated_at":"2026-07-05T04:26:29.285696+00:00"}