{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XCDBOFXGZCHT6RIGZ76DOVQWBN","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":"2f7e27da4f09fbb6d01bcd6bbeb3910ef4a072e7970c4b5ec96948434e1114d5","cross_cats_sorted":["stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-03-25T17:29:24Z","title_canon_sha256":"bf1dcbe80ffde6522b0025d9b13c81f25c4bb6b3d13a64b93baf27a03a31233d"},"schema_version":"1.0","source":{"id":"1303.6223","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6223","created_at":"2026-05-18T01:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6223v1","created_at":"2026-05-18T01:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6223","created_at":"2026-05-18T01:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"XCDBOFXGZCHT","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XCDBOFXGZCHT6RIG","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XCDBOFXG","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:e177940e20ededfb3f963cb68879479d2e45acc7e3be54748bb3019e6d0c2e1a","target":"graph","created_at":"2026-05-18T01:16:21Z","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":"Finding interactions between variables in large and high-dimensional datasets is often a serious computational challenge. Most approaches build up interaction sets incrementally, adding variables in a greedy fashion. The drawback is that potentially informative high-order interactions may be overlooked. Here, we propose at an alternative approach for classification problems with binary predictor variables, called Random Intersection Trees. It works by starting with a maximal interaction that includes all variables, and then gradually removing variables if they fail to appear in randomly chosen","authors_text":"Nicolai Meinshausen, Rajen Dinesh Shah","cross_cats":["stat.CO","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-03-25T17:29:24Z","title":"Random Intersection Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6223","kind":"arxiv","version":1},"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:8594f1870ee2bc00e111f5c93cc43fcf97255c6dc1e8c243c9d20aadeba5b8b8","target":"record","created_at":"2026-05-18T01:16:21Z","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":"2f7e27da4f09fbb6d01bcd6bbeb3910ef4a072e7970c4b5ec96948434e1114d5","cross_cats_sorted":["stat.CO","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-03-25T17:29:24Z","title_canon_sha256":"bf1dcbe80ffde6522b0025d9b13c81f25c4bb6b3d13a64b93baf27a03a31233d"},"schema_version":"1.0","source":{"id":"1303.6223","kind":"arxiv","version":1}},"canonical_sha256":"b8861716e6c88f3f4506cffc3756160b7bb1bdfed8552c0bc3e20f764c3f74ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8861716e6c88f3f4506cffc3756160b7bb1bdfed8552c0bc3e20f764c3f74ff","first_computed_at":"2026-05-18T01:16:21.961338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:21.961338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FE49gJnUQmAMTeQ2Lub76DhAR4IxvuU6OnWXm0aIfMbFvMjerI/mUj0OWFL1A4m/p1nWiyJqykT7A4Ovp38sCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:21.961852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6223","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8594f1870ee2bc00e111f5c93cc43fcf97255c6dc1e8c243c9d20aadeba5b8b8","sha256:e177940e20ededfb3f963cb68879479d2e45acc7e3be54748bb3019e6d0c2e1a"],"state_sha256":"2b5886b9bc2d37e47111f4efb59ec52be3e8ceef0db0082a6ae772ee7024d352"}