{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QPPKW7VKXFRCZYTRDPIOIB7M47","short_pith_number":"pith:QPPKW7VK","schema_version":"1.0","canonical_sha256":"83deab7eaab9622ce2711bd0e407ece7d5770edc7272dfdfe317aade3ada9a2b","source":{"kind":"arxiv","id":"1410.2988","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.2988","created_at":"2026-05-18T02:40:17.319984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.2988v1","created_at":"2026-05-18T02:40:17.319984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2988","created_at":"2026-05-18T02:40:17.319984+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPPKW7VKXFRC","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPPKW7VKXFRCZYTR","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPPKW7VK","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47","json":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47.json","graph_json":"https://pith.science/api/pith-number/QPPKW7VKXFRCZYTRDPIOIB7M47/graph.json","events_json":"https://pith.science/api/pith-number/QPPKW7VKXFRCZYTRDPIOIB7M47/events.json","paper":"https://pith.science/paper/QPPKW7VK"},"agent_actions":{"view_html":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47","download_json":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47.json","view_paper":"https://pith.science/paper/QPPKW7VK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.2988&json=true","fetch_graph":"https://pith.science/api/pith-number/QPPKW7VKXFRCZYTRDPIOIB7M47/graph.json","fetch_events":"https://pith.science/api/pith-number/QPPKW7VKXFRCZYTRDPIOIB7M47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47/action/storage_attestation","attest_author":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47/action/author_attestation","sign_citation":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47/action/citation_signature","submit_replication":"https://pith.science/pith/QPPKW7VKXFRCZYTRDPIOIB7M47/action/replication_record"}},"created_at":"2026-05-18T02:40:17.319984+00:00","updated_at":"2026-05-18T02:40:17.319984+00:00"}