{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ECQWZFAQCLXWONVRPP2AICG42M","short_pith_number":"pith:ECQWZFAQ","canonical_record":{"source":{"id":"1704.08067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-26T11:45:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8ee53930fcaecbe738b60187555f39a146d88c25db213c797340fc5066b96e49","abstract_canon_sha256":"8b53127fdf22f3ae563f72c19180c3a9e045329a3df2d1cab35c72851700b6ae"},"schema_version":"1.0"},"canonical_sha256":"20a16c941012ef6736b17bf40408dcd31a7489a52dc71d736ef63ad8fc88991d","source":{"kind":"arxiv","id":"1704.08067","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08067","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08067v1","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08067","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"ECQWZFAQCLXW","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ECQWZFAQCLXWONVR","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ECQWZFAQ","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ECQWZFAQCLXWONVRPP2AICG42M","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-26T11:45:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8ee53930fcaecbe738b60187555f39a146d88c25db213c797340fc5066b96e49","abstract_canon_sha256":"8b53127fdf22f3ae563f72c19180c3a9e045329a3df2d1cab35c72851700b6ae"},"schema_version":"1.0"},"canonical_sha256":"20a16c941012ef6736b17bf40408dcd31a7489a52dc71d736ef63ad8fc88991d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:56.966029Z","signature_b64":"DqP41m9ERoTpISn6JloBg/VICjnFLRW+0AyxTmhNJ9f3/EgEQMfYzD6nq8NNm+lQCPfJOqL8DrRhBpX5Wd39Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20a16c941012ef6736b17bf40408dcd31a7489a52dc71d736ef63ad8fc88991d","last_reissued_at":"2026-05-17T23:45:56.965562Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:56.965562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08067","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-05-17T23:45:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eu424WOpmWJFpPkhij3+vSCZwI5LTaC+qftLlHCUAFJYmWAs/ACdCcgxebsL1M9X9S02YD34bh67J1V4UHVRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T19:32:08.968456Z"},"content_sha256":"cc91f7d5f5f43d0599e040b6ad1f85efaf30cbdc52231cfdecd1b3e24000d93a","schema_version":"1.0","event_id":"sha256:cc91f7d5f5f43d0599e040b6ad1f85efaf30cbdc52231cfdecd1b3e24000d93a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ECQWZFAQCLXWONVRPP2AICG42M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting random projections and sparsity with random forests and gradient boosting methods -- Application to multi-label and multi-output learning, random forest model compression and leveraging input sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Arnaud Joly","submitted_at":"2017-04-26T11:45:04Z","abstract_excerpt":"Within machine learning, the supervised learning field aims at modeling the input-output relationship of a system, from past observations of its behavior. Decision trees characterize the input-output relationship through a series of nested $if-then-else$ questions, the testing nodes, leading to a set of predictions, the leaf nodes. Several of such trees are often combined together for state-of-the-art performance: random forest ensembles average the predictions of randomized decision trees trained independently in parallel, while tree boosting ensembles train decision trees sequentially to ref"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08067","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":""},"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-05-17T23:45:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/yb6kgZkM1vi+wl1d2Pnw5vHMPtpCRdXGo2sx2J4vvGHHUaFifXLOnWiQSHPhRwcstiLJ624QMvkyvBIlfxhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T19:32:08.968801Z"},"content_sha256":"9eca10ee365bdae9bbe90b9678ba49ca4f9ef8951ffa486a248d5d31be494192","schema_version":"1.0","event_id":"sha256:9eca10ee365bdae9bbe90b9678ba49ca4f9ef8951ffa486a248d5d31be494192"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECQWZFAQCLXWONVRPP2AICG42M/bundle.json","state_url":"https://pith.science/pith/ECQWZFAQCLXWONVRPP2AICG42M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECQWZFAQCLXWONVRPP2AICG42M/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-06-26T19:32:08Z","links":{"resolver":"https://pith.science/pith/ECQWZFAQCLXWONVRPP2AICG42M","bundle":"https://pith.science/pith/ECQWZFAQCLXWONVRPP2AICG42M/bundle.json","state":"https://pith.science/pith/ECQWZFAQCLXWONVRPP2AICG42M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECQWZFAQCLXWONVRPP2AICG42M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ECQWZFAQCLXWONVRPP2AICG42M","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":"8b53127fdf22f3ae563f72c19180c3a9e045329a3df2d1cab35c72851700b6ae","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-26T11:45:04Z","title_canon_sha256":"8ee53930fcaecbe738b60187555f39a146d88c25db213c797340fc5066b96e49"},"schema_version":"1.0","source":{"id":"1704.08067","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08067","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08067v1","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08067","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"ECQWZFAQCLXW","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"ECQWZFAQCLXWONVR","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"ECQWZFAQ","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:9eca10ee365bdae9bbe90b9678ba49ca4f9ef8951ffa486a248d5d31be494192","target":"graph","created_at":"2026-05-17T23:45:56Z","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"},"paper":{"abstract_excerpt":"Within machine learning, the supervised learning field aims at modeling the input-output relationship of a system, from past observations of its behavior. Decision trees characterize the input-output relationship through a series of nested $if-then-else$ questions, the testing nodes, leading to a set of predictions, the leaf nodes. Several of such trees are often combined together for state-of-the-art performance: random forest ensembles average the predictions of randomized decision trees trained independently in parallel, while tree boosting ensembles train decision trees sequentially to ref","authors_text":"Arnaud Joly","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-26T11:45:04Z","title":"Exploiting random projections and sparsity with random forests and gradient boosting methods -- Application to multi-label and multi-output learning, random forest model compression and leveraging input sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08067","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:cc91f7d5f5f43d0599e040b6ad1f85efaf30cbdc52231cfdecd1b3e24000d93a","target":"record","created_at":"2026-05-17T23:45:56Z","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":"8b53127fdf22f3ae563f72c19180c3a9e045329a3df2d1cab35c72851700b6ae","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-26T11:45:04Z","title_canon_sha256":"8ee53930fcaecbe738b60187555f39a146d88c25db213c797340fc5066b96e49"},"schema_version":"1.0","source":{"id":"1704.08067","kind":"arxiv","version":1}},"canonical_sha256":"20a16c941012ef6736b17bf40408dcd31a7489a52dc71d736ef63ad8fc88991d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20a16c941012ef6736b17bf40408dcd31a7489a52dc71d736ef63ad8fc88991d","first_computed_at":"2026-05-17T23:45:56.965562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:56.965562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DqP41m9ERoTpISn6JloBg/VICjnFLRW+0AyxTmhNJ9f3/EgEQMfYzD6nq8NNm+lQCPfJOqL8DrRhBpX5Wd39Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:56.966029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08067","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc91f7d5f5f43d0599e040b6ad1f85efaf30cbdc52231cfdecd1b3e24000d93a","sha256:9eca10ee365bdae9bbe90b9678ba49ca4f9ef8951ffa486a248d5d31be494192"],"state_sha256":"8c1a5063bcb3383b07d01f48b17c46f0dc28c3970b8e252ad90f4c3c3fcf320a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hcgUZnDu/xgab9V022x4S9MXx510NEWiO/+9Ksk18aUHn3laEZBJu26ICXBSkIpYvYUHxxiSxDqRWx7QqbNSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T19:32:08.970669Z","bundle_sha256":"af888a3a6507d9394824768391f787ad1f8eb68afebb099fd4872719dd8721d4"}}