{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:7YAHQJE6CSKJZOVGOPHM4UTVOL","short_pith_number":"pith:7YAHQJE6","canonical_record":{"source":{"id":"2010.15690","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-29T15:32:03Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"3282ebf9c5626dd1d1da8c74746806c2a8ac611895c0d978e3f5735090f3e7d5","abstract_canon_sha256":"a9e618469730e3d59ecf1901923db08a608cf14cc53c51bbe3e9990bc0f599af"},"schema_version":"1.0"},"canonical_sha256":"fe0078249e14949cbaa673cece527572dfa523d97fdfcf025db382945e2e68c5","source":{"kind":"arxiv","id":"2010.15690","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.15690","created_at":"2026-07-05T03:22:33Z"},{"alias_kind":"arxiv_version","alias_value":"2010.15690v3","created_at":"2026-07-05T03:22:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.15690","created_at":"2026-07-05T03:22:33Z"},{"alias_kind":"pith_short_12","alias_value":"7YAHQJE6CSKJ","created_at":"2026-07-05T03:22:33Z"},{"alias_kind":"pith_short_16","alias_value":"7YAHQJE6CSKJZOVG","created_at":"2026-07-05T03:22:33Z"},{"alias_kind":"pith_short_8","alias_value":"7YAHQJE6","created_at":"2026-07-05T03:22:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:7YAHQJE6CSKJZOVGOPHM4UTVOL","target":"record","payload":{"canonical_record":{"source":{"id":"2010.15690","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-29T15:32:03Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"3282ebf9c5626dd1d1da8c74746806c2a8ac611895c0d978e3f5735090f3e7d5","abstract_canon_sha256":"a9e618469730e3d59ecf1901923db08a608cf14cc53c51bbe3e9990bc0f599af"},"schema_version":"1.0"},"canonical_sha256":"fe0078249e14949cbaa673cece527572dfa523d97fdfcf025db382945e2e68c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:22:33.067216Z","signature_b64":"n4CKf0/rXAYT+WGKTxU3StRiiCY7NzLvOA7Ckf9na1U9QPJ1PL2Slo6JBLBA6qVWaOemsno396Q29/Ut7w53BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe0078249e14949cbaa673cece527572dfa523d97fdfcf025db382945e2e68c5","last_reissued_at":"2026-07-05T03:22:33.066821Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:22:33.066821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.15690","source_version":3,"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-05T03:22:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UtMoGnf5Szvhz3p1Bpy5Is6HEUVkRrO05Xw+gx7SkFtAQTDi2kHfV/afmpqT6rltcShu0PyBoKEzrNlEkhMrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:26:43.481367Z"},"content_sha256":"1d5547e1ced7c36e5088dda160b95eea5d77dfb04ecb3678ec6130e79861d3df","schema_version":"1.0","event_id":"sha256:1d5547e1ced7c36e5088dda160b95eea5d77dfb04ecb3678ec6130e79861d3df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:7YAHQJE6CSKJZOVGOPHM4UTVOL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analyzing the tree-layer structure of Deep Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Claire Boyer (LPSM (UMR\\_8001)), Erwan Scornet (CMAP), Ludovic Arnould (LPSM (UMR\\_8001)), Sorbonne Lpsm","submitted_at":"2020-10-29T15:32:03Z","abstract_excerpt":"Random forests on the one hand, and neural networks on the other hand, have met great success in the machine learning community for their predictive performance. Combinations of both have been proposed in the literature, notably leading to the so-called deep forests (DF) (Zhou \\& Feng,2019). In this paper, our aim is not to benchmark DF performances but to investigate instead their underlying mechanisms. Additionally, DF architecture can be generally simplified into more simple and computationally efficient shallow forest networks. Despite some instability, the latter may outperform standard p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.15690","kind":"arxiv","version":3},"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/2010.15690/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-05T03:22:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/iNKo8fI5aeVzzxkctfrVuCFNU+Oz5ds4/PbJa09elg4LUqXREMgf8D5DNzFIKu1Ti6l/ttsclpJ6OFt84kDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:26:43.481746Z"},"content_sha256":"de9021c6f6f9464c3b8c83b80034c91012ebf691ad6a60ef9dbc10f079a0195d","schema_version":"1.0","event_id":"sha256:de9021c6f6f9464c3b8c83b80034c91012ebf691ad6a60ef9dbc10f079a0195d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL/bundle.json","state_url":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL/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-06T13:26:43Z","links":{"resolver":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL","bundle":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL/bundle.json","state":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:7YAHQJE6CSKJZOVGOPHM4UTVOL","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":"a9e618469730e3d59ecf1901923db08a608cf14cc53c51bbe3e9990bc0f599af","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-29T15:32:03Z","title_canon_sha256":"3282ebf9c5626dd1d1da8c74746806c2a8ac611895c0d978e3f5735090f3e7d5"},"schema_version":"1.0","source":{"id":"2010.15690","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.15690","created_at":"2026-07-05T03:22:33Z"},{"alias_kind":"arxiv_version","alias_value":"2010.15690v3","created_at":"2026-07-05T03:22:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.15690","created_at":"2026-07-05T03:22:33Z"},{"alias_kind":"pith_short_12","alias_value":"7YAHQJE6CSKJ","created_at":"2026-07-05T03:22:33Z"},{"alias_kind":"pith_short_16","alias_value":"7YAHQJE6CSKJZOVG","created_at":"2026-07-05T03:22:33Z"},{"alias_kind":"pith_short_8","alias_value":"7YAHQJE6","created_at":"2026-07-05T03:22:33Z"}],"graph_snapshots":[{"event_id":"sha256:de9021c6f6f9464c3b8c83b80034c91012ebf691ad6a60ef9dbc10f079a0195d","target":"graph","created_at":"2026-07-05T03:22: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/2010.15690/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Random forests on the one hand, and neural networks on the other hand, have met great success in the machine learning community for their predictive performance. Combinations of both have been proposed in the literature, notably leading to the so-called deep forests (DF) (Zhou \\& Feng,2019). In this paper, our aim is not to benchmark DF performances but to investigate instead their underlying mechanisms. Additionally, DF architecture can be generally simplified into more simple and computationally efficient shallow forest networks. Despite some instability, the latter may outperform standard p","authors_text":"Claire Boyer (LPSM (UMR\\_8001)), Erwan Scornet (CMAP), Ludovic Arnould (LPSM (UMR\\_8001)), Sorbonne Lpsm","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-29T15:32:03Z","title":"Analyzing the tree-layer structure of Deep Forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.15690","kind":"arxiv","version":3},"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:1d5547e1ced7c36e5088dda160b95eea5d77dfb04ecb3678ec6130e79861d3df","target":"record","created_at":"2026-07-05T03:22: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":"a9e618469730e3d59ecf1901923db08a608cf14cc53c51bbe3e9990bc0f599af","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-29T15:32:03Z","title_canon_sha256":"3282ebf9c5626dd1d1da8c74746806c2a8ac611895c0d978e3f5735090f3e7d5"},"schema_version":"1.0","source":{"id":"2010.15690","kind":"arxiv","version":3}},"canonical_sha256":"fe0078249e14949cbaa673cece527572dfa523d97fdfcf025db382945e2e68c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe0078249e14949cbaa673cece527572dfa523d97fdfcf025db382945e2e68c5","first_computed_at":"2026-07-05T03:22:33.066821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:22:33.066821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n4CKf0/rXAYT+WGKTxU3StRiiCY7NzLvOA7Ckf9na1U9QPJ1PL2Slo6JBLBA6qVWaOemsno396Q29/Ut7w53BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:22:33.067216Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.15690","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d5547e1ced7c36e5088dda160b95eea5d77dfb04ecb3678ec6130e79861d3df","sha256:de9021c6f6f9464c3b8c83b80034c91012ebf691ad6a60ef9dbc10f079a0195d"],"state_sha256":"f683982fdf1018e9528f6b6b6451156577059ec82fe3bb217c36335cb6a2d9f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GeHSmbnzeZxgLgsNyBJqZuc3qySrnUDS4yVX0JQzuoPAhQD5EhsLPgbfpuVHimB+KRWjC3hvNR5R3oyIQHJNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T13:26:43.483821Z","bundle_sha256":"2e8c4187a622b2c0c68c5699700db6f74618660bd77e44ecea6d122154d6d747"}}