{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:POGDGRRBT5L6TKOE3AO3QMUVHG","short_pith_number":"pith:POGDGRRB","schema_version":"1.0","canonical_sha256":"7b8c3346219f57e9a9c4d81db83295398a5c29644a15ee283310d2bbc2b99613","source":{"kind":"arxiv","id":"2306.17031","version":1},"attestation_state":"computed","paper":{"title":"Medoid splits for efficient random forests in metric spaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Helle S{\\o}rensen, Matthieu Bult\\'e","submitted_at":"2023-06-29T15:32:11Z","abstract_excerpt":"This paper revisits an adaptation of the random forest algorithm for Fr\\'echet regression, addressing the challenge of regression in the context of random objects in metric spaces. Recognizing the limitations of previous approaches, we introduce a new splitting rule that circumvents the computationally expensive operation of Fr\\'echet means by substituting with a medoid-based approach. We validate this approach by demonstrating its asymptotic equivalence to Fr\\'echet mean-based procedures and establish the consistency of the associated regression estimator. The paper provides a sound theoretic"},"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":"2306.17031","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-06-29T15:32:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3fb09ac21557a3dbc70864edbfbdf71dfc1e951ecc784e026b4d475c34571974","abstract_canon_sha256":"5fbddebc1c3f80d34d87bd7c85603ffe974bab60db849e3e510b6001c2f84a5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:26:12.423839Z","signature_b64":"wRsg1ZgmlvDQMXAuhZ8K4ANZcx5/jjsp2MhQ3zHcgH397W6CweoDZ1jyPmpb+De4lGARlyGd+xFmV3iJ8RP3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b8c3346219f57e9a9c4d81db83295398a5c29644a15ee283310d2bbc2b99613","last_reissued_at":"2026-07-05T06:26:12.423351Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:26:12.423351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Medoid splits for efficient random forests in metric spaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Helle S{\\o}rensen, Matthieu Bult\\'e","submitted_at":"2023-06-29T15:32:11Z","abstract_excerpt":"This paper revisits an adaptation of the random forest algorithm for Fr\\'echet regression, addressing the challenge of regression in the context of random objects in metric spaces. Recognizing the limitations of previous approaches, we introduce a new splitting rule that circumvents the computationally expensive operation of Fr\\'echet means by substituting with a medoid-based approach. We validate this approach by demonstrating its asymptotic equivalence to Fr\\'echet mean-based procedures and establish the consistency of the associated regression estimator. The paper provides a sound theoretic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.17031","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.17031/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.17031","created_at":"2026-07-05T06:26:12.423419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.17031v1","created_at":"2026-07-05T06:26:12.423419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.17031","created_at":"2026-07-05T06:26:12.423419+00:00"},{"alias_kind":"pith_short_12","alias_value":"POGDGRRBT5L6","created_at":"2026-07-05T06:26:12.423419+00:00"},{"alias_kind":"pith_short_16","alias_value":"POGDGRRBT5L6TKOE","created_at":"2026-07-05T06:26:12.423419+00:00"},{"alias_kind":"pith_short_8","alias_value":"POGDGRRB","created_at":"2026-07-05T06:26:12.423419+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10748","citing_title":"Fr\\'echet Means of Periodic Orbits in Dynamical Systems: Geometry, Dynamics, and Diagnostics","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/POGDGRRBT5L6TKOE3AO3QMUVHG","json":"https://pith.science/pith/POGDGRRBT5L6TKOE3AO3QMUVHG.json","graph_json":"https://pith.science/api/pith-number/POGDGRRBT5L6TKOE3AO3QMUVHG/graph.json","events_json":"https://pith.science/api/pith-number/POGDGRRBT5L6TKOE3AO3QMUVHG/events.json","paper":"https://pith.science/paper/POGDGRRB"},"agent_actions":{"view_html":"https://pith.science/pith/POGDGRRBT5L6TKOE3AO3QMUVHG","download_json":"https://pith.science/pith/POGDGRRBT5L6TKOE3AO3QMUVHG.json","view_paper":"https://pith.science/paper/POGDGRRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.17031&json=true","fetch_graph":"https://pith.science/api/pith-number/POGDGRRBT5L6TKOE3AO3QMUVHG/graph.json","fetch_events":"https://pith.science/api/pith-number/POGDGRRBT5L6TKOE3AO3QMUVHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POGDGRRBT5L6TKOE3AO3QMUVHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POGDGRRBT5L6TKOE3AO3QMUVHG/action/storage_attestation","attest_author":"https://pith.science/pith/POGDGRRBT5L6TKOE3AO3QMUVHG/action/author_attestation","sign_citation":"https://pith.science/pith/POGDGRRBT5L6TKOE3AO3QMUVHG/action/citation_signature","submit_replication":"https://pith.science/pith/POGDGRRBT5L6TKOE3AO3QMUVHG/action/replication_record"}},"created_at":"2026-07-05T06:26:12.423419+00:00","updated_at":"2026-07-05T06:26:12.423419+00:00"}