{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FJSMCL37THLUM67G72F6F2RUCY","short_pith_number":"pith:FJSMCL37","schema_version":"1.0","canonical_sha256":"2a64c12f7f99d7467be6fe8be2ea34163b1ae5e417fc0f39136c553ace97a115","source":{"kind":"arxiv","id":"1604.00111","version":2},"attestation_state":"computed","paper":{"title":"Computing Join Queries with Functional Dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT"],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Hung Q. Ngo, Mahmoud Abo Khamis","submitted_at":"2016-04-01T02:28:40Z","abstract_excerpt":"Recently, Gottlob, Lee, Valiant, and Valiant (GLVV) presented an output size bound for join queries with functional dependencies (FD), based on a linear program on polymatroids. GLVV bound strictly generalizes the bound of Atserias, Grohe and Marx (AGM) for queries with no FD, in which case there are known algorithms running within AGM bound and thus are worst-case optimal.\n  A main result of this paper is an algorithm for computing join queries with FDs, running within GLVV bound up to a poly-log factor. In particular, our algorithm is worst-case optimal for any query where the GLVV bound is "},"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":"1604.00111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-01T02:28:40Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"title_canon_sha256":"9b965ab8c75bedc436b6587be5b5cf457539ab91b78a69fc880819b54164f847","abstract_canon_sha256":"dcc05b6ca2f875bd6b8928dddc54e3293a4050e2e049436d8112d12258ddb7f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:32.253459Z","signature_b64":"JQljgAHuP0n1A25opjOwmewliW4OkKDvKw2pWhl79pK9IGSR86MnRXbm8/usAMgqSk3Ca8RVJ6jTFCKyGJT7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a64c12f7f99d7467be6fe8be2ea34163b1ae5e417fc0f39136c553ace97a115","last_reissued_at":"2026-05-18T01:17:32.252812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:32.252812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Join Queries with Functional Dependencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT"],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Hung Q. Ngo, Mahmoud Abo Khamis","submitted_at":"2016-04-01T02:28:40Z","abstract_excerpt":"Recently, Gottlob, Lee, Valiant, and Valiant (GLVV) presented an output size bound for join queries with functional dependencies (FD), based on a linear program on polymatroids. GLVV bound strictly generalizes the bound of Atserias, Grohe and Marx (AGM) for queries with no FD, in which case there are known algorithms running within AGM bound and thus are worst-case optimal.\n  A main result of this paper is an algorithm for computing join queries with FDs, running within GLVV bound up to a poly-log factor. In particular, our algorithm is worst-case optimal for any query where the GLVV bound is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00111","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":"1604.00111","created_at":"2026-05-18T01:17:32.252896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00111v2","created_at":"2026-05-18T01:17:32.252896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00111","created_at":"2026-05-18T01:17:32.252896+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJSMCL37THLU","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJSMCL37THLUM67G","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJSMCL37","created_at":"2026-05-18T12:30:15.759754+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/FJSMCL37THLUM67G72F6F2RUCY","json":"https://pith.science/pith/FJSMCL37THLUM67G72F6F2RUCY.json","graph_json":"https://pith.science/api/pith-number/FJSMCL37THLUM67G72F6F2RUCY/graph.json","events_json":"https://pith.science/api/pith-number/FJSMCL37THLUM67G72F6F2RUCY/events.json","paper":"https://pith.science/paper/FJSMCL37"},"agent_actions":{"view_html":"https://pith.science/pith/FJSMCL37THLUM67G72F6F2RUCY","download_json":"https://pith.science/pith/FJSMCL37THLUM67G72F6F2RUCY.json","view_paper":"https://pith.science/paper/FJSMCL37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00111&json=true","fetch_graph":"https://pith.science/api/pith-number/FJSMCL37THLUM67G72F6F2RUCY/graph.json","fetch_events":"https://pith.science/api/pith-number/FJSMCL37THLUM67G72F6F2RUCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJSMCL37THLUM67G72F6F2RUCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJSMCL37THLUM67G72F6F2RUCY/action/storage_attestation","attest_author":"https://pith.science/pith/FJSMCL37THLUM67G72F6F2RUCY/action/author_attestation","sign_citation":"https://pith.science/pith/FJSMCL37THLUM67G72F6F2RUCY/action/citation_signature","submit_replication":"https://pith.science/pith/FJSMCL37THLUM67G72F6F2RUCY/action/replication_record"}},"created_at":"2026-05-18T01:17:32.252896+00:00","updated_at":"2026-05-18T01:17:32.252896+00:00"}