{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CBMXYV54S5GG7ZEEI26S2GXSPJ","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":"475b03afacf348ac127efb7d88821eddbcf235911b428aae7a067351e9e5682a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-27T13:32:42Z","title_canon_sha256":"b54dca1be378874dd5f4cff0bfe91decfed2c7f46427da4a79c4f97c8f962e8d"},"schema_version":"1.0","source":{"id":"1608.07710","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07710","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07710v3","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07710","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"pith_short_12","alias_value":"CBMXYV54S5GG","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CBMXYV54S5GG7ZEE","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CBMXYV54","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:452f572c7c007e41af36f3314936a40c8490be308833c552d10c5af97e07480f","target":"graph","created_at":"2026-05-18T00:13:07Z","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":"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 ","authors_text":"Guoping Qiu, Yangming Zhou","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-27T13:32:42Z","title":"Random Forest for Label Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07710","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:6951204f119be35dbd6d1dd70a39c2274d4131f98dbdc68ca8f2c963bdadc70e","target":"record","created_at":"2026-05-18T00:13:07Z","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":"475b03afacf348ac127efb7d88821eddbcf235911b428aae7a067351e9e5682a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-27T13:32:42Z","title_canon_sha256":"b54dca1be378874dd5f4cff0bfe91decfed2c7f46427da4a79c4f97c8f962e8d"},"schema_version":"1.0","source":{"id":"1608.07710","kind":"arxiv","version":3}},"canonical_sha256":"10597c57bc974c6fe48446bd2d1af27a7a7cc1ca4ea1c20200e66a77f3f8679f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10597c57bc974c6fe48446bd2d1af27a7a7cc1ca4ea1c20200e66a77f3f8679f","first_computed_at":"2026-05-18T00:13:07.987635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:07.987635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yG4Yt3SC9FafS0MF7tnbU2EMg2gZn7Wp7WYDZX+2+rfWhbdefeqPL5q2ojncp5cA47tUXTE8RpHR+ysqpdG0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:07.988372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07710","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6951204f119be35dbd6d1dd70a39c2274d4131f98dbdc68ca8f2c963bdadc70e","sha256:452f572c7c007e41af36f3314936a40c8490be308833c552d10c5af97e07480f"],"state_sha256":"0f9da958312a0bf15fc3eb97c13dc4cf56829445b2b23821783068184add840a"}