{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QOZBIOT6KVRZFK3EOK5Q3TYZYM","short_pith_number":"pith:QOZBIOT6","canonical_record":{"source":{"id":"1012.0735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-12-03T13:29:01Z","cross_cats_sorted":["cs.AI","cs.LO","math.LO"],"title_canon_sha256":"776e206ec5abffc1cebfb0292fd6556cf0d5ca820c2f83fa190dc5d628c426eb","abstract_canon_sha256":"29be2fabab3d93d8a0a8c81407ea137aa046e7a621a3d97473ba9bb3492ea94c"},"schema_version":"1.0"},"canonical_sha256":"83b2143a7e556392ab6472bb0dcf19c31915a60f93021c5c3d0d654034fef87f","source":{"kind":"arxiv","id":"1012.0735","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0735","created_at":"2026-05-18T04:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0735v2","created_at":"2026-05-18T04:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0735","created_at":"2026-05-18T04:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"QOZBIOT6KVRZ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QOZBIOT6KVRZFK3E","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QOZBIOT6","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QOZBIOT6KVRZFK3EOK5Q3TYZYM","target":"record","payload":{"canonical_record":{"source":{"id":"1012.0735","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-12-03T13:29:01Z","cross_cats_sorted":["cs.AI","cs.LO","math.LO"],"title_canon_sha256":"776e206ec5abffc1cebfb0292fd6556cf0d5ca820c2f83fa190dc5d628c426eb","abstract_canon_sha256":"29be2fabab3d93d8a0a8c81407ea137aa046e7a621a3d97473ba9bb3492ea94c"},"schema_version":"1.0"},"canonical_sha256":"83b2143a7e556392ab6472bb0dcf19c31915a60f93021c5c3d0d654034fef87f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:35.024338Z","signature_b64":"7szBD4/CAuakh0KoklMOFAUU7E7KF0qSISRG0sKb511q3Xfn1RjE2N2TeMiCzvECy6Rq+ImD6YbJLqK1/RAXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b2143a7e556392ab6472bb0dcf19c31915a60f93021c5c3d0d654034fef87f","last_reissued_at":"2026-05-18T04:23:35.023664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:35.023664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.0735","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kY3Ybm68z7cVBaBfV4WRMNdQ60HpYETZeOxjGwM3O3D5he/AFLCAG7VEidF9nDia6x6/VP/ySdpcragkcD9WDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:10:41.600720Z"},"content_sha256":"e014589f5b2006e2729d4ae658a0daa8944e98cab2872ff3bcd973d3113367ca","schema_version":"1.0","event_id":"sha256:e014589f5b2006e2729d4ae658a0daa8944e98cab2872ff3bcd973d3113367ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QOZBIOT6KVRZFK3EOK5Q3TYZYM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Closed-set-based Discovery of Bases of Association Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LO","math.LO"],"primary_cat":"cs.LG","authors_text":"Cristina T\\^irn\\u{a}uc\\u{a}, Diego Garc\\'ia-Saiz, Domingo G\\'omez-P\\'erez, Jos\\'e L. Balc\\'azar","submitted_at":"2010-12-03T13:29:01Z","abstract_excerpt":"The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the \"essential\" or \"representative\" rules. We revisit the algorithm given by Kryszkiewicz (Int. Symp. Intelligent Data Analysis 2001, Springer-Verlag LNCS 2189, 350-359) for mining representative rules. We show that its output is sometimes incomplete, due to an oversight in its mathematical validation. We propose alternative complete generators and we extend the approach to an existing closure-aware basis similar to, and often smaller than, the rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0735","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZrnDZJQ3Jz6E8+zdUmZzy3nNCDn4MrmigvBsIRWMzvKMvA32KPuRg149uO57pXMpv9QAUCEHrHuEYjMC/B7NCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:10:41.601467Z"},"content_sha256":"43ec69d1e59f84aeed61ef112aae94667e12a79270efff142af060357f6c16e7","schema_version":"1.0","event_id":"sha256:43ec69d1e59f84aeed61ef112aae94667e12a79270efff142af060357f6c16e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QOZBIOT6KVRZFK3EOK5Q3TYZYM/bundle.json","state_url":"https://pith.science/pith/QOZBIOT6KVRZFK3EOK5Q3TYZYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QOZBIOT6KVRZFK3EOK5Q3TYZYM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T18:10:41Z","links":{"resolver":"https://pith.science/pith/QOZBIOT6KVRZFK3EOK5Q3TYZYM","bundle":"https://pith.science/pith/QOZBIOT6KVRZFK3EOK5Q3TYZYM/bundle.json","state":"https://pith.science/pith/QOZBIOT6KVRZFK3EOK5Q3TYZYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QOZBIOT6KVRZFK3EOK5Q3TYZYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QOZBIOT6KVRZFK3EOK5Q3TYZYM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"29be2fabab3d93d8a0a8c81407ea137aa046e7a621a3d97473ba9bb3492ea94c","cross_cats_sorted":["cs.AI","cs.LO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-12-03T13:29:01Z","title_canon_sha256":"776e206ec5abffc1cebfb0292fd6556cf0d5ca820c2f83fa190dc5d628c426eb"},"schema_version":"1.0","source":{"id":"1012.0735","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0735","created_at":"2026-05-18T04:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0735v2","created_at":"2026-05-18T04:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0735","created_at":"2026-05-18T04:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"QOZBIOT6KVRZ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QOZBIOT6KVRZFK3E","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QOZBIOT6","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:43ec69d1e59f84aeed61ef112aae94667e12a79270efff142af060357f6c16e7","target":"graph","created_at":"2026-05-18T04:23:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The output of an association rule miner is often huge in practice. This is why several concise lossless representations have been proposed, such as the \"essential\" or \"representative\" rules. We revisit the algorithm given by Kryszkiewicz (Int. Symp. Intelligent Data Analysis 2001, Springer-Verlag LNCS 2189, 350-359) for mining representative rules. We show that its output is sometimes incomplete, due to an oversight in its mathematical validation. We propose alternative complete generators and we extend the approach to an existing closure-aware basis similar to, and often smaller than, the rep","authors_text":"Cristina T\\^irn\\u{a}uc\\u{a}, Diego Garc\\'ia-Saiz, Domingo G\\'omez-P\\'erez, Jos\\'e L. Balc\\'azar","cross_cats":["cs.AI","cs.LO","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-12-03T13:29:01Z","title":"Closed-set-based Discovery of Bases of Association Rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0735","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e014589f5b2006e2729d4ae658a0daa8944e98cab2872ff3bcd973d3113367ca","target":"record","created_at":"2026-05-18T04:23:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"29be2fabab3d93d8a0a8c81407ea137aa046e7a621a3d97473ba9bb3492ea94c","cross_cats_sorted":["cs.AI","cs.LO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-12-03T13:29:01Z","title_canon_sha256":"776e206ec5abffc1cebfb0292fd6556cf0d5ca820c2f83fa190dc5d628c426eb"},"schema_version":"1.0","source":{"id":"1012.0735","kind":"arxiv","version":2}},"canonical_sha256":"83b2143a7e556392ab6472bb0dcf19c31915a60f93021c5c3d0d654034fef87f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83b2143a7e556392ab6472bb0dcf19c31915a60f93021c5c3d0d654034fef87f","first_computed_at":"2026-05-18T04:23:35.023664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:35.023664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7szBD4/CAuakh0KoklMOFAUU7E7KF0qSISRG0sKb511q3Xfn1RjE2N2TeMiCzvECy6Rq+ImD6YbJLqK1/RAXAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:35.024338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.0735","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e014589f5b2006e2729d4ae658a0daa8944e98cab2872ff3bcd973d3113367ca","sha256:43ec69d1e59f84aeed61ef112aae94667e12a79270efff142af060357f6c16e7"],"state_sha256":"ad10ec3f8e227627f0ee799283c931bd5a7185d80564c77c76c575b774400ac8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MGjwsjMvcLm24OaPmQ7u/TcwN75cpnf8URJa1rREiQk69fhBzfAuH1H2+zglK+K9IRv5o2CEpn8SIc/jCcP7AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:10:41.605421Z","bundle_sha256":"5d5a0463cad2e24b09dc66592bcaba41e7ca5e5bff5cb9bed21f833b756a07a8"}}