{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CBMXYV54S5GG7ZEEI26S2GXSPJ","short_pith_number":"pith:CBMXYV54","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"},"canonical_sha256":"10597c57bc974c6fe48446bd2d1af27a7a7cc1ca4ea1c20200e66a77f3f8679f","source":{"kind":"arxiv","id":"1608.07710","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CBMXYV54S5GG7ZEEI26S2GXSPJ","target":"record","payload":{"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"},"canonical_sha256":"10597c57bc974c6fe48446bd2d1af27a7a7cc1ca4ea1c20200e66a77f3f8679f","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"},"source_kind":"arxiv","source_id":"1608.07710","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:13:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OFlypRNeMYJgnIMeqXbzlMbo8hWUYetUdq7nEg0MHGfulnDCHBwcLkh2umZqIFLpFB/oLnGgs8LyccbBIWluAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:59:49.685763Z"},"content_sha256":"6951204f119be35dbd6d1dd70a39c2274d4131f98dbdc68ca8f2c963bdadc70e","schema_version":"1.0","event_id":"sha256:6951204f119be35dbd6d1dd70a39c2274d4131f98dbdc68ca8f2c963bdadc70e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CBMXYV54S5GG7ZEEI26S2GXSPJ","target":"graph","payload":{"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"},"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:13:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRC3i4w+oIlij3cyWp4QbKaJAR5OhCXhFkIqnPSUbiBlv5NrNKKcerY7t8VsAG11sAklQFfGOMfqZvw0qrdTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:59:49.686500Z"},"content_sha256":"452f572c7c007e41af36f3314936a40c8490be308833c552d10c5af97e07480f","schema_version":"1.0","event_id":"sha256:452f572c7c007e41af36f3314936a40c8490be308833c552d10c5af97e07480f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ/bundle.json","state_url":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ/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-11T14:59:49Z","links":{"resolver":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ","bundle":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ/bundle.json","state":"https://pith.science/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBMXYV54S5GG7ZEEI26S2GXSPJ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g8Ax+ttbRjKcvsnnQmwdJBx59AyYmyg+jWopvK1aOdzEXQOG93JY89sDEWKnTrytgON8FplDTxp+cyaWGiIPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:59:49.690797Z","bundle_sha256":"6d8c37990cc4abd7897ef42053c49930627f0d2037045d459d4f0e682289857a"}}