{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HBSG56VK62U6K6Z2LMNEIKNDCE","short_pith_number":"pith:HBSG56VK","canonical_record":{"source":{"id":"1104.2079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-04-11T22:32:31Z","cross_cats_sorted":[],"title_canon_sha256":"2dc84a4f0bde3d90d7be1c51cc796a475b9a88511ba2ab23ba0f837ccf44e7ec","abstract_canon_sha256":"27bb3832233fa779b0963d6a4ddac8be762b9725da6031410411594f667284f5"},"schema_version":"1.0"},"canonical_sha256":"38646efaaaf6a9e57b3a5b1a4429a3112d28705716a60b07866f6c31010a90c3","source":{"kind":"arxiv","id":"1104.2079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2079","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2079v1","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2079","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"HBSG56VK62U6","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HBSG56VK62U6K6Z2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HBSG56VK","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HBSG56VK62U6K6Z2LMNEIKNDCE","target":"record","payload":{"canonical_record":{"source":{"id":"1104.2079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-04-11T22:32:31Z","cross_cats_sorted":[],"title_canon_sha256":"2dc84a4f0bde3d90d7be1c51cc796a475b9a88511ba2ab23ba0f837ccf44e7ec","abstract_canon_sha256":"27bb3832233fa779b0963d6a4ddac8be762b9725da6031410411594f667284f5"},"schema_version":"1.0"},"canonical_sha256":"38646efaaaf6a9e57b3a5b1a4429a3112d28705716a60b07866f6c31010a90c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:09.847358Z","signature_b64":"d7+e949kZB1k4oU3Okk+RmvidFKkNokagutAHmDAH8CIgqn1Dw8Su5T8iM5bn2sAjYYXC+BTn7woygDBUmn4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38646efaaaf6a9e57b3a5b1a4429a3112d28705716a60b07866f6c31010a90c3","last_reissued_at":"2026-05-18T02:22:09.846817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:09.846817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.2079","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-18T02:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPXRojLnj7p0itN3odkoPZLePRySu75DZjwR//CfByWdfgMZM6TlVzOv11vrGX7f3KHqPurD2CCU/PSgV8+JAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:19:10.432828Z"},"content_sha256":"259e68013e1738b5c19cf2a2716cf209708e999cc6ab0b611002bed48b66ab67","schema_version":"1.0","event_id":"sha256:259e68013e1738b5c19cf2a2716cf209708e999cc6ab0b611002bed48b66ab67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HBSG56VK62U6K6Z2LMNEIKNDCE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing XML querying using type-based document projection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dario Colazzo, Giuseppe Castagna, Kim Nguyen, V\\'eronique Benzaken","submitted_at":"2011-04-11T22:32:31Z","abstract_excerpt":"XML data projection (or pruning) is a natural optimization for main memory query engines: given a query Q over a document D, the subtrees of D that are not necessary to evaluate Q are pruned, thus producing a smaller document D'; the query Q is then executed on D', hence avoiding to allocate and process nodes that will never be reached by Q. In this article, we propose a new approach, based on types, that greatly improves current solutions. Besides providing comparable or greater precision and far lesser pruning overhead, our solution ---unlike current approaches--- takes into account backward"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2079","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-18T02:22:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Jwl2OweFNPg8e+coL1MM69xzmBdQAJSluzcDI7eY/h7qGc0WeRaFpY47FmWswbUig/7SVoEvtRW8I3B3+wBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:19:10.433178Z"},"content_sha256":"13781ce90b87bff39caf3f3e8ae5adddaabf1daba55e0c40a488070eec72be61","schema_version":"1.0","event_id":"sha256:13781ce90b87bff39caf3f3e8ae5adddaabf1daba55e0c40a488070eec72be61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE/bundle.json","state_url":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HBSG56VK62U6K6Z2LMNEIKNDCE/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-02T22:19:10Z","links":{"resolver":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE","bundle":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE/bundle.json","state":"https://pith.science/pith/HBSG56VK62U6K6Z2LMNEIKNDCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HBSG56VK62U6K6Z2LMNEIKNDCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HBSG56VK62U6K6Z2LMNEIKNDCE","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":"27bb3832233fa779b0963d6a4ddac8be762b9725da6031410411594f667284f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-04-11T22:32:31Z","title_canon_sha256":"2dc84a4f0bde3d90d7be1c51cc796a475b9a88511ba2ab23ba0f837ccf44e7ec"},"schema_version":"1.0","source":{"id":"1104.2079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2079","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2079v1","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2079","created_at":"2026-05-18T02:22:09Z"},{"alias_kind":"pith_short_12","alias_value":"HBSG56VK62U6","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HBSG56VK62U6K6Z2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HBSG56VK","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:13781ce90b87bff39caf3f3e8ae5adddaabf1daba55e0c40a488070eec72be61","target":"graph","created_at":"2026-05-18T02:22:09Z","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":"XML data projection (or pruning) is a natural optimization for main memory query engines: given a query Q over a document D, the subtrees of D that are not necessary to evaluate Q are pruned, thus producing a smaller document D'; the query Q is then executed on D', hence avoiding to allocate and process nodes that will never be reached by Q. In this article, we propose a new approach, based on types, that greatly improves current solutions. Besides providing comparable or greater precision and far lesser pruning overhead, our solution ---unlike current approaches--- takes into account backward","authors_text":"Dario Colazzo, Giuseppe Castagna, Kim Nguyen, V\\'eronique Benzaken","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-04-11T22:32:31Z","title":"Optimizing XML querying using type-based document projection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2079","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:259e68013e1738b5c19cf2a2716cf209708e999cc6ab0b611002bed48b66ab67","target":"record","created_at":"2026-05-18T02:22:09Z","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":"27bb3832233fa779b0963d6a4ddac8be762b9725da6031410411594f667284f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-04-11T22:32:31Z","title_canon_sha256":"2dc84a4f0bde3d90d7be1c51cc796a475b9a88511ba2ab23ba0f837ccf44e7ec"},"schema_version":"1.0","source":{"id":"1104.2079","kind":"arxiv","version":1}},"canonical_sha256":"38646efaaaf6a9e57b3a5b1a4429a3112d28705716a60b07866f6c31010a90c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38646efaaaf6a9e57b3a5b1a4429a3112d28705716a60b07866f6c31010a90c3","first_computed_at":"2026-05-18T02:22:09.846817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:09.846817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d7+e949kZB1k4oU3Okk+RmvidFKkNokagutAHmDAH8CIgqn1Dw8Su5T8iM5bn2sAjYYXC+BTn7woygDBUmn4CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:09.847358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:259e68013e1738b5c19cf2a2716cf209708e999cc6ab0b611002bed48b66ab67","sha256:13781ce90b87bff39caf3f3e8ae5adddaabf1daba55e0c40a488070eec72be61"],"state_sha256":"d263d2e91eeec02561e42339f32ea4b81d4f13f8406be0420852c07423a333d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kgFXK0+KlSlaCctXnINfO2rI0u4FuwtLwfdz/sVQnlYCVe3zGsZo7NHSpsksdU2XlXlG6LLu+rjXEVefr7JWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:19:10.435249Z","bundle_sha256":"b914c6e8f6dc61cc2e5096713b0aa40a1f59bb18bb4762ec2b2b28b1343d3770"}}