{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ROAVQ4YJ7NBQ2JBP4EDPUUEBA2","short_pith_number":"pith:ROAVQ4YJ","canonical_record":{"source":{"id":"1611.01971","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-07T10:25:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fe4cdddb1e7774ae78cf5fae818b7fafcc00fbe56ba1e1ffb5e39e9de4ed1b90","abstract_canon_sha256":"122204e37cc90d53b048c87c40306e36fac42411d5846c5f3053b92b85bc2d87"},"schema_version":"1.0"},"canonical_sha256":"8b81587309fb430d242fe106fa50810698e033c00cac6f010feb3b3b185921e1","source":{"kind":"arxiv","id":"1611.01971","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01971","created_at":"2026-05-18T00:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01971v3","created_at":"2026-05-18T00:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01971","created_at":"2026-05-18T00:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"ROAVQ4YJ7NBQ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"ROAVQ4YJ7NBQ2JBP","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"ROAVQ4YJ","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ROAVQ4YJ7NBQ2JBP4EDPUUEBA2","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01971","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-07T10:25:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fe4cdddb1e7774ae78cf5fae818b7fafcc00fbe56ba1e1ffb5e39e9de4ed1b90","abstract_canon_sha256":"122204e37cc90d53b048c87c40306e36fac42411d5846c5f3053b92b85bc2d87"},"schema_version":"1.0"},"canonical_sha256":"8b81587309fb430d242fe106fa50810698e033c00cac6f010feb3b3b185921e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:37.084688Z","signature_b64":"tkpGYO4+sDkkGmBfERBwBS3Quon2sG/2z0glz5eBhoa/4BLn970ucjX+MvCF5IXJ2zZK6akxukjniLX25kQsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b81587309fb430d242fe106fa50810698e033c00cac6f010feb3b3b185921e1","last_reissued_at":"2026-05-18T00:57:37.084079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:37.084079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01971","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-05-18T00:57:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnaIvGfSjO9QhOoVV1y4tbO5bEYY/p6D3fuk2LpM6AwfLacBlKT6bTyAllSBI2GGup5jnFlMPVSgm4qXaRrMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:47:49.765271Z"},"content_sha256":"6e98273db83b6857c80fff767daaf86497f1308914833f0684267c896d1d1fd0","schema_version":"1.0","event_id":"sha256:6e98273db83b6857c80fff767daaf86497f1308914833f0684267c896d1d1fd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ROAVQ4YJ7NBQ2JBP4EDPUUEBA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One Class Splitting Criteria for Random Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ma\\\"el Chiapino (LTCI), Nicolas Drougard (ISAE), Nicolas Goix (LTCI), Romain Brault (LTCI)","submitted_at":"2016-11-07T10:25:15Z","abstract_excerpt":"Random Forests (RFs) are strong machine learning tools for classification and regression. However, they remain supervised algorithms, and no extension of RFs to the one-class setting has been proposed, except for techniques based on second-class sampling. This work fills this gap by proposing a natural methodology to extend standard splitting criteria to the one-class setting, structurally generalizing RFs to one-class classification. An extensive benchmark of seven state-of-the-art anomaly detection algorithms is also presented. This empirically demonstrates the relevance of our approach."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01971","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":""},"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-18T00:57:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45N6fxeS9jMBfYisPraou8kvMXFKvfRQC8A9Ct+6RJdzfyM7j/gykhvWGFT5MMJ0cWbKjlTje8WEicYzoO8EDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:47:49.765635Z"},"content_sha256":"eb88f6a33270c005c9c83853568005dc66fddda2262dbb1264c2982e52176b54","schema_version":"1.0","event_id":"sha256:eb88f6a33270c005c9c83853568005dc66fddda2262dbb1264c2982e52176b54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROAVQ4YJ7NBQ2JBP4EDPUUEBA2/bundle.json","state_url":"https://pith.science/pith/ROAVQ4YJ7NBQ2JBP4EDPUUEBA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROAVQ4YJ7NBQ2JBP4EDPUUEBA2/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-22T09:47:49Z","links":{"resolver":"https://pith.science/pith/ROAVQ4YJ7NBQ2JBP4EDPUUEBA2","bundle":"https://pith.science/pith/ROAVQ4YJ7NBQ2JBP4EDPUUEBA2/bundle.json","state":"https://pith.science/pith/ROAVQ4YJ7NBQ2JBP4EDPUUEBA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROAVQ4YJ7NBQ2JBP4EDPUUEBA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ROAVQ4YJ7NBQ2JBP4EDPUUEBA2","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":"122204e37cc90d53b048c87c40306e36fac42411d5846c5f3053b92b85bc2d87","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-07T10:25:15Z","title_canon_sha256":"fe4cdddb1e7774ae78cf5fae818b7fafcc00fbe56ba1e1ffb5e39e9de4ed1b90"},"schema_version":"1.0","source":{"id":"1611.01971","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01971","created_at":"2026-05-18T00:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01971v3","created_at":"2026-05-18T00:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01971","created_at":"2026-05-18T00:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"ROAVQ4YJ7NBQ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"ROAVQ4YJ7NBQ2JBP","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"ROAVQ4YJ","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:eb88f6a33270c005c9c83853568005dc66fddda2262dbb1264c2982e52176b54","target":"graph","created_at":"2026-05-18T00:57:37Z","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":"Random Forests (RFs) are strong machine learning tools for classification and regression. However, they remain supervised algorithms, and no extension of RFs to the one-class setting has been proposed, except for techniques based on second-class sampling. This work fills this gap by proposing a natural methodology to extend standard splitting criteria to the one-class setting, structurally generalizing RFs to one-class classification. An extensive benchmark of seven state-of-the-art anomaly detection algorithms is also presented. This empirically demonstrates the relevance of our approach.","authors_text":"Ma\\\"el Chiapino (LTCI), Nicolas Drougard (ISAE), Nicolas Goix (LTCI), Romain Brault (LTCI)","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-07T10:25:15Z","title":"One Class Splitting Criteria for Random Forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01971","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:6e98273db83b6857c80fff767daaf86497f1308914833f0684267c896d1d1fd0","target":"record","created_at":"2026-05-18T00:57:37Z","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":"122204e37cc90d53b048c87c40306e36fac42411d5846c5f3053b92b85bc2d87","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-07T10:25:15Z","title_canon_sha256":"fe4cdddb1e7774ae78cf5fae818b7fafcc00fbe56ba1e1ffb5e39e9de4ed1b90"},"schema_version":"1.0","source":{"id":"1611.01971","kind":"arxiv","version":3}},"canonical_sha256":"8b81587309fb430d242fe106fa50810698e033c00cac6f010feb3b3b185921e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b81587309fb430d242fe106fa50810698e033c00cac6f010feb3b3b185921e1","first_computed_at":"2026-05-18T00:57:37.084079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:37.084079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tkpGYO4+sDkkGmBfERBwBS3Quon2sG/2z0glz5eBhoa/4BLn970ucjX+MvCF5IXJ2zZK6akxukjniLX25kQsBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:37.084688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01971","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e98273db83b6857c80fff767daaf86497f1308914833f0684267c896d1d1fd0","sha256:eb88f6a33270c005c9c83853568005dc66fddda2262dbb1264c2982e52176b54"],"state_sha256":"59e62a16dacdc7b42171db777523c43004c17b3d02d6e06be442beccabda785f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z6sAy3Ul7ZbnVShIJ7L0ZunqZ+gXTyopvsKrEgKZ7GMF7JnkGgCIA1tyBxNWlO0dg2x5Uxq6Kg/jGsCJQBneAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:47:49.767724Z","bundle_sha256":"85b491d25dc6bdbb3fd6a420be728aa1101c118884bd392df612e05a71b128c2"}}