{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LLGIHCSKJP3SNPRPU3Z5UNO4WA","short_pith_number":"pith:LLGIHCSK","canonical_record":{"source":{"id":"1008.2626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-16T11:35:59Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a51aa4597224948c5fcc1d77a1797df1a2699d8e3c80c60bed651b83c1489714","abstract_canon_sha256":"afc90183d598be6b3d4685168a84b1ae91c7eddb9818e03a7426265f8dc6149d"},"schema_version":"1.0"},"canonical_sha256":"5acc838a4a4bf726be2fa6f3da35dcb020824adbfadd83289c876b3459dc3db7","source":{"kind":"arxiv","id":"1008.2626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2626","created_at":"2026-05-18T04:42:12Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2626v1","created_at":"2026-05-18T04:42:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2626","created_at":"2026-05-18T04:42:12Z"},{"alias_kind":"pith_short_12","alias_value":"LLGIHCSKJP3S","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LLGIHCSKJP3SNPRP","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LLGIHCSK","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LLGIHCSKJP3SNPRPU3Z5UNO4WA","target":"record","payload":{"canonical_record":{"source":{"id":"1008.2626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-16T11:35:59Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a51aa4597224948c5fcc1d77a1797df1a2699d8e3c80c60bed651b83c1489714","abstract_canon_sha256":"afc90183d598be6b3d4685168a84b1ae91c7eddb9818e03a7426265f8dc6149d"},"schema_version":"1.0"},"canonical_sha256":"5acc838a4a4bf726be2fa6f3da35dcb020824adbfadd83289c876b3459dc3db7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:12.895915Z","signature_b64":"ADtUPmpt/t8sNoDqWNWlezlScUDBgI/QnqNxsp9B7WiDKox3rC0Z4iBsPdOA/tOxEruQF97l5MzWSkMSkJxzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5acc838a4a4bf726be2fa6f3da35dcb020824adbfadd83289c876b3459dc3db7","last_reissued_at":"2026-05-18T04:42:12.895390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:12.895390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.2626","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:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DfVzW+06GFpv6oT0UYGSpl2JRhijnKwn/FsdBXvw5N6kFlYzfiwW+T+xgsyLEUE0f3clhML9QU8IYAmG2fYfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:57:25.086193Z"},"content_sha256":"fb4f6e6f354574da3186b469d854694c3a4aa2ef23be144d44367dbc997f373a","schema_version":"1.0","event_id":"sha256:fb4f6e6f354574da3186b469d854694c3a4aa2ef23be144d44367dbc997f373a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LLGIHCSKJP3SNPRPU3Z5UNO4WA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mining tree-query associations in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Eveline Hoekx, Jan Van den Bussche","submitted_at":"2010-08-16T11:35:59Z","abstract_excerpt":"New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasetsstructured as graphs. We introduce a novel class of tree-shapedpatterns called tree queries, and present algorithms for miningtree queries and tree-query associations in a large data graph. Novel about our class of patterns is that they can containconstants, and can contain existential nodes which are not counted when determining the number of occurrences of the patternin the data graph. Our algorithms have a number of provableoptimality properties, which are based on the theory of c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2626","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:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LDKixKkK/FbyVif2PAYAYGUSY5U9wdRWQ55w0NAk3xQ5KXU+gXuR6GEnvk8RU0S+M1fHDnZVkeCNA6hzGU8tCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:57:25.086826Z"},"content_sha256":"d0b6c256c220caa054f9f876503ac90dd9dffaf481fee07aa3df99eb11ef8ff9","schema_version":"1.0","event_id":"sha256:d0b6c256c220caa054f9f876503ac90dd9dffaf481fee07aa3df99eb11ef8ff9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLGIHCSKJP3SNPRPU3Z5UNO4WA/bundle.json","state_url":"https://pith.science/pith/LLGIHCSKJP3SNPRPU3Z5UNO4WA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLGIHCSKJP3SNPRPU3Z5UNO4WA/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-08T15:57:25Z","links":{"resolver":"https://pith.science/pith/LLGIHCSKJP3SNPRPU3Z5UNO4WA","bundle":"https://pith.science/pith/LLGIHCSKJP3SNPRPU3Z5UNO4WA/bundle.json","state":"https://pith.science/pith/LLGIHCSKJP3SNPRPU3Z5UNO4WA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLGIHCSKJP3SNPRPU3Z5UNO4WA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LLGIHCSKJP3SNPRPU3Z5UNO4WA","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":"afc90183d598be6b3d4685168a84b1ae91c7eddb9818e03a7426265f8dc6149d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-16T11:35:59Z","title_canon_sha256":"a51aa4597224948c5fcc1d77a1797df1a2699d8e3c80c60bed651b83c1489714"},"schema_version":"1.0","source":{"id":"1008.2626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.2626","created_at":"2026-05-18T04:42:12Z"},{"alias_kind":"arxiv_version","alias_value":"1008.2626v1","created_at":"2026-05-18T04:42:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.2626","created_at":"2026-05-18T04:42:12Z"},{"alias_kind":"pith_short_12","alias_value":"LLGIHCSKJP3S","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LLGIHCSKJP3SNPRP","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LLGIHCSK","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:d0b6c256c220caa054f9f876503ac90dd9dffaf481fee07aa3df99eb11ef8ff9","target":"graph","created_at":"2026-05-18T04:42:12Z","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":"New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasetsstructured as graphs. We introduce a novel class of tree-shapedpatterns called tree queries, and present algorithms for miningtree queries and tree-query associations in a large data graph. Novel about our class of patterns is that they can containconstants, and can contain existential nodes which are not counted when determining the number of occurrences of the patternin the data graph. Our algorithms have a number of provableoptimality properties, which are based on the theory of c","authors_text":"Eveline Hoekx, Jan Van den Bussche","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-16T11:35:59Z","title":"Mining tree-query associations in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.2626","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:fb4f6e6f354574da3186b469d854694c3a4aa2ef23be144d44367dbc997f373a","target":"record","created_at":"2026-05-18T04:42:12Z","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":"afc90183d598be6b3d4685168a84b1ae91c7eddb9818e03a7426265f8dc6149d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2010-08-16T11:35:59Z","title_canon_sha256":"a51aa4597224948c5fcc1d77a1797df1a2699d8e3c80c60bed651b83c1489714"},"schema_version":"1.0","source":{"id":"1008.2626","kind":"arxiv","version":1}},"canonical_sha256":"5acc838a4a4bf726be2fa6f3da35dcb020824adbfadd83289c876b3459dc3db7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5acc838a4a4bf726be2fa6f3da35dcb020824adbfadd83289c876b3459dc3db7","first_computed_at":"2026-05-18T04:42:12.895390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:12.895390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ADtUPmpt/t8sNoDqWNWlezlScUDBgI/QnqNxsp9B7WiDKox3rC0Z4iBsPdOA/tOxEruQF97l5MzWSkMSkJxzDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:12.895915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.2626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb4f6e6f354574da3186b469d854694c3a4aa2ef23be144d44367dbc997f373a","sha256:d0b6c256c220caa054f9f876503ac90dd9dffaf481fee07aa3df99eb11ef8ff9"],"state_sha256":"1ff6181de1b1b841daf9e199aa868795b4a631390ff927c4758e626bc01d32ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eB+tnOrkSQiymWbe2KoxqXIBr4D4J0d+Pyrii0e7GvJ4WTm2XrJ9ys9mqJNGBJkuCcoMd/XvXpjV1xGlpDHABw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:57:25.090605Z","bundle_sha256":"f06e987af7a31673c06dbcb661022f67fafa3e059a40531bf87581d64cf3dcbf"}}