{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:GGULEWZQQYENGW7L2LVBXLPGVP","short_pith_number":"pith:GGULEWZQ","canonical_record":{"source":{"id":"2407.05108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-06T15:32:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"79b1c45f373e4840a2c3980f4d68c5c61c7307ff9526ba5c47ec52065063c447","abstract_canon_sha256":"f4275494396807c87d0cc0611246ef367338f1ba7ba78129d121351adda2a68f"},"schema_version":"1.0"},"canonical_sha256":"31a8b25b308608d35bebd2ea1bade6abd1f8f0606cffeb560ca65c31de5beaaa","source":{"kind":"arxiv","id":"2407.05108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.05108","created_at":"2026-07-05T10:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"2407.05108v1","created_at":"2026-07-05T10:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05108","created_at":"2026-07-05T10:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"GGULEWZQQYEN","created_at":"2026-07-05T10:08:19Z"},{"alias_kind":"pith_short_16","alias_value":"GGULEWZQQYENGW7L","created_at":"2026-07-05T10:08:19Z"},{"alias_kind":"pith_short_8","alias_value":"GGULEWZQ","created_at":"2026-07-05T10:08:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:GGULEWZQQYENGW7L2LVBXLPGVP","target":"record","payload":{"canonical_record":{"source":{"id":"2407.05108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-06T15:32:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"79b1c45f373e4840a2c3980f4d68c5c61c7307ff9526ba5c47ec52065063c447","abstract_canon_sha256":"f4275494396807c87d0cc0611246ef367338f1ba7ba78129d121351adda2a68f"},"schema_version":"1.0"},"canonical_sha256":"31a8b25b308608d35bebd2ea1bade6abd1f8f0606cffeb560ca65c31de5beaaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:19.157640Z","signature_b64":"BV4tPe85X/+KPHSZ+JxQmPGjdUyeDYEcTm+0uDJkKaUd2zVvZuqpVkOiKNPLgOYjdDDqvcY6EY4GTYll2AoqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31a8b25b308608d35bebd2ea1bade6abd1f8f0606cffeb560ca65c31de5beaaa","last_reissued_at":"2026-07-05T10:08:19.157279Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:19.157279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.05108","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-05T10:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dx55m7troh7d8KBtOqmCRqU9Jyf0qS4sd+DUzyKy6V8x+K3TkmB8/sbLtlWpOVjBV98V9wDnd3P6O+fjYEBhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:26:57.528331Z"},"content_sha256":"304ae6578fa2bdc546ac9003475c2f85bfeaa3139157c9134f5f55c78f4675d8","schema_version":"1.0","event_id":"sha256:304ae6578fa2bdc546ac9003475c2f85bfeaa3139157c9134f5f55c78f4675d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:GGULEWZQQYENGW7L2LVBXLPGVP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Role of Depth, Width, and Tree Size in Expressiveness of Deep Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Baoliu Ye, Jin-Hui Wu, Qin-Cheng Zheng, Shen-Huan Lyu","submitted_at":"2024-07-06T15:32:54Z","abstract_excerpt":"Random forests are classical ensemble algorithms that construct multiple randomized decision trees and aggregate their predictions using naive averaging. \\citet{zhou2019deep} further propose a deep forest algorithm with multi-layer forests, which outperforms random forests in various tasks. The performance of deep forests is related to three hyperparameters in practice: depth, width, and tree size, but little has been known about its theoretical explanation. This work provides the first upper and lower bounds on the approximation complexity of deep forests concerning the three hyperparameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05108","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/2407.05108/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-05T10:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRhjUOPOtYzVZMpPEQUs2qnnyHaMhST/8zdiurNrnjw0JEjLYFzuerLHXeIeKdchYvrJLGDjC3jTpm2T4ugqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:26:57.528885Z"},"content_sha256":"faab1122c179d98cef69a52a66aa7844b8ee9dfafbd3c49419d8d4a510919fb1","schema_version":"1.0","event_id":"sha256:faab1122c179d98cef69a52a66aa7844b8ee9dfafbd3c49419d8d4a510919fb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGULEWZQQYENGW7L2LVBXLPGVP/bundle.json","state_url":"https://pith.science/pith/GGULEWZQQYENGW7L2LVBXLPGVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGULEWZQQYENGW7L2LVBXLPGVP/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-03T19:26:57Z","links":{"resolver":"https://pith.science/pith/GGULEWZQQYENGW7L2LVBXLPGVP","bundle":"https://pith.science/pith/GGULEWZQQYENGW7L2LVBXLPGVP/bundle.json","state":"https://pith.science/pith/GGULEWZQQYENGW7L2LVBXLPGVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGULEWZQQYENGW7L2LVBXLPGVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GGULEWZQQYENGW7L2LVBXLPGVP","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":"f4275494396807c87d0cc0611246ef367338f1ba7ba78129d121351adda2a68f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-06T15:32:54Z","title_canon_sha256":"79b1c45f373e4840a2c3980f4d68c5c61c7307ff9526ba5c47ec52065063c447"},"schema_version":"1.0","source":{"id":"2407.05108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.05108","created_at":"2026-07-05T10:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"2407.05108v1","created_at":"2026-07-05T10:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05108","created_at":"2026-07-05T10:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"GGULEWZQQYEN","created_at":"2026-07-05T10:08:19Z"},{"alias_kind":"pith_short_16","alias_value":"GGULEWZQQYENGW7L","created_at":"2026-07-05T10:08:19Z"},{"alias_kind":"pith_short_8","alias_value":"GGULEWZQ","created_at":"2026-07-05T10:08:19Z"}],"graph_snapshots":[{"event_id":"sha256:faab1122c179d98cef69a52a66aa7844b8ee9dfafbd3c49419d8d4a510919fb1","target":"graph","created_at":"2026-07-05T10:08:19Z","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/2407.05108/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Random forests are classical ensemble algorithms that construct multiple randomized decision trees and aggregate their predictions using naive averaging. \\citet{zhou2019deep} further propose a deep forest algorithm with multi-layer forests, which outperforms random forests in various tasks. The performance of deep forests is related to three hyperparameters in practice: depth, width, and tree size, but little has been known about its theoretical explanation. This work provides the first upper and lower bounds on the approximation complexity of deep forests concerning the three hyperparameters.","authors_text":"Baoliu Ye, Jin-Hui Wu, Qin-Cheng Zheng, Shen-Huan Lyu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-06T15:32:54Z","title":"The Role of Depth, Width, and Tree Size in Expressiveness of Deep Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05108","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:304ae6578fa2bdc546ac9003475c2f85bfeaa3139157c9134f5f55c78f4675d8","target":"record","created_at":"2026-07-05T10:08:19Z","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":"f4275494396807c87d0cc0611246ef367338f1ba7ba78129d121351adda2a68f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-06T15:32:54Z","title_canon_sha256":"79b1c45f373e4840a2c3980f4d68c5c61c7307ff9526ba5c47ec52065063c447"},"schema_version":"1.0","source":{"id":"2407.05108","kind":"arxiv","version":1}},"canonical_sha256":"31a8b25b308608d35bebd2ea1bade6abd1f8f0606cffeb560ca65c31de5beaaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31a8b25b308608d35bebd2ea1bade6abd1f8f0606cffeb560ca65c31de5beaaa","first_computed_at":"2026-07-05T10:08:19.157279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:19.157279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BV4tPe85X/+KPHSZ+JxQmPGjdUyeDYEcTm+0uDJkKaUd2zVvZuqpVkOiKNPLgOYjdDDqvcY6EY4GTYll2AoqAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:19.157640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.05108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:304ae6578fa2bdc546ac9003475c2f85bfeaa3139157c9134f5f55c78f4675d8","sha256:faab1122c179d98cef69a52a66aa7844b8ee9dfafbd3c49419d8d4a510919fb1"],"state_sha256":"4013cb567def7c7eeb3bf39e2fe5dc5f9890b47caf393e083fd6f1004089dc47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YiKdJfEF2DU2EV5wrXqNIU03NOwBjVlIbV5zUTw8NMzHBLNhG1bcDAhUZtbou6h5frDg/p1F3KACjvbb423vBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:26:57.533726Z","bundle_sha256":"3fcfbe52a3cdabc28893eb418cc331058210055ba264ed21f741efa8249f5dfe"}}