{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:5A65D5ZWAKMY5RLCY7X3O2WLXP","short_pith_number":"pith:5A65D5ZW","canonical_record":{"source":{"id":"2006.08690","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-15T19:00:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5d6d95e9449d31ee0b319915ebbd060c2c1a1d57093cde3a01f5a83cedcdd547","abstract_canon_sha256":"4d8256980326690248a5d97532283d1272444ba17c76e987c0a6dc2ce584757e"},"schema_version":"1.0"},"canonical_sha256":"e83dd1f73602998ec562c7efb76acbbbca9aeb4ab4c5e12aba9566726ef7ec9e","source":{"kind":"arxiv","id":"2006.08690","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.08690","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"2006.08690v4","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08690","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"5A65D5ZWAKMY","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"pith_short_16","alias_value":"5A65D5ZWAKMY5RLC","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"pith_short_8","alias_value":"5A65D5ZW","created_at":"2026-07-05T05:18:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:5A65D5ZWAKMY5RLCY7X3O2WLXP","target":"record","payload":{"canonical_record":{"source":{"id":"2006.08690","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-15T19:00:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5d6d95e9449d31ee0b319915ebbd060c2c1a1d57093cde3a01f5a83cedcdd547","abstract_canon_sha256":"4d8256980326690248a5d97532283d1272444ba17c76e987c0a6dc2ce584757e"},"schema_version":"1.0"},"canonical_sha256":"e83dd1f73602998ec562c7efb76acbbbca9aeb4ab4c5e12aba9566726ef7ec9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:18:42.704048Z","signature_b64":"p9vXiLpGARHmF5X7lM4XKWK121ug4nb1Ie4wPUmskkF9s49y3VkoQs8TggJ8Gpky8X9hc7dN/zp/MTSAtRR7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e83dd1f73602998ec562c7efb76acbbbca9aeb4ab4c5e12aba9566726ef7ec9e","last_reissued_at":"2026-07-05T05:18:42.703581Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:18:42.703581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.08690","source_version":4,"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:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0t5A1t5XrjFfiCxD6HoUljDcS6eLDDuzDYt6cz/I7sC8YqX+Xr0j4UpdK6/IuJznPwdBf1CMHtBl1MqXA3xCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T00:09:31.608704Z"},"content_sha256":"2d79b06dfa4c7b5cd27d7d9ec3031f74b60da261384f121918e65466b8f861e0","schema_version":"1.0","event_id":"sha256:2d79b06dfa4c7b5cd27d7d9ec3031f74b60da261384f121918e65466b8f861e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:5A65D5ZWAKMY5RLCY7X3O2WLXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized and Scalable Optimal Sparse Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chudi Zhong, Cynthia Rudin, Diane Hu, Jimmy Lin, Margo Seltzer","submitted_at":"2020-06-15T19:00:11Z","abstract_excerpt":"Decision tree optimization is notoriously difficult from a computational perspective but essential for the field of interpretable machine learning. Despite efforts over the past 40 years, only recently have optimization breakthroughs been made that have allowed practical algorithms to find optimal decision trees. These new techniques have the potential to trigger a paradigm shift where it is possible to construct sparse decision trees to efficiently optimize a variety of objective functions without relying on greedy splitting and pruning heuristics that often lead to suboptimal solutions. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08690","kind":"arxiv","version":4},"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/2006.08690/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:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+72zZwlM7klHxh1qcZe5O/Bs4yFmeXmnV70flo5HcVUJDmVLzaUy/MeDkLApgktiHK5gjJ/t6uxU6Bm/d2nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T00:09:31.609082Z"},"content_sha256":"23b424e8e1761090b4b4b0c7aea1996e2cbcb292ed40c39ef3b4295b5312bdf4","schema_version":"1.0","event_id":"sha256:23b424e8e1761090b4b4b0c7aea1996e2cbcb292ed40c39ef3b4295b5312bdf4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5A65D5ZWAKMY5RLCY7X3O2WLXP/bundle.json","state_url":"https://pith.science/pith/5A65D5ZWAKMY5RLCY7X3O2WLXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5A65D5ZWAKMY5RLCY7X3O2WLXP/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-09T00:09:31Z","links":{"resolver":"https://pith.science/pith/5A65D5ZWAKMY5RLCY7X3O2WLXP","bundle":"https://pith.science/pith/5A65D5ZWAKMY5RLCY7X3O2WLXP/bundle.json","state":"https://pith.science/pith/5A65D5ZWAKMY5RLCY7X3O2WLXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5A65D5ZWAKMY5RLCY7X3O2WLXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:5A65D5ZWAKMY5RLCY7X3O2WLXP","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":"4d8256980326690248a5d97532283d1272444ba17c76e987c0a6dc2ce584757e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-15T19:00:11Z","title_canon_sha256":"5d6d95e9449d31ee0b319915ebbd060c2c1a1d57093cde3a01f5a83cedcdd547"},"schema_version":"1.0","source":{"id":"2006.08690","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.08690","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"2006.08690v4","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.08690","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"5A65D5ZWAKMY","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"pith_short_16","alias_value":"5A65D5ZWAKMY5RLC","created_at":"2026-07-05T05:18:42Z"},{"alias_kind":"pith_short_8","alias_value":"5A65D5ZW","created_at":"2026-07-05T05:18:42Z"}],"graph_snapshots":[{"event_id":"sha256:23b424e8e1761090b4b4b0c7aea1996e2cbcb292ed40c39ef3b4295b5312bdf4","target":"graph","created_at":"2026-07-05T05:18:42Z","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/2006.08690/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decision tree optimization is notoriously difficult from a computational perspective but essential for the field of interpretable machine learning. Despite efforts over the past 40 years, only recently have optimization breakthroughs been made that have allowed practical algorithms to find optimal decision trees. These new techniques have the potential to trigger a paradigm shift where it is possible to construct sparse decision trees to efficiently optimize a variety of objective functions without relying on greedy splitting and pruning heuristics that often lead to suboptimal solutions. The ","authors_text":"Chudi Zhong, Cynthia Rudin, Diane Hu, Jimmy Lin, Margo Seltzer","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-15T19:00:11Z","title":"Generalized and Scalable Optimal Sparse Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.08690","kind":"arxiv","version":4},"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:2d79b06dfa4c7b5cd27d7d9ec3031f74b60da261384f121918e65466b8f861e0","target":"record","created_at":"2026-07-05T05:18:42Z","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":"4d8256980326690248a5d97532283d1272444ba17c76e987c0a6dc2ce584757e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-15T19:00:11Z","title_canon_sha256":"5d6d95e9449d31ee0b319915ebbd060c2c1a1d57093cde3a01f5a83cedcdd547"},"schema_version":"1.0","source":{"id":"2006.08690","kind":"arxiv","version":4}},"canonical_sha256":"e83dd1f73602998ec562c7efb76acbbbca9aeb4ab4c5e12aba9566726ef7ec9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e83dd1f73602998ec562c7efb76acbbbca9aeb4ab4c5e12aba9566726ef7ec9e","first_computed_at":"2026-07-05T05:18:42.703581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:18:42.703581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p9vXiLpGARHmF5X7lM4XKWK121ug4nb1Ie4wPUmskkF9s49y3VkoQs8TggJ8Gpky8X9hc7dN/zp/MTSAtRR7Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:18:42.704048Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.08690","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d79b06dfa4c7b5cd27d7d9ec3031f74b60da261384f121918e65466b8f861e0","sha256:23b424e8e1761090b4b4b0c7aea1996e2cbcb292ed40c39ef3b4295b5312bdf4"],"state_sha256":"dc9fa78ed157d376d4149dc24cdce956947880c1304bf5c14b1eff9e4a243e51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LhFMw+GmciqU7uRn0Oo7DlklC9zReBMtEeUgUATP71H/LASXKf1m77YnfpxD4VDwXRPdMCFtYB1WFRnbb+pQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T00:09:31.611060Z","bundle_sha256":"ef94f28d68884b0d6db8f2a7c69f50498321b8a347a8459a696a2c58e91973e5"}}