{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MKBII7RC74HMCLWDEKTRVCXMMX","short_pith_number":"pith:MKBII7RC","canonical_record":{"source":{"id":"1008.2300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-13T12:06:29Z","cross_cats_sorted":[],"title_canon_sha256":"5a429c61b8614961c2edbfe9978940240054243efce84ad63f1064127679ae1b","abstract_canon_sha256":"61c1cb2f48740c0765708a45016afb983ad117a1e23e4a4c9e3a0242015c70ed"},"schema_version":"1.0"},"canonical_sha256":"6282847e22ff0ec12ec322a71a8aec65c9636cef0c9ab85c9e63e92ae2995837","source":{"kind":"arxiv","id":"1008.2300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2300","created_at":"2026-05-18T04:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2300v1","created_at":"2026-05-18T04:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2300","created_at":"2026-05-18T04:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"MKBII7RC74HM","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MKBII7RC74HMCLWD","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MKBII7RC","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MKBII7RC74HMCLWDEKTRVCXMMX","target":"record","payload":{"canonical_record":{"source":{"id":"1008.2300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-13T12:06:29Z","cross_cats_sorted":[],"title_canon_sha256":"5a429c61b8614961c2edbfe9978940240054243efce84ad63f1064127679ae1b","abstract_canon_sha256":"61c1cb2f48740c0765708a45016afb983ad117a1e23e4a4c9e3a0242015c70ed"},"schema_version":"1.0"},"canonical_sha256":"6282847e22ff0ec12ec322a71a8aec65c9636cef0c9ab85c9e63e92ae2995837","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:14.236038Z","signature_b64":"r6AzGcsVS0yOkDRZ9pQ5stvzZpQ+hDZhb8bHscwFmRXQbOrPrRhyIpqGK7qwoCZtLQo6COaf8S/yI1TtOU8EAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6282847e22ff0ec12ec322a71a8aec65c9636cef0c9ab85c9e63e92ae2995837","last_reissued_at":"2026-05-18T04:42:14.235409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:14.235409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.2300","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:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTlOb0ZjqbZ/LEpC1wzco3RMPEaQkXAc5l8TGnxxD5dSnDF3tL7qJShTCf6/yAgcbc+i0yeJCD+jLGQPa+urCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:11:56.530752Z"},"content_sha256":"a875761691eda43c2874fe26fb87dfa0ad228cca9a85c62bfb576679b4e65a9d","schema_version":"1.0","event_id":"sha256:a875761691eda43c2874fe26fb87dfa0ad228cca9a85c62bfb576679b4e65a9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MKBII7RC74HMCLWDEKTRVCXMMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Frequent Pattern Growth for Itemset Mining in Uncertain Databases (Technical Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Andreas Z\\\"ufle, Florian Verhein, Hans-Peter Kriegel, Matthias Renz, Thomas Bernecker","submitted_at":"2010-08-13T12:06:29Z","abstract_excerpt":"Frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied on standard (certain) transaction databases. Uncertain transaction databases consist of sets of existentially uncertain items. The uncertainty of items in transactions makes traditional techniques inapplicable. In this paper, we tackle the problem of finding probabilistic frequent itemsets based on possible world semantics. In this context, an itemset X is called frequent if the probability that X occurs in at least minSup transactions is above a given thresho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2300","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:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eMRrb9ZcUnsX8rsY3mE3ibdt/pKBo9R+mFmxhr//m2xXef5BxNNdiYqljQ6p4b8yX29f5TqgtcTYFEZ/xQoLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:11:56.531094Z"},"content_sha256":"6056ff31485e4c30e7dbe7abbb88fe5ec4c734a6a065f874aa1da09eeab68bcb","schema_version":"1.0","event_id":"sha256:6056ff31485e4c30e7dbe7abbb88fe5ec4c734a6a065f874aa1da09eeab68bcb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKBII7RC74HMCLWDEKTRVCXMMX/bundle.json","state_url":"https://pith.science/pith/MKBII7RC74HMCLWDEKTRVCXMMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKBII7RC74HMCLWDEKTRVCXMMX/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-04T01:11:56Z","links":{"resolver":"https://pith.science/pith/MKBII7RC74HMCLWDEKTRVCXMMX","bundle":"https://pith.science/pith/MKBII7RC74HMCLWDEKTRVCXMMX/bundle.json","state":"https://pith.science/pith/MKBII7RC74HMCLWDEKTRVCXMMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKBII7RC74HMCLWDEKTRVCXMMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MKBII7RC74HMCLWDEKTRVCXMMX","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":"61c1cb2f48740c0765708a45016afb983ad117a1e23e4a4c9e3a0242015c70ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-13T12:06:29Z","title_canon_sha256":"5a429c61b8614961c2edbfe9978940240054243efce84ad63f1064127679ae1b"},"schema_version":"1.0","source":{"id":"1008.2300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2300","created_at":"2026-05-18T04:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2300v1","created_at":"2026-05-18T04:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2300","created_at":"2026-05-18T04:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"MKBII7RC74HM","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MKBII7RC74HMCLWD","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MKBII7RC","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:6056ff31485e4c30e7dbe7abbb88fe5ec4c734a6a065f874aa1da09eeab68bcb","target":"graph","created_at":"2026-05-18T04:42:14Z","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":"Frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied on standard (certain) transaction databases. Uncertain transaction databases consist of sets of existentially uncertain items. The uncertainty of items in transactions makes traditional techniques inapplicable. In this paper, we tackle the problem of finding probabilistic frequent itemsets based on possible world semantics. In this context, an itemset X is called frequent if the probability that X occurs in at least minSup transactions is above a given thresho","authors_text":"Andreas Z\\\"ufle, Florian Verhein, Hans-Peter Kriegel, Matthias Renz, Thomas Bernecker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-13T12:06:29Z","title":"Probabilistic Frequent Pattern Growth for Itemset Mining in Uncertain Databases (Technical Report)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2300","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:a875761691eda43c2874fe26fb87dfa0ad228cca9a85c62bfb576679b4e65a9d","target":"record","created_at":"2026-05-18T04:42:14Z","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":"61c1cb2f48740c0765708a45016afb983ad117a1e23e4a4c9e3a0242015c70ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-13T12:06:29Z","title_canon_sha256":"5a429c61b8614961c2edbfe9978940240054243efce84ad63f1064127679ae1b"},"schema_version":"1.0","source":{"id":"1008.2300","kind":"arxiv","version":1}},"canonical_sha256":"6282847e22ff0ec12ec322a71a8aec65c9636cef0c9ab85c9e63e92ae2995837","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6282847e22ff0ec12ec322a71a8aec65c9636cef0c9ab85c9e63e92ae2995837","first_computed_at":"2026-05-18T04:42:14.235409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:14.235409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r6AzGcsVS0yOkDRZ9pQ5stvzZpQ+hDZhb8bHscwFmRXQbOrPrRhyIpqGK7qwoCZtLQo6COaf8S/yI1TtOU8EAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:14.236038Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a875761691eda43c2874fe26fb87dfa0ad228cca9a85c62bfb576679b4e65a9d","sha256:6056ff31485e4c30e7dbe7abbb88fe5ec4c734a6a065f874aa1da09eeab68bcb"],"state_sha256":"79ef1a5f44eb92473ebd2cfb5651d7e9ac947295ba35dc692c959cd2d23e7e70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbb8T2gCe1E9Lbx+hsfwObadqOoY6QA3avX/qlV+nlBgaO0eVL6quGZP51qFnN2E9e4h/t2kn+YJx0lBM8nSCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:11:56.533189Z","bundle_sha256":"db9cd5a01691eef6cf1264eb89ab2fff94eb71766e83813c933b13a80abbee7e"}}