{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RTZQFNTBJTVG5JUJVFS4EW64PV","short_pith_number":"pith:RTZQFNTB","canonical_record":{"source":{"id":"1801.00345","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-31T19:55:52Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"94dbe13ef2933ca2ec483f68b1c803313cc8cbe415b49ff6597362e26467eb31","abstract_canon_sha256":"f7fca4d0c7b469703aff3e7be463e63e1d5c3024e899dc861e94eeb95dc011e6"},"schema_version":"1.0"},"canonical_sha256":"8cf302b6614cea6ea689a965c25bdc7d5ff48d766ca01d55bce3bd996847bf69","source":{"kind":"arxiv","id":"1801.00345","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00345","created_at":"2026-05-18T00:24:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00345v2","created_at":"2026-05-18T00:24:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00345","created_at":"2026-05-18T00:24:03Z"},{"alias_kind":"pith_short_12","alias_value":"RTZQFNTBJTVG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RTZQFNTBJTVG5JUJ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RTZQFNTB","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RTZQFNTBJTVG5JUJVFS4EW64PV","target":"record","payload":{"canonical_record":{"source":{"id":"1801.00345","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-31T19:55:52Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"94dbe13ef2933ca2ec483f68b1c803313cc8cbe415b49ff6597362e26467eb31","abstract_canon_sha256":"f7fca4d0c7b469703aff3e7be463e63e1d5c3024e899dc861e94eeb95dc011e6"},"schema_version":"1.0"},"canonical_sha256":"8cf302b6614cea6ea689a965c25bdc7d5ff48d766ca01d55bce3bd996847bf69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:03.816111Z","signature_b64":"kwHD8Wosp+VPp3zY9lc1G8w27Rmk6iWXgtjFduwDzjKE6ixPSjVHFaONLDASNJeEXH1cu3Y6wAAf6VsZKsC6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cf302b6614cea6ea689a965c25bdc7d5ff48d766ca01d55bce3bd996847bf69","last_reissued_at":"2026-05-18T00:24:03.815536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:03.815536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.00345","source_version":2,"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:24:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FEWJGVzQgVdvbzL6dDVJUQ9ndJy1gGF1X9b1Wguaj0C41YCgshQ8SmrsuB08hMdNc5QtWmvsSe5K4ZQfti7NAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T07:07:36.047277Z"},"content_sha256":"e236b1d35ceafbb93d49066fafd3bc72b8b9333948ee79927f440f11541de8c4","schema_version":"1.0","event_id":"sha256:e236b1d35ceafbb93d49066fafd3bc72b8b9333948ee79927f440f11541de8c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RTZQFNTBJTVG5JUJVFS4EW64PV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Users Constraints in Itemset Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.AI","authors_text":"Christian Bessiere, Mehdi Maamar, Nadjib Lazaar, Yahia Lebbah","submitted_at":"2017-12-31T19:55:52Z","abstract_excerpt":"Discovering significant itemsets is one of the fundamental problems in data mining. It has recently been shown that constraint programming is a flexible way to tackle data mining tasks. With a constraint programming approach, we can easily express and efficiently answer queries with users constraints on items. However, in many practical cases it is possible that queries also express users constraints on the dataset itself. For instance, asking for a particular itemset in a particular part of the dataset. This paper presents a general constraint programming model able to handle any kind of quer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00345","kind":"arxiv","version":2},"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:24:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NU0xxq6fyXFQkOnSigviRsEiMVZWcQ5DzYm7jRrLxJK1xPfcojkmrLKAFme8szMrhFUnp+0eSc4Bd/GGQAu3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T07:07:36.047633Z"},"content_sha256":"9e770e6fde57a0b6d34ff4188236b85d1868e7cd808ac83bda491aae41076231","schema_version":"1.0","event_id":"sha256:9e770e6fde57a0b6d34ff4188236b85d1868e7cd808ac83bda491aae41076231"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTZQFNTBJTVG5JUJVFS4EW64PV/bundle.json","state_url":"https://pith.science/pith/RTZQFNTBJTVG5JUJVFS4EW64PV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTZQFNTBJTVG5JUJVFS4EW64PV/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-04T07:07:36Z","links":{"resolver":"https://pith.science/pith/RTZQFNTBJTVG5JUJVFS4EW64PV","bundle":"https://pith.science/pith/RTZQFNTBJTVG5JUJVFS4EW64PV/bundle.json","state":"https://pith.science/pith/RTZQFNTBJTVG5JUJVFS4EW64PV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTZQFNTBJTVG5JUJVFS4EW64PV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RTZQFNTBJTVG5JUJVFS4EW64PV","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":"f7fca4d0c7b469703aff3e7be463e63e1d5c3024e899dc861e94eeb95dc011e6","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-31T19:55:52Z","title_canon_sha256":"94dbe13ef2933ca2ec483f68b1c803313cc8cbe415b49ff6597362e26467eb31"},"schema_version":"1.0","source":{"id":"1801.00345","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00345","created_at":"2026-05-18T00:24:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00345v2","created_at":"2026-05-18T00:24:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00345","created_at":"2026-05-18T00:24:03Z"},{"alias_kind":"pith_short_12","alias_value":"RTZQFNTBJTVG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RTZQFNTBJTVG5JUJ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RTZQFNTB","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:9e770e6fde57a0b6d34ff4188236b85d1868e7cd808ac83bda491aae41076231","target":"graph","created_at":"2026-05-18T00:24:03Z","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 significant itemsets is one of the fundamental problems in data mining. It has recently been shown that constraint programming is a flexible way to tackle data mining tasks. With a constraint programming approach, we can easily express and efficiently answer queries with users constraints on items. However, in many practical cases it is possible that queries also express users constraints on the dataset itself. For instance, asking for a particular itemset in a particular part of the dataset. This paper presents a general constraint programming model able to handle any kind of quer","authors_text":"Christian Bessiere, Mehdi Maamar, Nadjib Lazaar, Yahia Lebbah","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-31T19:55:52Z","title":"Users Constraints in Itemset Mining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00345","kind":"arxiv","version":2},"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:e236b1d35ceafbb93d49066fafd3bc72b8b9333948ee79927f440f11541de8c4","target":"record","created_at":"2026-05-18T00:24:03Z","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":"f7fca4d0c7b469703aff3e7be463e63e1d5c3024e899dc861e94eeb95dc011e6","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-31T19:55:52Z","title_canon_sha256":"94dbe13ef2933ca2ec483f68b1c803313cc8cbe415b49ff6597362e26467eb31"},"schema_version":"1.0","source":{"id":"1801.00345","kind":"arxiv","version":2}},"canonical_sha256":"8cf302b6614cea6ea689a965c25bdc7d5ff48d766ca01d55bce3bd996847bf69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cf302b6614cea6ea689a965c25bdc7d5ff48d766ca01d55bce3bd996847bf69","first_computed_at":"2026-05-18T00:24:03.815536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:03.815536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kwHD8Wosp+VPp3zY9lc1G8w27Rmk6iWXgtjFduwDzjKE6ixPSjVHFaONLDASNJeEXH1cu3Y6wAAf6VsZKsC6CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:03.816111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00345","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e236b1d35ceafbb93d49066fafd3bc72b8b9333948ee79927f440f11541de8c4","sha256:9e770e6fde57a0b6d34ff4188236b85d1868e7cd808ac83bda491aae41076231"],"state_sha256":"3d36cbfd4c3f56b70c95aba280f7e7c644758b8173162e2bc1bcdc25b49a6cca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yCMtFAi6avF/XeroirUx+uhB1DagaHZJLkY6QZTkqwMUSTiXaIa6G5D3bSV28TAHksi3V43+CbPGdRvNCs1/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T07:07:36.049639Z","bundle_sha256":"97adf13f30fec33fd60d071ae5d9894316b297530d2536aa48bd7e71fa37d5bb"}}