{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JD2MSI5GWLD5P6AFZTZCN6F67N","short_pith_number":"pith:JD2MSI5G","schema_version":"1.0","canonical_sha256":"48f4c923a6b2c7d7f805ccf226f8befb5e26bede14daf52d1c3acaa901c776f2","source":{"kind":"arxiv","id":"1803.06632","version":2},"attestation_state":"computed","paper":{"title":"A Guided FP-growth algorithm for multitude-targeted mining of big data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Itai Dattner, Lior Shabtay, Rami Yaari","submitted_at":"2018-03-18T09:57:34Z","abstract_excerpt":"In this paper we present the GFP-growth (Guided FP-growth) algorithm, a novel method for multitude-targeted mining: finding the count of a given large list of itemsets in large data. The GFP-growth algorithm is designed to focus on the specific multitude itemsets of interest and optimizes the time and memory costs. We prove that the GFP-growth algorithm yields the exact frequency-counts for the required itemsets. We show that for a number of different problems, a solution can be devised which takes advantage of the efficient implementation of multitude-targeted mining for boosting the performa"},"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":"1803.06632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-03-18T09:57:34Z","cross_cats_sorted":[],"title_canon_sha256":"75a7eb77f037fa8319cb87b0d3259240e03a688ccd8fe7f59ebc70f5fc36cec3","abstract_canon_sha256":"2058e2785151c19745853b13976805824c44f1a03d97c28f9ebc31199eab167e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:30.279665Z","signature_b64":"rMrepgj7MkNM69wEen1Ro72u8wyLhON2Sl40ehaI1Qx/VDvZgk79I66cBjNB8X9DeBswPBNc0H/A7jjr4FsyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48f4c923a6b2c7d7f805ccf226f8befb5e26bede14daf52d1c3acaa901c776f2","last_reissued_at":"2026-05-18T00:11:30.279112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:30.279112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Guided FP-growth algorithm for multitude-targeted mining of big data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Itai Dattner, Lior Shabtay, Rami Yaari","submitted_at":"2018-03-18T09:57:34Z","abstract_excerpt":"In this paper we present the GFP-growth (Guided FP-growth) algorithm, a novel method for multitude-targeted mining: finding the count of a given large list of itemsets in large data. The GFP-growth algorithm is designed to focus on the specific multitude itemsets of interest and optimizes the time and memory costs. We prove that the GFP-growth algorithm yields the exact frequency-counts for the required itemsets. We show that for a number of different problems, a solution can be devised which takes advantage of the efficient implementation of multitude-targeted mining for boosting the performa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06632","kind":"arxiv","version":2},"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":"1803.06632","created_at":"2026-05-18T00:11:30.279195+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06632v2","created_at":"2026-05-18T00:11:30.279195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06632","created_at":"2026-05-18T00:11:30.279195+00:00"},{"alias_kind":"pith_short_12","alias_value":"JD2MSI5GWLD5","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JD2MSI5GWLD5P6AF","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JD2MSI5G","created_at":"2026-05-18T12:32:31.084164+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/JD2MSI5GWLD5P6AFZTZCN6F67N","json":"https://pith.science/pith/JD2MSI5GWLD5P6AFZTZCN6F67N.json","graph_json":"https://pith.science/api/pith-number/JD2MSI5GWLD5P6AFZTZCN6F67N/graph.json","events_json":"https://pith.science/api/pith-number/JD2MSI5GWLD5P6AFZTZCN6F67N/events.json","paper":"https://pith.science/paper/JD2MSI5G"},"agent_actions":{"view_html":"https://pith.science/pith/JD2MSI5GWLD5P6AFZTZCN6F67N","download_json":"https://pith.science/pith/JD2MSI5GWLD5P6AFZTZCN6F67N.json","view_paper":"https://pith.science/paper/JD2MSI5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06632&json=true","fetch_graph":"https://pith.science/api/pith-number/JD2MSI5GWLD5P6AFZTZCN6F67N/graph.json","fetch_events":"https://pith.science/api/pith-number/JD2MSI5GWLD5P6AFZTZCN6F67N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JD2MSI5GWLD5P6AFZTZCN6F67N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JD2MSI5GWLD5P6AFZTZCN6F67N/action/storage_attestation","attest_author":"https://pith.science/pith/JD2MSI5GWLD5P6AFZTZCN6F67N/action/author_attestation","sign_citation":"https://pith.science/pith/JD2MSI5GWLD5P6AFZTZCN6F67N/action/citation_signature","submit_replication":"https://pith.science/pith/JD2MSI5GWLD5P6AFZTZCN6F67N/action/replication_record"}},"created_at":"2026-05-18T00:11:30.279195+00:00","updated_at":"2026-05-18T00:11:30.279195+00:00"}