{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BNYF6IXEMHARM7XVB4IFBJPJU7","short_pith_number":"pith:BNYF6IXE","canonical_record":{"source":{"id":"1506.08002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-26T09:08:26Z","cross_cats_sorted":[],"title_canon_sha256":"5c995543321b04d35534df564e67e4742864bc5653558de6075f638bcb72d2b9","abstract_canon_sha256":"8ef2606693d6c17d1ab234ac718b02ca330acff4beae5de332ba405a7a5ace71"},"schema_version":"1.0"},"canonical_sha256":"0b705f22e461c1167ef50f1050a5e9a7eb3edf4e90f4cda6e42138918ff484dd","source":{"kind":"arxiv","id":"1506.08002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08002","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08002v1","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08002","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"pith_short_12","alias_value":"BNYF6IXEMHAR","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BNYF6IXEMHARM7XV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BNYF6IXE","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BNYF6IXEMHARM7XVB4IFBJPJU7","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-26T09:08:26Z","cross_cats_sorted":[],"title_canon_sha256":"5c995543321b04d35534df564e67e4742864bc5653558de6075f638bcb72d2b9","abstract_canon_sha256":"8ef2606693d6c17d1ab234ac718b02ca330acff4beae5de332ba405a7a5ace71"},"schema_version":"1.0"},"canonical_sha256":"0b705f22e461c1167ef50f1050a5e9a7eb3edf4e90f4cda6e42138918ff484dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:48.308772Z","signature_b64":"98zQk5q6RoWR4etu2xRqt0uRxA5qGwBK507MJnop5qn2Cm3+eyFemm1D/lCl28ENje/GTJ+ud5t9oxW1LIPMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b705f22e461c1167ef50f1050a5e9a7eb3edf4e90f4cda6e42138918ff484dd","last_reissued_at":"2026-05-18T01:37:48.307931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:48.307931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08002","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-05-18T01:37:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Yb19LtbgSsZdItPrpRgy+jez0Z3fUbESdHHttAsynDX1ijN/Z6mwXeayHM6tU7cqu6GA5zxq++RQ/gc30bWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:52:20.814293Z"},"content_sha256":"ac1506e3fcb206cc4a661d2e1254fd462fbefae3ebf59d3c6812f4b9a572c7e8","schema_version":"1.0","event_id":"sha256:ac1506e3fcb206cc4a661d2e1254fd462fbefae3ebf59d3c6812f4b9a572c7e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BNYF6IXEMHARM7XVB4IFBJPJU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe Feature Pruning for Sparse High-Order Interaction Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Ichiro Takeuchi, Kazuya Nakagawa, Koji Tsuda, Masayuki Karasuyama, Shinya Suzumura","submitted_at":"2015-06-26T09:08:26Z","abstract_excerpt":"Taking into account high-order interactions among covariates is valuable in many practical regression problems. This is, however, computationally challenging task because the number of high-order interaction features to be considered would be extremely large unless the number of covariates is sufficiently small. In this paper, we propose a novel efficient algorithm for LASSO-based sparse learning of such high-order interaction models. Our basic strategy for reducing the number of features is to employ the idea of recently proposed safe feature screening (SFS) rule. An SFS rule has a property t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08002","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":""},"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-05-18T01:37:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5CXHfPqVQZw6mcFGC8TWbBnusZ/a0DhEhqr5h8q2ynoF5T3AQ96VGDPi8yYbKb2kBYBb+nKICXhh6jkzDUbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:52:20.815105Z"},"content_sha256":"352d7ad40ba10812589e77b09f89e0e4396031c12564ea44ddd297d7de384680","schema_version":"1.0","event_id":"sha256:352d7ad40ba10812589e77b09f89e0e4396031c12564ea44ddd297d7de384680"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNYF6IXEMHARM7XVB4IFBJPJU7/bundle.json","state_url":"https://pith.science/pith/BNYF6IXEMHARM7XVB4IFBJPJU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNYF6IXEMHARM7XVB4IFBJPJU7/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-05-31T12:52:20Z","links":{"resolver":"https://pith.science/pith/BNYF6IXEMHARM7XVB4IFBJPJU7","bundle":"https://pith.science/pith/BNYF6IXEMHARM7XVB4IFBJPJU7/bundle.json","state":"https://pith.science/pith/BNYF6IXEMHARM7XVB4IFBJPJU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNYF6IXEMHARM7XVB4IFBJPJU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BNYF6IXEMHARM7XVB4IFBJPJU7","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":"8ef2606693d6c17d1ab234ac718b02ca330acff4beae5de332ba405a7a5ace71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-26T09:08:26Z","title_canon_sha256":"5c995543321b04d35534df564e67e4742864bc5653558de6075f638bcb72d2b9"},"schema_version":"1.0","source":{"id":"1506.08002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08002","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08002v1","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08002","created_at":"2026-05-18T01:37:48Z"},{"alias_kind":"pith_short_12","alias_value":"BNYF6IXEMHAR","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BNYF6IXEMHARM7XV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BNYF6IXE","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:352d7ad40ba10812589e77b09f89e0e4396031c12564ea44ddd297d7de384680","target":"graph","created_at":"2026-05-18T01:37: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Taking into account high-order interactions among covariates is valuable in many practical regression problems. This is, however, computationally challenging task because the number of high-order interaction features to be considered would be extremely large unless the number of covariates is sufficiently small. In this paper, we propose a novel efficient algorithm for LASSO-based sparse learning of such high-order interaction models. Our basic strategy for reducing the number of features is to employ the idea of recently proposed safe feature screening (SFS) rule. An SFS rule has a property t","authors_text":"Ichiro Takeuchi, Kazuya Nakagawa, Koji Tsuda, Masayuki Karasuyama, Shinya Suzumura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-26T09:08:26Z","title":"Safe Feature Pruning for Sparse High-Order Interaction Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08002","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:ac1506e3fcb206cc4a661d2e1254fd462fbefae3ebf59d3c6812f4b9a572c7e8","target":"record","created_at":"2026-05-18T01:37: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":"8ef2606693d6c17d1ab234ac718b02ca330acff4beae5de332ba405a7a5ace71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-26T09:08:26Z","title_canon_sha256":"5c995543321b04d35534df564e67e4742864bc5653558de6075f638bcb72d2b9"},"schema_version":"1.0","source":{"id":"1506.08002","kind":"arxiv","version":1}},"canonical_sha256":"0b705f22e461c1167ef50f1050a5e9a7eb3edf4e90f4cda6e42138918ff484dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b705f22e461c1167ef50f1050a5e9a7eb3edf4e90f4cda6e42138918ff484dd","first_computed_at":"2026-05-18T01:37:48.307931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:48.307931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"98zQk5q6RoWR4etu2xRqt0uRxA5qGwBK507MJnop5qn2Cm3+eyFemm1D/lCl28ENje/GTJ+ud5t9oxW1LIPMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:48.308772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac1506e3fcb206cc4a661d2e1254fd462fbefae3ebf59d3c6812f4b9a572c7e8","sha256:352d7ad40ba10812589e77b09f89e0e4396031c12564ea44ddd297d7de384680"],"state_sha256":"e462a584211d4457fb80c62fa5faa420582a53a58d4305fed2c0e1b68c347d4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hezdKH+20K0+VvZV+2vC0mWflEsM+Wba2THtqlO7SW7qm+6nuwsaRKxEyncEnju2TH0ZOn8Fudux0FAn5XMSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:52:20.819959Z","bundle_sha256":"f0f4b645e5e428fb7c4d9457d20d0868d7ef475ed8ab2919cb0894f93dc29963"}}