{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UL7TNRCMTENP6XABULUZPGO5J6","short_pith_number":"pith:UL7TNRCM","schema_version":"1.0","canonical_sha256":"a2ff36c44c991aff5c01a2e99799dd4fb75e3aaadd1f43d4cce74e0f8204eba2","source":{"kind":"arxiv","id":"1501.01178","version":3},"attestation_state":"computed","paper":{"title":"Constraint-based sequence mining using constraint programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Benjamin Negrevergne, Tias Guns","submitted_at":"2015-01-06T13:47:24Z","abstract_excerpt":"The goal of constraint-based sequence mining is to find sequences of symbols that are included in a large number of input sequences and that satisfy some constraints specified by the user. Many constraints have been proposed in the literature, but a general framework is still missing. We investigate the use of constraint programming as general framework for this task. We first identify four categories of constraints that are applicable to sequence mining. We then propose two constraint programming formulations. The first formulation introduces a new global constraint called exists-embedding. T"},"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":"1501.01178","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-01-06T13:47:24Z","cross_cats_sorted":[],"title_canon_sha256":"805b80936b31757f9f24b2894fa31cc15f2d8f53b72782ae82e806f45514e6b2","abstract_canon_sha256":"a7f418d77c4784827781b27ee4f6fd4076424c35899980b92124a84492c89d49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:12.402489Z","signature_b64":"fDlQ3h9EBi2FpHeSCxznSIcnxN4UAfK20hJiywedIPnTE7fkgiPzWG8xcN/f9fGBSsXuIn7j9iX+z5fsJXWaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2ff36c44c991aff5c01a2e99799dd4fb75e3aaadd1f43d4cce74e0f8204eba2","last_reissued_at":"2026-05-18T02:26:12.402048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:12.402048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constraint-based sequence mining using constraint programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Benjamin Negrevergne, Tias Guns","submitted_at":"2015-01-06T13:47:24Z","abstract_excerpt":"The goal of constraint-based sequence mining is to find sequences of symbols that are included in a large number of input sequences and that satisfy some constraints specified by the user. Many constraints have been proposed in the literature, but a general framework is still missing. We investigate the use of constraint programming as general framework for this task. We first identify four categories of constraints that are applicable to sequence mining. We then propose two constraint programming formulations. The first formulation introduces a new global constraint called exists-embedding. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01178","kind":"arxiv","version":3},"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":"1501.01178","created_at":"2026-05-18T02:26:12.402111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01178v3","created_at":"2026-05-18T02:26:12.402111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01178","created_at":"2026-05-18T02:26:12.402111+00:00"},{"alias_kind":"pith_short_12","alias_value":"UL7TNRCMTENP","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UL7TNRCMTENP6XAB","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UL7TNRCM","created_at":"2026-05-18T12:29:44.643036+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/UL7TNRCMTENP6XABULUZPGO5J6","json":"https://pith.science/pith/UL7TNRCMTENP6XABULUZPGO5J6.json","graph_json":"https://pith.science/api/pith-number/UL7TNRCMTENP6XABULUZPGO5J6/graph.json","events_json":"https://pith.science/api/pith-number/UL7TNRCMTENP6XABULUZPGO5J6/events.json","paper":"https://pith.science/paper/UL7TNRCM"},"agent_actions":{"view_html":"https://pith.science/pith/UL7TNRCMTENP6XABULUZPGO5J6","download_json":"https://pith.science/pith/UL7TNRCMTENP6XABULUZPGO5J6.json","view_paper":"https://pith.science/paper/UL7TNRCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01178&json=true","fetch_graph":"https://pith.science/api/pith-number/UL7TNRCMTENP6XABULUZPGO5J6/graph.json","fetch_events":"https://pith.science/api/pith-number/UL7TNRCMTENP6XABULUZPGO5J6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UL7TNRCMTENP6XABULUZPGO5J6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UL7TNRCMTENP6XABULUZPGO5J6/action/storage_attestation","attest_author":"https://pith.science/pith/UL7TNRCMTENP6XABULUZPGO5J6/action/author_attestation","sign_citation":"https://pith.science/pith/UL7TNRCMTENP6XABULUZPGO5J6/action/citation_signature","submit_replication":"https://pith.science/pith/UL7TNRCMTENP6XABULUZPGO5J6/action/replication_record"}},"created_at":"2026-05-18T02:26:12.402111+00:00","updated_at":"2026-05-18T02:26:12.402111+00:00"}