{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VGTFCNNGKFRECCANBDP7M5F46J","short_pith_number":"pith:VGTFCNNG","schema_version":"1.0","canonical_sha256":"a9a65135a6516241080d08dff674bcf264a56e48eb393f8b44e630b9b0fb7a1f","source":{"kind":"arxiv","id":"1711.03860","version":1},"attestation_state":"computed","paper":{"title":"Size bounds and query plans for relational joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Albert Atserias, D\\'aniel Marx, Martin Grohe","submitted_at":"2017-11-10T15:16:52Z","abstract_excerpt":"Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often dominated by the output size, it is an important task for database query optimisers to compute estimates on the size of joins and to find good execution plans for sequences of joins. We study these problems from a theoretical perspective, both in the worst-case model, and in an average-case model where the database is chosen according to a known probability distribution. In the former case, our first key observation is th"},"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":"1711.03860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-11-10T15:16:52Z","cross_cats_sorted":[],"title_canon_sha256":"be694487a521f0aec288ac6414edd3524ac9864d936b430a7bcecd197268a96e","abstract_canon_sha256":"f1feb2411fb9958f98079111250b17f674bed03f07dcc299df75d02f3fa63111"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:51.248459Z","signature_b64":"c8ooGZGC322HcE1fUF24LGhu9tq1SYVQT33ASbVH7b6fREE1WHFTTsAXV8iHyK3bokyS+6t/rwpnIiBr2ROoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9a65135a6516241080d08dff674bcf264a56e48eb393f8b44e630b9b0fb7a1f","last_reissued_at":"2026-05-18T00:30:51.247815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:51.247815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Size bounds and query plans for relational joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Albert Atserias, D\\'aniel Marx, Martin Grohe","submitted_at":"2017-11-10T15:16:52Z","abstract_excerpt":"Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often dominated by the output size, it is an important task for database query optimisers to compute estimates on the size of joins and to find good execution plans for sequences of joins. We study these problems from a theoretical perspective, both in the worst-case model, and in an average-case model where the database is chosen according to a known probability distribution. In the former case, our first key observation is th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03860","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.03860","created_at":"2026-05-18T00:30:51.247910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03860v1","created_at":"2026-05-18T00:30:51.247910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03860","created_at":"2026-05-18T00:30:51.247910+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGTFCNNGKFRE","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGTFCNNGKFRECCAN","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGTFCNNG","created_at":"2026-05-18T12:31:49.984773+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/VGTFCNNGKFRECCANBDP7M5F46J","json":"https://pith.science/pith/VGTFCNNGKFRECCANBDP7M5F46J.json","graph_json":"https://pith.science/api/pith-number/VGTFCNNGKFRECCANBDP7M5F46J/graph.json","events_json":"https://pith.science/api/pith-number/VGTFCNNGKFRECCANBDP7M5F46J/events.json","paper":"https://pith.science/paper/VGTFCNNG"},"agent_actions":{"view_html":"https://pith.science/pith/VGTFCNNGKFRECCANBDP7M5F46J","download_json":"https://pith.science/pith/VGTFCNNGKFRECCANBDP7M5F46J.json","view_paper":"https://pith.science/paper/VGTFCNNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03860&json=true","fetch_graph":"https://pith.science/api/pith-number/VGTFCNNGKFRECCANBDP7M5F46J/graph.json","fetch_events":"https://pith.science/api/pith-number/VGTFCNNGKFRECCANBDP7M5F46J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGTFCNNGKFRECCANBDP7M5F46J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGTFCNNGKFRECCANBDP7M5F46J/action/storage_attestation","attest_author":"https://pith.science/pith/VGTFCNNGKFRECCANBDP7M5F46J/action/author_attestation","sign_citation":"https://pith.science/pith/VGTFCNNGKFRECCANBDP7M5F46J/action/citation_signature","submit_replication":"https://pith.science/pith/VGTFCNNGKFRECCANBDP7M5F46J/action/replication_record"}},"created_at":"2026-05-18T00:30:51.247910+00:00","updated_at":"2026-05-18T00:30:51.247910+00:00"}