{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:4JXT2SQUTL57OE2IKKH2T3JJOZ","short_pith_number":"pith:4JXT2SQU","canonical_record":{"source":{"id":"2212.14255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-12-29T10:56:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5d933c7b00d49ec0f5c609e44cb36584e69861802411adbe64ead932347a2657","abstract_canon_sha256":"e1e8d98ca9f1b1890315b526193c2694fe2dc6d1a3e2ed5431a79eda9bbce875"},"schema_version":"1.0"},"canonical_sha256":"e26f3d4a149afbf71348528fa9ed297675387c31f42a397769d645716584709f","source":{"kind":"arxiv","id":"2212.14255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.14255","created_at":"2026-07-05T05:29:08Z"},{"alias_kind":"arxiv_version","alias_value":"2212.14255v1","created_at":"2026-07-05T05:29:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.14255","created_at":"2026-07-05T05:29:08Z"},{"alias_kind":"pith_short_12","alias_value":"4JXT2SQUTL57","created_at":"2026-07-05T05:29:08Z"},{"alias_kind":"pith_short_16","alias_value":"4JXT2SQUTL57OE2I","created_at":"2026-07-05T05:29:08Z"},{"alias_kind":"pith_short_8","alias_value":"4JXT2SQU","created_at":"2026-07-05T05:29:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:4JXT2SQUTL57OE2IKKH2T3JJOZ","target":"record","payload":{"canonical_record":{"source":{"id":"2212.14255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-12-29T10:56:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5d933c7b00d49ec0f5c609e44cb36584e69861802411adbe64ead932347a2657","abstract_canon_sha256":"e1e8d98ca9f1b1890315b526193c2694fe2dc6d1a3e2ed5431a79eda9bbce875"},"schema_version":"1.0"},"canonical_sha256":"e26f3d4a149afbf71348528fa9ed297675387c31f42a397769d645716584709f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:29:08.132074Z","signature_b64":"7o7JzB1VqERKgvDRvdz07gAnOGmgsgraELCmMXPmd6UJnk8VEZsGXJMF4WR1RCTgDcsuT/uF+GsK9zOxcoeyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e26f3d4a149afbf71348528fa9ed297675387c31f42a397769d645716584709f","last_reissued_at":"2026-07-05T05:29:08.131683Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:29:08.131683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.14255","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:29:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZQcMRzHrj8wbz7RX6NVlx/VnF3WNF1ZTaFRI/vXLqWEYZplyRyr2yCX0C2CSoMHqdbETVeovLgbtAXVOhFWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:51:24.767002Z"},"content_sha256":"cc1beeb76f5f59f4512b700f17ded7a306fea6ce8f4ba6a85f636f41a8b57250","schema_version":"1.0","event_id":"sha256:cc1beeb76f5f59f4512b700f17ded7a306fea6ce8f4ba6a85f636f41a8b57250"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:4JXT2SQUTL57OE2IKKH2T3JJOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HUSP-SP: Faster Utility Mining on Sequence Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Chunkai Zhang, Philip S. Yu, Wensheng Gan, Yuting Yang, Zilin Du","submitted_at":"2022-12-29T10:56:17Z","abstract_excerpt":"High-utility sequential pattern mining (HUSPM) has emerged as an important topic due to its wide application and considerable popularity. However, due to the combinatorial explosion of the search space when the HUSPM problem encounters a low utility threshold or large-scale data, it may be time-consuming and memory-costly to address the HUSPM problem. Several algorithms have been proposed for addressing this problem, but they still cost a lot in terms of running time and memory usage. In this paper, to further solve this problem efficiently, we design a compact structure called sequence projec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.14255","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/2212.14255/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:29:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dWwuFbMuBoqa8gzRCMRH43F6IuklH30pr5wk2kztxIvXQ4ch4D2f4TzzHBw9rrEby3i/Cv2snwWYmACrzeYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T04:51:24.767920Z"},"content_sha256":"7634db4ac74b4c81dad47a627854e31625c28831df79b18f8ec358cb403542a1","schema_version":"1.0","event_id":"sha256:7634db4ac74b4c81dad47a627854e31625c28831df79b18f8ec358cb403542a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JXT2SQUTL57OE2IKKH2T3JJOZ/bundle.json","state_url":"https://pith.science/pith/4JXT2SQUTL57OE2IKKH2T3JJOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JXT2SQUTL57OE2IKKH2T3JJOZ/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:51:24Z","links":{"resolver":"https://pith.science/pith/4JXT2SQUTL57OE2IKKH2T3JJOZ","bundle":"https://pith.science/pith/4JXT2SQUTL57OE2IKKH2T3JJOZ/bundle.json","state":"https://pith.science/pith/4JXT2SQUTL57OE2IKKH2T3JJOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JXT2SQUTL57OE2IKKH2T3JJOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:4JXT2SQUTL57OE2IKKH2T3JJOZ","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":"e1e8d98ca9f1b1890315b526193c2694fe2dc6d1a3e2ed5431a79eda9bbce875","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-12-29T10:56:17Z","title_canon_sha256":"5d933c7b00d49ec0f5c609e44cb36584e69861802411adbe64ead932347a2657"},"schema_version":"1.0","source":{"id":"2212.14255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.14255","created_at":"2026-07-05T05:29:08Z"},{"alias_kind":"arxiv_version","alias_value":"2212.14255v1","created_at":"2026-07-05T05:29:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.14255","created_at":"2026-07-05T05:29:08Z"},{"alias_kind":"pith_short_12","alias_value":"4JXT2SQUTL57","created_at":"2026-07-05T05:29:08Z"},{"alias_kind":"pith_short_16","alias_value":"4JXT2SQUTL57OE2I","created_at":"2026-07-05T05:29:08Z"},{"alias_kind":"pith_short_8","alias_value":"4JXT2SQU","created_at":"2026-07-05T05:29:08Z"}],"graph_snapshots":[{"event_id":"sha256:7634db4ac74b4c81dad47a627854e31625c28831df79b18f8ec358cb403542a1","target":"graph","created_at":"2026-07-05T05:29: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/2212.14255/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 emerged as an important topic due to its wide application and considerable popularity. However, due to the combinatorial explosion of the search space when the HUSPM problem encounters a low utility threshold or large-scale data, it may be time-consuming and memory-costly to address the HUSPM problem. Several algorithms have been proposed for addressing this problem, but they still cost a lot in terms of running time and memory usage. In this paper, to further solve this problem efficiently, we design a compact structure called sequence projec","authors_text":"Chunkai Zhang, Philip S. Yu, Wensheng Gan, Yuting Yang, Zilin Du","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-12-29T10:56:17Z","title":"HUSP-SP: Faster Utility Mining on Sequence Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.14255","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:cc1beeb76f5f59f4512b700f17ded7a306fea6ce8f4ba6a85f636f41a8b57250","target":"record","created_at":"2026-07-05T05:29: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":"e1e8d98ca9f1b1890315b526193c2694fe2dc6d1a3e2ed5431a79eda9bbce875","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-12-29T10:56:17Z","title_canon_sha256":"5d933c7b00d49ec0f5c609e44cb36584e69861802411adbe64ead932347a2657"},"schema_version":"1.0","source":{"id":"2212.14255","kind":"arxiv","version":1}},"canonical_sha256":"e26f3d4a149afbf71348528fa9ed297675387c31f42a397769d645716584709f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e26f3d4a149afbf71348528fa9ed297675387c31f42a397769d645716584709f","first_computed_at":"2026-07-05T05:29:08.131683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:29:08.131683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7o7JzB1VqERKgvDRvdz07gAnOGmgsgraELCmMXPmd6UJnk8VEZsGXJMF4WR1RCTgDcsuT/uF+GsK9zOxcoeyAw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:29:08.132074Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.14255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc1beeb76f5f59f4512b700f17ded7a306fea6ce8f4ba6a85f636f41a8b57250","sha256:7634db4ac74b4c81dad47a627854e31625c28831df79b18f8ec358cb403542a1"],"state_sha256":"31972d33df757f8a8ffb7461502f14f14f17acf8d1bf6f26c0b41c3ddd5ae8f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a4nGkYfXxdIbDTb2mBUYzh9kr8g9EbS4CfKw3n/wmTfnnjvRvanKYDAuX51az2MvPwxU+OhIe6WcuZzlIUJICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T04:51:24.786173Z","bundle_sha256":"666356b9326cf77ca58ae6e38769d2772d478c1c8961a493d37fa58b500411c0"}}