{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CVJFRXDBGUPGC3DRKKDI2ASS6G","short_pith_number":"pith:CVJFRXDB","schema_version":"1.0","canonical_sha256":"155258dc61351e616c7152868d0252f1852b5b3041d7c24cf7b77865f3009bdf","source":{"kind":"arxiv","id":"1905.03729","version":1},"attestation_state":"computed","paper":{"title":"Best-scored Random Forest Density Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hanyuan Hang, Hongwei Wen","submitted_at":"2019-05-09T16:11:55Z","abstract_excerpt":"This paper presents a brand new nonparametric density estimation strategy named the best-scored random forest density estimation whose effectiveness is supported by both solid theoretical analysis and significant experimental performance. The terminology best-scored stands for selecting one density tree with the best estimation performance out of a certain number of purely random density tree candidates and we then name the selected one the best-scored random density tree. In this manner, the ensemble of these selected trees that is the best-scored random density forest can achieve even better"},"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":"1905.03729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-09T16:11:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5ad9d799ef5b3d6e713d27ef662928d244b2c21b500520bbf85bd0954ff83a44","abstract_canon_sha256":"cb49de44d2d60fabdd6459e94e63534380373f60b6950ddf4789efb849b0c146"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:36.833166Z","signature_b64":"IzBZ1v6kNN3PXOXKXybi5p3JWLqiwqRYQUCtafrAZZO2OZpncKug/78h9C8Ysyb8WyAVxOd2qdeQHUvtFdRIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"155258dc61351e616c7152868d0252f1852b5b3041d7c24cf7b77865f3009bdf","last_reissued_at":"2026-05-17T23:46:36.832575Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:36.832575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best-scored Random Forest Density Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hanyuan Hang, Hongwei Wen","submitted_at":"2019-05-09T16:11:55Z","abstract_excerpt":"This paper presents a brand new nonparametric density estimation strategy named the best-scored random forest density estimation whose effectiveness is supported by both solid theoretical analysis and significant experimental performance. The terminology best-scored stands for selecting one density tree with the best estimation performance out of a certain number of purely random density tree candidates and we then name the selected one the best-scored random density tree. In this manner, the ensemble of these selected trees that is the best-scored random density forest can achieve even better"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03729","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.03729","created_at":"2026-05-17T23:46:36.832641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03729v1","created_at":"2026-05-17T23:46:36.832641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03729","created_at":"2026-05-17T23:46:36.832641+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVJFRXDBGUPG","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVJFRXDBGUPGC3DR","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVJFRXDB","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10094","citing_title":"Density-based Clustering with Best-scored Random Forest","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CVJFRXDBGUPGC3DRKKDI2ASS6G","json":"https://pith.science/pith/CVJFRXDBGUPGC3DRKKDI2ASS6G.json","graph_json":"https://pith.science/api/pith-number/CVJFRXDBGUPGC3DRKKDI2ASS6G/graph.json","events_json":"https://pith.science/api/pith-number/CVJFRXDBGUPGC3DRKKDI2ASS6G/events.json","paper":"https://pith.science/paper/CVJFRXDB"},"agent_actions":{"view_html":"https://pith.science/pith/CVJFRXDBGUPGC3DRKKDI2ASS6G","download_json":"https://pith.science/pith/CVJFRXDBGUPGC3DRKKDI2ASS6G.json","view_paper":"https://pith.science/paper/CVJFRXDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03729&json=true","fetch_graph":"https://pith.science/api/pith-number/CVJFRXDBGUPGC3DRKKDI2ASS6G/graph.json","fetch_events":"https://pith.science/api/pith-number/CVJFRXDBGUPGC3DRKKDI2ASS6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVJFRXDBGUPGC3DRKKDI2ASS6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVJFRXDBGUPGC3DRKKDI2ASS6G/action/storage_attestation","attest_author":"https://pith.science/pith/CVJFRXDBGUPGC3DRKKDI2ASS6G/action/author_attestation","sign_citation":"https://pith.science/pith/CVJFRXDBGUPGC3DRKKDI2ASS6G/action/citation_signature","submit_replication":"https://pith.science/pith/CVJFRXDBGUPGC3DRKKDI2ASS6G/action/replication_record"}},"created_at":"2026-05-17T23:46:36.832641+00:00","updated_at":"2026-05-17T23:46:36.832641+00:00"}