{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QPPKW7VKXFRCZYTRDPIOIB7M47","short_pith_number":"pith:QPPKW7VK","canonical_record":{"source":{"id":"1410.2988","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2014-10-11T11:30:14Z","cross_cats_sorted":[],"title_canon_sha256":"247e554a4354bb2ab7be8ea72d0eae30eea6696a847833a7b04e5033cd4750a5","abstract_canon_sha256":"7e284b89fef2aea430461fceb81d7c3a61bbec407a6e575194aad6cebeccb147"},"schema_version":"1.0"},"canonical_sha256":"83deab7eaab9622ce2711bd0e407ece7d5770edc7272dfdfe317aade3ada9a2b","source":{"kind":"arxiv","id":"1410.2988","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2988","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2988v1","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2988","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"QPPKW7VKXFRC","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QPPKW7VKXFRCZYTR","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QPPKW7VK","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QPPKW7VKXFRCZYTRDPIOIB7M47","target":"record","payload":{"canonical_record":{"source":{"id":"1410.2988","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2014-10-11T11:30:14Z","cross_cats_sorted":[],"title_canon_sha256":"247e554a4354bb2ab7be8ea72d0eae30eea6696a847833a7b04e5033cd4750a5","abstract_canon_sha256":"7e284b89fef2aea430461fceb81d7c3a61bbec407a6e575194aad6cebeccb147"},"schema_version":"1.0"},"canonical_sha256":"83deab7eaab9622ce2711bd0e407ece7d5770edc7272dfdfe317aade3ada9a2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:17.320373Z","signature_b64":"wOQxLPbPdHDGtWhaYxZ/BfO5nJfoDO8l8YVKDxKYe5d+bXwyudlyTqXUDyuhc5F/Q+AHo6+tzQGnWIoJA2oPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83deab7eaab9622ce2711bd0e407ece7d5770edc7272dfdfe317aade3ada9a2b","last_reissued_at":"2026-05-18T02:40:17.319924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:17.319924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.2988","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-05-18T02:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lHb9Qe+06RQuIQeJ7wBHcQT4Udc2y0QS9qTwfAD6kAV78FA5zWVPl1+M8ODoM/yNqmqx+Ev8Q7DR90yYO8W+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:31:44.236138Z"},"content_sha256":"fab2a3abb9c685be47e9b0423a2069329dd309c98b54c7f83ff3cf5896671d9e","schema_version":"1.0","event_id":"sha256:fab2a3abb9c685be47e9b0423a2069329dd309c98b54c7f83ff3cf5896671d9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QPPKW7VKXFRCZYTRDPIOIB7M47","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm for Mining High Utility Closed Itemsets and Generators","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"A. Goswami, Ashok Kumar Das, Jayakrushna Sahoo","submitted_at":"2014-10-11T11:30:14Z","abstract_excerpt":"Traditional association rule mining based on the support-confidence framework provides the objective measure of the rules that are of interest to users. However, it does not reflect the utility of the rules. To extract non-redundant association rules in support-confidence framework frequent closed itemsets and their generators play an important role. To extract non-redundant association rules among high utility itemsets, high utility closed itemsets (HUCI) and their generators should be extracted in order to apply traditional support-confidence framework. However, no efficient method exists at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2988","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":""},"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-05-18T02:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9GtkAoBg9SSRE2zl7DwH6H9/3RYJ6MkeJNka7VayV4xA+U/z8dcTPp72pauIVWjg4CoRdcN57H8UFT31ldP9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:31:44.236511Z"},"content_sha256":"1dce701070dc0187dc7a16dd98b199d03805a00969272c29f1bcbba34ecab6cd","schema_version":"1.0","event_id":"sha256:1dce701070dc0187dc7a16dd98b199d03805a00969272c29f1bcbba34ecab6cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47/bundle.json","state_url":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPPKW7VKXFRCZYTRDPIOIB7M47/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-05-26T16:31:44Z","links":{"resolver":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47","bundle":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47/bundle.json","state":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPPKW7VKXFRCZYTRDPIOIB7M47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QPPKW7VKXFRCZYTRDPIOIB7M47","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":"7e284b89fef2aea430461fceb81d7c3a61bbec407a6e575194aad6cebeccb147","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2014-10-11T11:30:14Z","title_canon_sha256":"247e554a4354bb2ab7be8ea72d0eae30eea6696a847833a7b04e5033cd4750a5"},"schema_version":"1.0","source":{"id":"1410.2988","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2988","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2988v1","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2988","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"QPPKW7VKXFRC","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QPPKW7VKXFRCZYTR","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QPPKW7VK","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:1dce701070dc0187dc7a16dd98b199d03805a00969272c29f1bcbba34ecab6cd","target":"graph","created_at":"2026-05-18T02:40:17Z","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"},"paper":{"abstract_excerpt":"Traditional association rule mining based on the support-confidence framework provides the objective measure of the rules that are of interest to users. However, it does not reflect the utility of the rules. To extract non-redundant association rules in support-confidence framework frequent closed itemsets and their generators play an important role. To extract non-redundant association rules among high utility itemsets, high utility closed itemsets (HUCI) and their generators should be extracted in order to apply traditional support-confidence framework. However, no efficient method exists at","authors_text":"A. Goswami, Ashok Kumar Das, Jayakrushna Sahoo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2014-10-11T11:30:14Z","title":"An Algorithm for Mining High Utility Closed Itemsets and Generators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2988","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:fab2a3abb9c685be47e9b0423a2069329dd309c98b54c7f83ff3cf5896671d9e","target":"record","created_at":"2026-05-18T02:40:17Z","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":"7e284b89fef2aea430461fceb81d7c3a61bbec407a6e575194aad6cebeccb147","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2014-10-11T11:30:14Z","title_canon_sha256":"247e554a4354bb2ab7be8ea72d0eae30eea6696a847833a7b04e5033cd4750a5"},"schema_version":"1.0","source":{"id":"1410.2988","kind":"arxiv","version":1}},"canonical_sha256":"83deab7eaab9622ce2711bd0e407ece7d5770edc7272dfdfe317aade3ada9a2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83deab7eaab9622ce2711bd0e407ece7d5770edc7272dfdfe317aade3ada9a2b","first_computed_at":"2026-05-18T02:40:17.319924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:17.319924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wOQxLPbPdHDGtWhaYxZ/BfO5nJfoDO8l8YVKDxKYe5d+bXwyudlyTqXUDyuhc5F/Q+AHo6+tzQGnWIoJA2oPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:17.320373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2988","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fab2a3abb9c685be47e9b0423a2069329dd309c98b54c7f83ff3cf5896671d9e","sha256:1dce701070dc0187dc7a16dd98b199d03805a00969272c29f1bcbba34ecab6cd"],"state_sha256":"75773a23bd1e683e3ddef85d88d743d2811ecbec05655c713e14b095a4a38ebb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dpp84fG0bQD8J+oNuoqrmbspfYuev7gBi0uKoy395WOjhoXNNH4Si4OB2SyrEiyx1u2VUTVzASXMJUAP8vssBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:31:44.238870Z","bundle_sha256":"50c925fa4c99ee753d15661bfe2fa0fa63473931d93cc69295a4e9f045c912ee"}}