{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4FLHZJAVUNY4EJ4DVVKIINYBHV","short_pith_number":"pith:4FLHZJAV","schema_version":"1.0","canonical_sha256":"e1567ca415a371c22783ad548437013d516014518eca5eb9ddc555fc344b0071","source":{"kind":"arxiv","id":"1901.07773","version":1},"attestation_state":"computed","paper":{"title":"Boosting Frequent Itemset Mining via Early Stopping Intersections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Huu Hiep Nguyen","submitted_at":"2019-01-23T08:43:50Z","abstract_excerpt":"Mining frequent itemsets from a transaction database has emerged as a fundamental problem in data mining and committed itself as a building block for many pattern mining tasks. In this paper, we present a general technique to reduce support checking time in existing depth-first search generate-and-test schemes such as Eclat/dEclat and PrePost+. Our technique allows infrequent candidate itemsets to be detected early. The technique is based on an early-stopping criterion and is general enough to be applicable in many frequent itemset mining algorithms. We have applied the technique to two TID-li"},"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":"1901.07773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-01-23T08:43:50Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"0a5688431bb9d9ae2c1ba471c00911613df509a5dc5cb18d19ab862f71ae0299","abstract_canon_sha256":"f7d3b9418fc8696696e76b96dc41192de9779dd225c98e65f6a97db43beba2ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:41.505843Z","signature_b64":"UoGSVXzZ8/rUbfhOOPC595ELFl0sqxU0mH7MpYfOouj5G701sKYepKYCGN+JnItZERFdE976k9SP7TBkQqbiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1567ca415a371c22783ad548437013d516014518eca5eb9ddc555fc344b0071","last_reissued_at":"2026-05-17T23:55:41.505238Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:41.505238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boosting Frequent Itemset Mining via Early Stopping Intersections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Huu Hiep Nguyen","submitted_at":"2019-01-23T08:43:50Z","abstract_excerpt":"Mining frequent itemsets from a transaction database has emerged as a fundamental problem in data mining and committed itself as a building block for many pattern mining tasks. In this paper, we present a general technique to reduce support checking time in existing depth-first search generate-and-test schemes such as Eclat/dEclat and PrePost+. Our technique allows infrequent candidate itemsets to be detected early. The technique is based on an early-stopping criterion and is general enough to be applicable in many frequent itemset mining algorithms. We have applied the technique to two TID-li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07773","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":"1901.07773","created_at":"2026-05-17T23:55:41.505332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07773v1","created_at":"2026-05-17T23:55:41.505332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07773","created_at":"2026-05-17T23:55:41.505332+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FLHZJAVUNY4","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FLHZJAVUNY4EJ4D","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FLHZJAV","created_at":"2026-05-18T12:33:10.108867+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/4FLHZJAVUNY4EJ4DVVKIINYBHV","json":"https://pith.science/pith/4FLHZJAVUNY4EJ4DVVKIINYBHV.json","graph_json":"https://pith.science/api/pith-number/4FLHZJAVUNY4EJ4DVVKIINYBHV/graph.json","events_json":"https://pith.science/api/pith-number/4FLHZJAVUNY4EJ4DVVKIINYBHV/events.json","paper":"https://pith.science/paper/4FLHZJAV"},"agent_actions":{"view_html":"https://pith.science/pith/4FLHZJAVUNY4EJ4DVVKIINYBHV","download_json":"https://pith.science/pith/4FLHZJAVUNY4EJ4DVVKIINYBHV.json","view_paper":"https://pith.science/paper/4FLHZJAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07773&json=true","fetch_graph":"https://pith.science/api/pith-number/4FLHZJAVUNY4EJ4DVVKIINYBHV/graph.json","fetch_events":"https://pith.science/api/pith-number/4FLHZJAVUNY4EJ4DVVKIINYBHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FLHZJAVUNY4EJ4DVVKIINYBHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FLHZJAVUNY4EJ4DVVKIINYBHV/action/storage_attestation","attest_author":"https://pith.science/pith/4FLHZJAVUNY4EJ4DVVKIINYBHV/action/author_attestation","sign_citation":"https://pith.science/pith/4FLHZJAVUNY4EJ4DVVKIINYBHV/action/citation_signature","submit_replication":"https://pith.science/pith/4FLHZJAVUNY4EJ4DVVKIINYBHV/action/replication_record"}},"created_at":"2026-05-17T23:55:41.505332+00:00","updated_at":"2026-05-17T23:55:41.505332+00:00"}