{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YVYA5DBT45PM2Q73KTKZS2PWDW","short_pith_number":"pith:YVYA5DBT","schema_version":"1.0","canonical_sha256":"c5700e8c33e75ecd43fb54d59969f61da8b01e541839563eb6744b8e32eecdf0","source":{"kind":"arxiv","id":"1506.03410","version":6},"attestation_state":"computed","paper":{"title":"Sparse Projection Oblique Randomer Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Benjamin Falk, Carey E. Priebe, Cencheng Shen, Jaewon Chung, James Browne, Jason Yim, Jesse L. Patsolic, Joshua T. Vogelstein, Mauro Maggioni, Randal Burns, Tyler M. Tomita","submitted_at":"2015-06-10T17:55:51Z","abstract_excerpt":"Decision forests, including Random Forests and Gradient Boosting Trees, have recently demonstrated state-of-the-art performance in a variety of machine learning settings. Decision forests are typically ensembles of axis-aligned decision trees; that is, trees that split only along feature dimensions. In contrast, many recent extensions to decision forests are based on axis-oblique splits. Unfortunately, these extensions forfeit one or more of the favorable properties of decision forests based on axis-aligned splits, such as robustness to many noise dimensions, interpretability, or computational"},"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":"1506.03410","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-10T17:55:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"aa2d0283c12720ff708a25497ad0a04225ecfb031b176f2e0ef6c8256abcc48c","abstract_canon_sha256":"9e305aeff2893b4c36834a5138ac009355d0b8c5b028dab36b99be677332b162"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:39.886559Z","signature_b64":"oSnzkg63Kh4Q5c1H7qBq11DsdwesfYocQGMhf+/naIQ4Mfu5Dx+EfppPj+YKgAVk5VezF/WNauy/V7E1GFdJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5700e8c33e75ecd43fb54d59969f61da8b01e541839563eb6744b8e32eecdf0","last_reissued_at":"2026-07-05T08:36:39.886042Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:39.886042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Projection Oblique Randomer Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Benjamin Falk, Carey E. Priebe, Cencheng Shen, Jaewon Chung, James Browne, Jason Yim, Jesse L. Patsolic, Joshua T. Vogelstein, Mauro Maggioni, Randal Burns, Tyler M. Tomita","submitted_at":"2015-06-10T17:55:51Z","abstract_excerpt":"Decision forests, including Random Forests and Gradient Boosting Trees, have recently demonstrated state-of-the-art performance in a variety of machine learning settings. Decision forests are typically ensembles of axis-aligned decision trees; that is, trees that split only along feature dimensions. In contrast, many recent extensions to decision forests are based on axis-oblique splits. Unfortunately, these extensions forfeit one or more of the favorable properties of decision forests based on axis-aligned splits, such as robustness to many noise dimensions, interpretability, or computational"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03410","kind":"arxiv","version":6},"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/1506.03410/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":"1506.03410","created_at":"2026-07-05T08:36:39.886106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03410v6","created_at":"2026-07-05T08:36:39.886106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03410","created_at":"2026-07-05T08:36:39.886106+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVYA5DBT45PM","created_at":"2026-07-05T08:36:39.886106+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVYA5DBT45PM2Q73","created_at":"2026-07-05T08:36:39.886106+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVYA5DBT","created_at":"2026-07-05T08:36:39.886106+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.02844","citing_title":"Geodesic Learning via Unsupervised Decision Forests","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YVYA5DBT45PM2Q73KTKZS2PWDW","json":"https://pith.science/pith/YVYA5DBT45PM2Q73KTKZS2PWDW.json","graph_json":"https://pith.science/api/pith-number/YVYA5DBT45PM2Q73KTKZS2PWDW/graph.json","events_json":"https://pith.science/api/pith-number/YVYA5DBT45PM2Q73KTKZS2PWDW/events.json","paper":"https://pith.science/paper/YVYA5DBT"},"agent_actions":{"view_html":"https://pith.science/pith/YVYA5DBT45PM2Q73KTKZS2PWDW","download_json":"https://pith.science/pith/YVYA5DBT45PM2Q73KTKZS2PWDW.json","view_paper":"https://pith.science/paper/YVYA5DBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03410&json=true","fetch_graph":"https://pith.science/api/pith-number/YVYA5DBT45PM2Q73KTKZS2PWDW/graph.json","fetch_events":"https://pith.science/api/pith-number/YVYA5DBT45PM2Q73KTKZS2PWDW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVYA5DBT45PM2Q73KTKZS2PWDW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVYA5DBT45PM2Q73KTKZS2PWDW/action/storage_attestation","attest_author":"https://pith.science/pith/YVYA5DBT45PM2Q73KTKZS2PWDW/action/author_attestation","sign_citation":"https://pith.science/pith/YVYA5DBT45PM2Q73KTKZS2PWDW/action/citation_signature","submit_replication":"https://pith.science/pith/YVYA5DBT45PM2Q73KTKZS2PWDW/action/replication_record"}},"created_at":"2026-07-05T08:36:39.886106+00:00","updated_at":"2026-07-05T08:36:39.886106+00:00"}