{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZRRH7ADAJWEQMCBCG47J5DHF4J","short_pith_number":"pith:ZRRH7ADA","schema_version":"1.0","canonical_sha256":"cc627f80604d89060822373e9e8ce5e25595189045e4693d77902744283fff0b","source":{"kind":"arxiv","id":"2505.19918","version":1},"attestation_state":"computed","paper":{"title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alex Mascolo, Amirali Kaboli, Amir Shaikhha","submitted_at":"2025-05-26T12:44:53Z","abstract_excerpt":"Join processing is a fundamental operation in database management systems; however, traditional join algorithms often encounter efficiency challenges when dealing with complex queries that produce intermediate results much larger than the final query output. The emergence of worst-case optimal join (WCOJ) algorithms represents a significant advancement, offering asymptotically better performance by avoiding the enumeration of potentially exploding intermediate results. In this paper, we propose a unified architecture that efficiently supports both traditional binary joins and WCOJ processing. "},"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":"2505.19918","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2025-05-26T12:44:53Z","cross_cats_sorted":[],"title_canon_sha256":"21b016782617333912b8aa4694373f21b66e39f4cfcb7e01a4f2d1259f7778d4","abstract_canon_sha256":"6283153fdccf569febcd88839aaae52e3bef2b84c0bcb9390637b35464d6cc58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:49.877093Z","signature_b64":"Z2FqSKZPhSZ/LH9CjNiiFbEF1VssaXtDGfeteNjys3U+kCyk4JAYtj6iVwM53Mcb1JAGyZyY7aeQNyJsj1jBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc627f80604d89060822373e9e8ce5e25595189045e4693d77902744283fff0b","last_reissued_at":"2026-07-05T11:09:49.876588Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:49.876588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Architecture for Efficient Binary and Worst-Case Optimal Join Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alex Mascolo, Amirali Kaboli, Amir Shaikhha","submitted_at":"2025-05-26T12:44:53Z","abstract_excerpt":"Join processing is a fundamental operation in database management systems; however, traditional join algorithms often encounter efficiency challenges when dealing with complex queries that produce intermediate results much larger than the final query output. The emergence of worst-case optimal join (WCOJ) algorithms represents a significant advancement, offering asymptotically better performance by avoiding the enumeration of potentially exploding intermediate results. In this paper, we propose a unified architecture that efficiently supports both traditional binary joins and WCOJ processing. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.19918","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.19918/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.19918","created_at":"2026-07-05T11:09:49.876655+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.19918v1","created_at":"2026-07-05T11:09:49.876655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.19918","created_at":"2026-07-05T11:09:49.876655+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRRH7ADAJWEQ","created_at":"2026-07-05T11:09:49.876655+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRRH7ADAJWEQMCBC","created_at":"2026-07-05T11:09:49.876655+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRRH7ADA","created_at":"2026-07-05T11:09:49.876655+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/ZRRH7ADAJWEQMCBCG47J5DHF4J","json":"https://pith.science/pith/ZRRH7ADAJWEQMCBCG47J5DHF4J.json","graph_json":"https://pith.science/api/pith-number/ZRRH7ADAJWEQMCBCG47J5DHF4J/graph.json","events_json":"https://pith.science/api/pith-number/ZRRH7ADAJWEQMCBCG47J5DHF4J/events.json","paper":"https://pith.science/paper/ZRRH7ADA"},"agent_actions":{"view_html":"https://pith.science/pith/ZRRH7ADAJWEQMCBCG47J5DHF4J","download_json":"https://pith.science/pith/ZRRH7ADAJWEQMCBCG47J5DHF4J.json","view_paper":"https://pith.science/paper/ZRRH7ADA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.19918&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRRH7ADAJWEQMCBCG47J5DHF4J/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRRH7ADAJWEQMCBCG47J5DHF4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRRH7ADAJWEQMCBCG47J5DHF4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRRH7ADAJWEQMCBCG47J5DHF4J/action/storage_attestation","attest_author":"https://pith.science/pith/ZRRH7ADAJWEQMCBCG47J5DHF4J/action/author_attestation","sign_citation":"https://pith.science/pith/ZRRH7ADAJWEQMCBCG47J5DHF4J/action/citation_signature","submit_replication":"https://pith.science/pith/ZRRH7ADAJWEQMCBCG47J5DHF4J/action/replication_record"}},"created_at":"2026-07-05T11:09:49.876655+00:00","updated_at":"2026-07-05T11:09:49.876655+00:00"}