{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:WHR6WZ5UQO7TY6IJZ6MQQZWHN2","short_pith_number":"pith:WHR6WZ5U","canonical_record":{"source":{"id":"2210.15637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-10-27T17:27:23Z","cross_cats_sorted":[],"title_canon_sha256":"f5abbdcd481f8262152aff297efc878516d06b8d7fffda70e7abfccde621da39","abstract_canon_sha256":"3742b027d7ec1357499a81785b68951eb5085b94cfd60ad24cb908edfcfb5252"},"schema_version":"1.0"},"canonical_sha256":"b1e3eb67b483bf3c7909cf990866c76eb2682567528721c8da8cee887a9a9560","source":{"kind":"arxiv","id":"2210.15637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.15637","created_at":"2026-07-05T05:11:08Z"},{"alias_kind":"arxiv_version","alias_value":"2210.15637v1","created_at":"2026-07-05T05:11:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.15637","created_at":"2026-07-05T05:11:08Z"},{"alias_kind":"pith_short_12","alias_value":"WHR6WZ5UQO7T","created_at":"2026-07-05T05:11:08Z"},{"alias_kind":"pith_short_16","alias_value":"WHR6WZ5UQO7TY6IJ","created_at":"2026-07-05T05:11:08Z"},{"alias_kind":"pith_short_8","alias_value":"WHR6WZ5U","created_at":"2026-07-05T05:11:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:WHR6WZ5UQO7TY6IJZ6MQQZWHN2","target":"record","payload":{"canonical_record":{"source":{"id":"2210.15637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-10-27T17:27:23Z","cross_cats_sorted":[],"title_canon_sha256":"f5abbdcd481f8262152aff297efc878516d06b8d7fffda70e7abfccde621da39","abstract_canon_sha256":"3742b027d7ec1357499a81785b68951eb5085b94cfd60ad24cb908edfcfb5252"},"schema_version":"1.0"},"canonical_sha256":"b1e3eb67b483bf3c7909cf990866c76eb2682567528721c8da8cee887a9a9560","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:11:08.306634Z","signature_b64":"Dta3akyQDmS9json98E2ww4o6JmzrULM0yJAK5pYil57xnsjCRHfMIZxmLo9E8uXvTtBE9uSIDnvhMiX3o3CCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1e3eb67b483bf3c7909cf990866c76eb2682567528721c8da8cee887a9a9560","last_reissued_at":"2026-07-05T05:11:08.306198Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:11:08.306198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.15637","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-07-05T05:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ou69OqI8xhm99pVBx8x08eZypXqLok0413dGrCx68qKiH0OClcWUawubIiqirJW60GZ9HC0beW+sTDkArhdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:17:30.863991Z"},"content_sha256":"cac2179642afcd3af014a41511669c4d155a7bea73fe9900349ab3c9fc0b3a14","schema_version":"1.0","event_id":"sha256:cac2179642afcd3af014a41511669c4d155a7bea73fe9900349ab3c9fc0b3a14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:WHR6WZ5UQO7TY6IJZ6MQQZWHN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Correlated Sequential Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chien-Ming Chen, Lili Chen, Wensheng Gan","submitted_at":"2022-10-27T17:27:23Z","abstract_excerpt":"The goal of high-utility sequential pattern mining (HUSPM) is to efficiently discover profitable or useful sequential patterns in a large number of sequences. However, simply being aware of utility-eligible patterns is insufficient for making predictions. To compensate for this deficiency, high-utility sequential rule mining (HUSRM) is designed to explore the confidence or probability of predicting the occurrence of consequence sequential patterns based on the appearance of premise sequential patterns. It has numerous applications, such as product recommendation and weather prediction. However"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.15637","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.15637/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XEDZAvgUarDpRmQpt3UaG2OL0eNPi6gCZ0XNzRfURvVuUEGzR6ZCwATnYFkdrgvzRxRE0Xyh83dZTSPfJLDWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:17:30.864380Z"},"content_sha256":"672f4b930036636c79fe618e73ba0f8db66160a41185d66e8055f7cfd1956c8c","schema_version":"1.0","event_id":"sha256:672f4b930036636c79fe618e73ba0f8db66160a41185d66e8055f7cfd1956c8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHR6WZ5UQO7TY6IJZ6MQQZWHN2/bundle.json","state_url":"https://pith.science/pith/WHR6WZ5UQO7TY6IJZ6MQQZWHN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHR6WZ5UQO7TY6IJZ6MQQZWHN2/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-08-04T08:17:30Z","links":{"resolver":"https://pith.science/pith/WHR6WZ5UQO7TY6IJZ6MQQZWHN2","bundle":"https://pith.science/pith/WHR6WZ5UQO7TY6IJZ6MQQZWHN2/bundle.json","state":"https://pith.science/pith/WHR6WZ5UQO7TY6IJZ6MQQZWHN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHR6WZ5UQO7TY6IJZ6MQQZWHN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WHR6WZ5UQO7TY6IJZ6MQQZWHN2","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":"3742b027d7ec1357499a81785b68951eb5085b94cfd60ad24cb908edfcfb5252","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-10-27T17:27:23Z","title_canon_sha256":"f5abbdcd481f8262152aff297efc878516d06b8d7fffda70e7abfccde621da39"},"schema_version":"1.0","source":{"id":"2210.15637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.15637","created_at":"2026-07-05T05:11:08Z"},{"alias_kind":"arxiv_version","alias_value":"2210.15637v1","created_at":"2026-07-05T05:11:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.15637","created_at":"2026-07-05T05:11:08Z"},{"alias_kind":"pith_short_12","alias_value":"WHR6WZ5UQO7T","created_at":"2026-07-05T05:11:08Z"},{"alias_kind":"pith_short_16","alias_value":"WHR6WZ5UQO7TY6IJ","created_at":"2026-07-05T05:11:08Z"},{"alias_kind":"pith_short_8","alias_value":"WHR6WZ5U","created_at":"2026-07-05T05:11:08Z"}],"graph_snapshots":[{"event_id":"sha256:672f4b930036636c79fe618e73ba0f8db66160a41185d66e8055f7cfd1956c8c","target":"graph","created_at":"2026-07-05T05:11:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.15637/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The goal of high-utility sequential pattern mining (HUSPM) is to efficiently discover profitable or useful sequential patterns in a large number of sequences. However, simply being aware of utility-eligible patterns is insufficient for making predictions. To compensate for this deficiency, high-utility sequential rule mining (HUSRM) is designed to explore the confidence or probability of predicting the occurrence of consequence sequential patterns based on the appearance of premise sequential patterns. It has numerous applications, such as product recommendation and weather prediction. However","authors_text":"Chien-Ming Chen, Lili Chen, Wensheng Gan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-10-27T17:27:23Z","title":"Towards Correlated Sequential Rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.15637","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:cac2179642afcd3af014a41511669c4d155a7bea73fe9900349ab3c9fc0b3a14","target":"record","created_at":"2026-07-05T05:11:08Z","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":"3742b027d7ec1357499a81785b68951eb5085b94cfd60ad24cb908edfcfb5252","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-10-27T17:27:23Z","title_canon_sha256":"f5abbdcd481f8262152aff297efc878516d06b8d7fffda70e7abfccde621da39"},"schema_version":"1.0","source":{"id":"2210.15637","kind":"arxiv","version":1}},"canonical_sha256":"b1e3eb67b483bf3c7909cf990866c76eb2682567528721c8da8cee887a9a9560","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1e3eb67b483bf3c7909cf990866c76eb2682567528721c8da8cee887a9a9560","first_computed_at":"2026-07-05T05:11:08.306198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:11:08.306198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dta3akyQDmS9json98E2ww4o6JmzrULM0yJAK5pYil57xnsjCRHfMIZxmLo9E8uXvTtBE9uSIDnvhMiX3o3CCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:11:08.306634Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.15637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cac2179642afcd3af014a41511669c4d155a7bea73fe9900349ab3c9fc0b3a14","sha256:672f4b930036636c79fe618e73ba0f8db66160a41185d66e8055f7cfd1956c8c"],"state_sha256":"b1cf74089debfa04c57055662bc4bd9144eefa9e6bf6967cc2799b6d9989bfb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0uxb7incZOIHZ5tNqh4fV2mXdM2wsdhj0WV3vTEgpzWcfAbaZ2ukGu/LG9i3KGHgIO7EfRzC9h+VRZ2Ws+U9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T08:17:30.867264Z","bundle_sha256":"cda4ce0972a0f20a832de111610ff2619df4780a8f6a7a3c3ac748b8a57937e7"}}