{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4H3PGQVU4EMMVKA25C6MNJJMGU","short_pith_number":"pith:4H3PGQVU","canonical_record":{"source":{"id":"1801.08310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-25T08:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"768e4132b3644a79c074756bde34f67afaa1a6fcf8763155c984ab6513cd4f23","abstract_canon_sha256":"0d8caa8c39a19efdd5c28661ae3ae12917bb7e75238f758e4199e2e6afc3f53a"},"schema_version":"1.0"},"canonical_sha256":"e1f6f342b4e118caa81ae8bcc6a52c353eaf8bdd0e4b62270d7147b0815e9bec","source":{"kind":"arxiv","id":"1801.08310","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08310","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08310v1","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08310","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"4H3PGQVU4EMM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4H3PGQVU4EMMVKA2","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4H3PGQVU","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4H3PGQVU4EMMVKA25C6MNJJMGU","target":"record","payload":{"canonical_record":{"source":{"id":"1801.08310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-25T08:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"768e4132b3644a79c074756bde34f67afaa1a6fcf8763155c984ab6513cd4f23","abstract_canon_sha256":"0d8caa8c39a19efdd5c28661ae3ae12917bb7e75238f758e4199e2e6afc3f53a"},"schema_version":"1.0"},"canonical_sha256":"e1f6f342b4e118caa81ae8bcc6a52c353eaf8bdd0e4b62270d7147b0815e9bec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:06.570214Z","signature_b64":"G1D3AEh+FayiBHCgvwyH8yaOMssBVqIewFdA/Dy3t2ZUdhG2qhGXm+s2iup8wSs/0JLKwD5vakUdJsMoFiDyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f6f342b4e118caa81ae8bcc6a52c353eaf8bdd0e4b62270d7147b0815e9bec","last_reissued_at":"2026-05-18T00:25:06.569841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:06.569841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.08310","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-18T00:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Y8UTc3ZX1s9GkZHeFP6W8RxfzuscDyrpdj+sE54EYSUMe023khodbVYMwWnfvGgHp+I7vqOjniewsHKorX1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:04:32.740012Z"},"content_sha256":"365e171ada5217c0d54ba6fdedf80f685ddae3a98c74e50d2d9e67a730e82bca","schema_version":"1.0","event_id":"sha256:365e171ada5217c0d54ba6fdedf80f685ddae3a98c74e50d2d9e67a730e82bca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4H3PGQVU4EMMVKA25C6MNJJMGU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information gain ratio correction: Improving prediction with more balanced decision tree splits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Antonin Leroux, Matthieu Boussard, Remi D\\`es","submitted_at":"2018-01-25T08:45:43Z","abstract_excerpt":"Decision trees algorithms use a gain function to select the best split during the tree's induction. This function is crucial to obtain trees with high predictive accuracy. Some gain functions can suffer from a bias when it compares splits of different arities. Quinlan proposed a gain ratio in C4.5's information gain function to fix this bias. In this paper, we present an updated version of the gain ratio that performs better as it tries to fix the gain ratio's bias for unbalanced trees and some splits with low predictive interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08310","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-18T00:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHdtTNtViRZwz0+9plFPXZETTF1gQmzQHRxBZTZR1ao/X5INGbIrkJp3HjxL/s245RxarWmv5WQhViM6MpbECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:04:32.740397Z"},"content_sha256":"9534fdb1bc03d8b5a15adb36a487cb864a188f2be34e701ca7c6d562d86d8fd4","schema_version":"1.0","event_id":"sha256:9534fdb1bc03d8b5a15adb36a487cb864a188f2be34e701ca7c6d562d86d8fd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4H3PGQVU4EMMVKA25C6MNJJMGU/bundle.json","state_url":"https://pith.science/pith/4H3PGQVU4EMMVKA25C6MNJJMGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4H3PGQVU4EMMVKA25C6MNJJMGU/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-06-04T17:04:32Z","links":{"resolver":"https://pith.science/pith/4H3PGQVU4EMMVKA25C6MNJJMGU","bundle":"https://pith.science/pith/4H3PGQVU4EMMVKA25C6MNJJMGU/bundle.json","state":"https://pith.science/pith/4H3PGQVU4EMMVKA25C6MNJJMGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4H3PGQVU4EMMVKA25C6MNJJMGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4H3PGQVU4EMMVKA25C6MNJJMGU","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":"0d8caa8c39a19efdd5c28661ae3ae12917bb7e75238f758e4199e2e6afc3f53a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-25T08:45:43Z","title_canon_sha256":"768e4132b3644a79c074756bde34f67afaa1a6fcf8763155c984ab6513cd4f23"},"schema_version":"1.0","source":{"id":"1801.08310","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08310","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08310v1","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08310","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"4H3PGQVU4EMM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4H3PGQVU4EMMVKA2","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4H3PGQVU","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:9534fdb1bc03d8b5a15adb36a487cb864a188f2be34e701ca7c6d562d86d8fd4","target":"graph","created_at":"2026-05-18T00:25:06Z","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 algorithms use a gain function to select the best split during the tree's induction. This function is crucial to obtain trees with high predictive accuracy. Some gain functions can suffer from a bias when it compares splits of different arities. Quinlan proposed a gain ratio in C4.5's information gain function to fix this bias. In this paper, we present an updated version of the gain ratio that performs better as it tries to fix the gain ratio's bias for unbalanced trees and some splits with low predictive interest.","authors_text":"Antonin Leroux, Matthieu Boussard, Remi D\\`es","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-25T08:45:43Z","title":"Information gain ratio correction: Improving prediction with more balanced decision tree splits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08310","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:365e171ada5217c0d54ba6fdedf80f685ddae3a98c74e50d2d9e67a730e82bca","target":"record","created_at":"2026-05-18T00:25:06Z","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":"0d8caa8c39a19efdd5c28661ae3ae12917bb7e75238f758e4199e2e6afc3f53a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-25T08:45:43Z","title_canon_sha256":"768e4132b3644a79c074756bde34f67afaa1a6fcf8763155c984ab6513cd4f23"},"schema_version":"1.0","source":{"id":"1801.08310","kind":"arxiv","version":1}},"canonical_sha256":"e1f6f342b4e118caa81ae8bcc6a52c353eaf8bdd0e4b62270d7147b0815e9bec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1f6f342b4e118caa81ae8bcc6a52c353eaf8bdd0e4b62270d7147b0815e9bec","first_computed_at":"2026-05-18T00:25:06.569841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:06.569841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G1D3AEh+FayiBHCgvwyH8yaOMssBVqIewFdA/Dy3t2ZUdhG2qhGXm+s2iup8wSs/0JLKwD5vakUdJsMoFiDyCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:06.570214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08310","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:365e171ada5217c0d54ba6fdedf80f685ddae3a98c74e50d2d9e67a730e82bca","sha256:9534fdb1bc03d8b5a15adb36a487cb864a188f2be34e701ca7c6d562d86d8fd4"],"state_sha256":"9fc4f09a19b481f8b2532485f116aa2fd8afc782de2ea69b2595a8449f35331c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYgLCS0w0dg3NtrkmTKDaCc/r1zxCfobhs7yih3vP6fV3ebF2TxZ/MuQsUjM2ByniUg9iTkpcblsn5CRWa8dCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:04:32.742394Z","bundle_sha256":"7e98126172ad58f8b9af93e0e0d5aeb4064fd10f771485e954b0eaa6f8dfba9d"}}