{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QHGNM3DZNKTORH4SZKVDE34R2H","short_pith_number":"pith:QHGNM3DZ","schema_version":"1.0","canonical_sha256":"81ccd66c796aa6e89f92caaa326f91d1d57253ed6d21da4eac12909620dbb183","source":{"kind":"arxiv","id":"1510.02188","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Data Structure for Fast Mining High Utility Itemsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"He Liu, Shulei Ma, Zhi-Hong Deng","submitted_at":"2015-10-08T03:04:12Z","abstract_excerpt":"In this paper, we propose a novel data structure called PUN-list, which maintains both the utility information about an itemset and utility upper bound for facilitating the processing of mining high utility itemsets. Based on PUN-lists, we present a method, called MIP (Mining high utility Itemset using PUN-Lists), for fast mining high utility itemsets. The efficiency of MIP is achieved with three techniques. First, itemsets are represented by a highly condensed data structure, PUN-list, which avoids costly, repeatedly utility computation. Second, the utility of an itemset can be efficiently ca"},"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":"1510.02188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-10-08T03:04:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f7c4ecd9303a3dde18988aa341c2364021cdc817e014630fd9d3fb0d68b770ed","abstract_canon_sha256":"7bff5d558122589e877832b1d053591c8e5a7e33594ad8795036c1839412a4d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:44.511875Z","signature_b64":"4RUNma/PPPnpWkCO9Dh/7Pp/ARuDZd7mEO8uHyDkTmSlS6g33w8YiBQsUQwB96f0Rf1jcEdIoA2NCz4STEWXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81ccd66c796aa6e89f92caaa326f91d1d57253ed6d21da4eac12909620dbb183","last_reissued_at":"2026-05-18T01:30:44.511253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:44.511253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Data Structure for Fast Mining High Utility Itemsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"He Liu, Shulei Ma, Zhi-Hong Deng","submitted_at":"2015-10-08T03:04:12Z","abstract_excerpt":"In this paper, we propose a novel data structure called PUN-list, which maintains both the utility information about an itemset and utility upper bound for facilitating the processing of mining high utility itemsets. Based on PUN-lists, we present a method, called MIP (Mining high utility Itemset using PUN-Lists), for fast mining high utility itemsets. The efficiency of MIP is achieved with three techniques. First, itemsets are represented by a highly condensed data structure, PUN-list, which avoids costly, repeatedly utility computation. Second, the utility of an itemset can be efficiently ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02188","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":"1510.02188","created_at":"2026-05-18T01:30:44.511331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02188v1","created_at":"2026-05-18T01:30:44.511331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02188","created_at":"2026-05-18T01:30:44.511331+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHGNM3DZNKTO","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHGNM3DZNKTORH4S","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHGNM3DZ","created_at":"2026-05-18T12:29:37.295048+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/QHGNM3DZNKTORH4SZKVDE34R2H","json":"https://pith.science/pith/QHGNM3DZNKTORH4SZKVDE34R2H.json","graph_json":"https://pith.science/api/pith-number/QHGNM3DZNKTORH4SZKVDE34R2H/graph.json","events_json":"https://pith.science/api/pith-number/QHGNM3DZNKTORH4SZKVDE34R2H/events.json","paper":"https://pith.science/paper/QHGNM3DZ"},"agent_actions":{"view_html":"https://pith.science/pith/QHGNM3DZNKTORH4SZKVDE34R2H","download_json":"https://pith.science/pith/QHGNM3DZNKTORH4SZKVDE34R2H.json","view_paper":"https://pith.science/paper/QHGNM3DZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02188&json=true","fetch_graph":"https://pith.science/api/pith-number/QHGNM3DZNKTORH4SZKVDE34R2H/graph.json","fetch_events":"https://pith.science/api/pith-number/QHGNM3DZNKTORH4SZKVDE34R2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHGNM3DZNKTORH4SZKVDE34R2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHGNM3DZNKTORH4SZKVDE34R2H/action/storage_attestation","attest_author":"https://pith.science/pith/QHGNM3DZNKTORH4SZKVDE34R2H/action/author_attestation","sign_citation":"https://pith.science/pith/QHGNM3DZNKTORH4SZKVDE34R2H/action/citation_signature","submit_replication":"https://pith.science/pith/QHGNM3DZNKTORH4SZKVDE34R2H/action/replication_record"}},"created_at":"2026-05-18T01:30:44.511331+00:00","updated_at":"2026-05-18T01:30:44.511331+00:00"}