{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JRI4H7LAZCZCCW7T5TV2U3KL6D","short_pith_number":"pith:JRI4H7LA","canonical_record":{"source":{"id":"1905.03438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-09T04:20:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f4d8a2e312516a92c12a877f9737276ba2af67137d6d8340fd4ad60a85c1a410","abstract_canon_sha256":"008da5329be9a189f3a9fb6ee706fefb9615f2b23cf7d3506580395808779c3d"},"schema_version":"1.0"},"canonical_sha256":"4c51c3fd60c8b2215bf3ecebaa6d4bf0f3a4e66fe041ffc24640545b5c0d59d9","source":{"kind":"arxiv","id":"1905.03438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03438","created_at":"2026-05-17T23:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03438v1","created_at":"2026-05-17T23:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03438","created_at":"2026-05-17T23:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"JRI4H7LAZCZC","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JRI4H7LAZCZCCW7T","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JRI4H7LA","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JRI4H7LAZCZCCW7T5TV2U3KL6D","target":"record","payload":{"canonical_record":{"source":{"id":"1905.03438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-09T04:20:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f4d8a2e312516a92c12a877f9737276ba2af67137d6d8340fd4ad60a85c1a410","abstract_canon_sha256":"008da5329be9a189f3a9fb6ee706fefb9615f2b23cf7d3506580395808779c3d"},"schema_version":"1.0"},"canonical_sha256":"4c51c3fd60c8b2215bf3ecebaa6d4bf0f3a4e66fe041ffc24640545b5c0d59d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:39.916642Z","signature_b64":"uedh0zNniP2iBqFXuZwzuzkx6qWGaGdRsAIwpAU36AfXn1se8SEQ8Zz0tkTCkjMlPs1BPaupX1SKu9dL8CbmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c51c3fd60c8b2215bf3ecebaa6d4bf0f3a4e66fe041ffc24640545b5c0d59d9","last_reissued_at":"2026-05-17T23:46:39.915946Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:39.915946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.03438","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:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQvBEknk9y3tfa9wfGvU48hC8+LxSgbrsHI7kX1fxJfqor3UF9nYv+YpHt4zs1BnOJBCpMtdg2+1sQDZ4CXlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:28:48.006967Z"},"content_sha256":"d144908cf5ac60ea92d884b59ab2170ea6f4e38497e0bfc5a2aee91d5c1eb510","schema_version":"1.0","event_id":"sha256:d144908cf5ac60ea92d884b59ab2170ea6f4e38497e0bfc5a2aee91d5c1eb510"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JRI4H7LAZCZCCW7T5TV2U3KL6D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-stage Best-scored Random Forest for Large-scale Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hanyuan Hang, Johan A.K. Suykens, Yingyi Chen","submitted_at":"2019-05-09T04:20:48Z","abstract_excerpt":"We propose a novel method designed for large-scale regression problems, namely the two-stage best-scored random forest (TBRF). \"Best-scored\" means to select one regression tree with the best empirical performance out of a certain number of purely random regression tree candidates, and \"two-stage\" means to divide the original random tree splitting procedure into two: In stage one, the feature space is partitioned into non-overlapping cells; in stage two, child trees grow separately on these cells. The strengths of this algorithm can be summarized as follows: First of all, the pure randomness in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03438","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:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X45XrwouugTfkH7mdThpJuupvLQNQau11yL0rv2ezL4r2xy25V6Af1imBjKfp0neJdCMFsFOCktHcyz+OAP9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:28:48.007332Z"},"content_sha256":"7a4c6bf45198b28da2f1b4e771afccd06bab47c42f2c12678aa41ea01ac81f13","schema_version":"1.0","event_id":"sha256:7a4c6bf45198b28da2f1b4e771afccd06bab47c42f2c12678aa41ea01ac81f13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JRI4H7LAZCZCCW7T5TV2U3KL6D/bundle.json","state_url":"https://pith.science/pith/JRI4H7LAZCZCCW7T5TV2U3KL6D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JRI4H7LAZCZCCW7T5TV2U3KL6D/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-05-28T09:28:48Z","links":{"resolver":"https://pith.science/pith/JRI4H7LAZCZCCW7T5TV2U3KL6D","bundle":"https://pith.science/pith/JRI4H7LAZCZCCW7T5TV2U3KL6D/bundle.json","state":"https://pith.science/pith/JRI4H7LAZCZCCW7T5TV2U3KL6D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JRI4H7LAZCZCCW7T5TV2U3KL6D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JRI4H7LAZCZCCW7T5TV2U3KL6D","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":"008da5329be9a189f3a9fb6ee706fefb9615f2b23cf7d3506580395808779c3d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-09T04:20:48Z","title_canon_sha256":"f4d8a2e312516a92c12a877f9737276ba2af67137d6d8340fd4ad60a85c1a410"},"schema_version":"1.0","source":{"id":"1905.03438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03438","created_at":"2026-05-17T23:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03438v1","created_at":"2026-05-17T23:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03438","created_at":"2026-05-17T23:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"JRI4H7LAZCZC","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JRI4H7LAZCZCCW7T","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JRI4H7LA","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:7a4c6bf45198b28da2f1b4e771afccd06bab47c42f2c12678aa41ea01ac81f13","target":"graph","created_at":"2026-05-17T23:46:39Z","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":"We propose a novel method designed for large-scale regression problems, namely the two-stage best-scored random forest (TBRF). \"Best-scored\" means to select one regression tree with the best empirical performance out of a certain number of purely random regression tree candidates, and \"two-stage\" means to divide the original random tree splitting procedure into two: In stage one, the feature space is partitioned into non-overlapping cells; in stage two, child trees grow separately on these cells. The strengths of this algorithm can be summarized as follows: First of all, the pure randomness in","authors_text":"Hanyuan Hang, Johan A.K. Suykens, Yingyi Chen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-09T04:20:48Z","title":"Two-stage Best-scored Random Forest for Large-scale Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03438","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:d144908cf5ac60ea92d884b59ab2170ea6f4e38497e0bfc5a2aee91d5c1eb510","target":"record","created_at":"2026-05-17T23:46:39Z","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":"008da5329be9a189f3a9fb6ee706fefb9615f2b23cf7d3506580395808779c3d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-09T04:20:48Z","title_canon_sha256":"f4d8a2e312516a92c12a877f9737276ba2af67137d6d8340fd4ad60a85c1a410"},"schema_version":"1.0","source":{"id":"1905.03438","kind":"arxiv","version":1}},"canonical_sha256":"4c51c3fd60c8b2215bf3ecebaa6d4bf0f3a4e66fe041ffc24640545b5c0d59d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c51c3fd60c8b2215bf3ecebaa6d4bf0f3a4e66fe041ffc24640545b5c0d59d9","first_computed_at":"2026-05-17T23:46:39.915946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:39.915946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uedh0zNniP2iBqFXuZwzuzkx6qWGaGdRsAIwpAU36AfXn1se8SEQ8Zz0tkTCkjMlPs1BPaupX1SKu9dL8CbmBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:39.916642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d144908cf5ac60ea92d884b59ab2170ea6f4e38497e0bfc5a2aee91d5c1eb510","sha256:7a4c6bf45198b28da2f1b4e771afccd06bab47c42f2c12678aa41ea01ac81f13"],"state_sha256":"8b46ee4002d3df9dfa196cedb1047ae9d5105d409dfb1ec8800e22c337b2187f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9J4oLfQgZ4/9gSD0tShy8GEwyCuMmXG6uhNFKXvXjQjnRRrLrZPXOxDzXXc31t17zE7+wPApoXwXapGJwYFrBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:28:48.009359Z","bundle_sha256":"10f2384df8507050f88941bbdfd0fb82433845da737eb36d48eb74459834ed7f"}}