{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:B5BWO2IW4DGUZA5RL6RB4ICSYF","short_pith_number":"pith:B5BWO2IW","canonical_record":{"source":{"id":"1209.6297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-09-27T17:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"a3894aff5eb4d7f1b3641449db9b9373e84115d77c9b977d49384142fd7e1180","abstract_canon_sha256":"0021aef536f8233ab72c042a9e57d850a4611bca2aa0e1f7980453540fb14b33"},"schema_version":"1.0"},"canonical_sha256":"0f43676916e0cd4c83b15fa21e2052c1469d0aef43e23f2edb2aaa673cad6fc9","source":{"kind":"arxiv","id":"1209.6297","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6297","created_at":"2026-05-18T03:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6297v1","created_at":"2026-05-18T03:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6297","created_at":"2026-05-18T03:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"B5BWO2IW4DGU","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B5BWO2IW4DGUZA5R","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B5BWO2IW","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:B5BWO2IW4DGUZA5RL6RB4ICSYF","target":"record","payload":{"canonical_record":{"source":{"id":"1209.6297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-09-27T17:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"a3894aff5eb4d7f1b3641449db9b9373e84115d77c9b977d49384142fd7e1180","abstract_canon_sha256":"0021aef536f8233ab72c042a9e57d850a4611bca2aa0e1f7980453540fb14b33"},"schema_version":"1.0"},"canonical_sha256":"0f43676916e0cd4c83b15fa21e2052c1469d0aef43e23f2edb2aaa673cad6fc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:34.692121Z","signature_b64":"ZspOyU6QGfue/SSMvM7MAywt4F9c3ecH83qz/wjvvkcyGsfizzdjgUKUq0olj7jJiH+pRcMPa+RLYTmhlmqJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f43676916e0cd4c83b15fa21e2052c1469d0aef43e23f2edb2aaa673cad6fc9","last_reissued_at":"2026-05-18T03:44:34.691578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:34.691578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.6297","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-18T03:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xCKbDSnAX4FNZHFrvzyBgaCVNcRbkNxa1SAPOyhBeGM9CHd2Rhk/il061zwQFL7XnvbqhiFpZkd73xFzcfl5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:01:59.109795Z"},"content_sha256":"3c7478256f9b7c01128c45105738aa9119f0ac5e4d3022e68270cf62b9e8d0b3","schema_version":"1.0","event_id":"sha256:3c7478256f9b7c01128c45105738aa9119f0ac5e4d3022e68270cf62b9e8d0b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:B5BWO2IW4DGUZA5RL6RB4ICSYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Mining Multilevel Association Rule Based on Pincer Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Pratima Gautam, Rahul Shukla","submitted_at":"2012-09-27T17:29:58Z","abstract_excerpt":"Discovering frequent itemset is a key difficulty in significant data mining applications, such as the discovery of association rules, strong rules, episodes, and minimal keys. The problem of developing models and algorithms for multilevel association mining poses for new challenges for mathematics and computer science. In this paper, we present a model of mining multilevel association rules which satisfies the different minimum support at each level, we have employed princer search concepts, multilevel taxonomy and different minimum supports to find multilevel association rules in a given tran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6297","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-18T03:44:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9NNb8jVJ3MsHafUDvg9pjNmiY3SFXkoSldEHwP0n+OwKwlOr2tEZil/fLj/yi3AsXan/r5IwtquHxeCKgj0OCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:01:59.110513Z"},"content_sha256":"1c3b4f58bba856d55079d3d08b673824f5bed561a074150a80a8136469c554ae","schema_version":"1.0","event_id":"sha256:1c3b4f58bba856d55079d3d08b673824f5bed561a074150a80a8136469c554ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5BWO2IW4DGUZA5RL6RB4ICSYF/bundle.json","state_url":"https://pith.science/pith/B5BWO2IW4DGUZA5RL6RB4ICSYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5BWO2IW4DGUZA5RL6RB4ICSYF/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-11T21:01:59Z","links":{"resolver":"https://pith.science/pith/B5BWO2IW4DGUZA5RL6RB4ICSYF","bundle":"https://pith.science/pith/B5BWO2IW4DGUZA5RL6RB4ICSYF/bundle.json","state":"https://pith.science/pith/B5BWO2IW4DGUZA5RL6RB4ICSYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5BWO2IW4DGUZA5RL6RB4ICSYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:B5BWO2IW4DGUZA5RL6RB4ICSYF","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":"0021aef536f8233ab72c042a9e57d850a4611bca2aa0e1f7980453540fb14b33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-09-27T17:29:58Z","title_canon_sha256":"a3894aff5eb4d7f1b3641449db9b9373e84115d77c9b977d49384142fd7e1180"},"schema_version":"1.0","source":{"id":"1209.6297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.6297","created_at":"2026-05-18T03:44:34Z"},{"alias_kind":"arxiv_version","alias_value":"1209.6297v1","created_at":"2026-05-18T03:44:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6297","created_at":"2026-05-18T03:44:34Z"},{"alias_kind":"pith_short_12","alias_value":"B5BWO2IW4DGU","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B5BWO2IW4DGUZA5R","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B5BWO2IW","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:1c3b4f58bba856d55079d3d08b673824f5bed561a074150a80a8136469c554ae","target":"graph","created_at":"2026-05-18T03:44:34Z","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":"Discovering frequent itemset is a key difficulty in significant data mining applications, such as the discovery of association rules, strong rules, episodes, and minimal keys. The problem of developing models and algorithms for multilevel association mining poses for new challenges for mathematics and computer science. In this paper, we present a model of mining multilevel association rules which satisfies the different minimum support at each level, we have employed princer search concepts, multilevel taxonomy and different minimum supports to find multilevel association rules in a given tran","authors_text":"Pratima Gautam, Rahul Shukla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-09-27T17:29:58Z","title":"An Efficient Algorithm for Mining Multilevel Association Rule Based on Pincer Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6297","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:3c7478256f9b7c01128c45105738aa9119f0ac5e4d3022e68270cf62b9e8d0b3","target":"record","created_at":"2026-05-18T03:44:34Z","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":"0021aef536f8233ab72c042a9e57d850a4611bca2aa0e1f7980453540fb14b33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-09-27T17:29:58Z","title_canon_sha256":"a3894aff5eb4d7f1b3641449db9b9373e84115d77c9b977d49384142fd7e1180"},"schema_version":"1.0","source":{"id":"1209.6297","kind":"arxiv","version":1}},"canonical_sha256":"0f43676916e0cd4c83b15fa21e2052c1469d0aef43e23f2edb2aaa673cad6fc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f43676916e0cd4c83b15fa21e2052c1469d0aef43e23f2edb2aaa673cad6fc9","first_computed_at":"2026-05-18T03:44:34.691578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:34.691578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZspOyU6QGfue/SSMvM7MAywt4F9c3ecH83qz/wjvvkcyGsfizzdjgUKUq0olj7jJiH+pRcMPa+RLYTmhlmqJBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:34.692121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.6297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c7478256f9b7c01128c45105738aa9119f0ac5e4d3022e68270cf62b9e8d0b3","sha256:1c3b4f58bba856d55079d3d08b673824f5bed561a074150a80a8136469c554ae"],"state_sha256":"b9e576b8b8cf23aa36dc5d09208a638d44d19b2a415fcb0e0dc325a7b41c372a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCjQ7crM0Tw/zTdT2snPwyXpnV7Bh6XFXTUf1jzysMd1Tl/xMsM/vYpWnduwJNE1VwAbSjv6GCeKXKwnN/jLAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:01:59.114449Z","bundle_sha256":"8657bbbdea6326ecabd920232ff684770bee4c6b3b118f4a7c00ea57837e5e1f"}}