{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ISM6WIONPHCGIPNSIPZLGAFFLW","short_pith_number":"pith:ISM6WION","canonical_record":{"source":{"id":"1906.01246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T07:30:32Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"6f3351c68624f27d65cef34641441d8dd259a4c61e1017ccc08248938a62ece4","abstract_canon_sha256":"65514008857c10e72573a4cddf060e25377081f14672f01c8ac5fa01a371a2f2"},"schema_version":"1.0"},"canonical_sha256":"4499eb21cd79c4643db243f2b300a55d98ab1955f754555817350a5770f7a222","source":{"kind":"arxiv","id":"1906.01246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01246","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01246v1","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01246","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"ISM6WIONPHCG","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"ISM6WIONPHCGIPNS","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"ISM6WION","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ISM6WIONPHCGIPNSIPZLGAFFLW","target":"record","payload":{"canonical_record":{"source":{"id":"1906.01246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T07:30:32Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"6f3351c68624f27d65cef34641441d8dd259a4c61e1017ccc08248938a62ece4","abstract_canon_sha256":"65514008857c10e72573a4cddf060e25377081f14672f01c8ac5fa01a371a2f2"},"schema_version":"1.0"},"canonical_sha256":"4499eb21cd79c4643db243f2b300a55d98ab1955f754555817350a5770f7a222","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:17.365795Z","signature_b64":"ft8tSkHMQlBwu1VLe/dEpW+wkI1i0rOyPVZJE+iwVFiZLYl71ybX2I/wGcBICyN1OdEykijS0/eoNH+78uIxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4499eb21cd79c4643db243f2b300a55d98ab1955f754555817350a5770f7a222","last_reissued_at":"2026-05-17T23:44:17.365191Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:17.365191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.01246","source_version":1,"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-05-17T23:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1MHrZy33R4g31xeWQjK4wFEdFwEDEWrJOjkramWEbqnZ0Aq3C5EI5V98Zd8n0FXjPbz38OAPYdpdVPJceKB7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:56:50.564274Z"},"content_sha256":"8d17ed5f2c8eef411771574058b09f8536cdf7cbedd3499e9291acbc2251bed8","schema_version":"1.0","event_id":"sha256:8d17ed5f2c8eef411771574058b09f8536cdf7cbedd3499e9291acbc2251bed8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ISM6WIONPHCGIPNSIPZLGAFFLW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Novel Hyperparameter-free Approach to Decision Tree Construction that Avoids Overfitting by Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Antonio Fernandez Anta, Paolo Casari, Rafael Garcia Leiva, Vincenzo Mancuso","submitted_at":"2019-06-04T07:30:32Z","abstract_excerpt":"Decision trees are an extremely popular machine learning technique. Unfortunately, overfitting in decision trees still remains an open issue that sometimes prevents achieving good performance. In this work, we present a novel approach for the construction of decision trees that avoids the overfitting by design, without losing accuracy. A distinctive feature of our algorithm is that it requires neither the optimization of any hyperparameters, nor the use of regularization techniques, thus significantly reducing the decision tree training time. Moreover, our algorithm produces much smaller and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01246","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"},"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-05-17T23:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eftHMte1Clp7MNZRiqS5VrDZebreTsWW0zaq4TK7fVgAzdPKE3S0bi38JnPCJ/FQoGsHiZYRoylcPfeJS6kFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:56:50.564637Z"},"content_sha256":"3096baa52196ba7bdd4cae1459115be724cb61dc4b9a198278766d7cb1c19c12","schema_version":"1.0","event_id":"sha256:3096baa52196ba7bdd4cae1459115be724cb61dc4b9a198278766d7cb1c19c12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISM6WIONPHCGIPNSIPZLGAFFLW/bundle.json","state_url":"https://pith.science/pith/ISM6WIONPHCGIPNSIPZLGAFFLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISM6WIONPHCGIPNSIPZLGAFFLW/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-02T09:56:50Z","links":{"resolver":"https://pith.science/pith/ISM6WIONPHCGIPNSIPZLGAFFLW","bundle":"https://pith.science/pith/ISM6WIONPHCGIPNSIPZLGAFFLW/bundle.json","state":"https://pith.science/pith/ISM6WIONPHCGIPNSIPZLGAFFLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISM6WIONPHCGIPNSIPZLGAFFLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ISM6WIONPHCGIPNSIPZLGAFFLW","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":"65514008857c10e72573a4cddf060e25377081f14672f01c8ac5fa01a371a2f2","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T07:30:32Z","title_canon_sha256":"6f3351c68624f27d65cef34641441d8dd259a4c61e1017ccc08248938a62ece4"},"schema_version":"1.0","source":{"id":"1906.01246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01246","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01246v1","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01246","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"ISM6WIONPHCG","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"ISM6WIONPHCGIPNS","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"ISM6WION","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:3096baa52196ba7bdd4cae1459115be724cb61dc4b9a198278766d7cb1c19c12","target":"graph","created_at":"2026-05-17T23:44:17Z","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"},"paper":{"abstract_excerpt":"Decision trees are an extremely popular machine learning technique. Unfortunately, overfitting in decision trees still remains an open issue that sometimes prevents achieving good performance. In this work, we present a novel approach for the construction of decision trees that avoids the overfitting by design, without losing accuracy. A distinctive feature of our algorithm is that it requires neither the optimization of any hyperparameters, nor the use of regularization techniques, thus significantly reducing the decision tree training time. Moreover, our algorithm produces much smaller and s","authors_text":"Antonio Fernandez Anta, Paolo Casari, Rafael Garcia Leiva, Vincenzo Mancuso","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T07:30:32Z","title":"A Novel Hyperparameter-free Approach to Decision Tree Construction that Avoids Overfitting by Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01246","kind":"arxiv","version":1},"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:8d17ed5f2c8eef411771574058b09f8536cdf7cbedd3499e9291acbc2251bed8","target":"record","created_at":"2026-05-17T23:44:17Z","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":"65514008857c10e72573a4cddf060e25377081f14672f01c8ac5fa01a371a2f2","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T07:30:32Z","title_canon_sha256":"6f3351c68624f27d65cef34641441d8dd259a4c61e1017ccc08248938a62ece4"},"schema_version":"1.0","source":{"id":"1906.01246","kind":"arxiv","version":1}},"canonical_sha256":"4499eb21cd79c4643db243f2b300a55d98ab1955f754555817350a5770f7a222","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4499eb21cd79c4643db243f2b300a55d98ab1955f754555817350a5770f7a222","first_computed_at":"2026-05-17T23:44:17.365191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:17.365191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ft8tSkHMQlBwu1VLe/dEpW+wkI1i0rOyPVZJE+iwVFiZLYl71ybX2I/wGcBICyN1OdEykijS0/eoNH+78uIxCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:17.365795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d17ed5f2c8eef411771574058b09f8536cdf7cbedd3499e9291acbc2251bed8","sha256:3096baa52196ba7bdd4cae1459115be724cb61dc4b9a198278766d7cb1c19c12"],"state_sha256":"81e492cd13f7a37ac67c8f4587aeef1187d114ff0b3a2b6995876c1998f17d56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LRL9MjSum0WwP1B/ivdqCC8fqewADAsGZSz+93YdJcWszEauUT2F0/6bGCEIQTIXYxS3whk3LwDeO5XiuQuuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T09:56:50.566575Z","bundle_sha256":"9f3b40ab338e3c55d5ff79a02cd5aff1d72f846fc05ebd43886d37883c6249b6"}}