{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QEQ23F5PCXUCMUPM34XBQAVW35","short_pith_number":"pith:QEQ23F5P","canonical_record":{"source":{"id":"1511.08350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-26T10:45:34Z","cross_cats_sorted":[],"title_canon_sha256":"aafe666bf073280563b2d7ecffb4b82e17f0dcf744490d5982f670b7433ddb54","abstract_canon_sha256":"1924c7a87e59a06cbf11d2ab8e82ae36cd047ff3c0dd28e6daefd6065cd0ea53"},"schema_version":"1.0"},"canonical_sha256":"8121ad97af15e82651ecdf2e1802b6df5cca45096b77846a49e4adea094f4158","source":{"kind":"arxiv","id":"1511.08350","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08350","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08350v1","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08350","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"pith_short_12","alias_value":"QEQ23F5PCXUC","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QEQ23F5PCXUCMUPM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QEQ23F5P","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QEQ23F5PCXUCMUPM34XBQAVW35","target":"record","payload":{"canonical_record":{"source":{"id":"1511.08350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-26T10:45:34Z","cross_cats_sorted":[],"title_canon_sha256":"aafe666bf073280563b2d7ecffb4b82e17f0dcf744490d5982f670b7433ddb54","abstract_canon_sha256":"1924c7a87e59a06cbf11d2ab8e82ae36cd047ff3c0dd28e6daefd6065cd0ea53"},"schema_version":"1.0"},"canonical_sha256":"8121ad97af15e82651ecdf2e1802b6df5cca45096b77846a49e4adea094f4158","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:54.327603Z","signature_b64":"NCujL5tJTnV5KznqrTZYUoy+XObqO7YJKUARFvogoYgArcoRc7n2aZzebfgeOWOQ0+PGpreyz3OHEsnuBAhpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8121ad97af15e82651ecdf2e1802b6df5cca45096b77846a49e4adea094f4158","last_reissued_at":"2026-05-18T01:25:54.326905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:54.326905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.08350","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:25:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WdAKFI4YPaPLbX5yGDeu7FaGeqvlUzUUPR8LS/cDLTNyf1t2fLKIqv3gq0J87nNWts11kwPrYp/LdufacRfhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:54:59.057892Z"},"content_sha256":"6edaad610be41154a32aa3cb945d0d2cf7447bac23e650136e266520afe1b684","schema_version":"1.0","event_id":"sha256:6edaad610be41154a32aa3cb945d0d2cf7447bac23e650136e266520afe1b684"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QEQ23F5PCXUCMUPM34XBQAVW35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A global Constraint for mining Sequential Patterns with GAP constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Amina Kemmar, Patrice Boizumault, Samir Loudni, Thierry Charnois, Yahia Lebbah","submitted_at":"2015-11-26T10:45:34Z","abstract_excerpt":"Sequential pattern mining (SPM) under gap constraint is a challenging task. Many efficient specialized methods have been developed but they are all suffering from a lack of genericity. The Constraint Programming (CP) approaches are not so effective because of the size of their encodings. In[7], we have proposed the global constraint Prefix-Projection for SPM which remedies to this drawback. However, this global constraint cannot be directly extended to support gap constraint. In this paper, we propose the global constraint GAP-SEQ enabling to handle SPM with or without gap constraint. GAP-SEQ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08350","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:25:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBoYnR4Ti4Hj1irNQ726o+kIYUfDs3QAKrienu+KIfBEt6gdSpXKwAurOhn2H86OtWaRQtFAlFMAApgXV6dMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:54:59.058240Z"},"content_sha256":"87a20aac4deed01085b3930562a96434144c94e4f45093b9584cda9960a62565","schema_version":"1.0","event_id":"sha256:87a20aac4deed01085b3930562a96434144c94e4f45093b9584cda9960a62565"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35/bundle.json","state_url":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEQ23F5PCXUCMUPM34XBQAVW35/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-22T21:54:59Z","links":{"resolver":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35","bundle":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35/bundle.json","state":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEQ23F5PCXUCMUPM34XBQAVW35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QEQ23F5PCXUCMUPM34XBQAVW35","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":"1924c7a87e59a06cbf11d2ab8e82ae36cd047ff3c0dd28e6daefd6065cd0ea53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-26T10:45:34Z","title_canon_sha256":"aafe666bf073280563b2d7ecffb4b82e17f0dcf744490d5982f670b7433ddb54"},"schema_version":"1.0","source":{"id":"1511.08350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08350","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08350v1","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08350","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"pith_short_12","alias_value":"QEQ23F5PCXUC","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QEQ23F5PCXUCMUPM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QEQ23F5P","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:87a20aac4deed01085b3930562a96434144c94e4f45093b9584cda9960a62565","target":"graph","created_at":"2026-05-18T01:25:54Z","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":"Sequential pattern mining (SPM) under gap constraint is a challenging task. Many efficient specialized methods have been developed but they are all suffering from a lack of genericity. The Constraint Programming (CP) approaches are not so effective because of the size of their encodings. In[7], we have proposed the global constraint Prefix-Projection for SPM which remedies to this drawback. However, this global constraint cannot be directly extended to support gap constraint. In this paper, we propose the global constraint GAP-SEQ enabling to handle SPM with or without gap constraint. GAP-SEQ ","authors_text":"Amina Kemmar, Patrice Boizumault, Samir Loudni, Thierry Charnois, Yahia Lebbah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-26T10:45:34Z","title":"A global Constraint for mining Sequential Patterns with GAP constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08350","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:6edaad610be41154a32aa3cb945d0d2cf7447bac23e650136e266520afe1b684","target":"record","created_at":"2026-05-18T01:25:54Z","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":"1924c7a87e59a06cbf11d2ab8e82ae36cd047ff3c0dd28e6daefd6065cd0ea53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-26T10:45:34Z","title_canon_sha256":"aafe666bf073280563b2d7ecffb4b82e17f0dcf744490d5982f670b7433ddb54"},"schema_version":"1.0","source":{"id":"1511.08350","kind":"arxiv","version":1}},"canonical_sha256":"8121ad97af15e82651ecdf2e1802b6df5cca45096b77846a49e4adea094f4158","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8121ad97af15e82651ecdf2e1802b6df5cca45096b77846a49e4adea094f4158","first_computed_at":"2026-05-18T01:25:54.326905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:54.326905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NCujL5tJTnV5KznqrTZYUoy+XObqO7YJKUARFvogoYgArcoRc7n2aZzebfgeOWOQ0+PGpreyz3OHEsnuBAhpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:54.327603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6edaad610be41154a32aa3cb945d0d2cf7447bac23e650136e266520afe1b684","sha256:87a20aac4deed01085b3930562a96434144c94e4f45093b9584cda9960a62565"],"state_sha256":"fc1dc7ba384c3a113e17fcdc322958dbfa0898a3c46d65eed06ad0479db7eb4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"koILQhGylidqeF/j9GCBKGZQMDCK6m0Q0WGKjSQJSygk1WKdk5rrirIKRecqncv39nDQIKb6iU/LW15QLt+iBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T21:54:59.060211Z","bundle_sha256":"6398b50b43ddf0b82d8afce0e1c670cc3469788287a82a5cf197cc325ae4885a"}}