{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WKRJSQZKMDCBGTB52TO4FDNAFA","short_pith_number":"pith:WKRJSQZK","schema_version":"1.0","canonical_sha256":"b2a299432a60c4134c3dd4ddc28da02839d72063d7243060c8660fb5af585336","source":{"kind":"arxiv","id":"1709.01600","version":2},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.01600","created_at":"2026-05-18T00:26:14.516504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01600v2","created_at":"2026-05-18T00:26:14.516504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01600","created_at":"2026-05-18T00:26:14.516504+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKRJSQZKMDCB","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKRJSQZKMDCBGTB5","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKRJSQZK","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA","json":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA.json","graph_json":"https://pith.science/api/pith-number/WKRJSQZKMDCBGTB52TO4FDNAFA/graph.json","events_json":"https://pith.science/api/pith-number/WKRJSQZKMDCBGTB52TO4FDNAFA/events.json","paper":"https://pith.science/paper/WKRJSQZK"},"agent_actions":{"view_html":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA","download_json":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA.json","view_paper":"https://pith.science/paper/WKRJSQZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01600&json=true","fetch_graph":"https://pith.science/api/pith-number/WKRJSQZKMDCBGTB52TO4FDNAFA/graph.json","fetch_events":"https://pith.science/api/pith-number/WKRJSQZKMDCBGTB52TO4FDNAFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA/action/storage_attestation","attest_author":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA/action/author_attestation","sign_citation":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA/action/citation_signature","submit_replication":"https://pith.science/pith/WKRJSQZKMDCBGTB52TO4FDNAFA/action/replication_record"}},"created_at":"2026-05-18T00:26:14.516504+00:00","updated_at":"2026-05-18T00:26:14.516504+00:00"}