{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ROVDH3FBDGVAQMORI45LJSGRYW","short_pith_number":"pith:ROVDH3FB","canonical_record":{"source":{"id":"2604.15107","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-04-16T15:02:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5df5275c054651e8eb9a63deea02412d72e9e80f3368da0551851cf38d81f775","abstract_canon_sha256":"e76431245264f4c0717af9f4f1fac2b0fcd6a2d77e969529d0e33b5f961379a9"},"schema_version":"1.0"},"canonical_sha256":"8baa33eca119aa0831d1473ab4c8d1c58ee91a9de3b3c0c08860c548c9ccdc6d","source":{"kind":"arxiv","id":"2604.15107","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.15107","created_at":"2026-07-21T01:20:48Z"},{"alias_kind":"arxiv_version","alias_value":"2604.15107v2","created_at":"2026-07-21T01:20:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.15107","created_at":"2026-07-21T01:20:48Z"},{"alias_kind":"pith_short_12","alias_value":"ROVDH3FBDGVA","created_at":"2026-07-21T01:20:48Z"},{"alias_kind":"pith_short_16","alias_value":"ROVDH3FBDGVAQMOR","created_at":"2026-07-21T01:20:48Z"},{"alias_kind":"pith_short_8","alias_value":"ROVDH3FB","created_at":"2026-07-21T01:20:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ROVDH3FBDGVAQMORI45LJSGRYW","target":"record","payload":{"canonical_record":{"source":{"id":"2604.15107","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-04-16T15:02:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5df5275c054651e8eb9a63deea02412d72e9e80f3368da0551851cf38d81f775","abstract_canon_sha256":"e76431245264f4c0717af9f4f1fac2b0fcd6a2d77e969529d0e33b5f961379a9"},"schema_version":"1.0"},"canonical_sha256":"8baa33eca119aa0831d1473ab4c8d1c58ee91a9de3b3c0c08860c548c9ccdc6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:20:48.152492Z","signature_b64":"HCpbNf36UMNfxCl01sCToY6uEabk8NbnnKkiWfJvRSuelTUyZXII9SZ+BQnlqRdAFsFknB26mFkRBVghF5eBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8baa33eca119aa0831d1473ab4c8d1c58ee91a9de3b3c0c08860c548c9ccdc6d","last_reissued_at":"2026-07-21T01:20:48.151508Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:20:48.151508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.15107","source_version":2,"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-21T01:20:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOIT+noW6K9YHWfuum9SWX1dgyRZpHeAGHCs3jlEKJVpY6ECi0Xu+v3Zes3HWBBhYamLUA2//TVltYZDddIdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-28T17:12:07.386069Z"},"content_sha256":"0d75ee48434824851ebfb55ea7642b30c4f2ab2bf5fedff73b847ec9d8be0dc4","schema_version":"1.0","event_id":"sha256:0d75ee48434824851ebfb55ea7642b30c4f2ab2bf5fedff73b847ec9d8be0dc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ROVDH3FBDGVAQMORI45LJSGRYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MinShap: A Shapley-Based Framework for Feature Redundancy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"MinShap adapts Shapley values for feature selection by taking the minimum marginal contribution over permutations to isolate direct effects.","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chenghui Zheng, Garvesh Raskutti","submitted_at":"2026-04-16T15:02:22Z","abstract_excerpt":"Shapley values provide a flexible framework for attributing feature contributions to model predictions, but they are not naturally suited for feature selection: a feature may receive a positive attribution even when it is redundant given the remaining variables. In this paper, we introduce \\textbf{MinShap}, a general framework for identifying \\emph{important} or \\emph{non-redundant} features through conditional importance functionals $VI_j^S$. Rather than averaging feature contributions across conditioning sets, MinShap aggregates them using the \\emph{minimum}, thereby testing whether a featur"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"MinShap tends to outperform state-of-the-art feature selection algorithms such as LOCO, GCM and Lasso in terms of both accuracy and stability. We provide a theoretical foundation motivated by the faithfulness assumption in DAG, a guarantee for the Type I error of MinShap.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The faithfulness assumption in directed acyclic graphical models holds so that the minimum marginal contribution isolates direct effects without indirect paths through other features.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"MinShap adapts Shapley values by taking minimum marginal contributions to select features more accurately and stably than LOCO, GCM, or Lasso, supported by DAG faithfulness assumptions and Type I error bounds.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"MinShap adapts Shapley values for feature selection by taking the minimum marginal contribution over permutations to isolate direct effects.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c135b8a003f1fb3b77ab449ee3adca51b7288a9e379ebc63a6fcfc00fdd3fd3a"},"source":{"id":"2604.15107","kind":"arxiv","version":2},"verdict":{"id":"19abdf06-8e24-42aa-81f0-17cb5b48d8b6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T09:51:48.114808Z","strongest_claim":"MinShap tends to outperform state-of-the-art feature selection algorithms such as LOCO, GCM and Lasso in terms of both accuracy and stability. We provide a theoretical foundation motivated by the faithfulness assumption in DAG, a guarantee for the Type I error of MinShap.","one_line_summary":"MinShap adapts Shapley values by taking minimum marginal contributions to select features more accurately and stably than LOCO, GCM, or Lasso, supported by DAG faithfulness assumptions and Type I error bounds.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The faithfulness assumption in directed acyclic graphical models holds so that the minimum marginal contribution isolates direct effects without indirect paths through other features.","pith_extraction_headline":"MinShap adapts Shapley values for feature selection by taking the minimum marginal contribution over permutations to isolate direct effects."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.15107/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":"19abdf06-8e24-42aa-81f0-17cb5b48d8b6"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-21T01:20:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5q8Bt1Ye+wdCaM3X48v+kSLn2Nx+bJwiV4fkOwRunoTNuEFu0g4ast60vTLSNoI2agQGooTHotCECY1j+4/uAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-28T17:12:07.386527Z"},"content_sha256":"b22dd562bc09724114bed20893497f05f1928239ad74f766dda4e78a0e694791","schema_version":"1.0","event_id":"sha256:b22dd562bc09724114bed20893497f05f1928239ad74f766dda4e78a0e694791"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROVDH3FBDGVAQMORI45LJSGRYW/bundle.json","state_url":"https://pith.science/pith/ROVDH3FBDGVAQMORI45LJSGRYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROVDH3FBDGVAQMORI45LJSGRYW/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-28T17:12:07Z","links":{"resolver":"https://pith.science/pith/ROVDH3FBDGVAQMORI45LJSGRYW","bundle":"https://pith.science/pith/ROVDH3FBDGVAQMORI45LJSGRYW/bundle.json","state":"https://pith.science/pith/ROVDH3FBDGVAQMORI45LJSGRYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROVDH3FBDGVAQMORI45LJSGRYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ROVDH3FBDGVAQMORI45LJSGRYW","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":"e76431245264f4c0717af9f4f1fac2b0fcd6a2d77e969529d0e33b5f961379a9","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-04-16T15:02:22Z","title_canon_sha256":"5df5275c054651e8eb9a63deea02412d72e9e80f3368da0551851cf38d81f775"},"schema_version":"1.0","source":{"id":"2604.15107","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.15107","created_at":"2026-07-21T01:20:48Z"},{"alias_kind":"arxiv_version","alias_value":"2604.15107v2","created_at":"2026-07-21T01:20:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.15107","created_at":"2026-07-21T01:20:48Z"},{"alias_kind":"pith_short_12","alias_value":"ROVDH3FBDGVA","created_at":"2026-07-21T01:20:48Z"},{"alias_kind":"pith_short_16","alias_value":"ROVDH3FBDGVAQMOR","created_at":"2026-07-21T01:20:48Z"},{"alias_kind":"pith_short_8","alias_value":"ROVDH3FB","created_at":"2026-07-21T01:20:48Z"}],"graph_snapshots":[{"event_id":"sha256:b22dd562bc09724114bed20893497f05f1928239ad74f766dda4e78a0e694791","target":"graph","created_at":"2026-07-21T01:20:48Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"MinShap tends to outperform state-of-the-art feature selection algorithms such as LOCO, GCM and Lasso in terms of both accuracy and stability. We provide a theoretical foundation motivated by the faithfulness assumption in DAG, a guarantee for the Type I error of MinShap."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The faithfulness assumption in directed acyclic graphical models holds so that the minimum marginal contribution isolates direct effects without indirect paths through other features."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"MinShap adapts Shapley values by taking minimum marginal contributions to select features more accurately and stably than LOCO, GCM, or Lasso, supported by DAG faithfulness assumptions and Type I error bounds."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"MinShap adapts Shapley values for feature selection by taking the minimum marginal contribution over permutations to isolate direct effects."}],"snapshot_sha256":"c135b8a003f1fb3b77ab449ee3adca51b7288a9e379ebc63a6fcfc00fdd3fd3a"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.15107/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Shapley values provide a flexible framework for attributing feature contributions to model predictions, but they are not naturally suited for feature selection: a feature may receive a positive attribution even when it is redundant given the remaining variables. In this paper, we introduce \\textbf{MinShap}, a general framework for identifying \\emph{important} or \\emph{non-redundant} features through conditional importance functionals $VI_j^S$. Rather than averaging feature contributions across conditioning sets, MinShap aggregates them using the \\emph{minimum}, thereby testing whether a featur","authors_text":"Chenghui Zheng, Garvesh Raskutti","cross_cats":["cs.LG"],"headline":"MinShap adapts Shapley values for feature selection by taking the minimum marginal contribution over permutations to isolate direct effects.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-04-16T15:02:22Z","title":"MinShap: A Shapley-Based Framework for Feature Redundancy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.15107","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T09:51:48.114808Z","id":"19abdf06-8e24-42aa-81f0-17cb5b48d8b6","model_set":{"reader":"grok-4.3"},"one_line_summary":"MinShap adapts Shapley values by taking minimum marginal contributions to select features more accurately and stably than LOCO, GCM, or Lasso, supported by DAG faithfulness assumptions and Type I error bounds.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"MinShap adapts Shapley values for feature selection by taking the minimum marginal contribution over permutations to isolate direct effects.","strongest_claim":"MinShap tends to outperform state-of-the-art feature selection algorithms such as LOCO, GCM and Lasso in terms of both accuracy and stability. We provide a theoretical foundation motivated by the faithfulness assumption in DAG, a guarantee for the Type I error of MinShap.","weakest_assumption":"The faithfulness assumption in directed acyclic graphical models holds so that the minimum marginal contribution isolates direct effects without indirect paths through other features."}},"verdict_id":"19abdf06-8e24-42aa-81f0-17cb5b48d8b6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0d75ee48434824851ebfb55ea7642b30c4f2ab2bf5fedff73b847ec9d8be0dc4","target":"record","created_at":"2026-07-21T01:20:48Z","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":"e76431245264f4c0717af9f4f1fac2b0fcd6a2d77e969529d0e33b5f961379a9","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-04-16T15:02:22Z","title_canon_sha256":"5df5275c054651e8eb9a63deea02412d72e9e80f3368da0551851cf38d81f775"},"schema_version":"1.0","source":{"id":"2604.15107","kind":"arxiv","version":2}},"canonical_sha256":"8baa33eca119aa0831d1473ab4c8d1c58ee91a9de3b3c0c08860c548c9ccdc6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8baa33eca119aa0831d1473ab4c8d1c58ee91a9de3b3c0c08860c548c9ccdc6d","first_computed_at":"2026-07-21T01:20:48.151508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-21T01:20:48.151508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HCpbNf36UMNfxCl01sCToY6uEabk8NbnnKkiWfJvRSuelTUyZXII9SZ+BQnlqRdAFsFknB26mFkRBVghF5eBDg==","signature_status":"signed_v1","signed_at":"2026-07-21T01:20:48.152492Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.15107","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d75ee48434824851ebfb55ea7642b30c4f2ab2bf5fedff73b847ec9d8be0dc4","sha256:b22dd562bc09724114bed20893497f05f1928239ad74f766dda4e78a0e694791"],"state_sha256":"3a804dad93a02d8a91f7b544fe6b49b9873188ec15c057820a78c0ca90f6fd93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cn2GIsMRgML6JsCqJeFf0pnpQwMJB1Wc4aY8qo/7zr0YjAEtED7ZWtn5qDvTH1qllu0IQ2+KbfkRENDQBlGfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-28T17:12:07.388734Z","bundle_sha256":"c2e4dc5991fd57bcf9d3d5a578113a3ae8761be2c2c49119a4adaacab9733995"}}