{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:A4AJKS2YAWCQFWPLDYVUNP5YN4","short_pith_number":"pith:A4AJKS2Y","canonical_record":{"source":{"id":"2508.05957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-08T02:43:45Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"797f0fdbffb19bb17d11cde3fd13473eb0520ddec3b479c278bfba37e6b1d94b","abstract_canon_sha256":"0a1b711607fe7f7f4b9a1da6a51588bd238056a1a72ba67ef2eb9729c1b5a56e"},"schema_version":"1.0"},"canonical_sha256":"0700954b58058502d9eb1e2b46bfb86f207e695d0427be872663dee56085e908","source":{"kind":"arxiv","id":"2508.05957","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.05957","created_at":"2026-07-05T11:50:46Z"},{"alias_kind":"arxiv_version","alias_value":"2508.05957v1","created_at":"2026-07-05T11:50:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05957","created_at":"2026-07-05T11:50:46Z"},{"alias_kind":"pith_short_12","alias_value":"A4AJKS2YAWCQ","created_at":"2026-07-05T11:50:46Z"},{"alias_kind":"pith_short_16","alias_value":"A4AJKS2YAWCQFWPL","created_at":"2026-07-05T11:50:46Z"},{"alias_kind":"pith_short_8","alias_value":"A4AJKS2Y","created_at":"2026-07-05T11:50:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:A4AJKS2YAWCQFWPLDYVUNP5YN4","target":"record","payload":{"canonical_record":{"source":{"id":"2508.05957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-08T02:43:45Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"797f0fdbffb19bb17d11cde3fd13473eb0520ddec3b479c278bfba37e6b1d94b","abstract_canon_sha256":"0a1b711607fe7f7f4b9a1da6a51588bd238056a1a72ba67ef2eb9729c1b5a56e"},"schema_version":"1.0"},"canonical_sha256":"0700954b58058502d9eb1e2b46bfb86f207e695d0427be872663dee56085e908","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:46.389575Z","signature_b64":"S9FKtyTb6sZHKlAckvV9jFKXxZa8cmXw90oO2U0BZhYGTuAUKO2Lm/6Hibpze2jHplO1Fxx0q9TgfV6qDfWGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0700954b58058502d9eb1e2b46bfb86f207e695d0427be872663dee56085e908","last_reissued_at":"2026-07-05T11:50:46.388959Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:46.388959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.05957","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-07-05T11:50:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxFBJ+3HpOU4u1DpOEvnhzynJ2Ye3W/2wk20JstRa3cmk/T0+ML/E1bk7bxVAAZ3vwZdZWaEChE5N8Acm5eoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T19:35:37.575740Z"},"content_sha256":"17777aa0b445d1d456206d26e108d3bc88be30fce4687519ba3a1319033fad6c","schema_version":"1.0","event_id":"sha256:17777aa0b445d1d456206d26e108d3bc88be30fce4687519ba3a1319033fad6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:A4AJKS2YAWCQFWPLDYVUNP5YN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Armed Bandits-Based Optimization of Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hasibul Karim Shanto, Shadikur Rahman, Umme Ayman Koana","submitted_at":"2025-08-08T02:43:45Z","abstract_excerpt":"Decision trees, without appropriate constraints, can easily become overly complex and prone to overfit, capturing noise rather than generalizable patterns. To resolve this problem,pruning operation is a crucial part in optimizing decision trees, as it not only reduces the complexity of trees but also decreases the probability of generating overfit models. The conventional pruning techniques like Cost-Complexity Pruning (CCP) and Reduced Error Pruning (REP) are mostly based on greedy approaches that focus on immediate gains in performance while pruning nodes of the decision tree. However, this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05957","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.05957/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-05T11:50:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VhwUitZvC6Lepa1w2VnDg/O9fbXqM5qHPqp4BnCljwrfhei5WzEN42lLrUoFk7IP+v84ILMOHu+ao6iSsZ19DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T19:35:37.576544Z"},"content_sha256":"1ed964595c90fa1b8dca8e55eefbb083e6dd25c832b096a7a0d79f0417510e07","schema_version":"1.0","event_id":"sha256:1ed964595c90fa1b8dca8e55eefbb083e6dd25c832b096a7a0d79f0417510e07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4AJKS2YAWCQFWPLDYVUNP5YN4/bundle.json","state_url":"https://pith.science/pith/A4AJKS2YAWCQFWPLDYVUNP5YN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4AJKS2YAWCQFWPLDYVUNP5YN4/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-08-07T19:35:37Z","links":{"resolver":"https://pith.science/pith/A4AJKS2YAWCQFWPLDYVUNP5YN4","bundle":"https://pith.science/pith/A4AJKS2YAWCQFWPLDYVUNP5YN4/bundle.json","state":"https://pith.science/pith/A4AJKS2YAWCQFWPLDYVUNP5YN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4AJKS2YAWCQFWPLDYVUNP5YN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:A4AJKS2YAWCQFWPLDYVUNP5YN4","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":"0a1b711607fe7f7f4b9a1da6a51588bd238056a1a72ba67ef2eb9729c1b5a56e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-08T02:43:45Z","title_canon_sha256":"797f0fdbffb19bb17d11cde3fd13473eb0520ddec3b479c278bfba37e6b1d94b"},"schema_version":"1.0","source":{"id":"2508.05957","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.05957","created_at":"2026-07-05T11:50:46Z"},{"alias_kind":"arxiv_version","alias_value":"2508.05957v1","created_at":"2026-07-05T11:50:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05957","created_at":"2026-07-05T11:50:46Z"},{"alias_kind":"pith_short_12","alias_value":"A4AJKS2YAWCQ","created_at":"2026-07-05T11:50:46Z"},{"alias_kind":"pith_short_16","alias_value":"A4AJKS2YAWCQFWPL","created_at":"2026-07-05T11:50:46Z"},{"alias_kind":"pith_short_8","alias_value":"A4AJKS2Y","created_at":"2026-07-05T11:50:46Z"}],"graph_snapshots":[{"event_id":"sha256:1ed964595c90fa1b8dca8e55eefbb083e6dd25c832b096a7a0d79f0417510e07","target":"graph","created_at":"2026-07-05T11:50:46Z","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/2508.05957/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decision trees, without appropriate constraints, can easily become overly complex and prone to overfit, capturing noise rather than generalizable patterns. To resolve this problem,pruning operation is a crucial part in optimizing decision trees, as it not only reduces the complexity of trees but also decreases the probability of generating overfit models. The conventional pruning techniques like Cost-Complexity Pruning (CCP) and Reduced Error Pruning (REP) are mostly based on greedy approaches that focus on immediate gains in performance while pruning nodes of the decision tree. However, this ","authors_text":"Hasibul Karim Shanto, Shadikur Rahman, Umme Ayman Koana","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-08T02:43:45Z","title":"Multi-Armed Bandits-Based Optimization of Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05957","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:17777aa0b445d1d456206d26e108d3bc88be30fce4687519ba3a1319033fad6c","target":"record","created_at":"2026-07-05T11:50:46Z","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":"0a1b711607fe7f7f4b9a1da6a51588bd238056a1a72ba67ef2eb9729c1b5a56e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-08T02:43:45Z","title_canon_sha256":"797f0fdbffb19bb17d11cde3fd13473eb0520ddec3b479c278bfba37e6b1d94b"},"schema_version":"1.0","source":{"id":"2508.05957","kind":"arxiv","version":1}},"canonical_sha256":"0700954b58058502d9eb1e2b46bfb86f207e695d0427be872663dee56085e908","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0700954b58058502d9eb1e2b46bfb86f207e695d0427be872663dee56085e908","first_computed_at":"2026-07-05T11:50:46.388959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:50:46.388959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S9FKtyTb6sZHKlAckvV9jFKXxZa8cmXw90oO2U0BZhYGTuAUKO2Lm/6Hibpze2jHplO1Fxx0q9TgfV6qDfWGAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:50:46.389575Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.05957","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17777aa0b445d1d456206d26e108d3bc88be30fce4687519ba3a1319033fad6c","sha256:1ed964595c90fa1b8dca8e55eefbb083e6dd25c832b096a7a0d79f0417510e07"],"state_sha256":"cf0f3d9867638411d3a728ead262bdf15bc4bf46f00a41d23d22632a00232366"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ZzrJkvqjIF5+hzGJLRgRupNZ8kA9DlT8+O0cqBDoyqJJw401z9OScws8Y9MevMd4fpFPelPFI+T7teik4onAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T19:35:37.599121Z","bundle_sha256":"75424effbad1a223f8ad88a0121005059116cb151b3d2870d4bfa017dacf37c6"}}