{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GOJEXPISLXDWH57F33HRXOLQHA","short_pith_number":"pith:GOJEXPIS","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"},"canonical_sha256":"33924bbd125dc763f7e5decf1bb97038374b2e594f65604e19916150954b9962","source":{"kind":"arxiv","id":"1609.08431","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08431","created_at":"2026-05-18T01:02:21Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08431v2","created_at":"2026-05-18T01:02:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08431","created_at":"2026-05-18T01:02:21Z"},{"alias_kind":"pith_short_12","alias_value":"GOJEXPISLXDW","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GOJEXPISLXDWH57F","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GOJEXPIS","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GOJEXPISLXDWH57F33HRXOLQHA","target":"record","payload":{"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"},"canonical_sha256":"33924bbd125dc763f7e5decf1bb97038374b2e594f65604e19916150954b9962","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"},"source_kind":"arxiv","source_id":"1609.08431","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-18T01:02:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5C/fohkdhoypgeVef36K1//86RXUxSUduNzPfBVlI84dpbZllVZ3oGhmIQaI27I6lNvMzF/jJS6+mqiZiSGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:22:47.150251Z"},"content_sha256":"a917523a3d6eed87e1ee7994245d5c7e16c1032ec1eb7bf888213b27ee9b7e6f","schema_version":"1.0","event_id":"sha256:a917523a3d6eed87e1ee7994245d5c7e16c1032ec1eb7bf888213b27ee9b7e6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GOJEXPISLXDWH57F33HRXOLQHA","target":"graph","payload":{"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"},"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:02:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t5lrYqB0FPu8susmLXFd/bFewIZ3YRwdj4/bxdHUTZTVbpJ4pSGciPfpnf2rH+p6YJd0VQrRO96yQuuv7zeJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:22:47.150674Z"},"content_sha256":"2b7882a94613ce662453b828847cf46c8128ae7acae62323369cf26de487b77d","schema_version":"1.0","event_id":"sha256:2b7882a94613ce662453b828847cf46c8128ae7acae62323369cf26de487b77d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA/bundle.json","state_url":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOJEXPISLXDWH57F33HRXOLQHA/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-07T17:22:47Z","links":{"resolver":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA","bundle":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA/bundle.json","state":"https://pith.science/pith/GOJEXPISLXDWH57F33HRXOLQHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOJEXPISLXDWH57F33HRXOLQHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GOJEXPISLXDWH57F33HRXOLQHA","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":"bcd9f089d64a158346d1ec50fbc24a7d34658f2ff47f424f183f616f8733b44a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-09-27T13:34:25Z","title_canon_sha256":"e51c62464ac56896d60953b9b969943d769f390a210af97f040bdc8bdfece6bf"},"schema_version":"1.0","source":{"id":"1609.08431","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.08431","created_at":"2026-05-18T01:02:21Z"},{"alias_kind":"arxiv_version","alias_value":"1609.08431v2","created_at":"2026-05-18T01:02:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08431","created_at":"2026-05-18T01:02:21Z"},{"alias_kind":"pith_short_12","alias_value":"GOJEXPISLXDW","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GOJEXPISLXDWH57F","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GOJEXPIS","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:2b7882a94613ce662453b828847cf46c8128ae7acae62323369cf26de487b77d","target":"graph","created_at":"2026-05-18T01:02:21Z","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":"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","authors_text":"Kaustubh Beedkar, Rainer Gemulla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-09-27T13:34:25Z","title":"DESQ: Frequent Sequence Mining with Subsequence Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08431","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:a917523a3d6eed87e1ee7994245d5c7e16c1032ec1eb7bf888213b27ee9b7e6f","target":"record","created_at":"2026-05-18T01:02:21Z","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":"bcd9f089d64a158346d1ec50fbc24a7d34658f2ff47f424f183f616f8733b44a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-09-27T13:34:25Z","title_canon_sha256":"e51c62464ac56896d60953b9b969943d769f390a210af97f040bdc8bdfece6bf"},"schema_version":"1.0","source":{"id":"1609.08431","kind":"arxiv","version":2}},"canonical_sha256":"33924bbd125dc763f7e5decf1bb97038374b2e594f65604e19916150954b9962","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33924bbd125dc763f7e5decf1bb97038374b2e594f65604e19916150954b9962","first_computed_at":"2026-05-18T01:02:21.967500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:21.967500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"INfm4HNUYkQRwoLlZDzM1i+JcEWGjItP2Ebv72OX+Aj/7XxbaUR5xfXLMOiF+g0ukF+FHL+dbby5ZvBC7F6rBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:21.968149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.08431","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a917523a3d6eed87e1ee7994245d5c7e16c1032ec1eb7bf888213b27ee9b7e6f","sha256:2b7882a94613ce662453b828847cf46c8128ae7acae62323369cf26de487b77d"],"state_sha256":"1c9718298b43ec7f01d113bb4d500971e5270c7971013e4a79f5ab422047b1ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bCeyBXsWogV9Wudmo2dx9ILWYlA4Y150Lj34ed/8hP2uw7UMNngarZuc/orR2jBvFpBj31nBImK10A/toBvhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:22:47.153624Z","bundle_sha256":"a833a4000912fe44d49d7415daf5a86e827e32b0cfc7d9630af35a5b40a45cf5"}}