{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3MUJQZRCPG26CVEKDJCHJKVYA3","short_pith_number":"pith:3MUJQZRC","schema_version":"1.0","canonical_sha256":"db2898662279b5e1548a1a4474aab806d5f28082b0270d04655b95dc07e517ff","source":{"kind":"arxiv","id":"1904.06314","version":1},"attestation_state":"computed","paper":{"title":"Learning Optimal Decision Trees from Large Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Florent Avellaneda","submitted_at":"2019-04-12T16:44:10Z","abstract_excerpt":"Inferring a decision tree from a given dataset is one of the classic problems in machine learning. This problem consists of buildings, from a labelled dataset, a tree such that each node corresponds to a class and a path between the tree root and a leaf corresponds to a conjunction of features to be satisfied in this class. Following the principle of parsimony, we want to infer a minimal tree consistent with the dataset. Unfortunately, inferring an optimal decision tree is known to be NP-complete for several definitions of optimality. Hence, the majority of existing approaches relies on heuris"},"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":"1904.06314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-12T16:44:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7c3ff6b68aa74400c504b8c4ac99938b624764cca8b8c09ccc715f7bd499ce62","abstract_canon_sha256":"c925d9fe4b414c522e641c1a62559b1f1c79cd68494d4322d44c9834e127a46c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:43.616520Z","signature_b64":"pHm6f7ikeZ0BuWL2VJ1xe0eI++goVaOFKDX7+U2VZt9GaSJv83/SstzZKF5wx2MLR6BinTtTLZcMNqm49ZVyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db2898662279b5e1548a1a4474aab806d5f28082b0270d04655b95dc07e517ff","last_reissued_at":"2026-05-17T23:48:43.615982Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:43.615982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Optimal Decision Trees from Large Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Florent Avellaneda","submitted_at":"2019-04-12T16:44:10Z","abstract_excerpt":"Inferring a decision tree from a given dataset is one of the classic problems in machine learning. This problem consists of buildings, from a labelled dataset, a tree such that each node corresponds to a class and a path between the tree root and a leaf corresponds to a conjunction of features to be satisfied in this class. Following the principle of parsimony, we want to infer a minimal tree consistent with the dataset. Unfortunately, inferring an optimal decision tree is known to be NP-complete for several definitions of optimality. Hence, the majority of existing approaches relies on heuris"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06314","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1904.06314","created_at":"2026-05-17T23:48:43.616053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.06314v1","created_at":"2026-05-17T23:48:43.616053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06314","created_at":"2026-05-17T23:48:43.616053+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MUJQZRCPG26","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MUJQZRCPG26CVEK","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MUJQZRC","created_at":"2026-05-18T12:33:07.085635+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/3MUJQZRCPG26CVEKDJCHJKVYA3","json":"https://pith.science/pith/3MUJQZRCPG26CVEKDJCHJKVYA3.json","graph_json":"https://pith.science/api/pith-number/3MUJQZRCPG26CVEKDJCHJKVYA3/graph.json","events_json":"https://pith.science/api/pith-number/3MUJQZRCPG26CVEKDJCHJKVYA3/events.json","paper":"https://pith.science/paper/3MUJQZRC"},"agent_actions":{"view_html":"https://pith.science/pith/3MUJQZRCPG26CVEKDJCHJKVYA3","download_json":"https://pith.science/pith/3MUJQZRCPG26CVEKDJCHJKVYA3.json","view_paper":"https://pith.science/paper/3MUJQZRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.06314&json=true","fetch_graph":"https://pith.science/api/pith-number/3MUJQZRCPG26CVEKDJCHJKVYA3/graph.json","fetch_events":"https://pith.science/api/pith-number/3MUJQZRCPG26CVEKDJCHJKVYA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MUJQZRCPG26CVEKDJCHJKVYA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MUJQZRCPG26CVEKDJCHJKVYA3/action/storage_attestation","attest_author":"https://pith.science/pith/3MUJQZRCPG26CVEKDJCHJKVYA3/action/author_attestation","sign_citation":"https://pith.science/pith/3MUJQZRCPG26CVEKDJCHJKVYA3/action/citation_signature","submit_replication":"https://pith.science/pith/3MUJQZRCPG26CVEKDJCHJKVYA3/action/replication_record"}},"created_at":"2026-05-17T23:48:43.616053+00:00","updated_at":"2026-05-17T23:48:43.616053+00:00"}