{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SSMWHECH32ZJ53UFS2VQQZTRU4","short_pith_number":"pith:SSMWHECH","canonical_record":{"source":{"id":"1604.04894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-17T16:32:27Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ba92bb9b58f07625daacfab6ffc2ac9ddf31c9200896bdff33f28c1ae54cc268","abstract_canon_sha256":"3b508cdce7f242a0ca3260691f1d9d2bfa7cfdcffc9890f34c3eb8bf8d868d63"},"schema_version":"1.0"},"canonical_sha256":"9499639047deb29eee8596ab086671a72ae3ab3d0daf4198b44f1a6c1908bfc8","source":{"kind":"arxiv","id":"1604.04894","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04894","created_at":"2026-05-18T01:16:56Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04894v1","created_at":"2026-05-18T01:16:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04894","created_at":"2026-05-18T01:16:56Z"},{"alias_kind":"pith_short_12","alias_value":"SSMWHECH32ZJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SSMWHECH32ZJ53UF","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SSMWHECH","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SSMWHECH32ZJ53UFS2VQQZTRU4","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-17T16:32:27Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ba92bb9b58f07625daacfab6ffc2ac9ddf31c9200896bdff33f28c1ae54cc268","abstract_canon_sha256":"3b508cdce7f242a0ca3260691f1d9d2bfa7cfdcffc9890f34c3eb8bf8d868d63"},"schema_version":"1.0"},"canonical_sha256":"9499639047deb29eee8596ab086671a72ae3ab3d0daf4198b44f1a6c1908bfc8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:56.435701Z","signature_b64":"ujf8iC5ACf213Y6dIMKEuynX/u0l50oFzC4f39oCQNZtYm32sl6C5IpjAg2LNu1eIzM4eS7Na3cvj0obm0tyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9499639047deb29eee8596ab086671a72ae3ab3d0daf4198b44f1a6c1908bfc8","last_reissued_at":"2026-05-18T01:16:56.435091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:56.435091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04894","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:16:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B12bEbuG6hjGswLcElaqy22uHeuTBDbUfuWOs2iSLRXX8CNjSv0KOZEMXrwE65rlqMT0ox0VTrIDqUeMXKFkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:20:53.092359Z"},"content_sha256":"172668edcabfb4a06125482cc7c71be9484471a7e555922f1ffa53e628d12381","schema_version":"1.0","event_id":"sha256:172668edcabfb4a06125482cc7c71be9484471a7e555922f1ffa53e628d12381"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SSMWHECH32ZJ53UFS2VQQZTRU4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A global constraint for closed itemset mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AI","authors_text":"Mehdi Maamar, Nadjib Lazaar, Samir Loudni, Yahia Lebbah","submitted_at":"2016-04-17T16:32:27Z","abstract_excerpt":"Discovering the set of closed frequent patterns is one of the fundamental problems in Data Mining. Recent Constraint Programming (CP) approaches for declarative itemset mining have proven their usefulness and flexibility. But the wide use of reified constraints in current CP approaches raises many difficulties to cope with high dimensional datasets. This paper proposes CLOSED PATTERN global constraint which does not require any reified constraints nor any extra variables to encode efficiently the Closed Frequent Pattern Mining (CFPM) constraint. CLOSED-PATTERN captures the particular semantics"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04894","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:16:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmVTrtdl24qY1fZJriwqhMD/NQUSNBMge+3B8ilZ3P/YQEy4JsiLxDDSRcm8HDZi0fATvoaieQe4bXOOhMe5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:20:53.092709Z"},"content_sha256":"2d836c9f9a0f7421c9877925434140c3c4034540b82148da0e31249f25a49919","schema_version":"1.0","event_id":"sha256:2d836c9f9a0f7421c9877925434140c3c4034540b82148da0e31249f25a49919"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSMWHECH32ZJ53UFS2VQQZTRU4/bundle.json","state_url":"https://pith.science/pith/SSMWHECH32ZJ53UFS2VQQZTRU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSMWHECH32ZJ53UFS2VQQZTRU4/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-04T20:20:53Z","links":{"resolver":"https://pith.science/pith/SSMWHECH32ZJ53UFS2VQQZTRU4","bundle":"https://pith.science/pith/SSMWHECH32ZJ53UFS2VQQZTRU4/bundle.json","state":"https://pith.science/pith/SSMWHECH32ZJ53UFS2VQQZTRU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSMWHECH32ZJ53UFS2VQQZTRU4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SSMWHECH32ZJ53UFS2VQQZTRU4","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":"3b508cdce7f242a0ca3260691f1d9d2bfa7cfdcffc9890f34c3eb8bf8d868d63","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-17T16:32:27Z","title_canon_sha256":"ba92bb9b58f07625daacfab6ffc2ac9ddf31c9200896bdff33f28c1ae54cc268"},"schema_version":"1.0","source":{"id":"1604.04894","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04894","created_at":"2026-05-18T01:16:56Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04894v1","created_at":"2026-05-18T01:16:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04894","created_at":"2026-05-18T01:16:56Z"},{"alias_kind":"pith_short_12","alias_value":"SSMWHECH32ZJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SSMWHECH32ZJ53UF","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SSMWHECH","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:2d836c9f9a0f7421c9877925434140c3c4034540b82148da0e31249f25a49919","target":"graph","created_at":"2026-05-18T01:16:56Z","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":"Discovering the set of closed frequent patterns is one of the fundamental problems in Data Mining. Recent Constraint Programming (CP) approaches for declarative itemset mining have proven their usefulness and flexibility. But the wide use of reified constraints in current CP approaches raises many difficulties to cope with high dimensional datasets. This paper proposes CLOSED PATTERN global constraint which does not require any reified constraints nor any extra variables to encode efficiently the Closed Frequent Pattern Mining (CFPM) constraint. CLOSED-PATTERN captures the particular semantics","authors_text":"Mehdi Maamar, Nadjib Lazaar, Samir Loudni, Yahia Lebbah","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-17T16:32:27Z","title":"A global constraint for closed itemset mining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04894","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:172668edcabfb4a06125482cc7c71be9484471a7e555922f1ffa53e628d12381","target":"record","created_at":"2026-05-18T01:16:56Z","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":"3b508cdce7f242a0ca3260691f1d9d2bfa7cfdcffc9890f34c3eb8bf8d868d63","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-17T16:32:27Z","title_canon_sha256":"ba92bb9b58f07625daacfab6ffc2ac9ddf31c9200896bdff33f28c1ae54cc268"},"schema_version":"1.0","source":{"id":"1604.04894","kind":"arxiv","version":1}},"canonical_sha256":"9499639047deb29eee8596ab086671a72ae3ab3d0daf4198b44f1a6c1908bfc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9499639047deb29eee8596ab086671a72ae3ab3d0daf4198b44f1a6c1908bfc8","first_computed_at":"2026-05-18T01:16:56.435091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:56.435091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ujf8iC5ACf213Y6dIMKEuynX/u0l50oFzC4f39oCQNZtYm32sl6C5IpjAg2LNu1eIzM4eS7Na3cvj0obm0tyCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:56.435701Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04894","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:172668edcabfb4a06125482cc7c71be9484471a7e555922f1ffa53e628d12381","sha256:2d836c9f9a0f7421c9877925434140c3c4034540b82148da0e31249f25a49919"],"state_sha256":"c8f5e700238acc2cff79a631a36e240f55b4fe0a5426f9d577686aa7fcea7993"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcPyJZnJNBEDyxb/7pdlxVakn4Bfae1Y8syCVy0IN/pwB6mLPea7RnCXva31KCqF0afj11apqmoCZsB3SDYcAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:20:53.094669Z","bundle_sha256":"3fb43e37b9cba3d1fc1695c0001f4d141307e19f87d620b80d44ad114381be64"}}