{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HGHEHAD73HQSMN72NBPAGVK6HY","short_pith_number":"pith:HGHEHAD7","canonical_record":{"source":{"id":"1712.04159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-12T08:03:50Z","cross_cats_sorted":["cs.AI","cs.DB"],"title_canon_sha256":"67b6482d44a3775528df4c1bfcbf7d0343d2ff2ec656808b4527ee283e6e4c8a","abstract_canon_sha256":"89579e94c7113c2c0cd362649d465fa5ac295d69558eeff2d78fb7daf1e66487"},"schema_version":"1.0"},"canonical_sha256":"398e43807fd9e12637fa685e03555e3e1b9cecec101b0b059d86cde7a2feffd9","source":{"kind":"arxiv","id":"1712.04159","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04159","created_at":"2026-05-18T00:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04159v2","created_at":"2026-05-18T00:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04159","created_at":"2026-05-18T00:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"HGHEHAD73HQS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGHEHAD73HQSMN72","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGHEHAD7","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HGHEHAD73HQSMN72NBPAGVK6HY","target":"record","payload":{"canonical_record":{"source":{"id":"1712.04159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-12T08:03:50Z","cross_cats_sorted":["cs.AI","cs.DB"],"title_canon_sha256":"67b6482d44a3775528df4c1bfcbf7d0343d2ff2ec656808b4527ee283e6e4c8a","abstract_canon_sha256":"89579e94c7113c2c0cd362649d465fa5ac295d69558eeff2d78fb7daf1e66487"},"schema_version":"1.0"},"canonical_sha256":"398e43807fd9e12637fa685e03555e3e1b9cecec101b0b059d86cde7a2feffd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:14.438713Z","signature_b64":"rErz0+rG5b4gu1lSqzzH6DqzDJZ04gmwiV8WdcTaTzPcNsBBZ4Upp02Mzbi8U5NWAHjn0bOimzwntdp3uq70AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"398e43807fd9e12637fa685e03555e3e1b9cecec101b0b059d86cde7a2feffd9","last_reissued_at":"2026-05-18T00:05:14.438141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:14.438141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.04159","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-18T00:05:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2PKrD2AHRVHF/lhJePE/PwwAi7gk79DVwkaA4izjlK5SDsu/Qt4YNOT7zfW93N6BvrIhArp59nA8AFo6qbUADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:46:25.310859Z"},"content_sha256":"3415d5073abbcf31f982820f6d9beaf5e660d2cae779884dc2f015f6b501a035","schema_version":"1.0","event_id":"sha256:3415d5073abbcf31f982820f6d9beaf5e660d2cae779884dc2f015f6b501a035"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HGHEHAD73HQSMN72NBPAGVK6HY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mining Non-Redundant Local Process Models From Sequence Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.DS","authors_text":"Marlon Dumas, Niek Tax","submitted_at":"2017-12-12T08:03:50Z","abstract_excerpt":"Sequential pattern mining techniques extract patterns corresponding to frequent subsequences from a sequence database. A practical limitation of these techniques is that they overload the user with too many patterns. Local Process Model (LPM) mining is an alternative approach coming from the field of process mining. While in traditional sequential pattern mining, a pattern describes one subsequence, an LPM captures a set of subsequences. Also, while traditional sequential patterns only match subsequences that are observed in the sequence database, an LPM may capture subsequences that are not e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04159","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-18T00:05:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zaf/VUMktMqx3Iaa4eXJxA2csZjDet0G6aTbIwrefvlBadQdte7A1WJrT+mmbXXDuqsKNigNt8aRh+57NKMLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:46:25.311557Z"},"content_sha256":"84dcde75634b042811863ff50e5c94df9cf8a690df74213b8f9ff865a608a7a6","schema_version":"1.0","event_id":"sha256:84dcde75634b042811863ff50e5c94df9cf8a690df74213b8f9ff865a608a7a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGHEHAD73HQSMN72NBPAGVK6HY/bundle.json","state_url":"https://pith.science/pith/HGHEHAD73HQSMN72NBPAGVK6HY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGHEHAD73HQSMN72NBPAGVK6HY/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-07T01:46:25Z","links":{"resolver":"https://pith.science/pith/HGHEHAD73HQSMN72NBPAGVK6HY","bundle":"https://pith.science/pith/HGHEHAD73HQSMN72NBPAGVK6HY/bundle.json","state":"https://pith.science/pith/HGHEHAD73HQSMN72NBPAGVK6HY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGHEHAD73HQSMN72NBPAGVK6HY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HGHEHAD73HQSMN72NBPAGVK6HY","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":"89579e94c7113c2c0cd362649d465fa5ac295d69558eeff2d78fb7daf1e66487","cross_cats_sorted":["cs.AI","cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-12T08:03:50Z","title_canon_sha256":"67b6482d44a3775528df4c1bfcbf7d0343d2ff2ec656808b4527ee283e6e4c8a"},"schema_version":"1.0","source":{"id":"1712.04159","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04159","created_at":"2026-05-18T00:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04159v2","created_at":"2026-05-18T00:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04159","created_at":"2026-05-18T00:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"HGHEHAD73HQS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGHEHAD73HQSMN72","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGHEHAD7","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:84dcde75634b042811863ff50e5c94df9cf8a690df74213b8f9ff865a608a7a6","target":"graph","created_at":"2026-05-18T00:05:14Z","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":"Sequential pattern mining techniques extract patterns corresponding to frequent subsequences from a sequence database. A practical limitation of these techniques is that they overload the user with too many patterns. Local Process Model (LPM) mining is an alternative approach coming from the field of process mining. While in traditional sequential pattern mining, a pattern describes one subsequence, an LPM captures a set of subsequences. Also, while traditional sequential patterns only match subsequences that are observed in the sequence database, an LPM may capture subsequences that are not e","authors_text":"Marlon Dumas, Niek Tax","cross_cats":["cs.AI","cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-12T08:03:50Z","title":"Mining Non-Redundant Local Process Models From Sequence Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04159","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:3415d5073abbcf31f982820f6d9beaf5e660d2cae779884dc2f015f6b501a035","target":"record","created_at":"2026-05-18T00:05:14Z","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":"89579e94c7113c2c0cd362649d465fa5ac295d69558eeff2d78fb7daf1e66487","cross_cats_sorted":["cs.AI","cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-12T08:03:50Z","title_canon_sha256":"67b6482d44a3775528df4c1bfcbf7d0343d2ff2ec656808b4527ee283e6e4c8a"},"schema_version":"1.0","source":{"id":"1712.04159","kind":"arxiv","version":2}},"canonical_sha256":"398e43807fd9e12637fa685e03555e3e1b9cecec101b0b059d86cde7a2feffd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"398e43807fd9e12637fa685e03555e3e1b9cecec101b0b059d86cde7a2feffd9","first_computed_at":"2026-05-18T00:05:14.438141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:14.438141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rErz0+rG5b4gu1lSqzzH6DqzDJZ04gmwiV8WdcTaTzPcNsBBZ4Upp02Mzbi8U5NWAHjn0bOimzwntdp3uq70AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:14.438713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04159","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3415d5073abbcf31f982820f6d9beaf5e660d2cae779884dc2f015f6b501a035","sha256:84dcde75634b042811863ff50e5c94df9cf8a690df74213b8f9ff865a608a7a6"],"state_sha256":"de0022a882e5f1b3733709af6292374291b18edc297a37da0a97b04d8bf662ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BK+yvhUdOxwZ8Dqqiy1M0lQdkpM5Re/+UBLWlKd+4GfvIax+8Iam4ki3KQjDFs4YftlwxuECRaY1660uffnnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T01:46:25.316269Z","bundle_sha256":"a338df4e6abc76c085053c0d34d0aeac86c09924081c585cf58f3f4c76e96c1b"}}