{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DMJAVLJEPJ62CN46ZNMABD5KLD","short_pith_number":"pith:DMJAVLJE","schema_version":"1.0","canonical_sha256":"1b120aad247a7da1379ecb58008faa58c50037ce0206166ece99faee159896d3","source":{"kind":"arxiv","id":"1806.06616","version":1},"attestation_state":"computed","paper":{"title":"Comparison-Based Random Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Damien Garreau, Siavash Haghiri, Ulrike von Luxburg","submitted_at":"2018-06-18T12:06:33Z","abstract_excerpt":"Assume we are given a set of items from a general metric space, but we neither have access to the representation of the data nor to the distances between data points. Instead, suppose that we can actively choose a triplet of items (A,B,C) and ask an oracle whether item A is closer to item B or to item C. In this paper, we propose a novel random forest algorithm for regression and classification that relies only on such triplet comparisons. In the theory part of this paper, we establish sufficient conditions for the consistency of such a forest. In a set of comprehensive experiments, we then de"},"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":"1806.06616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-18T12:06:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"665a98bcdcaf31030a67b9c959fe646498e2f61945c2115184953499ff20fdc3","abstract_canon_sha256":"8b74129099bebf6c1dd43cd21e1c6d682d6999e9be9d53282c71b9154dc7b2bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:01.832833Z","signature_b64":"zyZGtIyVU1PP2Z73A80GhK+6gAqLeNAjkLL7/KEJtCcwioJUsswmOLDglp4qT/aQmdXe1HbHIw/NyWJgkVQYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b120aad247a7da1379ecb58008faa58c50037ce0206166ece99faee159896d3","last_reissued_at":"2026-05-18T00:13:01.832222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:01.832222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparison-Based Random Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Damien Garreau, Siavash Haghiri, Ulrike von Luxburg","submitted_at":"2018-06-18T12:06:33Z","abstract_excerpt":"Assume we are given a set of items from a general metric space, but we neither have access to the representation of the data nor to the distances between data points. Instead, suppose that we can actively choose a triplet of items (A,B,C) and ask an oracle whether item A is closer to item B or to item C. In this paper, we propose a novel random forest algorithm for regression and classification that relies only on such triplet comparisons. In the theory part of this paper, we establish sufficient conditions for the consistency of such a forest. In a set of comprehensive experiments, we then de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06616","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":"1806.06616","created_at":"2026-05-18T00:13:01.832302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.06616v1","created_at":"2026-05-18T00:13:01.832302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06616","created_at":"2026-05-18T00:13:01.832302+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMJAVLJEPJ62","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMJAVLJEPJ62CN46","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMJAVLJE","created_at":"2026-05-18T12:32:19.392346+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/DMJAVLJEPJ62CN46ZNMABD5KLD","json":"https://pith.science/pith/DMJAVLJEPJ62CN46ZNMABD5KLD.json","graph_json":"https://pith.science/api/pith-number/DMJAVLJEPJ62CN46ZNMABD5KLD/graph.json","events_json":"https://pith.science/api/pith-number/DMJAVLJEPJ62CN46ZNMABD5KLD/events.json","paper":"https://pith.science/paper/DMJAVLJE"},"agent_actions":{"view_html":"https://pith.science/pith/DMJAVLJEPJ62CN46ZNMABD5KLD","download_json":"https://pith.science/pith/DMJAVLJEPJ62CN46ZNMABD5KLD.json","view_paper":"https://pith.science/paper/DMJAVLJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.06616&json=true","fetch_graph":"https://pith.science/api/pith-number/DMJAVLJEPJ62CN46ZNMABD5KLD/graph.json","fetch_events":"https://pith.science/api/pith-number/DMJAVLJEPJ62CN46ZNMABD5KLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMJAVLJEPJ62CN46ZNMABD5KLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMJAVLJEPJ62CN46ZNMABD5KLD/action/storage_attestation","attest_author":"https://pith.science/pith/DMJAVLJEPJ62CN46ZNMABD5KLD/action/author_attestation","sign_citation":"https://pith.science/pith/DMJAVLJEPJ62CN46ZNMABD5KLD/action/citation_signature","submit_replication":"https://pith.science/pith/DMJAVLJEPJ62CN46ZNMABD5KLD/action/replication_record"}},"created_at":"2026-05-18T00:13:01.832302+00:00","updated_at":"2026-05-18T00:13:01.832302+00:00"}