{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:ULQE7ECVZM4QADRZHZY7XBQU3A","short_pith_number":"pith:ULQE7ECV","canonical_record":{"source":{"id":"0904.3310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2009-04-21T18:33:04Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"7ab4d7822c6d0e9a24b0a9ef24e706fc1a1b35a4dd5d14dc6dadcb1d3eac1e5c","abstract_canon_sha256":"69e7587baf0ae62f841f6e5530ffb4b97875c1985a5570e666705a44ed3a6a7b"},"schema_version":"1.0"},"canonical_sha256":"a2e04f9055cb39000e393e71fb8614d81b881ff5df7938841a60dd3a3db25556","source":{"kind":"arxiv","id":"0904.3310","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.3310","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0904.3310v1","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.3310","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"ULQE7ECVZM4Q","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"ULQE7ECVZM4QADRZ","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"ULQE7ECV","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:ULQE7ECVZM4QADRZHZY7XBQU3A","target":"record","payload":{"canonical_record":{"source":{"id":"0904.3310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2009-04-21T18:33:04Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"7ab4d7822c6d0e9a24b0a9ef24e706fc1a1b35a4dd5d14dc6dadcb1d3eac1e5c","abstract_canon_sha256":"69e7587baf0ae62f841f6e5530ffb4b97875c1985a5570e666705a44ed3a6a7b"},"schema_version":"1.0"},"canonical_sha256":"a2e04f9055cb39000e393e71fb8614d81b881ff5df7938841a60dd3a3db25556","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:20.225443Z","signature_b64":"SgQe7xH+F0YiRhH9o698rdixUV7KoOXF9bNThXXxspVGmt5a43kF+ybV7ajR7gTVqIOMmpxJUjD/GdGN4zK6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2e04f9055cb39000e393e71fb8614d81b881ff5df7938841a60dd3a3db25556","last_reissued_at":"2026-05-18T00:58:20.224875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:20.224875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0904.3310","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-18T00:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XTtwalNuu73cqzDeRSWF6oLZ5UJSTtoqh4mZlIpfjoJBcwQrDNkjzI4PE59txN7GJhYvOQstyka1DIVBVTgWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:55:38.258764Z"},"content_sha256":"955717a1ea2ab85e5b278678d3156e0f5f4e6333296a801cd76bd7f9b307a3d2","schema_version":"1.0","event_id":"sha256:955717a1ea2ab85e5b278678d3156e0f5f4e6333296a801cd76bd7f9b307a3d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:ULQE7ECVZM4QADRZHZY7XBQU3A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FastLMFI: An Efficient Approach for Local Maximal Patterns Propagation and Maximal Patterns Superset Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.DB","authors_text":"Abdul Rauf Baig, Shariq Bashir","submitted_at":"2009-04-21T18:33:04Z","abstract_excerpt":"Maximal frequent patterns superset checking plays an important role in the efficient mining of complete Maximal Frequent Itemsets (MFI) and maximal search space pruning. In this paper we present a new indexing approach, FastLMFI for local maximal frequent patterns (itemset) propagation and maximal patterns superset checking. Experimental results on different sparse and dense datasets show that our work is better than the previous well known progressive focusing technique. We have also integrated our superset checking approach with an existing state of the art maximal itemsets algorithm Mafia, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.3310","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-18T00:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uoiQKxqPIRpcRLrXP8BqkaMVlYdzzAM+HH42+8bYpZxHMexCxq03AnDH/HL5PYoqpCaWIKFbJB+jR2fwGh6fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:55:38.259108Z"},"content_sha256":"d662aae3c82408da03fe3f2b2f1e4b117a4bd0af0061dd99ee703e0e35357b70","schema_version":"1.0","event_id":"sha256:d662aae3c82408da03fe3f2b2f1e4b117a4bd0af0061dd99ee703e0e35357b70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULQE7ECVZM4QADRZHZY7XBQU3A/bundle.json","state_url":"https://pith.science/pith/ULQE7ECVZM4QADRZHZY7XBQU3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULQE7ECVZM4QADRZHZY7XBQU3A/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-27T12:55:38Z","links":{"resolver":"https://pith.science/pith/ULQE7ECVZM4QADRZHZY7XBQU3A","bundle":"https://pith.science/pith/ULQE7ECVZM4QADRZHZY7XBQU3A/bundle.json","state":"https://pith.science/pith/ULQE7ECVZM4QADRZHZY7XBQU3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULQE7ECVZM4QADRZHZY7XBQU3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:ULQE7ECVZM4QADRZHZY7XBQU3A","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":"69e7587baf0ae62f841f6e5530ffb4b97875c1985a5570e666705a44ed3a6a7b","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2009-04-21T18:33:04Z","title_canon_sha256":"7ab4d7822c6d0e9a24b0a9ef24e706fc1a1b35a4dd5d14dc6dadcb1d3eac1e5c"},"schema_version":"1.0","source":{"id":"0904.3310","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.3310","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0904.3310v1","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.3310","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"ULQE7ECVZM4Q","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"ULQE7ECVZM4QADRZ","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"ULQE7ECV","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:d662aae3c82408da03fe3f2b2f1e4b117a4bd0af0061dd99ee703e0e35357b70","target":"graph","created_at":"2026-05-18T00:58:20Z","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":"Maximal frequent patterns superset checking plays an important role in the efficient mining of complete Maximal Frequent Itemsets (MFI) and maximal search space pruning. In this paper we present a new indexing approach, FastLMFI for local maximal frequent patterns (itemset) propagation and maximal patterns superset checking. Experimental results on different sparse and dense datasets show that our work is better than the previous well known progressive focusing technique. We have also integrated our superset checking approach with an existing state of the art maximal itemsets algorithm Mafia, ","authors_text":"Abdul Rauf Baig, Shariq Bashir","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2009-04-21T18:33:04Z","title":"FastLMFI: An Efficient Approach for Local Maximal Patterns Propagation and Maximal Patterns Superset Checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.3310","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:955717a1ea2ab85e5b278678d3156e0f5f4e6333296a801cd76bd7f9b307a3d2","target":"record","created_at":"2026-05-18T00:58:20Z","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":"69e7587baf0ae62f841f6e5530ffb4b97875c1985a5570e666705a44ed3a6a7b","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2009-04-21T18:33:04Z","title_canon_sha256":"7ab4d7822c6d0e9a24b0a9ef24e706fc1a1b35a4dd5d14dc6dadcb1d3eac1e5c"},"schema_version":"1.0","source":{"id":"0904.3310","kind":"arxiv","version":1}},"canonical_sha256":"a2e04f9055cb39000e393e71fb8614d81b881ff5df7938841a60dd3a3db25556","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2e04f9055cb39000e393e71fb8614d81b881ff5df7938841a60dd3a3db25556","first_computed_at":"2026-05-18T00:58:20.224875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:20.224875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SgQe7xH+F0YiRhH9o698rdixUV7KoOXF9bNThXXxspVGmt5a43kF+ybV7ajR7gTVqIOMmpxJUjD/GdGN4zK6CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:20.225443Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.3310","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:955717a1ea2ab85e5b278678d3156e0f5f4e6333296a801cd76bd7f9b307a3d2","sha256:d662aae3c82408da03fe3f2b2f1e4b117a4bd0af0061dd99ee703e0e35357b70"],"state_sha256":"19cc45ea8491bc12f1194e766b60dd42d4d58fa91049ce21b00741b6f66f2777"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPyTKFDX7hFs1moXRqXOL0RSaA/BHBHe9e+OG2GyVtKH+FNXzvdptQvLtRIBCK1nL/N33YqTrS2gppWqqr0GAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:55:38.261566Z","bundle_sha256":"eb8486b5e872c1e13f25ace74c5c4172cb6495cad4522d9d9393036bb277fbec"}}