{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:Y4RE64C26X2F5I5KZYMNK2YSVV","short_pith_number":"pith:Y4RE64C2","canonical_record":{"source":{"id":"2106.14811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-06-28T15:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"b419ebbc76f7d7f933f4067996263c076d7514b9e575a3978b35cc1ae1781c0a","abstract_canon_sha256":"38c14e20382b85c86185aad52967a69c40535f0777a992b091b950b587c43839"},"schema_version":"1.0"},"canonical_sha256":"c7224f705af5f45ea3aace18d56b12ad4b3b0cb6e9caeca4ac155b1b615c61c7","source":{"kind":"arxiv","id":"2106.14811","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.14811","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"arxiv_version","alias_value":"2106.14811v1","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.14811","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"pith_short_12","alias_value":"Y4RE64C26X2F","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"pith_short_16","alias_value":"Y4RE64C26X2F5I5K","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"pith_short_8","alias_value":"Y4RE64C2","created_at":"2026-07-05T02:52:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:Y4RE64C26X2F5I5KZYMNK2YSVV","target":"record","payload":{"canonical_record":{"source":{"id":"2106.14811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-06-28T15:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"b419ebbc76f7d7f933f4067996263c076d7514b9e575a3978b35cc1ae1781c0a","abstract_canon_sha256":"38c14e20382b85c86185aad52967a69c40535f0777a992b091b950b587c43839"},"schema_version":"1.0"},"canonical_sha256":"c7224f705af5f45ea3aace18d56b12ad4b3b0cb6e9caeca4ac155b1b615c61c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:54.155482Z","signature_b64":"4R7cBd0kJG4ZV88PkRkCshhCbyHa4muYGlzOmXLMScZNyN6gXaf2Hx6bxNsWHu9AvSBF70fl1VK1le8/pwKGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7224f705af5f45ea3aace18d56b12ad4b3b0cb6e9caeca4ac155b1b615c61c7","last_reissued_at":"2026-07-05T02:52:54.155074Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:54.155074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.14811","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-05T02:52:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CPVCHvdcBl8FcUAzdZS/OuTuNPu/taSsL1wscGMVKPsPkRU86pIuQOPb5c3S98EosVPrjOjaZD8FnFWKgsYSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:02:10.711006Z"},"content_sha256":"f43686e8dd8eebce9c4016def1ed6e485326d95f33dfa0ad695f0fd6aa4e20b7","schema_version":"1.0","event_id":"sha256:f43686e8dd8eebce9c4016def1ed6e485326d95f33dfa0ad695f0fd6aa4e20b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:Y4RE64C26X2F5I5KZYMNK2YSVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TOPIC: Top-k High-Utility Itemset Discovering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Guoting Chen, Hamido Fujita, Jiahui Chen, Shicheng Wan, Wensheng Gan","submitted_at":"2021-06-28T15:34:03Z","abstract_excerpt":"Utility-driven itemset mining is widely applied in many real-world scenarios. However, most algorithms do not work for itemsets with negative utilities. Several efficient algorithms for high-utility itemset (HUI) mining with negative utilities have been proposed. These algorithms can find complete HUIs with or without negative utilities. However, the major problem with these algorithms is how to select an appropriate minimum utility (minUtil) threshold. To address this issue, some efficient algorithms for extracting top-k HUIs have been proposed, where parameter k is the quantity of HUIs to be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.14811","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/2106.14811/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-05T02:52:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57tAV/+RiDd/sdu12FnJiWK5i23njMLGdBDh/zllVuGHNgtwLlRzMnHtAAEGXeZS7CRfJ3TRqSCJ8U4Y6greDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:02:10.711498Z"},"content_sha256":"5eca1ac56926e77c20d2c70e13c16273ce5fc39813f623e3ad1f1a67d736fe11","schema_version":"1.0","event_id":"sha256:5eca1ac56926e77c20d2c70e13c16273ce5fc39813f623e3ad1f1a67d736fe11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4RE64C26X2F5I5KZYMNK2YSVV/bundle.json","state_url":"https://pith.science/pith/Y4RE64C26X2F5I5KZYMNK2YSVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4RE64C26X2F5I5KZYMNK2YSVV/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:02:10Z","links":{"resolver":"https://pith.science/pith/Y4RE64C26X2F5I5KZYMNK2YSVV","bundle":"https://pith.science/pith/Y4RE64C26X2F5I5KZYMNK2YSVV/bundle.json","state":"https://pith.science/pith/Y4RE64C26X2F5I5KZYMNK2YSVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4RE64C26X2F5I5KZYMNK2YSVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:Y4RE64C26X2F5I5KZYMNK2YSVV","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":"38c14e20382b85c86185aad52967a69c40535f0777a992b091b950b587c43839","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-06-28T15:34:03Z","title_canon_sha256":"b419ebbc76f7d7f933f4067996263c076d7514b9e575a3978b35cc1ae1781c0a"},"schema_version":"1.0","source":{"id":"2106.14811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.14811","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"arxiv_version","alias_value":"2106.14811v1","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.14811","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"pith_short_12","alias_value":"Y4RE64C26X2F","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"pith_short_16","alias_value":"Y4RE64C26X2F5I5K","created_at":"2026-07-05T02:52:54Z"},{"alias_kind":"pith_short_8","alias_value":"Y4RE64C2","created_at":"2026-07-05T02:52:54Z"}],"graph_snapshots":[{"event_id":"sha256:5eca1ac56926e77c20d2c70e13c16273ce5fc39813f623e3ad1f1a67d736fe11","target":"graph","created_at":"2026-07-05T02:52: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/2106.14811/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Utility-driven itemset mining is widely applied in many real-world scenarios. However, most algorithms do not work for itemsets with negative utilities. Several efficient algorithms for high-utility itemset (HUI) mining with negative utilities have been proposed. These algorithms can find complete HUIs with or without negative utilities. However, the major problem with these algorithms is how to select an appropriate minimum utility (minUtil) threshold. To address this issue, some efficient algorithms for extracting top-k HUIs have been proposed, where parameter k is the quantity of HUIs to be","authors_text":"Guoting Chen, Hamido Fujita, Jiahui Chen, Shicheng Wan, Wensheng Gan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-06-28T15:34:03Z","title":"TOPIC: Top-k High-Utility Itemset Discovering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.14811","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:f43686e8dd8eebce9c4016def1ed6e485326d95f33dfa0ad695f0fd6aa4e20b7","target":"record","created_at":"2026-07-05T02:52: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":"38c14e20382b85c86185aad52967a69c40535f0777a992b091b950b587c43839","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-06-28T15:34:03Z","title_canon_sha256":"b419ebbc76f7d7f933f4067996263c076d7514b9e575a3978b35cc1ae1781c0a"},"schema_version":"1.0","source":{"id":"2106.14811","kind":"arxiv","version":1}},"canonical_sha256":"c7224f705af5f45ea3aace18d56b12ad4b3b0cb6e9caeca4ac155b1b615c61c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c7224f705af5f45ea3aace18d56b12ad4b3b0cb6e9caeca4ac155b1b615c61c7","first_computed_at":"2026-07-05T02:52:54.155074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:52:54.155074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4R7cBd0kJG4ZV88PkRkCshhCbyHa4muYGlzOmXLMScZNyN6gXaf2Hx6bxNsWHu9AvSBF70fl1VK1le8/pwKGCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:52:54.155482Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.14811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f43686e8dd8eebce9c4016def1ed6e485326d95f33dfa0ad695f0fd6aa4e20b7","sha256:5eca1ac56926e77c20d2c70e13c16273ce5fc39813f623e3ad1f1a67d736fe11"],"state_sha256":"fa1d3e57aaaa9fe6983fce838f9b30ad3c47de61f46906ce098f321876f0365d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E9nawXOYY+PhJiUk2O1NtNn8MkumhjMVr131a5asEL0BvAK6XytASelZeBQu8yQ3i/EgcBBbV2pA7v/Ot23HDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T08:02:10.716091Z","bundle_sha256":"d69dd75c60b974d3db44c1a641ca587ac2f78c2a4a8cde958af7e0a7455e2ce8"}}