{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QXOOYR5IKJBT6F5P7BH4W4M2AM","short_pith_number":"pith:QXOOYR5I","canonical_record":{"source":{"id":"1109.4288","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2011-09-20T13:30:32Z","cross_cats_sorted":[],"title_canon_sha256":"a26e7ec28ff869943d09169c3bfe9ca981e506aed8a784cf5e3c114be28cfb5d","abstract_canon_sha256":"875a22fb664c4bb4189ae7d26a5b41165f54d2f9f2e6d74f9679fc2b3b007fe9"},"schema_version":"1.0"},"canonical_sha256":"85dcec47a852433f17aff84fcb719a0338631eb00baf8b48141f8484ab450713","source":{"kind":"arxiv","id":"1109.4288","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4288","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4288v4","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4288","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"QXOOYR5IKJBT","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QXOOYR5IKJBT6F5P","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QXOOYR5I","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QXOOYR5IKJBT6F5P7BH4W4M2AM","target":"record","payload":{"canonical_record":{"source":{"id":"1109.4288","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2011-09-20T13:30:32Z","cross_cats_sorted":[],"title_canon_sha256":"a26e7ec28ff869943d09169c3bfe9ca981e506aed8a784cf5e3c114be28cfb5d","abstract_canon_sha256":"875a22fb664c4bb4189ae7d26a5b41165f54d2f9f2e6d74f9679fc2b3b007fe9"},"schema_version":"1.0"},"canonical_sha256":"85dcec47a852433f17aff84fcb719a0338631eb00baf8b48141f8484ab450713","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:36.407363Z","signature_b64":"s+F3n+ANJzFQ6KoBDs3G1niCg5oWqxNRGZq3PH8/Qc1ykyVh0tXG7xf3F3CsLpcxOQbLmzQGNX7r3/p/O84OBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85dcec47a852433f17aff84fcb719a0338631eb00baf8b48141f8484ab450713","last_reissued_at":"2026-05-18T02:21:36.406939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:36.406939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.4288","source_version":4,"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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r527IQIN0jRn+XyDGv3NdHBP6seSso4tpN18j2X9cqJ03f5BgSwPUXcud4LLuV23i0Z4+JmE/MN/EuEhEaBaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:14:04.326367Z"},"content_sha256":"c70bbd94ea38b85cb38d2820abc77ed26bc2c9df38eca81dbbdf585a3250a30f","schema_version":"1.0","event_id":"sha256:c70bbd94ea38b85cb38d2820abc77ed26bc2c9df38eca81dbbdf585a3250a30f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QXOOYR5IKJBT6F5P7BH4W4M2AM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Hai Zhuge, Qiang Zeng, Xiaorui Jiang","submitted_at":"2011-09-20T13:30:32Z","abstract_excerpt":"As data are increasingly modeled as graphs for expressing complex relationships, the tree pattern query on graph-structured data becomes an important type of queries in real-world applications. Most practical query languages, such as XQuery and SPARQL, support logical expressions using logical-AND/OR/NOT operators to define structural constraints of tree patterns. In this paper, (1) we propose generalized tree pattern queries (GTPQs) over graph-structured data, which fully support propositional logic of structural constraints. (2) We make a thorough study of fundamental problems including sati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4288","kind":"arxiv","version":4},"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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p0CK5/uj3pBf1eZ5124Cf+5q6ztk0v87Lquhv/xRkHX6NKenvmvjDeW3nxXx5T4B7l9oGqbsRSBt/Jc88QsbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:14:04.327205Z"},"content_sha256":"91da3800d3c9a6ddff18b8009d04a07f5be24a5aa85598e60331823a68568d14","schema_version":"1.0","event_id":"sha256:91da3800d3c9a6ddff18b8009d04a07f5be24a5aa85598e60331823a68568d14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXOOYR5IKJBT6F5P7BH4W4M2AM/bundle.json","state_url":"https://pith.science/pith/QXOOYR5IKJBT6F5P7BH4W4M2AM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXOOYR5IKJBT6F5P7BH4W4M2AM/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-11T23:14:04Z","links":{"resolver":"https://pith.science/pith/QXOOYR5IKJBT6F5P7BH4W4M2AM","bundle":"https://pith.science/pith/QXOOYR5IKJBT6F5P7BH4W4M2AM/bundle.json","state":"https://pith.science/pith/QXOOYR5IKJBT6F5P7BH4W4M2AM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXOOYR5IKJBT6F5P7BH4W4M2AM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QXOOYR5IKJBT6F5P7BH4W4M2AM","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":"875a22fb664c4bb4189ae7d26a5b41165f54d2f9f2e6d74f9679fc2b3b007fe9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2011-09-20T13:30:32Z","title_canon_sha256":"a26e7ec28ff869943d09169c3bfe9ca981e506aed8a784cf5e3c114be28cfb5d"},"schema_version":"1.0","source":{"id":"1109.4288","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4288","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4288v4","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4288","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"QXOOYR5IKJBT","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QXOOYR5IKJBT6F5P","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QXOOYR5I","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:91da3800d3c9a6ddff18b8009d04a07f5be24a5aa85598e60331823a68568d14","target":"graph","created_at":"2026-05-18T02:21:36Z","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":"As data are increasingly modeled as graphs for expressing complex relationships, the tree pattern query on graph-structured data becomes an important type of queries in real-world applications. Most practical query languages, such as XQuery and SPARQL, support logical expressions using logical-AND/OR/NOT operators to define structural constraints of tree patterns. In this paper, (1) we propose generalized tree pattern queries (GTPQs) over graph-structured data, which fully support propositional logic of structural constraints. (2) We make a thorough study of fundamental problems including sati","authors_text":"Hai Zhuge, Qiang Zeng, Xiaorui Jiang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2011-09-20T13:30:32Z","title":"Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4288","kind":"arxiv","version":4},"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:c70bbd94ea38b85cb38d2820abc77ed26bc2c9df38eca81dbbdf585a3250a30f","target":"record","created_at":"2026-05-18T02:21:36Z","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":"875a22fb664c4bb4189ae7d26a5b41165f54d2f9f2e6d74f9679fc2b3b007fe9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DB","submitted_at":"2011-09-20T13:30:32Z","title_canon_sha256":"a26e7ec28ff869943d09169c3bfe9ca981e506aed8a784cf5e3c114be28cfb5d"},"schema_version":"1.0","source":{"id":"1109.4288","kind":"arxiv","version":4}},"canonical_sha256":"85dcec47a852433f17aff84fcb719a0338631eb00baf8b48141f8484ab450713","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85dcec47a852433f17aff84fcb719a0338631eb00baf8b48141f8484ab450713","first_computed_at":"2026-05-18T02:21:36.406939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:36.406939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s+F3n+ANJzFQ6KoBDs3G1niCg5oWqxNRGZq3PH8/Qc1ykyVh0tXG7xf3F3CsLpcxOQbLmzQGNX7r3/p/O84OBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:36.407363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4288","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c70bbd94ea38b85cb38d2820abc77ed26bc2c9df38eca81dbbdf585a3250a30f","sha256:91da3800d3c9a6ddff18b8009d04a07f5be24a5aa85598e60331823a68568d14"],"state_sha256":"01feb691bdca4ce52c7a6b5e517554f3c05881dd3fabad86625277f866b0b254"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bHVs7Wtt5k8dUdd8eymvZi6Yfuq6mYxpnKN5DoSHHfqr1AJQFHdAUKmKC+zgPeFdyjMfePV6oIX6D3yND0lsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:14:04.331555Z","bundle_sha256":"a120018c1f3d2927bd13fe1d9eaba09c74bbf671392f328e78be5a09e130cbf2"}}