{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HCKRUPSRDVZGIQ5WX2MPUK2HMC","short_pith_number":"pith:HCKRUPSR","canonical_record":{"source":{"id":"2303.14510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-03-25T16:19:39Z","cross_cats_sorted":[],"title_canon_sha256":"1c211ab2203aefabc1e1e8a8eb588164e5a628b68b0cf27d6f614cb6e032f319","abstract_canon_sha256":"b5f538c3e271b5d232e58c89fb5e1b09e6caa60266d222887ec8feda42387da0"},"schema_version":"1.0"},"canonical_sha256":"38951a3e511d726443b6be98fa2b47609946391d085952dacbb1f7cb1d9ef37d","source":{"kind":"arxiv","id":"2303.14510","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.14510","created_at":"2026-07-05T05:54:42Z"},{"alias_kind":"arxiv_version","alias_value":"2303.14510v1","created_at":"2026-07-05T05:54:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.14510","created_at":"2026-07-05T05:54:42Z"},{"alias_kind":"pith_short_12","alias_value":"HCKRUPSRDVZG","created_at":"2026-07-05T05:54:42Z"},{"alias_kind":"pith_short_16","alias_value":"HCKRUPSRDVZGIQ5W","created_at":"2026-07-05T05:54:42Z"},{"alias_kind":"pith_short_8","alias_value":"HCKRUPSR","created_at":"2026-07-05T05:54:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HCKRUPSRDVZGIQ5WX2MPUK2HMC","target":"record","payload":{"canonical_record":{"source":{"id":"2303.14510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-03-25T16:19:39Z","cross_cats_sorted":[],"title_canon_sha256":"1c211ab2203aefabc1e1e8a8eb588164e5a628b68b0cf27d6f614cb6e032f319","abstract_canon_sha256":"b5f538c3e271b5d232e58c89fb5e1b09e6caa60266d222887ec8feda42387da0"},"schema_version":"1.0"},"canonical_sha256":"38951a3e511d726443b6be98fa2b47609946391d085952dacbb1f7cb1d9ef37d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:54:42.687921Z","signature_b64":"TESY1AjsaVgMQMYmm9rs/pLLo4QRFAgH/ewn9G8Rak2iwC7qeqEpLDqrzFizP2vrN18/EH+4sOPp1pOQI1f8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38951a3e511d726443b6be98fa2b47609946391d085952dacbb1f7cb1d9ef37d","last_reissued_at":"2026-07-05T05:54:42.687497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:54:42.687497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.14510","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:54:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PeHOrCONCLefqtiHD+OUiyjPW1yw2nV+sGwP4EYNmRglupKx/ZfCbRnes3zO/cx1uMvYdTR5BQAkwEJT92aaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:11:37.423285Z"},"content_sha256":"8df0fa1cdc98201b0a64db6b0dd5b034d3a7f39211d5f01e9e0e345c72c62c08","schema_version":"1.0","event_id":"sha256:8df0fa1cdc98201b0a64db6b0dd5b034d3a7f39211d5f01e9e0e345c72c62c08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HCKRUPSRDVZGIQ5WX2MPUK2HMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Targeted Mining of Top-k High Utility Itemsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jinbao Miao, Philippe Fournier-Viger, Shan Huang, Wensheng Gan, Xuming Han","submitted_at":"2023-03-25T16:19:39Z","abstract_excerpt":"Finding high-importance patterns in data is an emerging data mining task known as High-utility itemset mining (HUIM). Given a minimum utility threshold, a HUIM algorithm extracts all the high-utility itemsets (HUIs) whose utility values are not less than the threshold. This can reveal a wealth of useful information, but the precise needs of users are not well taken into account. In particular, users often want to focus on patterns that have some specific items rather than find all patterns. To overcome that difficulty, targeted mining has emerged, focusing on user preferences, but only prelimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.14510","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/2303.14510/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:54:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wbs+JSlpDlimBHPJ40HFAu4Qvu+X5G3hVY5msmQKkjBHoY8wXXNezjbw5wtV8eRL2xiXDKaP3XjT4YEZiZUtBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T06:11:37.423793Z"},"content_sha256":"500ce69d91268a528b3b8022de65f23e9b0cbdfefc84a068a9f783564ca5c8b3","schema_version":"1.0","event_id":"sha256:500ce69d91268a528b3b8022de65f23e9b0cbdfefc84a068a9f783564ca5c8b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCKRUPSRDVZGIQ5WX2MPUK2HMC/bundle.json","state_url":"https://pith.science/pith/HCKRUPSRDVZGIQ5WX2MPUK2HMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCKRUPSRDVZGIQ5WX2MPUK2HMC/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:11:37Z","links":{"resolver":"https://pith.science/pith/HCKRUPSRDVZGIQ5WX2MPUK2HMC","bundle":"https://pith.science/pith/HCKRUPSRDVZGIQ5WX2MPUK2HMC/bundle.json","state":"https://pith.science/pith/HCKRUPSRDVZGIQ5WX2MPUK2HMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCKRUPSRDVZGIQ5WX2MPUK2HMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HCKRUPSRDVZGIQ5WX2MPUK2HMC","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":"b5f538c3e271b5d232e58c89fb5e1b09e6caa60266d222887ec8feda42387da0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-03-25T16:19:39Z","title_canon_sha256":"1c211ab2203aefabc1e1e8a8eb588164e5a628b68b0cf27d6f614cb6e032f319"},"schema_version":"1.0","source":{"id":"2303.14510","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.14510","created_at":"2026-07-05T05:54:42Z"},{"alias_kind":"arxiv_version","alias_value":"2303.14510v1","created_at":"2026-07-05T05:54:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.14510","created_at":"2026-07-05T05:54:42Z"},{"alias_kind":"pith_short_12","alias_value":"HCKRUPSRDVZG","created_at":"2026-07-05T05:54:42Z"},{"alias_kind":"pith_short_16","alias_value":"HCKRUPSRDVZGIQ5W","created_at":"2026-07-05T05:54:42Z"},{"alias_kind":"pith_short_8","alias_value":"HCKRUPSR","created_at":"2026-07-05T05:54:42Z"}],"graph_snapshots":[{"event_id":"sha256:500ce69d91268a528b3b8022de65f23e9b0cbdfefc84a068a9f783564ca5c8b3","target":"graph","created_at":"2026-07-05T05:54:42Z","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/2303.14510/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding high-importance patterns in data is an emerging data mining task known as High-utility itemset mining (HUIM). Given a minimum utility threshold, a HUIM algorithm extracts all the high-utility itemsets (HUIs) whose utility values are not less than the threshold. This can reveal a wealth of useful information, but the precise needs of users are not well taken into account. In particular, users often want to focus on patterns that have some specific items rather than find all patterns. To overcome that difficulty, targeted mining has emerged, focusing on user preferences, but only prelimi","authors_text":"Jinbao Miao, Philippe Fournier-Viger, Shan Huang, Wensheng Gan, Xuming Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-03-25T16:19:39Z","title":"Targeted Mining of Top-k High Utility Itemsets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.14510","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:8df0fa1cdc98201b0a64db6b0dd5b034d3a7f39211d5f01e9e0e345c72c62c08","target":"record","created_at":"2026-07-05T05:54:42Z","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":"b5f538c3e271b5d232e58c89fb5e1b09e6caa60266d222887ec8feda42387da0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-03-25T16:19:39Z","title_canon_sha256":"1c211ab2203aefabc1e1e8a8eb588164e5a628b68b0cf27d6f614cb6e032f319"},"schema_version":"1.0","source":{"id":"2303.14510","kind":"arxiv","version":1}},"canonical_sha256":"38951a3e511d726443b6be98fa2b47609946391d085952dacbb1f7cb1d9ef37d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38951a3e511d726443b6be98fa2b47609946391d085952dacbb1f7cb1d9ef37d","first_computed_at":"2026-07-05T05:54:42.687497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:54:42.687497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TESY1AjsaVgMQMYmm9rs/pLLo4QRFAgH/ewn9G8Rak2iwC7qeqEpLDqrzFizP2vrN18/EH+4sOPp1pOQI1f8BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:54:42.687921Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.14510","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8df0fa1cdc98201b0a64db6b0dd5b034d3a7f39211d5f01e9e0e345c72c62c08","sha256:500ce69d91268a528b3b8022de65f23e9b0cbdfefc84a068a9f783564ca5c8b3"],"state_sha256":"ac3ee3e89ee11c642428d849e057ea8aaa0a116f8483c86d64697cc5278fea17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSm3uzHr9Ud16Y/GQkgaWYEFDLYJnsQGZBvW67ONQEKeVDzzTK2TtgyxdpwDM1tGGDhpME0rPXVkWdmgenE5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T06:11:37.428648Z","bundle_sha256":"7fadc79f8d4ff8bf7172e11ec5a7ed98cea33739e4740ceec3798ffe92e6da8d"}}