{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WKRJSQZKMDCBGTB52TO4FDNAFA","short_pith_number":"pith:WKRJSQZK","canonical_record":{"source":{"id":"1709.01600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-05T21:31:02Z","cross_cats_sorted":[],"title_canon_sha256":"36eda1b9daf64601d699b026e781b4de0a210a98ca73a568e5b4d8fca14b5c67","abstract_canon_sha256":"8c6a0e58a3d539bacbd253d6efa50297931d16a7bf4d8ef379e92e1476d5ae48"},"schema_version":"1.0"},"canonical_sha256":"b2a299432a60c4134c3dd4ddc28da02839d72063d7243060c8660fb5af585336","source":{"kind":"arxiv","id":"1709.01600","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01600","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01600v2","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01600","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"pith_short_12","alias_value":"WKRJSQZKMDCB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WKRJSQZKMDCBGTB5","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WKRJSQZK","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WKRJSQZKMDCBGTB52TO4FDNAFA","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-05T21:31:02Z","cross_cats_sorted":[],"title_canon_sha256":"36eda1b9daf64601d699b026e781b4de0a210a98ca73a568e5b4d8fca14b5c67","abstract_canon_sha256":"8c6a0e58a3d539bacbd253d6efa50297931d16a7bf4d8ef379e92e1476d5ae48"},"schema_version":"1.0"},"canonical_sha256":"b2a299432a60c4134c3dd4ddc28da02839d72063d7243060c8660fb5af585336","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:14.516999Z","signature_b64":"Tg94JfNPY/b3AxZa0ibzWCMynV9+/8ZEaTK7J3Lr4EUUPbeFy91tI7Qf/ce36GGmcNmXx0HuJsJxgNAyNU1dAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2a299432a60c4134c3dd4ddc28da02839d72063d7243060c8660fb5af585336","last_reissued_at":"2026-05-18T00:26:14.516394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:14.516394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01600","source_version":2,"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-18T00:26:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkhh5McDUteXwq/Xwat62T37NJT4XQIb4w1PErs3AZ/SK3XcpnKGvgOlJsb7Qu1z9t7I9+kVP0iPxDtxLaDuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:23:33.635205Z"},"content_sha256":"275aadcf883210bb340f5903a9f3ba77d7e92c30af511a7cd6c78a93137f78e6","schema_version":"1.0","event_id":"sha256:275aadcf883210bb340f5903a9f3ba77d7e92c30af511a7cd6c78a93137f78e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WKRJSQZKMDCBGTB52TO4FDNAFA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covers of Query Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ahmet Kara, Dan Olteanu","submitted_at":"2017-09-05T21:31:02Z","abstract_excerpt":"We introduce succinct lossless representations of query results called covers. They are subsets of the query results that correspond to minimal edge covers in the hypergraphs of these results.\n  We first study covers whose structures are given by fractional hypertree decompositions of join queries. For any decomposition of a query, we give asymptotically tight size bounds for the covers of the query result over that decomposition and show that such covers can be computed in worst-case optimal time up to a logarithmic factor in the database size. For acyclic join queries, we can compute covers "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01600","kind":"arxiv","version":2},"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-18T00:26:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhyxyTIk+DwiFX9P0z42fd4D5fLbU2ZAWIXQCnDkV5GUmwwaNH7gc8scpOvy+K0NJjad67SQM4jZt3CElZC2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:23:33.635900Z"},"content_sha256":"0aa00a89c97353cbdaf53a5fb07df74946cc4f6905287acca534df82a752b29f","schema_version":"1.0","event_id":"sha256:0aa00a89c97353cbdaf53a5fb07df74946cc4f6905287acca534df82a752b29f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA/bundle.json","state_url":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WKRJSQZKMDCBGTB52TO4FDNAFA/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-27T09:23:33Z","links":{"resolver":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA","bundle":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA/bundle.json","state":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WKRJSQZKMDCBGTB52TO4FDNAFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WKRJSQZKMDCBGTB52TO4FDNAFA","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":"8c6a0e58a3d539bacbd253d6efa50297931d16a7bf4d8ef379e92e1476d5ae48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-05T21:31:02Z","title_canon_sha256":"36eda1b9daf64601d699b026e781b4de0a210a98ca73a568e5b4d8fca14b5c67"},"schema_version":"1.0","source":{"id":"1709.01600","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01600","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01600v2","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01600","created_at":"2026-05-18T00:26:14Z"},{"alias_kind":"pith_short_12","alias_value":"WKRJSQZKMDCB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WKRJSQZKMDCBGTB5","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WKRJSQZK","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:0aa00a89c97353cbdaf53a5fb07df74946cc4f6905287acca534df82a752b29f","target":"graph","created_at":"2026-05-18T00:26:14Z","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 introduce succinct lossless representations of query results called covers. They are subsets of the query results that correspond to minimal edge covers in the hypergraphs of these results.\n  We first study covers whose structures are given by fractional hypertree decompositions of join queries. For any decomposition of a query, we give asymptotically tight size bounds for the covers of the query result over that decomposition and show that such covers can be computed in worst-case optimal time up to a logarithmic factor in the database size. For acyclic join queries, we can compute covers ","authors_text":"Ahmet Kara, Dan Olteanu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-05T21:31:02Z","title":"Covers of Query Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01600","kind":"arxiv","version":2},"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:275aadcf883210bb340f5903a9f3ba77d7e92c30af511a7cd6c78a93137f78e6","target":"record","created_at":"2026-05-18T00:26:14Z","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":"8c6a0e58a3d539bacbd253d6efa50297931d16a7bf4d8ef379e92e1476d5ae48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-05T21:31:02Z","title_canon_sha256":"36eda1b9daf64601d699b026e781b4de0a210a98ca73a568e5b4d8fca14b5c67"},"schema_version":"1.0","source":{"id":"1709.01600","kind":"arxiv","version":2}},"canonical_sha256":"b2a299432a60c4134c3dd4ddc28da02839d72063d7243060c8660fb5af585336","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2a299432a60c4134c3dd4ddc28da02839d72063d7243060c8660fb5af585336","first_computed_at":"2026-05-18T00:26:14.516394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:14.516394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tg94JfNPY/b3AxZa0ibzWCMynV9+/8ZEaTK7J3Lr4EUUPbeFy91tI7Qf/ce36GGmcNmXx0HuJsJxgNAyNU1dAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:14.516999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01600","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:275aadcf883210bb340f5903a9f3ba77d7e92c30af511a7cd6c78a93137f78e6","sha256:0aa00a89c97353cbdaf53a5fb07df74946cc4f6905287acca534df82a752b29f"],"state_sha256":"a97a0878754bd572bccba8a437567ad170c4296d3cd5ee513acda12d5a2f0a48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3bJDNxH/R43FfXGtYef7BvPV7oEEcSjuE2cKqpk1wGyRoxRSuEgj1IT6o/GZOIps45GYTIpPGPDMI5nFeDqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:23:33.639288Z","bundle_sha256":"b5e68f20f293ceddf4ec057ee905cde89dc79b78c78523edaab8edf5399ca686"}}