{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:Z6LDOM3O7BWCDND2RNQIMRFLH4","short_pith_number":"pith:Z6LDOM3O","schema_version":"1.0","canonical_sha256":"cf9637336ef86c21b47a8b608644ab3f21c1d4fc34c1c9fdf874825b28772e4c","source":{"kind":"arxiv","id":"2111.00309","version":1},"attestation_state":"computed","paper":{"title":"TargetUM: Targeted High-Utility Itemset Querying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Jiahui Chen, Jiayi Sun, Jinbao Miao, Shicheng Wan, Wensheng Gan","submitted_at":"2021-10-30T18:55:28Z","abstract_excerpt":"Traditional high-utility itemset mining (HUIM) aims to determine all high-utility itemsets (HUIs) that satisfy the minimum utility threshold (\\textit{minUtil}) in transaction databases. However, in most applications, not all HUIs are interesting because only specific parts are required. Thus, targeted mining based on user preferences is more important than traditional mining tasks. This paper is the first to propose a target-based HUIM problem and to provide a clear formulation of the targeted utility mining task in a quantitative transaction database. A tree-based algorithm known as Target-ba"},"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":"2111.00309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-10-30T18:55:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"41580ef49d981d0218df7ab8ab043cfc59b37245c52bc408e6b2bb35b373ce2a","abstract_canon_sha256":"eec1f5ffe9e97b5a6ee92e8c2c78e8572c586e3d9907d5a55045711678627154"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:41.096342Z","signature_b64":"DOCFK1VtOIVfrXX1NuY/aJliZsyMoH3e5aw5RXmUl5VtVPtJk8RLD/hWCrKBjuXzyyQY8bZUY6ey3Gou5WDGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf9637336ef86c21b47a8b608644ab3f21c1d4fc34c1c9fdf874825b28772e4c","last_reissued_at":"2026-07-05T03:27:41.095944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:41.095944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TargetUM: Targeted High-Utility Itemset Querying","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Jiahui Chen, Jiayi Sun, Jinbao Miao, Shicheng Wan, Wensheng Gan","submitted_at":"2021-10-30T18:55:28Z","abstract_excerpt":"Traditional high-utility itemset mining (HUIM) aims to determine all high-utility itemsets (HUIs) that satisfy the minimum utility threshold (\\textit{minUtil}) in transaction databases. However, in most applications, not all HUIs are interesting because only specific parts are required. Thus, targeted mining based on user preferences is more important than traditional mining tasks. This paper is the first to propose a target-based HUIM problem and to provide a clear formulation of the targeted utility mining task in a quantitative transaction database. A tree-based algorithm known as Target-ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00309","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/2111.00309/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.00309","created_at":"2026-07-05T03:27:41.096005+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.00309v1","created_at":"2026-07-05T03:27:41.096005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00309","created_at":"2026-07-05T03:27:41.096005+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6LDOM3O7BWC","created_at":"2026-07-05T03:27:41.096005+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6LDOM3O7BWCDND2","created_at":"2026-07-05T03:27:41.096005+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6LDOM3O","created_at":"2026-07-05T03:27:41.096005+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/Z6LDOM3O7BWCDND2RNQIMRFLH4","json":"https://pith.science/pith/Z6LDOM3O7BWCDND2RNQIMRFLH4.json","graph_json":"https://pith.science/api/pith-number/Z6LDOM3O7BWCDND2RNQIMRFLH4/graph.json","events_json":"https://pith.science/api/pith-number/Z6LDOM3O7BWCDND2RNQIMRFLH4/events.json","paper":"https://pith.science/paper/Z6LDOM3O"},"agent_actions":{"view_html":"https://pith.science/pith/Z6LDOM3O7BWCDND2RNQIMRFLH4","download_json":"https://pith.science/pith/Z6LDOM3O7BWCDND2RNQIMRFLH4.json","view_paper":"https://pith.science/paper/Z6LDOM3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.00309&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6LDOM3O7BWCDND2RNQIMRFLH4/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6LDOM3O7BWCDND2RNQIMRFLH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6LDOM3O7BWCDND2RNQIMRFLH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6LDOM3O7BWCDND2RNQIMRFLH4/action/storage_attestation","attest_author":"https://pith.science/pith/Z6LDOM3O7BWCDND2RNQIMRFLH4/action/author_attestation","sign_citation":"https://pith.science/pith/Z6LDOM3O7BWCDND2RNQIMRFLH4/action/citation_signature","submit_replication":"https://pith.science/pith/Z6LDOM3O7BWCDND2RNQIMRFLH4/action/replication_record"}},"created_at":"2026-07-05T03:27:41.096005+00:00","updated_at":"2026-07-05T03:27:41.096005+00:00"}