{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:U5OZM45WR73KP25NGMTCLFEVXG","short_pith_number":"pith:U5OZM45W","schema_version":"1.0","canonical_sha256":"a75d9673b68ff6a7ebad3326259495b99221101dc6ba51479a61db406490f090","source":{"kind":"arxiv","id":"2401.09848","version":3},"attestation_state":"computed","paper":{"title":"Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jan Pablo Burgard, Maria Eduarda Pinheiro, Martin Schmidt","submitted_at":"2024-01-18T10:05:03Z","abstract_excerpt":"Decision trees are one of the most popular methods for solving classification problems, mainly because of their good interpretability properties. Moreover, due to advances in recent years in mixed-integer optimization, several models have been proposed to formulate the problem of computing optimal classification trees. The goal is, given a set of labeled points, to split the feature spacewith hyperplanes and assign a class to each part of the resulting partition. In certain scenarios, however, labels are only available for a subset of the given points. Additionally, this subset may be non-repr"},"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":"2401.09848","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-01-18T10:05:03Z","cross_cats_sorted":[],"title_canon_sha256":"118ac709d0933b0826b087e74dd53badb87cbc4e3fc14a9665b3baf046217ca8","abstract_canon_sha256":"103ba430bcf9777a7f2085d569f28d10726879e7cc6ddd069835ad86693a508e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:04:34.591362Z","signature_b64":"UEMbO/jc2DI/mFhLp4eUWdWJA5o1DfGtRq8Legq4UthVuAtk0HqrbttN/vAxUmTx/ROyJvKGEGVpe0S+ctuqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a75d9673b68ff6a7ebad3326259495b99221101dc6ba51479a61db406490f090","last_reissued_at":"2026-05-29T01:04:34.590793Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:04:34.590793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jan Pablo Burgard, Maria Eduarda Pinheiro, Martin Schmidt","submitted_at":"2024-01-18T10:05:03Z","abstract_excerpt":"Decision trees are one of the most popular methods for solving classification problems, mainly because of their good interpretability properties. Moreover, due to advances in recent years in mixed-integer optimization, several models have been proposed to formulate the problem of computing optimal classification trees. The goal is, given a set of labeled points, to split the feature spacewith hyperplanes and assign a class to each part of the resulting partition. In certain scenarios, however, labels are only available for a subset of the given points. Additionally, this subset may be non-repr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09848","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/2401.09848/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":"2401.09848","created_at":"2026-05-29T01:04:34.590863+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.09848v3","created_at":"2026-05-29T01:04:34.590863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09848","created_at":"2026-05-29T01:04:34.590863+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5OZM45WR73K","created_at":"2026-05-29T01:04:34.590863+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5OZM45WR73KP25N","created_at":"2026-05-29T01:04:34.590863+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5OZM45W","created_at":"2026-05-29T01:04:34.590863+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/U5OZM45WR73KP25NGMTCLFEVXG","json":"https://pith.science/pith/U5OZM45WR73KP25NGMTCLFEVXG.json","graph_json":"https://pith.science/api/pith-number/U5OZM45WR73KP25NGMTCLFEVXG/graph.json","events_json":"https://pith.science/api/pith-number/U5OZM45WR73KP25NGMTCLFEVXG/events.json","paper":"https://pith.science/paper/U5OZM45W"},"agent_actions":{"view_html":"https://pith.science/pith/U5OZM45WR73KP25NGMTCLFEVXG","download_json":"https://pith.science/pith/U5OZM45WR73KP25NGMTCLFEVXG.json","view_paper":"https://pith.science/paper/U5OZM45W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.09848&json=true","fetch_graph":"https://pith.science/api/pith-number/U5OZM45WR73KP25NGMTCLFEVXG/graph.json","fetch_events":"https://pith.science/api/pith-number/U5OZM45WR73KP25NGMTCLFEVXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5OZM45WR73KP25NGMTCLFEVXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5OZM45WR73KP25NGMTCLFEVXG/action/storage_attestation","attest_author":"https://pith.science/pith/U5OZM45WR73KP25NGMTCLFEVXG/action/author_attestation","sign_citation":"https://pith.science/pith/U5OZM45WR73KP25NGMTCLFEVXG/action/citation_signature","submit_replication":"https://pith.science/pith/U5OZM45WR73KP25NGMTCLFEVXG/action/replication_record"}},"created_at":"2026-05-29T01:04:34.590863+00:00","updated_at":"2026-05-29T01:04:34.590863+00:00"}