{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KCE6LEENIM4NQN3SDX675ZUC6P","short_pith_number":"pith:KCE6LEEN","schema_version":"1.0","canonical_sha256":"5089e5908d4338d837721dfdfee682f3eeaff44e8ead30f68cbaf3088aa33faa","source":{"kind":"arxiv","id":"1908.06852","version":5},"attestation_state":"computed","paper":{"title":"SIRUS: Stable and Interpretable RUle Set for Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Cl\\'ement B\\'enard (LPSM (UMR\\_8001)), Erwan Scornet (CMAP), G\\'erard Biau (LPSM (UMR\\_8001)), S\\'ebastien Da Veiga","submitted_at":"2019-08-19T14:55:47Z","abstract_excerpt":"State-of-the-art learning algorithms, such as random forests or neural networks, are often qualified as \"black-boxes\" because of the high number and complexity of operations involved in their prediction mechanism. This lack of interpretability is a strong limitation for applications involving critical decisions, typically the analysis of production processes in the manufacturing industry. In such critical contexts, models have to be interpretable, i.e., simple, stable, and predictive. To address this issue, we design SIRUS (Stable and Interpretable RUle Set), a new classification algorithm bas"},"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":"1908.06852","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-08-19T14:55:47Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"a81aa4f8225a37fece16511c8a762cc525f6b9a2521c60a5d8459bc799da6248","abstract_canon_sha256":"5a85b988d1c4710e98aed52fd16ee0834fc04d5b67b1a72fda7d50cea0038f5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:59:53.925204Z","signature_b64":"Zejlny4YZ38k9ROUxpOLXdT9YSDhU+oDtpe0iL1fQAahS9LG3xoCouQ7qFF1K6tgo1Eig/7A0b/4Ri0+4pUWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5089e5908d4338d837721dfdfee682f3eeaff44e8ead30f68cbaf3088aa33faa","last_reissued_at":"2026-07-05T01:59:53.924810Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:59:53.924810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SIRUS: Stable and Interpretable RUle Set for Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Cl\\'ement B\\'enard (LPSM (UMR\\_8001)), Erwan Scornet (CMAP), G\\'erard Biau (LPSM (UMR\\_8001)), S\\'ebastien Da Veiga","submitted_at":"2019-08-19T14:55:47Z","abstract_excerpt":"State-of-the-art learning algorithms, such as random forests or neural networks, are often qualified as \"black-boxes\" because of the high number and complexity of operations involved in their prediction mechanism. This lack of interpretability is a strong limitation for applications involving critical decisions, typically the analysis of production processes in the manufacturing industry. In such critical contexts, models have to be interpretable, i.e., simple, stable, and predictive. To address this issue, we design SIRUS (Stable and Interpretable RUle Set), a new classification algorithm bas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06852","kind":"arxiv","version":5},"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/1908.06852/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":"1908.06852","created_at":"2026-07-05T01:59:53.924865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06852v5","created_at":"2026-07-05T01:59:53.924865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06852","created_at":"2026-07-05T01:59:53.924865+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCE6LEENIM4N","created_at":"2026-07-05T01:59:53.924865+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCE6LEENIM4NQN3S","created_at":"2026-07-05T01:59:53.924865+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCE6LEEN","created_at":"2026-07-05T01:59:53.924865+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KCE6LEENIM4NQN3SDX675ZUC6P","json":"https://pith.science/pith/KCE6LEENIM4NQN3SDX675ZUC6P.json","graph_json":"https://pith.science/api/pith-number/KCE6LEENIM4NQN3SDX675ZUC6P/graph.json","events_json":"https://pith.science/api/pith-number/KCE6LEENIM4NQN3SDX675ZUC6P/events.json","paper":"https://pith.science/paper/KCE6LEEN"},"agent_actions":{"view_html":"https://pith.science/pith/KCE6LEENIM4NQN3SDX675ZUC6P","download_json":"https://pith.science/pith/KCE6LEENIM4NQN3SDX675ZUC6P.json","view_paper":"https://pith.science/paper/KCE6LEEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06852&json=true","fetch_graph":"https://pith.science/api/pith-number/KCE6LEENIM4NQN3SDX675ZUC6P/graph.json","fetch_events":"https://pith.science/api/pith-number/KCE6LEENIM4NQN3SDX675ZUC6P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCE6LEENIM4NQN3SDX675ZUC6P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCE6LEENIM4NQN3SDX675ZUC6P/action/storage_attestation","attest_author":"https://pith.science/pith/KCE6LEENIM4NQN3SDX675ZUC6P/action/author_attestation","sign_citation":"https://pith.science/pith/KCE6LEENIM4NQN3SDX675ZUC6P/action/citation_signature","submit_replication":"https://pith.science/pith/KCE6LEENIM4NQN3SDX675ZUC6P/action/replication_record"}},"created_at":"2026-07-05T01:59:53.924865+00:00","updated_at":"2026-07-05T01:59:53.924865+00:00"}