{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YLMUI7CRV2XWAM3BRH3XCNBOPL","short_pith_number":"pith:YLMUI7CR","schema_version":"1.0","canonical_sha256":"c2d9447c51aeaf60336189f771342e7ad8b91a1781d6f91dec076dbb8f1465a5","source":{"kind":"arxiv","id":"2106.04929","version":1},"attestation_state":"computed","paper":{"title":"Fast and More Powerful Selective Inference for Sparse High-order Interaction Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Diptesh Das, Hiroyuki Hanada, Ichiro Takeuchi, Koji Tsuda, Vo Nguyen Le Duy","submitted_at":"2021-06-09T09:22:42Z","abstract_excerpt":"Automated high-stake decision-making such as medical diagnosis requires models with high interpretability and reliability. As one of the interpretable and reliable models with good prediction ability, we consider Sparse High-order Interaction Model (SHIM) in this study. However, finding statistically significant high-order interactions is challenging due to the intrinsic high dimensionality of the combinatorial effects. Another problem in data-driven modeling is the effect of \"cherry-picking\" a.k.a. selection bias. Our main contribution is to extend the recently developed parametric programmin"},"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":"2106.04929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-06-09T09:22:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f763e6ad308825f520073d2d259a41f4083d13047629cb427b4b2c7108ab3e85","abstract_canon_sha256":"1a7d4ddecf943c9fe1eed6f4493092ad0139fb6dcd48f1c0478f16a2e8d76ff3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:47:50.840110Z","signature_b64":"uqefZaVYX9DrSKcOSs3N+k49Meo2BbiJTt8UZycOLKQnwN8xmHf8ZcSKLXn+gjgx4+oTdybIWd1c9sak+bFGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2d9447c51aeaf60336189f771342e7ad8b91a1781d6f91dec076dbb8f1465a5","last_reissued_at":"2026-07-05T02:47:50.839625Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:47:50.839625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and More Powerful Selective Inference for Sparse High-order Interaction Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Diptesh Das, Hiroyuki Hanada, Ichiro Takeuchi, Koji Tsuda, Vo Nguyen Le Duy","submitted_at":"2021-06-09T09:22:42Z","abstract_excerpt":"Automated high-stake decision-making such as medical diagnosis requires models with high interpretability and reliability. As one of the interpretable and reliable models with good prediction ability, we consider Sparse High-order Interaction Model (SHIM) in this study. However, finding statistically significant high-order interactions is challenging due to the intrinsic high dimensionality of the combinatorial effects. Another problem in data-driven modeling is the effect of \"cherry-picking\" a.k.a. selection bias. Our main contribution is to extend the recently developed parametric programmin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.04929","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/2106.04929/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":"2106.04929","created_at":"2026-07-05T02:47:50.839681+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.04929v1","created_at":"2026-07-05T02:47:50.839681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.04929","created_at":"2026-07-05T02:47:50.839681+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLMUI7CRV2XW","created_at":"2026-07-05T02:47:50.839681+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLMUI7CRV2XWAM3B","created_at":"2026-07-05T02:47:50.839681+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLMUI7CR","created_at":"2026-07-05T02:47:50.839681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.11789","citing_title":"Statistical Test for Diffusion-Based Anomaly Localization via Selective Inference","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YLMUI7CRV2XWAM3BRH3XCNBOPL","json":"https://pith.science/pith/YLMUI7CRV2XWAM3BRH3XCNBOPL.json","graph_json":"https://pith.science/api/pith-number/YLMUI7CRV2XWAM3BRH3XCNBOPL/graph.json","events_json":"https://pith.science/api/pith-number/YLMUI7CRV2XWAM3BRH3XCNBOPL/events.json","paper":"https://pith.science/paper/YLMUI7CR"},"agent_actions":{"view_html":"https://pith.science/pith/YLMUI7CRV2XWAM3BRH3XCNBOPL","download_json":"https://pith.science/pith/YLMUI7CRV2XWAM3BRH3XCNBOPL.json","view_paper":"https://pith.science/paper/YLMUI7CR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.04929&json=true","fetch_graph":"https://pith.science/api/pith-number/YLMUI7CRV2XWAM3BRH3XCNBOPL/graph.json","fetch_events":"https://pith.science/api/pith-number/YLMUI7CRV2XWAM3BRH3XCNBOPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLMUI7CRV2XWAM3BRH3XCNBOPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLMUI7CRV2XWAM3BRH3XCNBOPL/action/storage_attestation","attest_author":"https://pith.science/pith/YLMUI7CRV2XWAM3BRH3XCNBOPL/action/author_attestation","sign_citation":"https://pith.science/pith/YLMUI7CRV2XWAM3BRH3XCNBOPL/action/citation_signature","submit_replication":"https://pith.science/pith/YLMUI7CRV2XWAM3BRH3XCNBOPL/action/replication_record"}},"created_at":"2026-07-05T02:47:50.839681+00:00","updated_at":"2026-07-05T02:47:50.839681+00:00"}