{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZUJMOSV4ZB2P43LWM2CUYVSMS5","short_pith_number":"pith:ZUJMOSV4","canonical_record":{"source":{"id":"1110.3158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-14T09:25:52Z","cross_cats_sorted":[],"title_canon_sha256":"1cbed0895e204484fd466aa47be80d35b825dae64037457dcccdd525e2e5eaac","abstract_canon_sha256":"a1ca01f50fad2fdb1b46d265c45a972bbac97974329bc47c0c9aacb429832f25"},"schema_version":"1.0"},"canonical_sha256":"cd12c74abcc874fe6d7666854c564c97671caa16f0ff1074039663bdc4818bf8","source":{"kind":"arxiv","id":"1110.3158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3158","created_at":"2026-05-18T04:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3158v1","created_at":"2026-05-18T04:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3158","created_at":"2026-05-18T04:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZUJMOSV4ZB2P","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZUJMOSV4ZB2P43LW","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZUJMOSV4","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZUJMOSV4ZB2P43LWM2CUYVSMS5","target":"record","payload":{"canonical_record":{"source":{"id":"1110.3158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-14T09:25:52Z","cross_cats_sorted":[],"title_canon_sha256":"1cbed0895e204484fd466aa47be80d35b825dae64037457dcccdd525e2e5eaac","abstract_canon_sha256":"a1ca01f50fad2fdb1b46d265c45a972bbac97974329bc47c0c9aacb429832f25"},"schema_version":"1.0"},"canonical_sha256":"cd12c74abcc874fe6d7666854c564c97671caa16f0ff1074039663bdc4818bf8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:57.932739Z","signature_b64":"gAlio+Jk4CaHbcWW+nEObFLuKf5qcV5xASHUN5VPxc8kaCgJAsF4Km0Z8hzUgZtuzgz6ZmE2zYO33B+tHuywAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd12c74abcc874fe6d7666854c564c97671caa16f0ff1074039663bdc4818bf8","last_reissued_at":"2026-05-18T04:10:57.932143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:57.932143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.3158","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:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qk7VXQjaCnj+B+uiREKBmiN9c/dpJQpu3dzUHrN+xQhkLDEvXXgDtwS1iTD/NjzlvNVsdRqvM0on8mA/UCqxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:33:22.801738Z"},"content_sha256":"b16b188ae429f6df86937716a5ad0a3f1664a032c481408438b0899467c5437d","schema_version":"1.0","event_id":"sha256:b16b188ae429f6df86937716a5ad0a3f1664a032c481408438b0899467c5437d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZUJMOSV4ZB2P43LWM2CUYVSMS5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Incremental Breadth-Depth XML Event Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"J\\'er\\^ome Darmont (ERIC), Omar Boussa\\\"id (ERIC), Rashed Salem (ERIC)","submitted_at":"2011-10-14T09:25:52Z","abstract_excerpt":"Many applications log a large amount of events continuously. Extracting interesting knowledge from logged events is an emerging active research area in data mining. In this context, we propose an approach for mining frequent events and association rules from logged events in XML format. This approach is composed of two-main phases: I) constructing a novel tree structure called Frequency XML-based Tree (FXT), which contains the frequency of events to be mined; II) querying the constructed FXT using XQuery to discover frequent itemsets and association rules. The FXT is constructed with a single-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3158","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:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"925iRWU9jvZ0dc1XD4xMH/7SRe/lh/q6qtY4NBd+E09NxBGfPM/pKwUUITIjssSiWRmZRN304PjV+pTTd5s3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:33:22.802455Z"},"content_sha256":"f78cce353dc8477a8fb337ffda1f65c6fdcc2f4df43c98877e94bff41574d958","schema_version":"1.0","event_id":"sha256:f78cce353dc8477a8fb337ffda1f65c6fdcc2f4df43c98877e94bff41574d958"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUJMOSV4ZB2P43LWM2CUYVSMS5/bundle.json","state_url":"https://pith.science/pith/ZUJMOSV4ZB2P43LWM2CUYVSMS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUJMOSV4ZB2P43LWM2CUYVSMS5/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-09T08:33:22Z","links":{"resolver":"https://pith.science/pith/ZUJMOSV4ZB2P43LWM2CUYVSMS5","bundle":"https://pith.science/pith/ZUJMOSV4ZB2P43LWM2CUYVSMS5/bundle.json","state":"https://pith.science/pith/ZUJMOSV4ZB2P43LWM2CUYVSMS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUJMOSV4ZB2P43LWM2CUYVSMS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZUJMOSV4ZB2P43LWM2CUYVSMS5","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":"a1ca01f50fad2fdb1b46d265c45a972bbac97974329bc47c0c9aacb429832f25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-14T09:25:52Z","title_canon_sha256":"1cbed0895e204484fd466aa47be80d35b825dae64037457dcccdd525e2e5eaac"},"schema_version":"1.0","source":{"id":"1110.3158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.3158","created_at":"2026-05-18T04:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1110.3158v1","created_at":"2026-05-18T04:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.3158","created_at":"2026-05-18T04:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZUJMOSV4ZB2P","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZUJMOSV4ZB2P43LW","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZUJMOSV4","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:f78cce353dc8477a8fb337ffda1f65c6fdcc2f4df43c98877e94bff41574d958","target":"graph","created_at":"2026-05-18T04:10:57Z","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":"Many applications log a large amount of events continuously. Extracting interesting knowledge from logged events is an emerging active research area in data mining. In this context, we propose an approach for mining frequent events and association rules from logged events in XML format. This approach is composed of two-main phases: I) constructing a novel tree structure called Frequency XML-based Tree (FXT), which contains the frequency of events to be mined; II) querying the constructed FXT using XQuery to discover frequent itemsets and association rules. The FXT is constructed with a single-","authors_text":"J\\'er\\^ome Darmont (ERIC), Omar Boussa\\\"id (ERIC), Rashed Salem (ERIC)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-14T09:25:52Z","title":"Efficient Incremental Breadth-Depth XML Event Mining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.3158","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:b16b188ae429f6df86937716a5ad0a3f1664a032c481408438b0899467c5437d","target":"record","created_at":"2026-05-18T04:10:57Z","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":"a1ca01f50fad2fdb1b46d265c45a972bbac97974329bc47c0c9aacb429832f25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-10-14T09:25:52Z","title_canon_sha256":"1cbed0895e204484fd466aa47be80d35b825dae64037457dcccdd525e2e5eaac"},"schema_version":"1.0","source":{"id":"1110.3158","kind":"arxiv","version":1}},"canonical_sha256":"cd12c74abcc874fe6d7666854c564c97671caa16f0ff1074039663bdc4818bf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd12c74abcc874fe6d7666854c564c97671caa16f0ff1074039663bdc4818bf8","first_computed_at":"2026-05-18T04:10:57.932143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:57.932143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gAlio+Jk4CaHbcWW+nEObFLuKf5qcV5xASHUN5VPxc8kaCgJAsF4Km0Z8hzUgZtuzgz6ZmE2zYO33B+tHuywAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:57.932739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.3158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b16b188ae429f6df86937716a5ad0a3f1664a032c481408438b0899467c5437d","sha256:f78cce353dc8477a8fb337ffda1f65c6fdcc2f4df43c98877e94bff41574d958"],"state_sha256":"8448fe142e50eac93ee9eef2ff8a23f0b565abe9b2fed39cfda6a9f2abf2d015"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTqNjua7a8ATvdBBpxSXvgf/KHAD+y6KSSr6entkujpOTs8BgM0S/8C+JG6zhp6YkXsGvf18B/bPQbV3gtupBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:33:22.806270Z","bundle_sha256":"3cd9cee033e47f9cc1105dbc0e754fe0ea3dee3e7c3d125851d2de078bdc94cf"}}