{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:E7L25N7DRQDKGGOI5WAYFYHYI3","short_pith_number":"pith:E7L25N7D","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"},"canonical_sha256":"27d7aeb7e38c06a319c8ed8182e0f846fc9436418e66f44a27b89c2c43b1b8c2","source":{"kind":"arxiv","id":"1609.08827","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08827","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08827v5","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08827","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"E7L25N7DRQDK","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E7L25N7DRQDKGGOI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E7L25N7D","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:E7L25N7DRQDKGGOI5WAYFYHYI3","target":"record","payload":{"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"},"canonical_sha256":"27d7aeb7e38c06a319c8ed8182e0f846fc9436418e66f44a27b89c2c43b1b8c2","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"},"source_kind":"arxiv","source_id":"1609.08827","source_version":5,"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-18T00:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3Zai25+JmzaXMwNob37hWTd/wwcanO+xZaDx1AApK5zGXLGcFXMWHG4MY7k9zcePvmZQ43hshHCS2Rn25gqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:22:39.580821Z"},"content_sha256":"2ada7ce36ceb02878e69b9f3b552bbb3a248ce27a782f0dc3cb4e74db5346e83","schema_version":"1.0","event_id":"sha256:2ada7ce36ceb02878e69b9f3b552bbb3a248ce27a782f0dc3cb4e74db5346e83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:E7L25N7DRQDKGGOI5WAYFYHYI3","target":"graph","payload":{"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"},"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-18T00:28:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sDHubCR4pfhG24WcfBGvdbBCUBiQ6sNUHFSWlyWJieDNk+I8KSfUVaZ1tY16mRlBAgiK5UrgID0MKf6yQkZ5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:22:39.581158Z"},"content_sha256":"1eff9a8ebafc742f4776ae0e4b8d68fd5d5f6a2071c41b85a6452dc8655723de","schema_version":"1.0","event_id":"sha256:1eff9a8ebafc742f4776ae0e4b8d68fd5d5f6a2071c41b85a6452dc8655723de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3/bundle.json","state_url":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7L25N7DRQDKGGOI5WAYFYHYI3/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-06-26T15:22:39Z","links":{"resolver":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3","bundle":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3/bundle.json","state":"https://pith.science/pith/E7L25N7DRQDKGGOI5WAYFYHYI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7L25N7DRQDKGGOI5WAYFYHYI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E7L25N7DRQDKGGOI5WAYFYHYI3","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":"c9150301ac1d212c7cb38b11ede227f6e7fdc4625898a63af445f238156dc45a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-28T08:58:12Z","title_canon_sha256":"97fc4cb5297400ddf2fc414c6e81b96b3afe4b3c2fdeced9f0449e3992956292"},"schema_version":"1.0","source":{"id":"1609.08827","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08827","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08827v5","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08827","created_at":"2026-05-18T00:28:41Z"},{"alias_kind":"pith_short_12","alias_value":"E7L25N7DRQDK","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E7L25N7DRQDKGGOI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E7L25N7D","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:1eff9a8ebafc742f4776ae0e4b8d68fd5d5f6a2071c41b85a6452dc8655723de","target":"graph","created_at":"2026-05-18T00:28:41Z","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":"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","authors_text":"Chedy Ra\\\"issi, Guillaume Bosc, Jean-Fran\\c{c}ois Boulicaut, Mehdi Kaytoue","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-28T08:58:12Z","title":"Anytime Discovery of a Diverse Set of Patterns with Monte Carlo Tree Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08827","kind":"arxiv","version":5},"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:2ada7ce36ceb02878e69b9f3b552bbb3a248ce27a782f0dc3cb4e74db5346e83","target":"record","created_at":"2026-05-18T00:28:41Z","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":"c9150301ac1d212c7cb38b11ede227f6e7fdc4625898a63af445f238156dc45a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-28T08:58:12Z","title_canon_sha256":"97fc4cb5297400ddf2fc414c6e81b96b3afe4b3c2fdeced9f0449e3992956292"},"schema_version":"1.0","source":{"id":"1609.08827","kind":"arxiv","version":5}},"canonical_sha256":"27d7aeb7e38c06a319c8ed8182e0f846fc9436418e66f44a27b89c2c43b1b8c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27d7aeb7e38c06a319c8ed8182e0f846fc9436418e66f44a27b89c2c43b1b8c2","first_computed_at":"2026-05-18T00:28:41.245146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:41.245146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"btgzRGPq+P++68MwOwRH8Dj2F83vqAvtUtt2NywtJA8GavGZppCBrG4vWypK8WP+T/qOzWP2kIwFXHKSJW1/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:41.245863Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08827","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ada7ce36ceb02878e69b9f3b552bbb3a248ce27a782f0dc3cb4e74db5346e83","sha256:1eff9a8ebafc742f4776ae0e4b8d68fd5d5f6a2071c41b85a6452dc8655723de"],"state_sha256":"ceb35406d0a1c2496c5859022ef5d07eed7bcd95143ccba15387ee59221af105"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPYO0f601crg6R+FlTBssGBSdkyvC44VB7dvmbpMAIhXPToJp9hD88ZYHx9sdc00CqK8be8U1vQqlS0d3VWeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T15:22:39.583020Z","bundle_sha256":"58938744ce8ec12aff929edcabc786a71311f7e0fc74dda80eced18669be79b2"}}