{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZULL66IKYQAWKK3KGUKKMN7TUC","short_pith_number":"pith:ZULL66IK","schema_version":"1.0","canonical_sha256":"cd16bf790ac401652b6a3514a637f3a0845c0f93ebf07c5a42bc818a13b5b22d","source":{"kind":"arxiv","id":"1602.04548","version":1},"attestation_state":"computed","paper":{"title":"Safe Pattern Pruning: An Efficient Approach for Predictive Pattern Mining","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":"2016-02-15T02:16:16Z","abstract_excerpt":"In this paper we study predictive pattern mining problems where the goal is to construct a predictive model based on a subset of predictive patterns in the database. Our main contribution is to introduce a novel method called safe pattern pruning (SPP) for a class of predictive pattern mining problems. The SPP method allows us to efficiently find a superset of all the predictive patterns in the database that are needed for the optimal predictive model. The advantage of the SPP method over existing boosting-type method is that the former can find the superset by a single search over the databas"},"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":"1602.04548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-15T02:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"a1d7d2743d4624bc082278efe5c3fb4477bb04c10ca833b967356a32c5c90f1e","abstract_canon_sha256":"a39f786eb945a4bd00fe452b4ce7add8853c469c2be447bbbe322c5fc2f62d7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:49.698303Z","signature_b64":"3HSyHfy8yMnu3VNbYlXrYX3nNrEnyLkE/kuJ0Irsu18gIMedv7O+1QGLCbulzTIDUbff8X57wqmgs/TBYcteAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd16bf790ac401652b6a3514a637f3a0845c0f93ebf07c5a42bc818a13b5b22d","last_reissued_at":"2026-05-18T01:20:49.697879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:49.697879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Safe Pattern Pruning: An Efficient Approach for Predictive Pattern Mining","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":"2016-02-15T02:16:16Z","abstract_excerpt":"In this paper we study predictive pattern mining problems where the goal is to construct a predictive model based on a subset of predictive patterns in the database. Our main contribution is to introduce a novel method called safe pattern pruning (SPP) for a class of predictive pattern mining problems. The SPP method allows us to efficiently find a superset of all the predictive patterns in the database that are needed for the optimal predictive model. The advantage of the SPP method over existing boosting-type method is that the former can find the superset by a single search over the databas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04548","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.04548","created_at":"2026-05-18T01:20:49.697942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04548v1","created_at":"2026-05-18T01:20:49.697942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04548","created_at":"2026-05-18T01:20:49.697942+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZULL66IKYQAW","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZULL66IKYQAWKK3K","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZULL66IK","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZULL66IKYQAWKK3KGUKKMN7TUC","json":"https://pith.science/pith/ZULL66IKYQAWKK3KGUKKMN7TUC.json","graph_json":"https://pith.science/api/pith-number/ZULL66IKYQAWKK3KGUKKMN7TUC/graph.json","events_json":"https://pith.science/api/pith-number/ZULL66IKYQAWKK3KGUKKMN7TUC/events.json","paper":"https://pith.science/paper/ZULL66IK"},"agent_actions":{"view_html":"https://pith.science/pith/ZULL66IKYQAWKK3KGUKKMN7TUC","download_json":"https://pith.science/pith/ZULL66IKYQAWKK3KGUKKMN7TUC.json","view_paper":"https://pith.science/paper/ZULL66IK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04548&json=true","fetch_graph":"https://pith.science/api/pith-number/ZULL66IKYQAWKK3KGUKKMN7TUC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZULL66IKYQAWKK3KGUKKMN7TUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZULL66IKYQAWKK3KGUKKMN7TUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZULL66IKYQAWKK3KGUKKMN7TUC/action/storage_attestation","attest_author":"https://pith.science/pith/ZULL66IKYQAWKK3KGUKKMN7TUC/action/author_attestation","sign_citation":"https://pith.science/pith/ZULL66IKYQAWKK3KGUKKMN7TUC/action/citation_signature","submit_replication":"https://pith.science/pith/ZULL66IKYQAWKK3KGUKKMN7TUC/action/replication_record"}},"created_at":"2026-05-18T01:20:49.697942+00:00","updated_at":"2026-05-18T01:20:49.697942+00:00"}