{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3H7S7HMUO6CJZRF455LFACONK3","short_pith_number":"pith:3H7S7HMU","schema_version":"1.0","canonical_sha256":"d9ff2f9d9477849cc4bcef565009cd56cf1918aa92b8062cabf9a2ff45bb1aa7","source":{"kind":"arxiv","id":"1404.0703","version":7},"attestation_state":"computed","paper":{"title":"Joins via Geometric Resolutions: Worst-case and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Atri Rudra, Christopher R\\'e, Hung Q. Ngo, Mahmoud Abo Khamis","submitted_at":"2014-04-02T20:50:22Z","abstract_excerpt":"We present a simple geometric framework for the relational join. Using this framework, we design an algorithm that achieves the fractional hypertree-width bound, which generalizes classical and recent worst-case algorithmic results on computing joins. In addition, we use our framework and the same algorithm to show a series of what are colloquially known as beyond worst-case results. The framework allows us to prove results for data stored in Btrees, multidimensional data structures, and even multiple indices per table. A key idea in our framework is formalizing the inference one does with an "},"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":"1404.0703","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-04-02T20:50:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f4afb924d9a3e9a97ddf579a8a5acee871f85e5c34a2882465d1e96a779a2f12","abstract_canon_sha256":"b6bb9e4126c56828c9683ced6726ee3dbf644adc9e2f3b3f55db039e08b4450b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:09.167986Z","signature_b64":"g8moQT/qUOj+vfRo5Crh+GWh8emOe1c7UxeIjZvlMsiq+V7crptAjdxz8uv1Mha6ySEiUIgNf9hmTwlBsrMYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9ff2f9d9477849cc4bcef565009cd56cf1918aa92b8062cabf9a2ff45bb1aa7","last_reissued_at":"2026-05-18T00:54:09.167427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:09.167427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joins via Geometric Resolutions: Worst-case and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Atri Rudra, Christopher R\\'e, Hung Q. Ngo, Mahmoud Abo Khamis","submitted_at":"2014-04-02T20:50:22Z","abstract_excerpt":"We present a simple geometric framework for the relational join. Using this framework, we design an algorithm that achieves the fractional hypertree-width bound, which generalizes classical and recent worst-case algorithmic results on computing joins. In addition, we use our framework and the same algorithm to show a series of what are colloquially known as beyond worst-case results. The framework allows us to prove results for data stored in Btrees, multidimensional data structures, and even multiple indices per table. A key idea in our framework is formalizing the inference one does with an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0703","kind":"arxiv","version":7},"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":"1404.0703","created_at":"2026-05-18T00:54:09.167518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0703v7","created_at":"2026-05-18T00:54:09.167518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0703","created_at":"2026-05-18T00:54:09.167518+00:00"},{"alias_kind":"pith_short_12","alias_value":"3H7S7HMUO6CJ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3H7S7HMUO6CJZRF4","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3H7S7HMU","created_at":"2026-05-18T12:28:11.866339+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/3H7S7HMUO6CJZRF455LFACONK3","json":"https://pith.science/pith/3H7S7HMUO6CJZRF455LFACONK3.json","graph_json":"https://pith.science/api/pith-number/3H7S7HMUO6CJZRF455LFACONK3/graph.json","events_json":"https://pith.science/api/pith-number/3H7S7HMUO6CJZRF455LFACONK3/events.json","paper":"https://pith.science/paper/3H7S7HMU"},"agent_actions":{"view_html":"https://pith.science/pith/3H7S7HMUO6CJZRF455LFACONK3","download_json":"https://pith.science/pith/3H7S7HMUO6CJZRF455LFACONK3.json","view_paper":"https://pith.science/paper/3H7S7HMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0703&json=true","fetch_graph":"https://pith.science/api/pith-number/3H7S7HMUO6CJZRF455LFACONK3/graph.json","fetch_events":"https://pith.science/api/pith-number/3H7S7HMUO6CJZRF455LFACONK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3H7S7HMUO6CJZRF455LFACONK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3H7S7HMUO6CJZRF455LFACONK3/action/storage_attestation","attest_author":"https://pith.science/pith/3H7S7HMUO6CJZRF455LFACONK3/action/author_attestation","sign_citation":"https://pith.science/pith/3H7S7HMUO6CJZRF455LFACONK3/action/citation_signature","submit_replication":"https://pith.science/pith/3H7S7HMUO6CJZRF455LFACONK3/action/replication_record"}},"created_at":"2026-05-18T00:54:09.167518+00:00","updated_at":"2026-05-18T00:54:09.167518+00:00"}