{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:D6PWKDMGVMQFFTWUUY3EQK244G","short_pith_number":"pith:D6PWKDMG","canonical_record":{"source":{"id":"1109.2425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-12T10:20:31Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"6bfe656f4bcb90fa2f0a1b720dd4e1a6d328a6de41a860fe978298f09cf29566","abstract_canon_sha256":"0efe7789c063a4f3736e0826b37b4e391e08b3cc9a071bc6ef707cf302c9c376"},"schema_version":"1.0"},"canonical_sha256":"1f9f650d86ab2052ced4a636482b5ce19c5fe613c612f022b698a88c146fe750","source":{"kind":"arxiv","id":"1109.2425","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2425","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2425v1","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2425","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"D6PWKDMGVMQF","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D6PWKDMGVMQFFTWU","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D6PWKDMG","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:D6PWKDMGVMQFFTWUUY3EQK244G","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2425","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-12T10:20:31Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"6bfe656f4bcb90fa2f0a1b720dd4e1a6d328a6de41a860fe978298f09cf29566","abstract_canon_sha256":"0efe7789c063a4f3736e0826b37b4e391e08b3cc9a071bc6ef707cf302c9c376"},"schema_version":"1.0"},"canonical_sha256":"1f9f650d86ab2052ced4a636482b5ce19c5fe613c612f022b698a88c146fe750","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:37.710181Z","signature_b64":"DwEJUZbReUJ6luq+n5MvmxwKGloiHlqmsu5gw1w9GG15NIf0SUvyxo/SlUwNUvVuNGXCdrisO9UJisrpVD5AAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f9f650d86ab2052ced4a636482b5ce19c5fe613c612f022b698a88c146fe750","last_reissued_at":"2026-05-18T04:13:37.709659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:37.709659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2425","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:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBhsB9PodTSRelJKgPdC5LjMqVFSblTwPmpajgZT6zXnUDEZyVmhYfJwDWQWMvzXhAMAURbnaRN7DRbGXMjQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:49:52.119056Z"},"content_sha256":"6ce2256ee9a0603897bbf4d5e28d8d36263112e8c68c0f7aaa24609488418485","schema_version":"1.0","event_id":"sha256:6ce2256ee9a0603897bbf4d5e28d8d36263112e8c68c0f7aaa24609488418485"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:D6PWKDMGVMQFFTWUUY3EQK244G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Query processing in distributed, taxonomy-based information sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Anastasia Analyti, Carlo Meghini, Veronica Coltella, Yannis Tzitzikas","submitted_at":"2011-09-12T10:20:31Z","abstract_excerpt":"We address the problem of answering queries over a distributed information system, storing objects indexed by terms organized in a taxonomy. The taxonomy consists of subsumption relationships between negation-free DNF formulas on terms and negation-free conjunctions of terms. In the first part of the paper, we consider the centralized case, deriving a hypergraph-based algorithm that is efficient in data complexity. In the second part of the paper, we consider the distributed case, presenting alternative ways implementing the centralized algorithm. These ways descend from two basic criteria: di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2425","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:13:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OY1GoDKzbMCUTN3EQxfve/ZIgmgFy0YivpyRagRHrvvn68F9qSD0ZnvAd5IU2O6JbdfRXXswRvHED+bV0ZL3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:49:52.119412Z"},"content_sha256":"bd26fb457ef146f45f921030f4e966610bd6b4cd71dfe0f5e3b5aa1482c06fd5","schema_version":"1.0","event_id":"sha256:bd26fb457ef146f45f921030f4e966610bd6b4cd71dfe0f5e3b5aa1482c06fd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6PWKDMGVMQFFTWUUY3EQK244G/bundle.json","state_url":"https://pith.science/pith/D6PWKDMGVMQFFTWUUY3EQK244G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6PWKDMGVMQFFTWUUY3EQK244G/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-03T07:49:52Z","links":{"resolver":"https://pith.science/pith/D6PWKDMGVMQFFTWUUY3EQK244G","bundle":"https://pith.science/pith/D6PWKDMGVMQFFTWUUY3EQK244G/bundle.json","state":"https://pith.science/pith/D6PWKDMGVMQFFTWUUY3EQK244G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6PWKDMGVMQFFTWUUY3EQK244G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:D6PWKDMGVMQFFTWUUY3EQK244G","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":"0efe7789c063a4f3736e0826b37b4e391e08b3cc9a071bc6ef707cf302c9c376","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-12T10:20:31Z","title_canon_sha256":"6bfe656f4bcb90fa2f0a1b720dd4e1a6d328a6de41a860fe978298f09cf29566"},"schema_version":"1.0","source":{"id":"1109.2425","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2425","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2425v1","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2425","created_at":"2026-05-18T04:13:37Z"},{"alias_kind":"pith_short_12","alias_value":"D6PWKDMGVMQF","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D6PWKDMGVMQFFTWU","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D6PWKDMG","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:bd26fb457ef146f45f921030f4e966610bd6b4cd71dfe0f5e3b5aa1482c06fd5","target":"graph","created_at":"2026-05-18T04:13:37Z","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 address the problem of answering queries over a distributed information system, storing objects indexed by terms organized in a taxonomy. The taxonomy consists of subsumption relationships between negation-free DNF formulas on terms and negation-free conjunctions of terms. In the first part of the paper, we consider the centralized case, deriving a hypergraph-based algorithm that is efficient in data complexity. In the second part of the paper, we consider the distributed case, presenting alternative ways implementing the centralized algorithm. These ways descend from two basic criteria: di","authors_text":"Anastasia Analyti, Carlo Meghini, Veronica Coltella, Yannis Tzitzikas","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-12T10:20:31Z","title":"Query processing in distributed, taxonomy-based information sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2425","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:6ce2256ee9a0603897bbf4d5e28d8d36263112e8c68c0f7aaa24609488418485","target":"record","created_at":"2026-05-18T04:13:37Z","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":"0efe7789c063a4f3736e0826b37b4e391e08b3cc9a071bc6ef707cf302c9c376","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-12T10:20:31Z","title_canon_sha256":"6bfe656f4bcb90fa2f0a1b720dd4e1a6d328a6de41a860fe978298f09cf29566"},"schema_version":"1.0","source":{"id":"1109.2425","kind":"arxiv","version":1}},"canonical_sha256":"1f9f650d86ab2052ced4a636482b5ce19c5fe613c612f022b698a88c146fe750","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f9f650d86ab2052ced4a636482b5ce19c5fe613c612f022b698a88c146fe750","first_computed_at":"2026-05-18T04:13:37.709659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:37.709659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DwEJUZbReUJ6luq+n5MvmxwKGloiHlqmsu5gw1w9GG15NIf0SUvyxo/SlUwNUvVuNGXCdrisO9UJisrpVD5AAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:37.710181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2425","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ce2256ee9a0603897bbf4d5e28d8d36263112e8c68c0f7aaa24609488418485","sha256:bd26fb457ef146f45f921030f4e966610bd6b4cd71dfe0f5e3b5aa1482c06fd5"],"state_sha256":"9682572c0b4322268a039f087d35346e4727d8a996d5f55cd0f75ce8259fde70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XP0e5IT4FLdm3BcZX/LDY43eRbd68B36rS1tKwTIhkghJAHkYf52IY2reNU3R7W/Qo5J7fv5+/DVswKBjjfyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:49:52.122241Z","bundle_sha256":"114ac557be386c8d94bdff28ce7446a862343bee8cb1dc2580bb0a3f9c415be4"}}