{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7YAHQJE6CSKJZOVGOPHM4UTVOL","short_pith_number":"pith:7YAHQJE6","schema_version":"1.0","canonical_sha256":"fe0078249e14949cbaa673cece527572dfa523d97fdfcf025db382945e2e68c5","source":{"kind":"arxiv","id":"2010.15690","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2010.15690","created_at":"2026-07-05T03:22:33.066877+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.15690v3","created_at":"2026-07-05T03:22:33.066877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.15690","created_at":"2026-07-05T03:22:33.066877+00:00"},{"alias_kind":"pith_short_12","alias_value":"7YAHQJE6CSKJ","created_at":"2026-07-05T03:22:33.066877+00:00"},{"alias_kind":"pith_short_16","alias_value":"7YAHQJE6CSKJZOVG","created_at":"2026-07-05T03:22:33.066877+00:00"},{"alias_kind":"pith_short_8","alias_value":"7YAHQJE6","created_at":"2026-07-05T03:22:33.066877+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL","json":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL.json","graph_json":"https://pith.science/api/pith-number/7YAHQJE6CSKJZOVGOPHM4UTVOL/graph.json","events_json":"https://pith.science/api/pith-number/7YAHQJE6CSKJZOVGOPHM4UTVOL/events.json","paper":"https://pith.science/paper/7YAHQJE6"},"agent_actions":{"view_html":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL","download_json":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL.json","view_paper":"https://pith.science/paper/7YAHQJE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.15690&json=true","fetch_graph":"https://pith.science/api/pith-number/7YAHQJE6CSKJZOVGOPHM4UTVOL/graph.json","fetch_events":"https://pith.science/api/pith-number/7YAHQJE6CSKJZOVGOPHM4UTVOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL/action/storage_attestation","attest_author":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL/action/author_attestation","sign_citation":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL/action/citation_signature","submit_replication":"https://pith.science/pith/7YAHQJE6CSKJZOVGOPHM4UTVOL/action/replication_record"}},"created_at":"2026-07-05T03:22:33.066877+00:00","updated_at":"2026-07-05T03:22:33.066877+00:00"}