{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZJKQEAYUBPNLBXOU4NB3643SZP","short_pith_number":"pith:ZJKQEAYU","canonical_record":{"source":{"id":"1108.5253","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2011-08-26T08:07:22Z","cross_cats_sorted":[],"title_canon_sha256":"85fc29c7be3cebd0f2752c0d3d8095937b75bbed7eda56e948bdfd1c503e3988","abstract_canon_sha256":"59e6fe37ad8cd7edbcf7d9291fe3209d2b1c0a7993ec59f5fe9f4134d570b7ab"},"schema_version":"1.0"},"canonical_sha256":"ca550203140bdab0ddd4e343bf7372cbff313f6c453f8c1217bd482a0b3c9448","source":{"kind":"arxiv","id":"1108.5253","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5253","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5253v1","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5253","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZJKQEAYUBPNL","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZJKQEAYUBPNLBXOU","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZJKQEAYU","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZJKQEAYUBPNLBXOU4NB3643SZP","target":"record","payload":{"canonical_record":{"source":{"id":"1108.5253","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2011-08-26T08:07:22Z","cross_cats_sorted":[],"title_canon_sha256":"85fc29c7be3cebd0f2752c0d3d8095937b75bbed7eda56e948bdfd1c503e3988","abstract_canon_sha256":"59e6fe37ad8cd7edbcf7d9291fe3209d2b1c0a7993ec59f5fe9f4134d570b7ab"},"schema_version":"1.0"},"canonical_sha256":"ca550203140bdab0ddd4e343bf7372cbff313f6c453f8c1217bd482a0b3c9448","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:38.665415Z","signature_b64":"QP+jw2cFHCRdY+CKcaeiMh6aG72HGCVxdYsHHMbOb/INMjisi1eHH3hm01HKJZB1I980xaB1pDrYJI2Spy9+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca550203140bdab0ddd4e343bf7372cbff313f6c453f8c1217bd482a0b3c9448","last_reissued_at":"2026-05-18T04:14:38.664983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:38.664983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.5253","source_version":1,"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:14:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s99boqEbI4P+u+Br+00WNQShFgLZgdO9khfR6wh5R0T8fo0LLzeljhYHya2jXXQ+1zwEYPBhoEkvFBb+mUgrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T19:56:20.648678Z"},"content_sha256":"9ee3daaede590c1b580b56558087be3808f2fe19df3acd73b5b894746b519504","schema_version":"1.0","event_id":"sha256:9ee3daaede590c1b580b56558087be3808f2fe19df3acd73b5b894746b519504"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZJKQEAYUBPNLBXOU4NB3643SZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Frequent Closed Itemsets Lattice-based Approach for Mining Minimal Non-Redundant Association Rules","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bac Le, Bay Vo","submitted_at":"2011-08-26T08:07:22Z","abstract_excerpt":"There are many algorithms developed for improvement the time of mining frequent itemsets (FI) or frequent closed itemsets (FCI). However, the algorithms which deal with the time of generating association rules were not put in deep research. In reality, in case of a database containing many FI/FCI (from ten thousands up to millions), the time of generating association rules is much larger than that of mining FI/FCI. Therefore, this paper presents an application of frequent closed itemsets lattice (FCIL) for mining minimal non-redundant association rules (MNAR) to reduce a lot of time for genera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5253","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"},"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:14:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNHCzEcrU5KWJpXA/a539m7MBdv29tGr/AbrxK03hjppt+xg4ajuu4Zui2TUR0iXvapUI4cpFqzL6U2psYrvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T19:56:20.649040Z"},"content_sha256":"b4e6137b8e6afb79cd793f50f99dde2f4511aa1e4ea295a2efdede1c71b8d4da","schema_version":"1.0","event_id":"sha256:b4e6137b8e6afb79cd793f50f99dde2f4511aa1e4ea295a2efdede1c71b8d4da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJKQEAYUBPNLBXOU4NB3643SZP/bundle.json","state_url":"https://pith.science/pith/ZJKQEAYUBPNLBXOU4NB3643SZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJKQEAYUBPNLBXOU4NB3643SZP/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-07-01T19:56:20Z","links":{"resolver":"https://pith.science/pith/ZJKQEAYUBPNLBXOU4NB3643SZP","bundle":"https://pith.science/pith/ZJKQEAYUBPNLBXOU4NB3643SZP/bundle.json","state":"https://pith.science/pith/ZJKQEAYUBPNLBXOU4NB3643SZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJKQEAYUBPNLBXOU4NB3643SZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZJKQEAYUBPNLBXOU4NB3643SZP","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":"59e6fe37ad8cd7edbcf7d9291fe3209d2b1c0a7993ec59f5fe9f4134d570b7ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2011-08-26T08:07:22Z","title_canon_sha256":"85fc29c7be3cebd0f2752c0d3d8095937b75bbed7eda56e948bdfd1c503e3988"},"schema_version":"1.0","source":{"id":"1108.5253","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.5253","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"arxiv_version","alias_value":"1108.5253v1","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5253","created_at":"2026-05-18T04:14:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZJKQEAYUBPNL","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZJKQEAYUBPNLBXOU","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZJKQEAYU","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:b4e6137b8e6afb79cd793f50f99dde2f4511aa1e4ea295a2efdede1c71b8d4da","target":"graph","created_at":"2026-05-18T04:14:38Z","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":"There are many algorithms developed for improvement the time of mining frequent itemsets (FI) or frequent closed itemsets (FCI). However, the algorithms which deal with the time of generating association rules were not put in deep research. In reality, in case of a database containing many FI/FCI (from ten thousands up to millions), the time of generating association rules is much larger than that of mining FI/FCI. Therefore, this paper presents an application of frequent closed itemsets lattice (FCIL) for mining minimal non-redundant association rules (MNAR) to reduce a lot of time for genera","authors_text":"Bac Le, Bay Vo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2011-08-26T08:07:22Z","title":"A Frequent Closed Itemsets Lattice-based Approach for Mining Minimal Non-Redundant Association Rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5253","kind":"arxiv","version":1},"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:9ee3daaede590c1b580b56558087be3808f2fe19df3acd73b5b894746b519504","target":"record","created_at":"2026-05-18T04:14:38Z","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":"59e6fe37ad8cd7edbcf7d9291fe3209d2b1c0a7993ec59f5fe9f4134d570b7ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2011-08-26T08:07:22Z","title_canon_sha256":"85fc29c7be3cebd0f2752c0d3d8095937b75bbed7eda56e948bdfd1c503e3988"},"schema_version":"1.0","source":{"id":"1108.5253","kind":"arxiv","version":1}},"canonical_sha256":"ca550203140bdab0ddd4e343bf7372cbff313f6c453f8c1217bd482a0b3c9448","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca550203140bdab0ddd4e343bf7372cbff313f6c453f8c1217bd482a0b3c9448","first_computed_at":"2026-05-18T04:14:38.664983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:38.664983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QP+jw2cFHCRdY+CKcaeiMh6aG72HGCVxdYsHHMbOb/INMjisi1eHH3hm01HKJZB1I980xaB1pDrYJI2Spy9+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:38.665415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.5253","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ee3daaede590c1b580b56558087be3808f2fe19df3acd73b5b894746b519504","sha256:b4e6137b8e6afb79cd793f50f99dde2f4511aa1e4ea295a2efdede1c71b8d4da"],"state_sha256":"d788cd3ef4950b313711e0b5ddda53b538b80e5ce0d892f6defab263ccb4dd10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYVVTui0Rfi0ssKxqZW0fukq00z65XvPFwj1NyH+nPV6qeuFNrL2Rvhn88PFORZdTJFxS60qYr8SwSRb22ovCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T19:56:20.651451Z","bundle_sha256":"e3b5255ada6d6ec5cf27a6b5c15bb05af1b23ef9477717cfd6046141212300d7"}}