{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K5Z3GR3BBV2VO54LSEKYP54ZZT","short_pith_number":"pith:K5Z3GR3B","canonical_record":{"source":{"id":"1604.01166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-05T08:15:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2fd349c053d01b3d407325d615de32ca4e1678201e89623d894b9f2b8967cebc","abstract_canon_sha256":"6d96aad6f6135fc25368bb80671bbf7f33153107427b3c55ff2d49d4e50a9781"},"schema_version":"1.0"},"canonical_sha256":"5773b347610d7557778b911587f799ccd2eb6720f5821414fa6257707cf8c115","source":{"kind":"arxiv","id":"1604.01166","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01166","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01166v1","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01166","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"K5Z3GR3BBV2V","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K5Z3GR3BBV2VO54L","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K5Z3GR3B","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K5Z3GR3BBV2VO54LSEKYP54ZZT","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-05T08:15:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2fd349c053d01b3d407325d615de32ca4e1678201e89623d894b9f2b8967cebc","abstract_canon_sha256":"6d96aad6f6135fc25368bb80671bbf7f33153107427b3c55ff2d49d4e50a9781"},"schema_version":"1.0"},"canonical_sha256":"5773b347610d7557778b911587f799ccd2eb6720f5821414fa6257707cf8c115","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:44.572164Z","signature_b64":"OxFB9hqD8fLzE9OLc+y+09cLXwzakHqbUwEo5NYjg60qFQDF2zMpureGEa2pgY2ygTZbKC1WvRI1dOodujfPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5773b347610d7557778b911587f799ccd2eb6720f5821414fa6257707cf8c115","last_reissued_at":"2026-05-18T01:17:44.571459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:44.571459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01166","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:17:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5kMRYymMJEKE8I1iALrue86VW9P12Dbx/8d4sf4Cttz9OkEc4VKOoddpbNg20XmheWl+iyIUfEQxynzGZuKWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:54:43.825355Z"},"content_sha256":"c44f16d251b1c568b6c94c9d66e78f2c30314653c8309878c26d7012fd4b3faf","schema_version":"1.0","event_id":"sha256:c44f16d251b1c568b6c94c9d66e78f2c30314653c8309878c26d7012fd4b3faf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K5Z3GR3BBV2VO54LSEKYP54ZZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Mining Frequent Sequence with Constraint Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"John O.R. Aoga, Pierre Schaus, Tias Guns","submitted_at":"2016-04-05T08:15:24Z","abstract_excerpt":"The main advantage of Constraint Programming (CP) approaches for sequential pattern mining (SPM) is their modularity, which includes the ability to add new constraints (regular expressions, length restrictions, etc). The current best CP approach for SPM uses a global constraint (module) that computes the projected database and enforces the minimum frequency; it does this with a filtering algorithm similar to the PrefixSpan method. However, the resulting system is not as scalable as some of the most advanced mining systems like Zaki's cSPADE. We show how, using techniques from both data mining "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01166","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:17:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zvi2ncco/V3pIPqkcUu/SvOvuiW8r4UCZU2utwjlFrJygEQE2dP7pzn1psNKkVJyY5pQY3f84wd3grFtzKFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:54:43.825718Z"},"content_sha256":"1aca0bf0ee03bf3b22e3b825e751929914f28f5989507d2b5cc23d53ab52a7f7","schema_version":"1.0","event_id":"sha256:1aca0bf0ee03bf3b22e3b825e751929914f28f5989507d2b5cc23d53ab52a7f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5Z3GR3BBV2VO54LSEKYP54ZZT/bundle.json","state_url":"https://pith.science/pith/K5Z3GR3BBV2VO54LSEKYP54ZZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5Z3GR3BBV2VO54LSEKYP54ZZT/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-05-28T13:54:43Z","links":{"resolver":"https://pith.science/pith/K5Z3GR3BBV2VO54LSEKYP54ZZT","bundle":"https://pith.science/pith/K5Z3GR3BBV2VO54LSEKYP54ZZT/bundle.json","state":"https://pith.science/pith/K5Z3GR3BBV2VO54LSEKYP54ZZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5Z3GR3BBV2VO54LSEKYP54ZZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K5Z3GR3BBV2VO54LSEKYP54ZZT","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":"6d96aad6f6135fc25368bb80671bbf7f33153107427b3c55ff2d49d4e50a9781","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-05T08:15:24Z","title_canon_sha256":"2fd349c053d01b3d407325d615de32ca4e1678201e89623d894b9f2b8967cebc"},"schema_version":"1.0","source":{"id":"1604.01166","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01166","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01166v1","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01166","created_at":"2026-05-18T01:17:44Z"},{"alias_kind":"pith_short_12","alias_value":"K5Z3GR3BBV2V","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K5Z3GR3BBV2VO54L","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K5Z3GR3B","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:1aca0bf0ee03bf3b22e3b825e751929914f28f5989507d2b5cc23d53ab52a7f7","target":"graph","created_at":"2026-05-18T01:17:44Z","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":"The main advantage of Constraint Programming (CP) approaches for sequential pattern mining (SPM) is their modularity, which includes the ability to add new constraints (regular expressions, length restrictions, etc). The current best CP approach for SPM uses a global constraint (module) that computes the projected database and enforces the minimum frequency; it does this with a filtering algorithm similar to the PrefixSpan method. However, the resulting system is not as scalable as some of the most advanced mining systems like Zaki's cSPADE. We show how, using techniques from both data mining ","authors_text":"John O.R. Aoga, Pierre Schaus, Tias Guns","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-05T08:15:24Z","title":"An Efficient Algorithm for Mining Frequent Sequence with Constraint Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01166","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:c44f16d251b1c568b6c94c9d66e78f2c30314653c8309878c26d7012fd4b3faf","target":"record","created_at":"2026-05-18T01:17:44Z","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":"6d96aad6f6135fc25368bb80671bbf7f33153107427b3c55ff2d49d4e50a9781","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-05T08:15:24Z","title_canon_sha256":"2fd349c053d01b3d407325d615de32ca4e1678201e89623d894b9f2b8967cebc"},"schema_version":"1.0","source":{"id":"1604.01166","kind":"arxiv","version":1}},"canonical_sha256":"5773b347610d7557778b911587f799ccd2eb6720f5821414fa6257707cf8c115","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5773b347610d7557778b911587f799ccd2eb6720f5821414fa6257707cf8c115","first_computed_at":"2026-05-18T01:17:44.571459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:44.571459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OxFB9hqD8fLzE9OLc+y+09cLXwzakHqbUwEo5NYjg60qFQDF2zMpureGEa2pgY2ygTZbKC1WvRI1dOodujfPBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:44.572164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01166","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c44f16d251b1c568b6c94c9d66e78f2c30314653c8309878c26d7012fd4b3faf","sha256:1aca0bf0ee03bf3b22e3b825e751929914f28f5989507d2b5cc23d53ab52a7f7"],"state_sha256":"7e770d04875c5a70570ffec332683c9e1388231ee8f77ff98eaad8efaf5743d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ogq8hAlTRwgUym9Fd9PYqGfimHoAY6gScilj2nNum7/t9ZqS5wY+sq6cH1ZQB3LBAnkIpnDiVLWS+Fv0jiSNAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:54:43.827912Z","bundle_sha256":"475ef4b35218c0e9008a052e7d2246ceadb984805343e1c52113ebb6642bd706"}}