{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:QX5RFHCK5HYXWGBBPXB2AS2H7O","short_pith_number":"pith:QX5RFHCK","canonical_record":{"source":{"id":"2209.08040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-16T16:37:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6672ac35e370d4bd3f11f71253ce21c9702f05e705a4e92cfac8e9e5f8b0c278","abstract_canon_sha256":"c5910a0fc2691854f0e65cbcdbebf9715f812c0c11406842c328010c55ae60aa"},"schema_version":"1.0"},"canonical_sha256":"85fb129c4ae9f17b18217dc3a04b47fb854835a9908a770270992f5192086344","source":{"kind":"arxiv","id":"2209.08040","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.08040","created_at":"2026-07-05T05:10:40Z"},{"alias_kind":"arxiv_version","alias_value":"2209.08040v2","created_at":"2026-07-05T05:10:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08040","created_at":"2026-07-05T05:10:40Z"},{"alias_kind":"pith_short_12","alias_value":"QX5RFHCK5HYX","created_at":"2026-07-05T05:10:40Z"},{"alias_kind":"pith_short_16","alias_value":"QX5RFHCK5HYXWGBB","created_at":"2026-07-05T05:10:40Z"},{"alias_kind":"pith_short_8","alias_value":"QX5RFHCK","created_at":"2026-07-05T05:10:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:QX5RFHCK5HYXWGBBPXB2AS2H7O","target":"record","payload":{"canonical_record":{"source":{"id":"2209.08040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-16T16:37:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6672ac35e370d4bd3f11f71253ce21c9702f05e705a4e92cfac8e9e5f8b0c278","abstract_canon_sha256":"c5910a0fc2691854f0e65cbcdbebf9715f812c0c11406842c328010c55ae60aa"},"schema_version":"1.0"},"canonical_sha256":"85fb129c4ae9f17b18217dc3a04b47fb854835a9908a770270992f5192086344","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:10:40.096633Z","signature_b64":"/5AiqDyRpDke15eJ/IBQ0VJcCPBGHa9Pn88Xo1tSDZBnK4rMFhSZACW7vnykEi4vUmJoN57QtrI8YVbz3p6hCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85fb129c4ae9f17b18217dc3a04b47fb854835a9908a770270992f5192086344","last_reissued_at":"2026-07-05T05:10:40.096192Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:10:40.096192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2209.08040","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-05T05:10:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BH7aJVXUD4l81GrIJCPYo3vX5iYrX3556CrThvkhpZJK3eexljYbpLvKvsoTOMUst0w/TMzHV0cIpCf/0MZwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:48:54.772896Z"},"content_sha256":"bf2439ab7c0cdd6a2840b4eee8a8a7486711ffc38e184d8baed6730b97c9e40b","schema_version":"1.0","event_id":"sha256:bf2439ab7c0cdd6a2840b4eee8a8a7486711ffc38e184d8baed6730b97c9e40b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:QX5RFHCK5HYXWGBBPXB2AS2H7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring the Whole Rashomon Set of Sparse Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chudi Zhong, Cynthia Rudin, Margo Seltzer, Rui Xin, Takuya Takagi, Zhi Chen","submitted_at":"2022-09-16T16:37:26Z","abstract_excerpt":"In any given machine learning problem, there may be many models that could explain the data almost equally well. However, most learning algorithms return only one of these models, leaving practitioners with no practical way to explore alternative models that might have desirable properties beyond what could be expressed within a loss function. The Rashomon set is the set of these all almost-optimal models. Rashomon sets can be extremely complicated, particularly for highly nonlinear function classes that allow complex interaction terms, such as decision trees. We provide the first technique fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08040","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/2209.08040/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-05T05:10:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gAXGuN+xF0+CBcX2wet2vu0NYSkh9nmgR8ec3rwBe4OUU/YWB3R/yrgWmG6uNa+7xUGMQbDq1Sf0L530++fpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:48:54.773963Z"},"content_sha256":"c4d371f375419c1efe7bb0ca3e4dca47902ae7e1f479870bbd906fba4007d5de","schema_version":"1.0","event_id":"sha256:c4d371f375419c1efe7bb0ca3e4dca47902ae7e1f479870bbd906fba4007d5de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QX5RFHCK5HYXWGBBPXB2AS2H7O/bundle.json","state_url":"https://pith.science/pith/QX5RFHCK5HYXWGBBPXB2AS2H7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QX5RFHCK5HYXWGBBPXB2AS2H7O/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-05T11:48:54Z","links":{"resolver":"https://pith.science/pith/QX5RFHCK5HYXWGBBPXB2AS2H7O","bundle":"https://pith.science/pith/QX5RFHCK5HYXWGBBPXB2AS2H7O/bundle.json","state":"https://pith.science/pith/QX5RFHCK5HYXWGBBPXB2AS2H7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QX5RFHCK5HYXWGBBPXB2AS2H7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:QX5RFHCK5HYXWGBBPXB2AS2H7O","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":"c5910a0fc2691854f0e65cbcdbebf9715f812c0c11406842c328010c55ae60aa","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-16T16:37:26Z","title_canon_sha256":"6672ac35e370d4bd3f11f71253ce21c9702f05e705a4e92cfac8e9e5f8b0c278"},"schema_version":"1.0","source":{"id":"2209.08040","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.08040","created_at":"2026-07-05T05:10:40Z"},{"alias_kind":"arxiv_version","alias_value":"2209.08040v2","created_at":"2026-07-05T05:10:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08040","created_at":"2026-07-05T05:10:40Z"},{"alias_kind":"pith_short_12","alias_value":"QX5RFHCK5HYX","created_at":"2026-07-05T05:10:40Z"},{"alias_kind":"pith_short_16","alias_value":"QX5RFHCK5HYXWGBB","created_at":"2026-07-05T05:10:40Z"},{"alias_kind":"pith_short_8","alias_value":"QX5RFHCK","created_at":"2026-07-05T05:10:40Z"}],"graph_snapshots":[{"event_id":"sha256:c4d371f375419c1efe7bb0ca3e4dca47902ae7e1f479870bbd906fba4007d5de","target":"graph","created_at":"2026-07-05T05:10:40Z","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/2209.08040/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In any given machine learning problem, there may be many models that could explain the data almost equally well. However, most learning algorithms return only one of these models, leaving practitioners with no practical way to explore alternative models that might have desirable properties beyond what could be expressed within a loss function. The Rashomon set is the set of these all almost-optimal models. Rashomon sets can be extremely complicated, particularly for highly nonlinear function classes that allow complex interaction terms, such as decision trees. We provide the first technique fo","authors_text":"Chudi Zhong, Cynthia Rudin, Margo Seltzer, Rui Xin, Takuya Takagi, Zhi Chen","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-16T16:37:26Z","title":"Exploring the Whole Rashomon Set of Sparse Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08040","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:bf2439ab7c0cdd6a2840b4eee8a8a7486711ffc38e184d8baed6730b97c9e40b","target":"record","created_at":"2026-07-05T05:10:40Z","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":"c5910a0fc2691854f0e65cbcdbebf9715f812c0c11406842c328010c55ae60aa","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-16T16:37:26Z","title_canon_sha256":"6672ac35e370d4bd3f11f71253ce21c9702f05e705a4e92cfac8e9e5f8b0c278"},"schema_version":"1.0","source":{"id":"2209.08040","kind":"arxiv","version":2}},"canonical_sha256":"85fb129c4ae9f17b18217dc3a04b47fb854835a9908a770270992f5192086344","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85fb129c4ae9f17b18217dc3a04b47fb854835a9908a770270992f5192086344","first_computed_at":"2026-07-05T05:10:40.096192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:10:40.096192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/5AiqDyRpDke15eJ/IBQ0VJcCPBGHa9Pn88Xo1tSDZBnK4rMFhSZACW7vnykEi4vUmJoN57QtrI8YVbz3p6hCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:10:40.096633Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.08040","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf2439ab7c0cdd6a2840b4eee8a8a7486711ffc38e184d8baed6730b97c9e40b","sha256:c4d371f375419c1efe7bb0ca3e4dca47902ae7e1f479870bbd906fba4007d5de"],"state_sha256":"98fe6322ce9b5164ef5daf4d7bc3f635e96bd17468475435838e76b42ec15d8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rT55PcXSFBu6wzb8Ps9DFnwTPeBPMPG99KTHUZ2Lhx279QkHGokUqDgk15iRMsIyMtVi7uwVF3V2+vbByLsrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T11:48:54.781594Z","bundle_sha256":"231af8b2635ec092b24fc551535fedf031460e6e57d51947a565494981744357"}}