{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QEQ23F5PCXUCMUPM34XBQAVW35","short_pith_number":"pith:QEQ23F5P","schema_version":"1.0","canonical_sha256":"8121ad97af15e82651ecdf2e1802b6df5cca45096b77846a49e4adea094f4158","source":{"kind":"arxiv","id":"1511.08350","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.08350","created_at":"2026-05-18T01:25:54.327025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08350v1","created_at":"2026-05-18T01:25:54.327025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08350","created_at":"2026-05-18T01:25:54.327025+00:00"},{"alias_kind":"pith_short_12","alias_value":"QEQ23F5PCXUC","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QEQ23F5PCXUCMUPM","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QEQ23F5P","created_at":"2026-05-18T12:29:37.295048+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/QEQ23F5PCXUCMUPM34XBQAVW35","json":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35.json","graph_json":"https://pith.science/api/pith-number/QEQ23F5PCXUCMUPM34XBQAVW35/graph.json","events_json":"https://pith.science/api/pith-number/QEQ23F5PCXUCMUPM34XBQAVW35/events.json","paper":"https://pith.science/paper/QEQ23F5P"},"agent_actions":{"view_html":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35","download_json":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35.json","view_paper":"https://pith.science/paper/QEQ23F5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08350&json=true","fetch_graph":"https://pith.science/api/pith-number/QEQ23F5PCXUCMUPM34XBQAVW35/graph.json","fetch_events":"https://pith.science/api/pith-number/QEQ23F5PCXUCMUPM34XBQAVW35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35/action/storage_attestation","attest_author":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35/action/author_attestation","sign_citation":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35/action/citation_signature","submit_replication":"https://pith.science/pith/QEQ23F5PCXUCMUPM34XBQAVW35/action/replication_record"}},"created_at":"2026-05-18T01:25:54.327025+00:00","updated_at":"2026-05-18T01:25:54.327025+00:00"}