{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E7L25N7DRQDKGGOI5WAYFYHYI3","short_pith_number":"pith:E7L25N7D","schema_version":"1.0","canonical_sha256":"27d7aeb7e38c06a319c8ed8182e0f846fc9436418e66f44a27b89c2c43b1b8c2","source":{"kind":"arxiv","id":"1609.08827","version":5},"attestation_state":"computed","paper":{"title":"Anytime Discovery of a Diverse Set of Patterns with Monte Carlo Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chedy Ra\\\"issi, Guillaume Bosc, Jean-Fran\\c{c}ois Boulicaut, Mehdi Kaytoue","submitted_at":"2016-09-28T08:58:12Z","abstract_excerpt":"The discovery of patterns that accurately discriminate one class label from another remains a challenging data mining task. Subgroup discovery (SD) is one of the frameworks that enables to elicit such interesting hypotheses from labeled data. A question remains fairly open: How to select an accurate heuristic search technique when exhaustive enumeration of the pattern space is infeasible? Existing approaches make use of beam-search, sampling and genetic algorithms for discovering a pattern set that is non-redundant and of high quality w.r.t. a pattern quality measure. We argue that such approa"},"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":"1609.08827","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-28T08:58:12Z","cross_cats_sorted":[],"title_canon_sha256":"97fc4cb5297400ddf2fc414c6e81b96b3afe4b3c2fdeced9f0449e3992956292","abstract_canon_sha256":"c9150301ac1d212c7cb38b11ede227f6e7fdc4625898a63af445f238156dc45a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:41.245863Z","signature_b64":"btgzRGPq+P++68MwOwRH8Dj2F83vqAvtUtt2NywtJA8GavGZppCBrG4vWypK8WP+T/qOzWP2kIwFXHKSJW1/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27d7aeb7e38c06a319c8ed8182e0f846fc9436418e66f44a27b89c2c43b1b8c2","last_reissued_at":"2026-05-18T00:28:41.245146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:41.245146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anytime Discovery of a Diverse Set of Patterns with Monte Carlo Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chedy Ra\\\"issi, Guillaume Bosc, Jean-Fran\\c{c}ois Boulicaut, Mehdi Kaytoue","submitted_at":"2016-09-28T08:58:12Z","abstract_excerpt":"The discovery of patterns that accurately discriminate one class label from another remains a challenging data mining task. Subgroup discovery (SD) is one of the frameworks that enables to elicit such interesting hypotheses from labeled data. A question remains fairly open: How to select an accurate heuristic search technique when exhaustive enumeration of the pattern space is infeasible? Existing approaches make use of beam-search, sampling and genetic algorithms for discovering a pattern set that is non-redundant and of high quality w.r.t. a pattern quality measure. We argue that such approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08827","kind":"arxiv","version":5},"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":"1609.08827","created_at":"2026-05-18T00:28:41.245265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08827v5","created_at":"2026-05-18T00:28:41.245265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08827","created_at":"2026-05-18T00:28:41.245265+00:00"},{"alias_kind":"pith_short_12","alias_value":"E7L25N7DRQDK","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E7L25N7DRQDKGGOI","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E7L25N7D","created_at":"2026-05-18T12:30:12.583610+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/E7L25N7DRQDKGGOI5WAYFYHYI3","json":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3.json","graph_json":"https://pith.science/api/pith-number/E7L25N7DRQDKGGOI5WAYFYHYI3/graph.json","events_json":"https://pith.science/api/pith-number/E7L25N7DRQDKGGOI5WAYFYHYI3/events.json","paper":"https://pith.science/paper/E7L25N7D"},"agent_actions":{"view_html":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3","download_json":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3.json","view_paper":"https://pith.science/paper/E7L25N7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08827&json=true","fetch_graph":"https://pith.science/api/pith-number/E7L25N7DRQDKGGOI5WAYFYHYI3/graph.json","fetch_events":"https://pith.science/api/pith-number/E7L25N7DRQDKGGOI5WAYFYHYI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3/action/storage_attestation","attest_author":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3/action/author_attestation","sign_citation":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3/action/citation_signature","submit_replication":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3/action/replication_record"}},"created_at":"2026-05-18T00:28:41.245265+00:00","updated_at":"2026-05-18T00:28:41.245265+00:00"}