{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GDNQP7V3QFJHMQWWQSFEM6G33M","short_pith_number":"pith:GDNQP7V3","schema_version":"1.0","canonical_sha256":"30db07febb81527642d6848a4678dbdb0993e9829f1cf1a0fbe153d018ec2311","source":{"kind":"arxiv","id":"1902.02392","version":1},"attestation_state":"computed","paper":{"title":"Finding Good Itemsets by Packing Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Jilles Vreeken, Nikolaj Tatti","submitted_at":"2019-02-06T20:38:24Z","abstract_excerpt":"The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that compress the data efficiently. As a compression technique we use decision trees combined with a refined version of MDL. More formally, assuming that the items are ordered, we create a decision tree for each item that may only depend on the previous items. Our approach allows us to find complex interactions between the attributes, not just co-occurrences of 1s. Further, we present a link between the itemsets and the dec"},"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":"1902.02392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-06T20:38:24Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"c15c4bc42ea9721f3d4549e457eefd72e441609edae93f94078a70c90f9777a7","abstract_canon_sha256":"aec993a2bd6ebbad17d5d998d21f5871d2191a3c6a59ba19229b915b8235ffc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:33.543514Z","signature_b64":"4Sj82tX9w0UsxhWqIjZbQ5A9G3DB4/Zg9wgiyhCmQ59ZKVjqA3pSWEk4CoAHARx02fIEiM8B+4EdCt4YL2ZeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30db07febb81527642d6848a4678dbdb0993e9829f1cf1a0fbe153d018ec2311","last_reissued_at":"2026-05-17T23:54:33.542788Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:33.542788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Good Itemsets by Packing Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DS","authors_text":"Jilles Vreeken, Nikolaj Tatti","submitted_at":"2019-02-06T20:38:24Z","abstract_excerpt":"The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that compress the data efficiently. As a compression technique we use decision trees combined with a refined version of MDL. More formally, assuming that the items are ordered, we create a decision tree for each item that may only depend on the previous items. Our approach allows us to find complex interactions between the attributes, not just co-occurrences of 1s. Further, we present a link between the itemsets and the dec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02392","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":"1902.02392","created_at":"2026-05-17T23:54:33.542901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.02392v1","created_at":"2026-05-17T23:54:33.542901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02392","created_at":"2026-05-17T23:54:33.542901+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDNQP7V3QFJH","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDNQP7V3QFJHMQWW","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDNQP7V3","created_at":"2026-05-18T12:33:18.533446+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/GDNQP7V3QFJHMQWWQSFEM6G33M","json":"https://pith.science/pith/GDNQP7V3QFJHMQWWQSFEM6G33M.json","graph_json":"https://pith.science/api/pith-number/GDNQP7V3QFJHMQWWQSFEM6G33M/graph.json","events_json":"https://pith.science/api/pith-number/GDNQP7V3QFJHMQWWQSFEM6G33M/events.json","paper":"https://pith.science/paper/GDNQP7V3"},"agent_actions":{"view_html":"https://pith.science/pith/GDNQP7V3QFJHMQWWQSFEM6G33M","download_json":"https://pith.science/pith/GDNQP7V3QFJHMQWWQSFEM6G33M.json","view_paper":"https://pith.science/paper/GDNQP7V3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.02392&json=true","fetch_graph":"https://pith.science/api/pith-number/GDNQP7V3QFJHMQWWQSFEM6G33M/graph.json","fetch_events":"https://pith.science/api/pith-number/GDNQP7V3QFJHMQWWQSFEM6G33M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDNQP7V3QFJHMQWWQSFEM6G33M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDNQP7V3QFJHMQWWQSFEM6G33M/action/storage_attestation","attest_author":"https://pith.science/pith/GDNQP7V3QFJHMQWWQSFEM6G33M/action/author_attestation","sign_citation":"https://pith.science/pith/GDNQP7V3QFJHMQWWQSFEM6G33M/action/citation_signature","submit_replication":"https://pith.science/pith/GDNQP7V3QFJHMQWWQSFEM6G33M/action/replication_record"}},"created_at":"2026-05-17T23:54:33.542901+00:00","updated_at":"2026-05-17T23:54:33.542901+00:00"}