{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CBMXYV54S5GG7ZEEI26S2GXSPJ","short_pith_number":"pith:CBMXYV54","schema_version":"1.0","canonical_sha256":"10597c57bc974c6fe48446bd2d1af27a7a7cc1ca4ea1c20200e66a77f3f8679f","source":{"kind":"arxiv","id":"1608.07710","version":3},"attestation_state":"computed","paper":{"title":"Random Forest for Label Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Guoping Qiu, Yangming Zhou","submitted_at":"2016-08-27T13:32:42Z","abstract_excerpt":"Label ranking aims to learn a mapping from instances to rankings over a finite number of predefined labels. Random forest is a powerful and one of the most successful general-purpose machine learning algorithms of modern times. In this paper, we present a powerful random forest label ranking method which uses random decision trees to retrieve nearest neighbors. We have developed a novel two-step rank aggregation strategy to effectively aggregate neighboring rankings discovered by the random forest into a final predicted ranking. Compared with existing methods, the new random forest method has "},"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":"1608.07710","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-27T13:32:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b54dca1be378874dd5f4cff0bfe91decfed2c7f46427da4a79c4f97c8f962e8d","abstract_canon_sha256":"475b03afacf348ac127efb7d88821eddbcf235911b428aae7a067351e9e5682a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:07.988372Z","signature_b64":"yG4Yt3SC9FafS0MF7tnbU2EMg2gZn7Wp7WYDZX+2+rfWhbdefeqPL5q2ojncp5cA47tUXTE8RpHR+ysqpdG0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10597c57bc974c6fe48446bd2d1af27a7a7cc1ca4ea1c20200e66a77f3f8679f","last_reissued_at":"2026-05-18T00:13:07.987635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:07.987635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Forest for Label Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Guoping Qiu, Yangming Zhou","submitted_at":"2016-08-27T13:32:42Z","abstract_excerpt":"Label ranking aims to learn a mapping from instances to rankings over a finite number of predefined labels. Random forest is a powerful and one of the most successful general-purpose machine learning algorithms of modern times. In this paper, we present a powerful random forest label ranking method which uses random decision trees to retrieve nearest neighbors. We have developed a novel two-step rank aggregation strategy to effectively aggregate neighboring rankings discovered by the random forest into a final predicted ranking. Compared with existing methods, the new random forest method has "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07710","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.07710","created_at":"2026-05-18T00:13:07.987742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07710v3","created_at":"2026-05-18T00:13:07.987742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07710","created_at":"2026-05-18T00:13:07.987742+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBMXYV54S5GG","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBMXYV54S5GG7ZEE","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBMXYV54","created_at":"2026-05-18T12:30:09.641336+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/CBMXYV54S5GG7ZEEI26S2GXSPJ","json":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ.json","graph_json":"https://pith.science/api/pith-number/CBMXYV54S5GG7ZEEI26S2GXSPJ/graph.json","events_json":"https://pith.science/api/pith-number/CBMXYV54S5GG7ZEEI26S2GXSPJ/events.json","paper":"https://pith.science/paper/CBMXYV54"},"agent_actions":{"view_html":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ","download_json":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ.json","view_paper":"https://pith.science/paper/CBMXYV54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07710&json=true","fetch_graph":"https://pith.science/api/pith-number/CBMXYV54S5GG7ZEEI26S2GXSPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CBMXYV54S5GG7ZEEI26S2GXSPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ/action/storage_attestation","attest_author":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ/action/author_attestation","sign_citation":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ/action/citation_signature","submit_replication":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ/action/replication_record"}},"created_at":"2026-05-18T00:13:07.987742+00:00","updated_at":"2026-05-18T00:13:07.987742+00:00"}