{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GOJEXPISLXDWH57F33HRXOLQHA","short_pith_number":"pith:GOJEXPIS","schema_version":"1.0","canonical_sha256":"33924bbd125dc763f7e5decf1bb97038374b2e594f65604e19916150954b9962","source":{"kind":"arxiv","id":"1609.08431","version":2},"attestation_state":"computed","paper":{"title":"DESQ: Frequent Sequence Mining with Subsequence Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Kaustubh Beedkar, Rainer Gemulla","submitted_at":"2016-09-27T13:34:25Z","abstract_excerpt":"Frequent sequence mining methods often make use of constraints to control which subsequences should be mined. A variety of such subsequence constraints has been studied in the literature, including length, gap, span, regular-expression, and hierarchy constraints. In this paper, we show that many subsequence constraints---including and beyond those considered in the literature---can be unified in a single framework. A unified treatment allows researchers to study jointly many types of subsequence constraints (instead of each one individually) and helps to improve usability of pattern mining sys"},"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":"1609.08431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-09-27T13:34:25Z","cross_cats_sorted":[],"title_canon_sha256":"e51c62464ac56896d60953b9b969943d769f390a210af97f040bdc8bdfece6bf","abstract_canon_sha256":"bcd9f089d64a158346d1ec50fbc24a7d34658f2ff47f424f183f616f8733b44a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:21.968149Z","signature_b64":"INfm4HNUYkQRwoLlZDzM1i+JcEWGjItP2Ebv72OX+Aj/7XxbaUR5xfXLMOiF+g0ukF+FHL+dbby5ZvBC7F6rBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33924bbd125dc763f7e5decf1bb97038374b2e594f65604e19916150954b9962","last_reissued_at":"2026-05-18T01:02:21.967500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:21.967500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DESQ: Frequent Sequence Mining with Subsequence Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Kaustubh Beedkar, Rainer Gemulla","submitted_at":"2016-09-27T13:34:25Z","abstract_excerpt":"Frequent sequence mining methods often make use of constraints to control which subsequences should be mined. A variety of such subsequence constraints has been studied in the literature, including length, gap, span, regular-expression, and hierarchy constraints. In this paper, we show that many subsequence constraints---including and beyond those considered in the literature---can be unified in a single framework. A unified treatment allows researchers to study jointly many types of subsequence constraints (instead of each one individually) and helps to improve usability of pattern mining sys"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08431","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.08431","created_at":"2026-05-18T01:02:21.967587+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08431v2","created_at":"2026-05-18T01:02:21.967587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08431","created_at":"2026-05-18T01:02:21.967587+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOJEXPISLXDW","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOJEXPISLXDWH57F","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOJEXPIS","created_at":"2026-05-18T12:30:19.053100+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/GOJEXPISLXDWH57F33HRXOLQHA","json":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA.json","graph_json":"https://pith.science/api/pith-number/GOJEXPISLXDWH57F33HRXOLQHA/graph.json","events_json":"https://pith.science/api/pith-number/GOJEXPISLXDWH57F33HRXOLQHA/events.json","paper":"https://pith.science/paper/GOJEXPIS"},"agent_actions":{"view_html":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA","download_json":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA.json","view_paper":"https://pith.science/paper/GOJEXPIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08431&json=true","fetch_graph":"https://pith.science/api/pith-number/GOJEXPISLXDWH57F33HRXOLQHA/graph.json","fetch_events":"https://pith.science/api/pith-number/GOJEXPISLXDWH57F33HRXOLQHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA/action/storage_attestation","attest_author":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA/action/author_attestation","sign_citation":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA/action/citation_signature","submit_replication":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA/action/replication_record"}},"created_at":"2026-05-18T01:02:21.967587+00:00","updated_at":"2026-05-18T01:02:21.967587+00:00"}