{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:A4WRBHWHKYIXKWIELEYNWCBSNK","short_pith_number":"pith:A4WRBHWH","canonical_record":{"source":{"id":"2103.15965","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-29T21:40:58Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"f446f2d2477b1031ac1a0d555aedeeccc797db65bf6b8cd3241dd48af7c5d80f","abstract_canon_sha256":"ded51b8c40c911ddd76fb264a39f1836aec816f841314b2d1ecbf0edc0458077"},"schema_version":"1.0"},"canonical_sha256":"072d109ec756117559045930db08326aa8682bd3e24c8d273a1dd39a4689f046","source":{"kind":"arxiv","id":"2103.15965","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.15965","created_at":"2026-07-05T06:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"2103.15965v3","created_at":"2026-07-05T06:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15965","created_at":"2026-07-05T06:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"A4WRBHWHKYIX","created_at":"2026-07-05T06:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"A4WRBHWHKYIXKWIE","created_at":"2026-07-05T06:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"A4WRBHWH","created_at":"2026-07-05T06:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:A4WRBHWHKYIXKWIELEYNWCBSNK","target":"record","payload":{"canonical_record":{"source":{"id":"2103.15965","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-29T21:40:58Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"f446f2d2477b1031ac1a0d555aedeeccc797db65bf6b8cd3241dd48af7c5d80f","abstract_canon_sha256":"ded51b8c40c911ddd76fb264a39f1836aec816f841314b2d1ecbf0edc0458077"},"schema_version":"1.0"},"canonical_sha256":"072d109ec756117559045930db08326aa8682bd3e24c8d273a1dd39a4689f046","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:32:31.229761Z","signature_b64":"LC2wj1ufFXlHCAZtFmxixvDdswNeZdIv/DGFWx/AVpRoNLbShOiczWljDFbMOCAqwWEFNn6sGpItI9XJPjaJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"072d109ec756117559045930db08326aa8682bd3e24c8d273a1dd39a4689f046","last_reissued_at":"2026-07-05T06:32:31.229241Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:32:31.229241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.15965","source_version":3,"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-05T06:32:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGstL6QT8+Ky+phI09j7cqHalrx5PcMyKhyL7Ma6eDzL+p3e2+WBN5LPOy/9soqj5Rk5Qs8uxTgN8+k4abx+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:09:03.398686Z"},"content_sha256":"e1a9ad61f2365ffe0cfcc86118a8f841b46257582941d546ec8f1c167fd74a5b","schema_version":"1.0","event_id":"sha256:e1a9ad61f2365ffe0cfcc86118a8f841b46257582941d546ec8f1c167fd74a5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:A4WRBHWHKYIXKWIELEYNWCBSNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Optimal Classification Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.LG","authors_text":"Andr\\'es G\\'omez, Phebe Vayanos, Sina Aghaei","submitted_at":"2021-03-29T21:40:58Z","abstract_excerpt":"Decision trees are among the most popular machine learning models and are used routinely in applications ranging from revenue management and medicine to bioinformatics. In this paper, we consider the problem of learning optimal binary classification trees with univariate splits. Literature on the topic has burgeoned in recent years, motivated both by the empirical suboptimality of heuristic approaches and the tremendous improvements in mixed-integer optimization (MIO) technology. Yet, existing MIO-based approaches from the literature do not leverage the power of MIO to its full extent: they re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15965","kind":"arxiv","version":3},"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/2103.15965/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-05T06:32:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYTN5FggQK0/6FxXnKGw6NbjEOQAm2vg84zrZ9smRdivRWut/pjuA8nQ9kUjKTYsoLARzw4DMtWMpfWHzfF8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:09:03.399060Z"},"content_sha256":"2ab2d6e15f6e126b3737adec8f4d1d201d23f0d39bd9fcb6527466fabbcaa006","schema_version":"1.0","event_id":"sha256:2ab2d6e15f6e126b3737adec8f4d1d201d23f0d39bd9fcb6527466fabbcaa006"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK/bundle.json","state_url":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4WRBHWHKYIXKWIELEYNWCBSNK/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-06T23:09:03Z","links":{"resolver":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK","bundle":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK/bundle.json","state":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4WRBHWHKYIXKWIELEYNWCBSNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:A4WRBHWHKYIXKWIELEYNWCBSNK","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":"ded51b8c40c911ddd76fb264a39f1836aec816f841314b2d1ecbf0edc0458077","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-29T21:40:58Z","title_canon_sha256":"f446f2d2477b1031ac1a0d555aedeeccc797db65bf6b8cd3241dd48af7c5d80f"},"schema_version":"1.0","source":{"id":"2103.15965","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.15965","created_at":"2026-07-05T06:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"2103.15965v3","created_at":"2026-07-05T06:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15965","created_at":"2026-07-05T06:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"A4WRBHWHKYIX","created_at":"2026-07-05T06:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"A4WRBHWHKYIXKWIE","created_at":"2026-07-05T06:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"A4WRBHWH","created_at":"2026-07-05T06:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:2ab2d6e15f6e126b3737adec8f4d1d201d23f0d39bd9fcb6527466fabbcaa006","target":"graph","created_at":"2026-07-05T06:32:31Z","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/2103.15965/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decision trees are among the most popular machine learning models and are used routinely in applications ranging from revenue management and medicine to bioinformatics. In this paper, we consider the problem of learning optimal binary classification trees with univariate splits. Literature on the topic has burgeoned in recent years, motivated both by the empirical suboptimality of heuristic approaches and the tremendous improvements in mixed-integer optimization (MIO) technology. Yet, existing MIO-based approaches from the literature do not leverage the power of MIO to its full extent: they re","authors_text":"Andr\\'es G\\'omez, Phebe Vayanos, Sina Aghaei","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-29T21:40:58Z","title":"Strong Optimal Classification Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15965","kind":"arxiv","version":3},"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:e1a9ad61f2365ffe0cfcc86118a8f841b46257582941d546ec8f1c167fd74a5b","target":"record","created_at":"2026-07-05T06:32:31Z","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":"ded51b8c40c911ddd76fb264a39f1836aec816f841314b2d1ecbf0edc0458077","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-29T21:40:58Z","title_canon_sha256":"f446f2d2477b1031ac1a0d555aedeeccc797db65bf6b8cd3241dd48af7c5d80f"},"schema_version":"1.0","source":{"id":"2103.15965","kind":"arxiv","version":3}},"canonical_sha256":"072d109ec756117559045930db08326aa8682bd3e24c8d273a1dd39a4689f046","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"072d109ec756117559045930db08326aa8682bd3e24c8d273a1dd39a4689f046","first_computed_at":"2026-07-05T06:32:31.229241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:32:31.229241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LC2wj1ufFXlHCAZtFmxixvDdswNeZdIv/DGFWx/AVpRoNLbShOiczWljDFbMOCAqwWEFNn6sGpItI9XJPjaJCA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:32:31.229761Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.15965","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1a9ad61f2365ffe0cfcc86118a8f841b46257582941d546ec8f1c167fd74a5b","sha256:2ab2d6e15f6e126b3737adec8f4d1d201d23f0d39bd9fcb6527466fabbcaa006"],"state_sha256":"efa45e9f3cbaceb3b80376621f43058edc97c5df6bdd626b601cd737a8ece44e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q06+yI1sZdk1DaUtkq9sgcMVSETHL8cDG26RCd4S9rPA8Ofj+3r72kQiLI3dUHPz2gQ3cOTrgdrgMVRj9jehBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T23:09:03.401012Z","bundle_sha256":"63bdf994bc38d9eceead0ab9bd7dd2d8400bb274d9c2f9c858916c4904ffb0b1"}}