{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:22RZRIEC3QMLYE7HWLAHXBIIJR","short_pith_number":"pith:22RZRIEC","canonical_record":{"source":{"id":"1208.0078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:46:21Z","cross_cats_sorted":[],"title_canon_sha256":"a6f584720377dc2d74d24529355d8689dc64f1794438889c621976000d0af523","abstract_canon_sha256":"8a03416f5da291e3e40f6efc22b89147eee5796f43a4911bc0096a155a526209"},"schema_version":"1.0"},"canonical_sha256":"d6a398a082dc18bc13e7b2c07b85084c689b42e44f416fa0e9be5488456f9e7b","source":{"kind":"arxiv","id":"1208.0078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0078","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0078v1","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0078","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"22RZRIEC3QML","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"22RZRIEC3QMLYE7H","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"22RZRIEC","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:22RZRIEC3QMLYE7HWLAHXBIIJR","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:46:21Z","cross_cats_sorted":[],"title_canon_sha256":"a6f584720377dc2d74d24529355d8689dc64f1794438889c621976000d0af523","abstract_canon_sha256":"8a03416f5da291e3e40f6efc22b89147eee5796f43a4911bc0096a155a526209"},"schema_version":"1.0"},"canonical_sha256":"d6a398a082dc18bc13e7b2c07b85084c689b42e44f416fa0e9be5488456f9e7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:45.068156Z","signature_b64":"UlF6BhRI3QFX/SUoZTrrvntU0jDOKoYIhhdHroV1Fza+pqZ31j9447EjkjZlOJB0F6Pj+4yB5ssv9Cv+YuIPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6a398a082dc18bc13e7b2c07b85084c689b42e44f416fa0e9be5488456f9e7b","last_reissued_at":"2026-05-18T03:49:45.067462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:45.067462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0078","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:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sY/3rZBrHGsXg90xj/jPLBg2a6ING3sLGqt9OyR8TDVoli5++iP+ArprdgDPFzfKkhkKAEZOpejIr1/Gx690Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:18:25.864913Z"},"content_sha256":"53f25315b29624a16b70987fc5cd9302840b6bbf339047b60f244cba057639e7","schema_version":"1.0","event_id":"sha256:53f25315b29624a16b70987fc5cd9302840b6bbf339047b60f244cba057639e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:22RZRIEC3QMLYE7HWLAHXBIIJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Answering Queries using Views over Probabilistic XML: Complexity and Tractability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bogdan Cautis, Evgeny Kharlamov","submitted_at":"2012-08-01T03:46:21Z","abstract_excerpt":"We study the complexity of query answering using views in a probabilistic XML setting, identifying large classes of XPath queries -- with child and descendant navigation and predicates -- for which there are efficient (PTime) algorithms. We consider this problem under the two possible semantics for XML query results: with persistent node identifiers and in their absence. Accordingly, we consider rewritings that can exploit a single view, by means of compensation, and rewritings that can use multiple views, by means of intersection. Since in a probabilistic setting queries return answers with p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0078","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:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8lLX+URbvnQw/1vM6PxVfO8kK+OLOzktA73qNAj3Z28yU09bvSCai7JVJFdIQjGAtU0g6h9MckpXiZ96IZvaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:18:25.865628Z"},"content_sha256":"05466118a86407a91eb1f0d337ac546ee25a32d23810f09956a6fd342c106221","schema_version":"1.0","event_id":"sha256:05466118a86407a91eb1f0d337ac546ee25a32d23810f09956a6fd342c106221"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22RZRIEC3QMLYE7HWLAHXBIIJR/bundle.json","state_url":"https://pith.science/pith/22RZRIEC3QMLYE7HWLAHXBIIJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22RZRIEC3QMLYE7HWLAHXBIIJR/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-05-25T22:18:25Z","links":{"resolver":"https://pith.science/pith/22RZRIEC3QMLYE7HWLAHXBIIJR","bundle":"https://pith.science/pith/22RZRIEC3QMLYE7HWLAHXBIIJR/bundle.json","state":"https://pith.science/pith/22RZRIEC3QMLYE7HWLAHXBIIJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22RZRIEC3QMLYE7HWLAHXBIIJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:22RZRIEC3QMLYE7HWLAHXBIIJR","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":"8a03416f5da291e3e40f6efc22b89147eee5796f43a4911bc0096a155a526209","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:46:21Z","title_canon_sha256":"a6f584720377dc2d74d24529355d8689dc64f1794438889c621976000d0af523"},"schema_version":"1.0","source":{"id":"1208.0078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0078","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0078v1","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0078","created_at":"2026-05-18T03:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"22RZRIEC3QML","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"22RZRIEC3QMLYE7H","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"22RZRIEC","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:05466118a86407a91eb1f0d337ac546ee25a32d23810f09956a6fd342c106221","target":"graph","created_at":"2026-05-18T03:49:45Z","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":"We study the complexity of query answering using views in a probabilistic XML setting, identifying large classes of XPath queries -- with child and descendant navigation and predicates -- for which there are efficient (PTime) algorithms. We consider this problem under the two possible semantics for XML query results: with persistent node identifiers and in their absence. Accordingly, we consider rewritings that can exploit a single view, by means of compensation, and rewritings that can use multiple views, by means of intersection. Since in a probabilistic setting queries return answers with p","authors_text":"Bogdan Cautis, Evgeny Kharlamov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:46:21Z","title":"Answering Queries using Views over Probabilistic XML: Complexity and Tractability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0078","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:53f25315b29624a16b70987fc5cd9302840b6bbf339047b60f244cba057639e7","target":"record","created_at":"2026-05-18T03:49:45Z","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":"8a03416f5da291e3e40f6efc22b89147eee5796f43a4911bc0096a155a526209","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:46:21Z","title_canon_sha256":"a6f584720377dc2d74d24529355d8689dc64f1794438889c621976000d0af523"},"schema_version":"1.0","source":{"id":"1208.0078","kind":"arxiv","version":1}},"canonical_sha256":"d6a398a082dc18bc13e7b2c07b85084c689b42e44f416fa0e9be5488456f9e7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6a398a082dc18bc13e7b2c07b85084c689b42e44f416fa0e9be5488456f9e7b","first_computed_at":"2026-05-18T03:49:45.067462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:45.067462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UlF6BhRI3QFX/SUoZTrrvntU0jDOKoYIhhdHroV1Fza+pqZ31j9447EjkjZlOJB0F6Pj+4yB5ssv9Cv+YuIPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:45.068156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53f25315b29624a16b70987fc5cd9302840b6bbf339047b60f244cba057639e7","sha256:05466118a86407a91eb1f0d337ac546ee25a32d23810f09956a6fd342c106221"],"state_sha256":"fb22a83aac4e0a4c4a612b3dd632a403679588e792f02f480832d76231666846"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6lhLXQwx0yE5qRYZSk4+MH5rYfLq9CIE6fEjD+SbtUENw9p5J3otV3FPzkEzzoMNvILac65Z6soWJHFEAP3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:18:25.868965Z","bundle_sha256":"1ce55a8c3979cae275e7427118645c171e64f709a7cc4ee14141d1212020c1d3"}}