{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6QTBAATLBJ3BLB5SWH6FSZVQ2F","short_pith_number":"pith:6QTBAATL","schema_version":"1.0","canonical_sha256":"f42610026b0a761587b2b1fc5966b0d1420d2f54d73d5cc24efcf76b4c6ac2b3","source":{"kind":"arxiv","id":"1207.6253","version":1},"attestation_state":"computed","paper":{"title":"On When and How to use SAT to Mine Frequent Itemsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG"],"primary_cat":"cs.AI","authors_text":"In\\^es Lynce, Rui Henriques, Vasco Manquinho","submitted_at":"2012-07-26T12:33:46Z","abstract_excerpt":"A new stream of research was born in the last decade with the goal of mining itemsets of interest using Constraint Programming (CP). This has promoted a natural way to combine complex constraints in a highly flexible manner. Although CP state-of-the-art solutions formulate the task using Boolean variables, the few attempts to adopt propositional Satisfiability (SAT) provided an unsatisfactory performance. This work deepens the study on when and how to use SAT for the frequent itemset mining (FIM) problem by defining different encodings with multiple task-driven enumeration options and search s"},"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":"1207.6253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-26T12:33:46Z","cross_cats_sorted":["cs.DB","cs.LG"],"title_canon_sha256":"d5ac28055c3ea600c0414434da49e8d0a3e3277f7ebf105eab91a763cfde8111","abstract_canon_sha256":"7f467c2495aa7f9dd8faa0fc4e9a2865654eb972c7334352edb71f20e0267b93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:08.334890Z","signature_b64":"Jiv0sD3JMJtawddF8EE9TQNFqsTDZWmiOX7X4zxtEogjpkpmNhg/0gKZwj5bxMvtX5uxwiAsAvW0RY99iFKfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f42610026b0a761587b2b1fc5966b0d1420d2f54d73d5cc24efcf76b4c6ac2b3","last_reissued_at":"2026-05-18T03:50:08.334118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:08.334118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On When and How to use SAT to Mine Frequent Itemsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG"],"primary_cat":"cs.AI","authors_text":"In\\^es Lynce, Rui Henriques, Vasco Manquinho","submitted_at":"2012-07-26T12:33:46Z","abstract_excerpt":"A new stream of research was born in the last decade with the goal of mining itemsets of interest using Constraint Programming (CP). This has promoted a natural way to combine complex constraints in a highly flexible manner. Although CP state-of-the-art solutions formulate the task using Boolean variables, the few attempts to adopt propositional Satisfiability (SAT) provided an unsatisfactory performance. This work deepens the study on when and how to use SAT for the frequent itemset mining (FIM) problem by defining different encodings with multiple task-driven enumeration options and search s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6253","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":"1207.6253","created_at":"2026-05-18T03:50:08.334248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6253v1","created_at":"2026-05-18T03:50:08.334248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6253","created_at":"2026-05-18T03:50:08.334248+00:00"},{"alias_kind":"pith_short_12","alias_value":"6QTBAATLBJ3B","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6QTBAATLBJ3BLB5S","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6QTBAATL","created_at":"2026-05-18T12:26:56.085431+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/6QTBAATLBJ3BLB5SWH6FSZVQ2F","json":"https://pith.science/pith/6QTBAATLBJ3BLB5SWH6FSZVQ2F.json","graph_json":"https://pith.science/api/pith-number/6QTBAATLBJ3BLB5SWH6FSZVQ2F/graph.json","events_json":"https://pith.science/api/pith-number/6QTBAATLBJ3BLB5SWH6FSZVQ2F/events.json","paper":"https://pith.science/paper/6QTBAATL"},"agent_actions":{"view_html":"https://pith.science/pith/6QTBAATLBJ3BLB5SWH6FSZVQ2F","download_json":"https://pith.science/pith/6QTBAATLBJ3BLB5SWH6FSZVQ2F.json","view_paper":"https://pith.science/paper/6QTBAATL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6253&json=true","fetch_graph":"https://pith.science/api/pith-number/6QTBAATLBJ3BLB5SWH6FSZVQ2F/graph.json","fetch_events":"https://pith.science/api/pith-number/6QTBAATLBJ3BLB5SWH6FSZVQ2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6QTBAATLBJ3BLB5SWH6FSZVQ2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6QTBAATLBJ3BLB5SWH6FSZVQ2F/action/storage_attestation","attest_author":"https://pith.science/pith/6QTBAATLBJ3BLB5SWH6FSZVQ2F/action/author_attestation","sign_citation":"https://pith.science/pith/6QTBAATLBJ3BLB5SWH6FSZVQ2F/action/citation_signature","submit_replication":"https://pith.science/pith/6QTBAATLBJ3BLB5SWH6FSZVQ2F/action/replication_record"}},"created_at":"2026-05-18T03:50:08.334248+00:00","updated_at":"2026-05-18T03:50:08.334248+00:00"}