{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:A35YULHZ4KFDYJOVDSZHTIJMWJ","short_pith_number":"pith:A35YULHZ","canonical_record":{"source":{"id":"2007.12652","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-24T17:06:55Z","cross_cats_sorted":["cs.AI","cs.DS","stat.ML"],"title_canon_sha256":"38d6d78143b3de4dd684979e6eefb04cad001eda86c1f58dceb0305e5d8e8294","abstract_canon_sha256":"0d8d8b6fdf9bfd219d0f5d78c091cfffbf6d5a23a4e037660e4de692af731c64"},"schema_version":"1.0"},"canonical_sha256":"06fb8a2cf9e28a3c25d51cb279a12cb24f6fd422ee770fbdc7a45b62ab010d7a","source":{"kind":"arxiv","id":"2007.12652","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.12652","created_at":"2026-07-05T04:35:54Z"},{"alias_kind":"arxiv_version","alias_value":"2007.12652v4","created_at":"2026-07-05T04:35:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.12652","created_at":"2026-07-05T04:35:54Z"},{"alias_kind":"pith_short_12","alias_value":"A35YULHZ4KFD","created_at":"2026-07-05T04:35:54Z"},{"alias_kind":"pith_short_16","alias_value":"A35YULHZ4KFDYJOV","created_at":"2026-07-05T04:35:54Z"},{"alias_kind":"pith_short_8","alias_value":"A35YULHZ","created_at":"2026-07-05T04:35:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:A35YULHZ4KFDYJOVDSZHTIJMWJ","target":"record","payload":{"canonical_record":{"source":{"id":"2007.12652","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-24T17:06:55Z","cross_cats_sorted":["cs.AI","cs.DS","stat.ML"],"title_canon_sha256":"38d6d78143b3de4dd684979e6eefb04cad001eda86c1f58dceb0305e5d8e8294","abstract_canon_sha256":"0d8d8b6fdf9bfd219d0f5d78c091cfffbf6d5a23a4e037660e4de692af731c64"},"schema_version":"1.0"},"canonical_sha256":"06fb8a2cf9e28a3c25d51cb279a12cb24f6fd422ee770fbdc7a45b62ab010d7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:35:54.936265Z","signature_b64":"kukUUHHM8OiGwnV7A4IBEKR0DtUTWVTHjJyphBrMjexvz0OlEXeNSvJdLZwGTKzp08dsA73ueDuebDAyh1GbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06fb8a2cf9e28a3c25d51cb279a12cb24f6fd422ee770fbdc7a45b62ab010d7a","last_reissued_at":"2026-07-05T04:35:54.935828Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:35:54.935828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.12652","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-05T04:35:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cDaj0yPnXw5Aal0uzBPpNr8sdLEXcez2lCMDIVtQGlLAU3TGCOGdE3o2m4mRAUAFq7H8Pmc9TO8BRbtpjB8ODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:06:10.565687Z"},"content_sha256":"7f1013a3a640eaca80781f07196874987e4babe2fcf0e2bed20917b1f525a790","schema_version":"1.0","event_id":"sha256:7f1013a3a640eaca80781f07196874987e4babe2fcf0e2bed20917b1f525a790"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:A35YULHZ4KFDYJOVDSZHTIJMWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MurTree: Optimal Classification Trees via Dynamic Programming and Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anna Lukina, Christopher Leckie, Emir Demirovi\\'c, Emmanuel Hebrard, James Bailey, Jeffrey Chan, Kotagiri Ramamohanarao, Peter J. Stuckey","submitted_at":"2020-07-24T17:06:55Z","abstract_excerpt":"Decision tree learning is a widely used approach in machine learning, favoured in applications that require concise and interpretable models. Heuristic methods are traditionally used to quickly produce models with reasonably high accuracy. A commonly criticised point, however, is that the resulting trees may not necessarily be the best representation of the data in terms of accuracy and size. In recent years, this motivated the development of optimal classification tree algorithms that globally optimise the decision tree in contrast to heuristic methods that perform a sequence of locally optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.12652","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/2007.12652/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-05T04:35:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"awbZtdCgkRY0lNZmVFz+Wz3mFSUByCCRHtPTf3SrDQaF7yhWLldqsg98KUF8ruPaMfBgtDr7DwNXtcg4J30jAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:06:10.566199Z"},"content_sha256":"2f58ee4af63179a1ffb56c3a9d06610581dd7d613684d9ad8e350bf434419ad3","schema_version":"1.0","event_id":"sha256:2f58ee4af63179a1ffb56c3a9d06610581dd7d613684d9ad8e350bf434419ad3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A35YULHZ4KFDYJOVDSZHTIJMWJ/bundle.json","state_url":"https://pith.science/pith/A35YULHZ4KFDYJOVDSZHTIJMWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A35YULHZ4KFDYJOVDSZHTIJMWJ/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-05T22:06:10Z","links":{"resolver":"https://pith.science/pith/A35YULHZ4KFDYJOVDSZHTIJMWJ","bundle":"https://pith.science/pith/A35YULHZ4KFDYJOVDSZHTIJMWJ/bundle.json","state":"https://pith.science/pith/A35YULHZ4KFDYJOVDSZHTIJMWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A35YULHZ4KFDYJOVDSZHTIJMWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:A35YULHZ4KFDYJOVDSZHTIJMWJ","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":"0d8d8b6fdf9bfd219d0f5d78c091cfffbf6d5a23a4e037660e4de692af731c64","cross_cats_sorted":["cs.AI","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-24T17:06:55Z","title_canon_sha256":"38d6d78143b3de4dd684979e6eefb04cad001eda86c1f58dceb0305e5d8e8294"},"schema_version":"1.0","source":{"id":"2007.12652","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.12652","created_at":"2026-07-05T04:35:54Z"},{"alias_kind":"arxiv_version","alias_value":"2007.12652v4","created_at":"2026-07-05T04:35:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.12652","created_at":"2026-07-05T04:35:54Z"},{"alias_kind":"pith_short_12","alias_value":"A35YULHZ4KFD","created_at":"2026-07-05T04:35:54Z"},{"alias_kind":"pith_short_16","alias_value":"A35YULHZ4KFDYJOV","created_at":"2026-07-05T04:35:54Z"},{"alias_kind":"pith_short_8","alias_value":"A35YULHZ","created_at":"2026-07-05T04:35:54Z"}],"graph_snapshots":[{"event_id":"sha256:2f58ee4af63179a1ffb56c3a9d06610581dd7d613684d9ad8e350bf434419ad3","target":"graph","created_at":"2026-07-05T04:35:54Z","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/2007.12652/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decision tree learning is a widely used approach in machine learning, favoured in applications that require concise and interpretable models. Heuristic methods are traditionally used to quickly produce models with reasonably high accuracy. A commonly criticised point, however, is that the resulting trees may not necessarily be the best representation of the data in terms of accuracy and size. In recent years, this motivated the development of optimal classification tree algorithms that globally optimise the decision tree in contrast to heuristic methods that perform a sequence of locally optim","authors_text":"Anna Lukina, Christopher Leckie, Emir Demirovi\\'c, Emmanuel Hebrard, James Bailey, Jeffrey Chan, Kotagiri Ramamohanarao, Peter J. Stuckey","cross_cats":["cs.AI","cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-24T17:06:55Z","title":"MurTree: Optimal Classification Trees via Dynamic Programming and Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.12652","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:7f1013a3a640eaca80781f07196874987e4babe2fcf0e2bed20917b1f525a790","target":"record","created_at":"2026-07-05T04:35:54Z","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":"0d8d8b6fdf9bfd219d0f5d78c091cfffbf6d5a23a4e037660e4de692af731c64","cross_cats_sorted":["cs.AI","cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-24T17:06:55Z","title_canon_sha256":"38d6d78143b3de4dd684979e6eefb04cad001eda86c1f58dceb0305e5d8e8294"},"schema_version":"1.0","source":{"id":"2007.12652","kind":"arxiv","version":4}},"canonical_sha256":"06fb8a2cf9e28a3c25d51cb279a12cb24f6fd422ee770fbdc7a45b62ab010d7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06fb8a2cf9e28a3c25d51cb279a12cb24f6fd422ee770fbdc7a45b62ab010d7a","first_computed_at":"2026-07-05T04:35:54.935828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:35:54.935828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kukUUHHM8OiGwnV7A4IBEKR0DtUTWVTHjJyphBrMjexvz0OlEXeNSvJdLZwGTKzp08dsA73ueDuebDAyh1GbDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:35:54.936265Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.12652","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f1013a3a640eaca80781f07196874987e4babe2fcf0e2bed20917b1f525a790","sha256:2f58ee4af63179a1ffb56c3a9d06610581dd7d613684d9ad8e350bf434419ad3"],"state_sha256":"1c9aef1e199e93ccae6b99b33bceebfed401c4dbd45e09785df34a22673074d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5RtPD4LqHHAvBdXUMI5aMvvCoZqifQqXNzfAeJ6xTZrL1FD+b498dYywRvIJg7g1RyA7ovCRp/u6vP/QQLHzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T22:06:10.569540Z","bundle_sha256":"a66d531ece9a86e7a9e9aa0f57f804b36d0f3ecf38375d66d3b6fa204e935d84"}}