{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:TSON3LDD46HDUN3I2HC736IPPH","short_pith_number":"pith:TSON3LDD","canonical_record":{"source":{"id":"2209.13501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-09-27T16:17:58Z","cross_cats_sorted":[],"title_canon_sha256":"1316dc05c2a09b0f5c8ca847a2466902d331a7dd758d265657c4e1970257190f","abstract_canon_sha256":"093785e789ac05bf027c3f6cca99e7791a331f626dff8c399478c5dba2eed17d"},"schema_version":"1.0"},"canonical_sha256":"9c9cddac63e78e3a3768d1c5fdf90f79c98ee13871b8bea01fddf3812a848c3b","source":{"kind":"arxiv","id":"2209.13501","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.13501","created_at":"2026-07-05T05:01:33Z"},{"alias_kind":"arxiv_version","alias_value":"2209.13501v1","created_at":"2026-07-05T05:01:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.13501","created_at":"2026-07-05T05:01:33Z"},{"alias_kind":"pith_short_12","alias_value":"TSON3LDD46HD","created_at":"2026-07-05T05:01:33Z"},{"alias_kind":"pith_short_16","alias_value":"TSON3LDD46HDUN3I","created_at":"2026-07-05T05:01:33Z"},{"alias_kind":"pith_short_8","alias_value":"TSON3LDD","created_at":"2026-07-05T05:01:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:TSON3LDD46HDUN3I2HC736IPPH","target":"record","payload":{"canonical_record":{"source":{"id":"2209.13501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-09-27T16:17:58Z","cross_cats_sorted":[],"title_canon_sha256":"1316dc05c2a09b0f5c8ca847a2466902d331a7dd758d265657c4e1970257190f","abstract_canon_sha256":"093785e789ac05bf027c3f6cca99e7791a331f626dff8c399478c5dba2eed17d"},"schema_version":"1.0"},"canonical_sha256":"9c9cddac63e78e3a3768d1c5fdf90f79c98ee13871b8bea01fddf3812a848c3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:01:33.169530Z","signature_b64":"cj74Td4OGRfuMzyxA8CqzDlU/u7kSpYIzLr7eo8Y67PcNfHccenqydLDVls6xBo8wD41QIwNJhRh6EKCyaH4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c9cddac63e78e3a3768d1c5fdf90f79c98ee13871b8bea01fddf3812a848c3b","last_reissued_at":"2026-07-05T05:01:33.169194Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:01:33.169194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2209.13501","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:01:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NdcFTPyjc8Z7xPzHOj2zs/a57GZU/OSBVD/qV2+IMxvLXfmBgmUjldOI1kugSUYpJpyluKztR2Fk8Ftx2zdcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:40:32.570152Z"},"content_sha256":"22cfc537785e47b70a7da741930585969017bfb0fe809f47a6c7b243cc8f31c7","schema_version":"1.0","event_id":"sha256:22cfc537785e47b70a7da741930585969017bfb0fe809f47a6c7b243cc8f31c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:TSON3LDD46HDUN3I2HC736IPPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Totally-ordered Sequential Rules for Utility Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chunkai Zhang, Maohua Lyu, Philip S. Yu, Wensheng Gan","submitted_at":"2022-09-27T16:17:58Z","abstract_excerpt":"High utility sequential pattern mining (HUSPM) is a significant and valuable activity in knowledge discovery and data analytics with many real-world applications. In some cases, HUSPM can not provide an excellent measure to predict what will happen. High utility sequential rule mining (HUSRM) discovers high utility and high confidence sequential rules, allowing it to solve the problem in HUSPM. All existing HUSRM algorithms aim to find high-utility partially-ordered sequential rules (HUSRs), which are not consistent with reality and may generate fake HUSRs. Therefore, in this paper, we formula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.13501","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/2209.13501/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:01:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjMfPiyyA9jwW2bh5AKbZkmRu074MWVC12JW5n6rBSyxlUUUqO6J3amoDutDlBLPY5M3kI8fS+FmILP9tS+kAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:40:32.570544Z"},"content_sha256":"1b85c5298e5c17de004f21e52f26aaa83cee024918ce8963136e0c7b31c09ba1","schema_version":"1.0","event_id":"sha256:1b85c5298e5c17de004f21e52f26aaa83cee024918ce8963136e0c7b31c09ba1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSON3LDD46HDUN3I2HC736IPPH/bundle.json","state_url":"https://pith.science/pith/TSON3LDD46HDUN3I2HC736IPPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSON3LDD46HDUN3I2HC736IPPH/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-04T04:40:32Z","links":{"resolver":"https://pith.science/pith/TSON3LDD46HDUN3I2HC736IPPH","bundle":"https://pith.science/pith/TSON3LDD46HDUN3I2HC736IPPH/bundle.json","state":"https://pith.science/pith/TSON3LDD46HDUN3I2HC736IPPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSON3LDD46HDUN3I2HC736IPPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:TSON3LDD46HDUN3I2HC736IPPH","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":"093785e789ac05bf027c3f6cca99e7791a331f626dff8c399478c5dba2eed17d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-09-27T16:17:58Z","title_canon_sha256":"1316dc05c2a09b0f5c8ca847a2466902d331a7dd758d265657c4e1970257190f"},"schema_version":"1.0","source":{"id":"2209.13501","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.13501","created_at":"2026-07-05T05:01:33Z"},{"alias_kind":"arxiv_version","alias_value":"2209.13501v1","created_at":"2026-07-05T05:01:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.13501","created_at":"2026-07-05T05:01:33Z"},{"alias_kind":"pith_short_12","alias_value":"TSON3LDD46HD","created_at":"2026-07-05T05:01:33Z"},{"alias_kind":"pith_short_16","alias_value":"TSON3LDD46HDUN3I","created_at":"2026-07-05T05:01:33Z"},{"alias_kind":"pith_short_8","alias_value":"TSON3LDD","created_at":"2026-07-05T05:01:33Z"}],"graph_snapshots":[{"event_id":"sha256:1b85c5298e5c17de004f21e52f26aaa83cee024918ce8963136e0c7b31c09ba1","target":"graph","created_at":"2026-07-05T05:01:33Z","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/2209.13501/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"High utility sequential pattern mining (HUSPM) is a significant and valuable activity in knowledge discovery and data analytics with many real-world applications. In some cases, HUSPM can not provide an excellent measure to predict what will happen. High utility sequential rule mining (HUSRM) discovers high utility and high confidence sequential rules, allowing it to solve the problem in HUSPM. All existing HUSRM algorithms aim to find high-utility partially-ordered sequential rules (HUSRs), which are not consistent with reality and may generate fake HUSRs. Therefore, in this paper, we formula","authors_text":"Chunkai Zhang, Maohua Lyu, Philip S. Yu, Wensheng Gan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-09-27T16:17:58Z","title":"Totally-ordered Sequential Rules for Utility Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.13501","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:22cfc537785e47b70a7da741930585969017bfb0fe809f47a6c7b243cc8f31c7","target":"record","created_at":"2026-07-05T05:01:33Z","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":"093785e789ac05bf027c3f6cca99e7791a331f626dff8c399478c5dba2eed17d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-09-27T16:17:58Z","title_canon_sha256":"1316dc05c2a09b0f5c8ca847a2466902d331a7dd758d265657c4e1970257190f"},"schema_version":"1.0","source":{"id":"2209.13501","kind":"arxiv","version":1}},"canonical_sha256":"9c9cddac63e78e3a3768d1c5fdf90f79c98ee13871b8bea01fddf3812a848c3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c9cddac63e78e3a3768d1c5fdf90f79c98ee13871b8bea01fddf3812a848c3b","first_computed_at":"2026-07-05T05:01:33.169194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:01:33.169194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cj74Td4OGRfuMzyxA8CqzDlU/u7kSpYIzLr7eo8Y67PcNfHccenqydLDVls6xBo8wD41QIwNJhRh6EKCyaH4AA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:01:33.169530Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.13501","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22cfc537785e47b70a7da741930585969017bfb0fe809f47a6c7b243cc8f31c7","sha256:1b85c5298e5c17de004f21e52f26aaa83cee024918ce8963136e0c7b31c09ba1"],"state_sha256":"d922e29aa9f90fadf4dbcd2de061752cc5af6cb4a3efe33e748fc2c8928f6c28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0NF6E5crKDQeFdViWD4/d9kwHhnrgvkWPgKsaTjNuUawHeTu49QGsw2WWylnal21x6gXBoNcsN7PQVRhojdABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T04:40:32.573285Z","bundle_sha256":"4f57eee42b30ef35d0f64f79d18609d73553b2b420c0e2c3e7e430092467520b"}}