{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DUOPV6NT6EWG6RTPLE6AR3KHSF","short_pith_number":"pith:DUOPV6NT","canonical_record":{"source":{"id":"2607.01417","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T19:23:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"feda7aa78a69791dd8cc5f5f94131d7fb91240d41045976363cea51fbdcf2bea","abstract_canon_sha256":"eb91c5720cd555e918b7fdede9cc7d48ab2d9c4326bbf5292c933faedf0d2704"},"schema_version":"1.0"},"canonical_sha256":"1d1cfaf9b3f12c6f466f593c08ed479168496aff783ab6b4714acb19692ae91c","source":{"kind":"arxiv","id":"2607.01417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01417","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01417v1","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01417","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"DUOPV6NT6EWG","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"pith_short_16","alias_value":"DUOPV6NT6EWG6RTP","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"pith_short_8","alias_value":"DUOPV6NT","created_at":"2026-07-03T00:16:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DUOPV6NT6EWG6RTPLE6AR3KHSF","target":"record","payload":{"canonical_record":{"source":{"id":"2607.01417","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T19:23:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"feda7aa78a69791dd8cc5f5f94131d7fb91240d41045976363cea51fbdcf2bea","abstract_canon_sha256":"eb91c5720cd555e918b7fdede9cc7d48ab2d9c4326bbf5292c933faedf0d2704"},"schema_version":"1.0"},"canonical_sha256":"1d1cfaf9b3f12c6f466f593c08ed479168496aff783ab6b4714acb19692ae91c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T00:16:59.733549Z","signature_b64":"iLmEou3uwsNXfdyD8CZENtI+d40hb+0MuDJJ6Vgn5SEChvm7PsUZxUsaaSq0t6J9nVALzooHbzD5K8pynFKCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d1cfaf9b3f12c6f466f593c08ed479168496aff783ab6b4714acb19692ae91c","last_reissued_at":"2026-07-03T00:16:59.733138Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T00:16:59.733138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.01417","source_version":1,"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-07-03T00:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WU6kXEMqF0xmrW9rxoi1NuQCby3uvmLHUqwuopzJM52gTcw/kqRkSe8/yVQ+53WFnzvVgKtIG3vcp1NeZlCXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T18:12:55.097071Z"},"content_sha256":"1cee2a4152301b64b169efd5ec9c2f5e6ca69e98efc0cb19112767e6af6053e1","schema_version":"1.0","event_id":"sha256:1cee2a4152301b64b169efd5ec9c2f5e6ca69e98efc0cb19112767e6af6053e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DUOPV6NT6EWG6RTPLE6AR3KHSF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conditional Inference Trees and Forests for Feature Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Justin Downes, Newel Hirst, Robert Milletich, Steve Goley","submitted_at":"2026-07-01T19:23:07Z","abstract_excerpt":"Conditional inference trees (CIT) and conditional inference forests (CIF) reduce split-selection bias by testing features before choosing split thresholds, but repeated permutation tests and threshold searches can make these methods computationally expensive. We study CIT and CIF as top-$k$ feature-ranking methods for downstream prediction using real-data benchmarks, runtime ablations, and synthetic feature-recovery experiments. At a fixed node, if the features and permutation budget do not depend on the node responses, Bonferroni-corrected $+1$ Monte Carlo permutation $p$-values control nodew"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01417","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/2607.01417/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"},"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-07-03T00:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t6RWBzdRHbfurcvYpOBQ74VfYVxQv4GB+VnNyMLyLI0ajiHmXeICdYaeM10Uzy4phfLa8lE7LbYpCJg9qt5nAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T18:12:55.097462Z"},"content_sha256":"28d84911be4078d9b04fbbc0d90238e4fcb4323cbe24ef2460276a39faeff575","schema_version":"1.0","event_id":"sha256:28d84911be4078d9b04fbbc0d90238e4fcb4323cbe24ef2460276a39faeff575"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUOPV6NT6EWG6RTPLE6AR3KHSF/bundle.json","state_url":"https://pith.science/pith/DUOPV6NT6EWG6RTPLE6AR3KHSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUOPV6NT6EWG6RTPLE6AR3KHSF/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-07-03T18:12:55Z","links":{"resolver":"https://pith.science/pith/DUOPV6NT6EWG6RTPLE6AR3KHSF","bundle":"https://pith.science/pith/DUOPV6NT6EWG6RTPLE6AR3KHSF/bundle.json","state":"https://pith.science/pith/DUOPV6NT6EWG6RTPLE6AR3KHSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUOPV6NT6EWG6RTPLE6AR3KHSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DUOPV6NT6EWG6RTPLE6AR3KHSF","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":"eb91c5720cd555e918b7fdede9cc7d48ab2d9c4326bbf5292c933faedf0d2704","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T19:23:07Z","title_canon_sha256":"feda7aa78a69791dd8cc5f5f94131d7fb91240d41045976363cea51fbdcf2bea"},"schema_version":"1.0","source":{"id":"2607.01417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01417","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01417v1","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01417","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"DUOPV6NT6EWG","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"pith_short_16","alias_value":"DUOPV6NT6EWG6RTP","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"pith_short_8","alias_value":"DUOPV6NT","created_at":"2026-07-03T00:16:59Z"}],"graph_snapshots":[{"event_id":"sha256:28d84911be4078d9b04fbbc0d90238e4fcb4323cbe24ef2460276a39faeff575","target":"graph","created_at":"2026-07-03T00:16:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.01417/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Conditional inference trees (CIT) and conditional inference forests (CIF) reduce split-selection bias by testing features before choosing split thresholds, but repeated permutation tests and threshold searches can make these methods computationally expensive. We study CIT and CIF as top-$k$ feature-ranking methods for downstream prediction using real-data benchmarks, runtime ablations, and synthetic feature-recovery experiments. At a fixed node, if the features and permutation budget do not depend on the node responses, Bonferroni-corrected $+1$ Monte Carlo permutation $p$-values control nodew","authors_text":"Justin Downes, Newel Hirst, Robert Milletich, Steve Goley","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T19:23:07Z","title":"Conditional Inference Trees and Forests for Feature Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01417","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:1cee2a4152301b64b169efd5ec9c2f5e6ca69e98efc0cb19112767e6af6053e1","target":"record","created_at":"2026-07-03T00:16:59Z","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":"eb91c5720cd555e918b7fdede9cc7d48ab2d9c4326bbf5292c933faedf0d2704","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-01T19:23:07Z","title_canon_sha256":"feda7aa78a69791dd8cc5f5f94131d7fb91240d41045976363cea51fbdcf2bea"},"schema_version":"1.0","source":{"id":"2607.01417","kind":"arxiv","version":1}},"canonical_sha256":"1d1cfaf9b3f12c6f466f593c08ed479168496aff783ab6b4714acb19692ae91c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d1cfaf9b3f12c6f466f593c08ed479168496aff783ab6b4714acb19692ae91c","first_computed_at":"2026-07-03T00:16:59.733138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T00:16:59.733138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iLmEou3uwsNXfdyD8CZENtI+d40hb+0MuDJJ6Vgn5SEChvm7PsUZxUsaaSq0t6J9nVALzooHbzD5K8pynFKCAA==","signature_status":"signed_v1","signed_at":"2026-07-03T00:16:59.733549Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.01417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cee2a4152301b64b169efd5ec9c2f5e6ca69e98efc0cb19112767e6af6053e1","sha256:28d84911be4078d9b04fbbc0d90238e4fcb4323cbe24ef2460276a39faeff575"],"state_sha256":"9414c5023bd62d572ded8b9fc3bf620270ed42a94d04257c3f9086474f2c35c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aals6npZ4pGOgOPvdZc67dQEhOSJNT6kCOCclhIRI959s7pr6llR6yg8LTfuifNVyvMIRuln/54zOS5r0C3+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T18:12:55.099465Z","bundle_sha256":"fcd14fa6d38ab3089ceadd30b4b4d68871f3eb17dac2059e55a9356701efc54d"}}