{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XNFV5S27LVTV2PSDPBL5R4H3WS","short_pith_number":"pith:XNFV5S27","canonical_record":{"source":{"id":"2011.13454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-11-26T19:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"437146faf675ca5f62c97b6d22afb2493c85f2692e1b6571e9431051545f1b23","abstract_canon_sha256":"cfd1630e5d04eb2d476b4d04685c950dd54ed67888121c3ba9ef81cfddd058a7"},"schema_version":"1.0"},"canonical_sha256":"bb4b5ecb5f5d675d3e437857d8f0fbb4bd0a18c3a49ac1d41b77c6036118624f","source":{"kind":"arxiv","id":"2011.13454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.13454","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"2011.13454v1","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13454","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"XNFV5S27LVTV","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"pith_short_16","alias_value":"XNFV5S27LVTV2PSD","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"pith_short_8","alias_value":"XNFV5S27","created_at":"2026-07-05T01:54:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XNFV5S27LVTV2PSDPBL5R4H3WS","target":"record","payload":{"canonical_record":{"source":{"id":"2011.13454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-11-26T19:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"437146faf675ca5f62c97b6d22afb2493c85f2692e1b6571e9431051545f1b23","abstract_canon_sha256":"cfd1630e5d04eb2d476b4d04685c950dd54ed67888121c3ba9ef81cfddd058a7"},"schema_version":"1.0"},"canonical_sha256":"bb4b5ecb5f5d675d3e437857d8f0fbb4bd0a18c3a49ac1d41b77c6036118624f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:54.370456Z","signature_b64":"kzMXZ+wUgnYt+U+qvyozQnrYMNE7ckZBtGnajjRIjOEv4YdkV+TL68rNwuF478UTVxLsNlDNolr+wzrlDvFKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb4b5ecb5f5d675d3e437857d8f0fbb4bd0a18c3a49ac1d41b77c6036118624f","last_reissued_at":"2026-07-05T01:54:54.369938Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:54.369938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.13454","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-05T01:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfR+YNdUqqSVfVuzIZ0KiRhXLL6QxeEqUHO/ztrrH0YsNOznuPkra0oue/HRdVTLccCOLxPc4YuhLHnBRLaxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:01:03.555913Z"},"content_sha256":"8c155d48b4ee83b53c3d0e8386774add583f59dac3a2e8dbcbef4d42b7e50c6b","schema_version":"1.0","event_id":"sha256:8c155d48b4ee83b53c3d0e8386774add583f59dac3a2e8dbcbef4d42b7e50c6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XNFV5S27LVTV2PSDPBL5R4H3WS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TKUS: Mining Top-K High-Utility Sequential Patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chunkai Zhang, Philip S. Yu, Wensheng Gan, Zilin Du","submitted_at":"2020-11-26T19:36:20Z","abstract_excerpt":"High-utility sequential pattern mining (HUSPM) has recently emerged as a focus of intense research interest. The main task of HUSPM is to find all subsequences, within a quantitative sequential database, that have high utility with respect to a user-defined minimum utility threshold. However, it is difficult to specify the minimum utility threshold, especially when database features, which are invisible in most cases, are not understood. To handle this problem, top-k HUSPM was proposed. Up to now, only very preliminary work has been conducted to capture top-k HUSPs, and existing strategies req"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13454","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/2011.13454/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-05T01:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DKsfMNUR2jsKEgnAgZo1WUTsH52xiVBu50tVBpzTQph39AmpDONwzG2Hf8soOU+RmZPQUUUshnFJGuJCA8ohBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:01:03.556423Z"},"content_sha256":"59e2ba0fa8ac183e0e9593a746d062c8d446f0ea4a6caff92bc044d996112d4a","schema_version":"1.0","event_id":"sha256:59e2ba0fa8ac183e0e9593a746d062c8d446f0ea4a6caff92bc044d996112d4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNFV5S27LVTV2PSDPBL5R4H3WS/bundle.json","state_url":"https://pith.science/pith/XNFV5S27LVTV2PSDPBL5R4H3WS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNFV5S27LVTV2PSDPBL5R4H3WS/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-04T06:01:03Z","links":{"resolver":"https://pith.science/pith/XNFV5S27LVTV2PSDPBL5R4H3WS","bundle":"https://pith.science/pith/XNFV5S27LVTV2PSDPBL5R4H3WS/bundle.json","state":"https://pith.science/pith/XNFV5S27LVTV2PSDPBL5R4H3WS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNFV5S27LVTV2PSDPBL5R4H3WS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XNFV5S27LVTV2PSDPBL5R4H3WS","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":"cfd1630e5d04eb2d476b4d04685c950dd54ed67888121c3ba9ef81cfddd058a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-11-26T19:36:20Z","title_canon_sha256":"437146faf675ca5f62c97b6d22afb2493c85f2692e1b6571e9431051545f1b23"},"schema_version":"1.0","source":{"id":"2011.13454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.13454","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"2011.13454v1","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13454","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"XNFV5S27LVTV","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"pith_short_16","alias_value":"XNFV5S27LVTV2PSD","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"pith_short_8","alias_value":"XNFV5S27","created_at":"2026-07-05T01:54:54Z"}],"graph_snapshots":[{"event_id":"sha256:59e2ba0fa8ac183e0e9593a746d062c8d446f0ea4a6caff92bc044d996112d4a","target":"graph","created_at":"2026-07-05T01:54:54Z","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/2011.13454/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"High-utility sequential pattern mining (HUSPM) has recently emerged as a focus of intense research interest. The main task of HUSPM is to find all subsequences, within a quantitative sequential database, that have high utility with respect to a user-defined minimum utility threshold. However, it is difficult to specify the minimum utility threshold, especially when database features, which are invisible in most cases, are not understood. To handle this problem, top-k HUSPM was proposed. Up to now, only very preliminary work has been conducted to capture top-k HUSPs, and existing strategies req","authors_text":"Chunkai Zhang, Philip S. Yu, Wensheng Gan, Zilin Du","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-11-26T19:36:20Z","title":"TKUS: Mining Top-K High-Utility Sequential Patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13454","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:8c155d48b4ee83b53c3d0e8386774add583f59dac3a2e8dbcbef4d42b7e50c6b","target":"record","created_at":"2026-07-05T01:54:54Z","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":"cfd1630e5d04eb2d476b4d04685c950dd54ed67888121c3ba9ef81cfddd058a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-11-26T19:36:20Z","title_canon_sha256":"437146faf675ca5f62c97b6d22afb2493c85f2692e1b6571e9431051545f1b23"},"schema_version":"1.0","source":{"id":"2011.13454","kind":"arxiv","version":1}},"canonical_sha256":"bb4b5ecb5f5d675d3e437857d8f0fbb4bd0a18c3a49ac1d41b77c6036118624f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb4b5ecb5f5d675d3e437857d8f0fbb4bd0a18c3a49ac1d41b77c6036118624f","first_computed_at":"2026-07-05T01:54:54.369938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:54:54.369938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kzMXZ+wUgnYt+U+qvyozQnrYMNE7ckZBtGnajjRIjOEv4YdkV+TL68rNwuF478UTVxLsNlDNolr+wzrlDvFKCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:54:54.370456Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.13454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c155d48b4ee83b53c3d0e8386774add583f59dac3a2e8dbcbef4d42b7e50c6b","sha256:59e2ba0fa8ac183e0e9593a746d062c8d446f0ea4a6caff92bc044d996112d4a"],"state_sha256":"82d768df6c0bc8ebb21e35aa92226aca562f06196c3c03cb99a3fcd8cea5da0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cX808Sa33dxg9+XDRpN+2DcazvMNF7moNWuUkpVEIumBnMgxJFl1vzZ5VJbbZrHkfUlfkNjkfrzw1QxO9Cu2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T06:01:03.562022Z","bundle_sha256":"e4b9475f914dea931bb15d52de1e757bea38312a3f19143a7be55b59e2e2cb8e"}}