{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LGDXFBBZNKOWOH4OJDSH5UYZ3A","short_pith_number":"pith:LGDXFBBZ","canonical_record":{"source":{"id":"2309.09030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-16T15:54:25Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c4f0ef6cbf5e2bbb03832746cef84b76965791d434500700295d93a3f24e5f8a","abstract_canon_sha256":"b6c7ac5939a3ffff0cde5779d16cb2abe1b09c58cd18b3028c5cf7360894d56b"},"schema_version":"1.0"},"canonical_sha256":"59877284396a9d671f8e48e47ed319d83ddf1abf36fa33249d53289eb730ab7d","source":{"kind":"arxiv","id":"2309.09030","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.09030","created_at":"2026-07-05T06:51:33Z"},{"alias_kind":"arxiv_version","alias_value":"2309.09030v1","created_at":"2026-07-05T06:51:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.09030","created_at":"2026-07-05T06:51:33Z"},{"alias_kind":"pith_short_12","alias_value":"LGDXFBBZNKOW","created_at":"2026-07-05T06:51:33Z"},{"alias_kind":"pith_short_16","alias_value":"LGDXFBBZNKOWOH4O","created_at":"2026-07-05T06:51:33Z"},{"alias_kind":"pith_short_8","alias_value":"LGDXFBBZ","created_at":"2026-07-05T06:51:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LGDXFBBZNKOWOH4OJDSH5UYZ3A","target":"record","payload":{"canonical_record":{"source":{"id":"2309.09030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-16T15:54:25Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c4f0ef6cbf5e2bbb03832746cef84b76965791d434500700295d93a3f24e5f8a","abstract_canon_sha256":"b6c7ac5939a3ffff0cde5779d16cb2abe1b09c58cd18b3028c5cf7360894d56b"},"schema_version":"1.0"},"canonical_sha256":"59877284396a9d671f8e48e47ed319d83ddf1abf36fa33249d53289eb730ab7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:51:33.232249Z","signature_b64":"wa9MTFC/i0LrxEKQQfEQQG+hZEYwab8FEapzZCs/Wz+hJfYbjCeH+i/M5D/14R2dPXGTQbj0MLEjgn2OxHanBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59877284396a9d671f8e48e47ed319d83ddf1abf36fa33249d53289eb730ab7d","last_reissued_at":"2026-07-05T06:51:33.231864Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:51:33.231864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.09030","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-05T06:51:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VwbkTcIQmSLv0HmToZaWL+2N2HdA1RKoOxm/4twDuhdVHZRvcFL05sOey5+p5hbtp+RKeQ6gwl7jT/GXqRtIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T18:42:10.690119Z"},"content_sha256":"73c9b660db79b548288f4a73f572c5037c8a36f09bd869744653fb4649bf043f","schema_version":"1.0","event_id":"sha256:73c9b660db79b548288f4a73f572c5037c8a36f09bd869744653fb4649bf043f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LGDXFBBZNKOWOH4OJDSH5UYZ3A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improve Deep Forest with Learnable Layerwise Augmentation Policy Schedule","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fang-Qi Li, Guang Cheng, Hongyu Zhu, Shi-Lin Wang, Sichu Liang, Wentao Hu, Yali Yuan","submitted_at":"2023-09-16T15:54:25Z","abstract_excerpt":"As a modern ensemble technique, Deep Forest (DF) employs a cascading structure to construct deep models, providing stronger representational power compared to traditional decision forests. However, its greedy multi-layer learning procedure is prone to overfitting, limiting model effectiveness and generalizability. This paper presents an optimized Deep Forest, featuring learnable, layerwise data augmentation policy schedules. Specifically, We introduce the Cut Mix for Tabular data (CMT) augmentation technique to mitigate overfitting and develop a population-based search algorithm to tailor augm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.09030","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/2309.09030/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-05T06:51:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TyhRHXm1IFyqhSWV/tQiuEa/Xce+NhR2TYCWRBQbfbwDavFSFzySMjGAtXjqxzqW/enxQH0pDQYg7tkbcIiICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T18:42:10.690436Z"},"content_sha256":"6bdc87a68223083771e940181227edc6889fb470c61bea98b718b68c6ce4300b","schema_version":"1.0","event_id":"sha256:6bdc87a68223083771e940181227edc6889fb470c61bea98b718b68c6ce4300b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LGDXFBBZNKOWOH4OJDSH5UYZ3A/bundle.json","state_url":"https://pith.science/pith/LGDXFBBZNKOWOH4OJDSH5UYZ3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LGDXFBBZNKOWOH4OJDSH5UYZ3A/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-14T18:42:10Z","links":{"resolver":"https://pith.science/pith/LGDXFBBZNKOWOH4OJDSH5UYZ3A","bundle":"https://pith.science/pith/LGDXFBBZNKOWOH4OJDSH5UYZ3A/bundle.json","state":"https://pith.science/pith/LGDXFBBZNKOWOH4OJDSH5UYZ3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LGDXFBBZNKOWOH4OJDSH5UYZ3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LGDXFBBZNKOWOH4OJDSH5UYZ3A","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":"b6c7ac5939a3ffff0cde5779d16cb2abe1b09c58cd18b3028c5cf7360894d56b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-16T15:54:25Z","title_canon_sha256":"c4f0ef6cbf5e2bbb03832746cef84b76965791d434500700295d93a3f24e5f8a"},"schema_version":"1.0","source":{"id":"2309.09030","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.09030","created_at":"2026-07-05T06:51:33Z"},{"alias_kind":"arxiv_version","alias_value":"2309.09030v1","created_at":"2026-07-05T06:51:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.09030","created_at":"2026-07-05T06:51:33Z"},{"alias_kind":"pith_short_12","alias_value":"LGDXFBBZNKOW","created_at":"2026-07-05T06:51:33Z"},{"alias_kind":"pith_short_16","alias_value":"LGDXFBBZNKOWOH4O","created_at":"2026-07-05T06:51:33Z"},{"alias_kind":"pith_short_8","alias_value":"LGDXFBBZ","created_at":"2026-07-05T06:51:33Z"}],"graph_snapshots":[{"event_id":"sha256:6bdc87a68223083771e940181227edc6889fb470c61bea98b718b68c6ce4300b","target":"graph","created_at":"2026-07-05T06:51:33Z","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/2309.09030/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As a modern ensemble technique, Deep Forest (DF) employs a cascading structure to construct deep models, providing stronger representational power compared to traditional decision forests. However, its greedy multi-layer learning procedure is prone to overfitting, limiting model effectiveness and generalizability. This paper presents an optimized Deep Forest, featuring learnable, layerwise data augmentation policy schedules. Specifically, We introduce the Cut Mix for Tabular data (CMT) augmentation technique to mitigate overfitting and develop a population-based search algorithm to tailor augm","authors_text":"Fang-Qi Li, Guang Cheng, Hongyu Zhu, Shi-Lin Wang, Sichu Liang, Wentao Hu, Yali Yuan","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-16T15:54:25Z","title":"Improve Deep Forest with Learnable Layerwise Augmentation Policy Schedule"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.09030","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:73c9b660db79b548288f4a73f572c5037c8a36f09bd869744653fb4649bf043f","target":"record","created_at":"2026-07-05T06:51:33Z","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":"b6c7ac5939a3ffff0cde5779d16cb2abe1b09c58cd18b3028c5cf7360894d56b","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-16T15:54:25Z","title_canon_sha256":"c4f0ef6cbf5e2bbb03832746cef84b76965791d434500700295d93a3f24e5f8a"},"schema_version":"1.0","source":{"id":"2309.09030","kind":"arxiv","version":1}},"canonical_sha256":"59877284396a9d671f8e48e47ed319d83ddf1abf36fa33249d53289eb730ab7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59877284396a9d671f8e48e47ed319d83ddf1abf36fa33249d53289eb730ab7d","first_computed_at":"2026-07-05T06:51:33.231864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:51:33.231864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wa9MTFC/i0LrxEKQQfEQQG+hZEYwab8FEapzZCs/Wz+hJfYbjCeH+i/M5D/14R2dPXGTQbj0MLEjgn2OxHanBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:51:33.232249Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.09030","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73c9b660db79b548288f4a73f572c5037c8a36f09bd869744653fb4649bf043f","sha256:6bdc87a68223083771e940181227edc6889fb470c61bea98b718b68c6ce4300b"],"state_sha256":"ea7be30bf51ec671348733c48ce166a5dc6d5b48e5d1357d8bbcda676ccfe270"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gAGOsd+ceBNYE1Zvdlva9kZdFT4tlfX54aunL8QHJu10fwOLFcoKJ47yUVGjLScGpBkZAHBcRy/Y3MeMpoQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T18:42:10.694853Z","bundle_sha256":"5b056e461bbac5a0f62b1586f7d07e3a2d10c84600fc60b4fd92be808aa48df4"}}