{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:D7FHKOA7TGE3RE7O5CXDONUKYZ","short_pith_number":"pith:D7FHKOA7","canonical_record":{"source":{"id":"2301.10841","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-01-25T21:39:13Z","cross_cats_sorted":[],"title_canon_sha256":"8852ae37559b3afe4cb70f99f1e8806487f22f0bafa624e5b92a65cf1c644228","abstract_canon_sha256":"3850cfd43be7398c6b7938380586b7212a364a8cd6824a807be31a9696c3474f"},"schema_version":"1.0"},"canonical_sha256":"1fca75381f9989b893eee8ae37368ac6649acbf584b7b8fe24142a6a094b45e2","source":{"kind":"arxiv","id":"2301.10841","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.10841","created_at":"2026-07-05T05:36:33Z"},{"alias_kind":"arxiv_version","alias_value":"2301.10841v2","created_at":"2026-07-05T05:36:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10841","created_at":"2026-07-05T05:36:33Z"},{"alias_kind":"pith_short_12","alias_value":"D7FHKOA7TGE3","created_at":"2026-07-05T05:36:33Z"},{"alias_kind":"pith_short_16","alias_value":"D7FHKOA7TGE3RE7O","created_at":"2026-07-05T05:36:33Z"},{"alias_kind":"pith_short_8","alias_value":"D7FHKOA7","created_at":"2026-07-05T05:36:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:D7FHKOA7TGE3RE7O5CXDONUKYZ","target":"record","payload":{"canonical_record":{"source":{"id":"2301.10841","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-01-25T21:39:13Z","cross_cats_sorted":[],"title_canon_sha256":"8852ae37559b3afe4cb70f99f1e8806487f22f0bafa624e5b92a65cf1c644228","abstract_canon_sha256":"3850cfd43be7398c6b7938380586b7212a364a8cd6824a807be31a9696c3474f"},"schema_version":"1.0"},"canonical_sha256":"1fca75381f9989b893eee8ae37368ac6649acbf584b7b8fe24142a6a094b45e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:36:33.387204Z","signature_b64":"JO+7hzpawr8CivDD095XJRn49aVJBQf/78jLUV5RMzSE6AYqBHub5SdOsu1EI16nO4s3tjjkXyxGQ1qoEqRrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fca75381f9989b893eee8ae37368ac6649acbf584b7b8fe24142a6a094b45e2","last_reissued_at":"2026-07-05T05:36:33.386674Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:36:33.386674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.10841","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:36:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1iYPisMRuSnSB67awSd6dkb/tbSLoHCO8fuy8MpJ4sVjZrRzazPhVq6g9pZhmYdlpsPcmfkmEJv+sGGKVXZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:08:07.752931Z"},"content_sha256":"a1e099487eddddddd9ce8cc1a77bd165d2d46f838bd17b19eb113739307166b4","schema_version":"1.0","event_id":"sha256:a1e099487eddddddd9ce8cc1a77bd165d2d46f838bd17b19eb113739307166b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:D7FHKOA7TGE3RE7O5CXDONUKYZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Free Join: Unifying Worst-Case Optimal and Traditional Joins","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dan Suciu, Max Willsey, Yisu Remy Wang","submitted_at":"2023-01-25T21:39:13Z","abstract_excerpt":"Over the last decade, worst-case optimal join (WCOJ) algorithms have emerged as a new paradigm for one of the most fundamental challenges in query processing: computing joins efficiently. Such an algorithm can be asymptotically faster than traditional binary joins, all the while remaining simple to understand and implement. However, they have been found to be less efficient than the old paradigm, traditional binary join plans, on the typical acyclic queries found in practice. Some database systems that support WCOJ use a hypbrid approach: use WCOJ to process the cyclic subparts of the query (i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10841","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.10841/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:36:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mr7QPUky+x9nViIdBToLy3ijOhXE9FT1oKJnquDLtmc6RapnMHjO9RBRufPYXA9ZB6La9rnXaQrqom1TeO5cDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:08:07.753427Z"},"content_sha256":"f077bc448fa7f058a0996c5ed201e04826ecaa8c63108cd495dc98d49f6b2243","schema_version":"1.0","event_id":"sha256:f077bc448fa7f058a0996c5ed201e04826ecaa8c63108cd495dc98d49f6b2243"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D7FHKOA7TGE3RE7O5CXDONUKYZ/bundle.json","state_url":"https://pith.science/pith/D7FHKOA7TGE3RE7O5CXDONUKYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D7FHKOA7TGE3RE7O5CXDONUKYZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T01:08:07Z","links":{"resolver":"https://pith.science/pith/D7FHKOA7TGE3RE7O5CXDONUKYZ","bundle":"https://pith.science/pith/D7FHKOA7TGE3RE7O5CXDONUKYZ/bundle.json","state":"https://pith.science/pith/D7FHKOA7TGE3RE7O5CXDONUKYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D7FHKOA7TGE3RE7O5CXDONUKYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:D7FHKOA7TGE3RE7O5CXDONUKYZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3850cfd43be7398c6b7938380586b7212a364a8cd6824a807be31a9696c3474f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-01-25T21:39:13Z","title_canon_sha256":"8852ae37559b3afe4cb70f99f1e8806487f22f0bafa624e5b92a65cf1c644228"},"schema_version":"1.0","source":{"id":"2301.10841","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.10841","created_at":"2026-07-05T05:36:33Z"},{"alias_kind":"arxiv_version","alias_value":"2301.10841v2","created_at":"2026-07-05T05:36:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10841","created_at":"2026-07-05T05:36:33Z"},{"alias_kind":"pith_short_12","alias_value":"D7FHKOA7TGE3","created_at":"2026-07-05T05:36:33Z"},{"alias_kind":"pith_short_16","alias_value":"D7FHKOA7TGE3RE7O","created_at":"2026-07-05T05:36:33Z"},{"alias_kind":"pith_short_8","alias_value":"D7FHKOA7","created_at":"2026-07-05T05:36:33Z"}],"graph_snapshots":[{"event_id":"sha256:f077bc448fa7f058a0996c5ed201e04826ecaa8c63108cd495dc98d49f6b2243","target":"graph","created_at":"2026-07-05T05:36:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.10841/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Over the last decade, worst-case optimal join (WCOJ) algorithms have emerged as a new paradigm for one of the most fundamental challenges in query processing: computing joins efficiently. Such an algorithm can be asymptotically faster than traditional binary joins, all the while remaining simple to understand and implement. However, they have been found to be less efficient than the old paradigm, traditional binary join plans, on the typical acyclic queries found in practice. Some database systems that support WCOJ use a hypbrid approach: use WCOJ to process the cyclic subparts of the query (i","authors_text":"Dan Suciu, Max Willsey, Yisu Remy Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-01-25T21:39:13Z","title":"Free Join: Unifying Worst-Case Optimal and Traditional Joins"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10841","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a1e099487eddddddd9ce8cc1a77bd165d2d46f838bd17b19eb113739307166b4","target":"record","created_at":"2026-07-05T05:36:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3850cfd43be7398c6b7938380586b7212a364a8cd6824a807be31a9696c3474f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-01-25T21:39:13Z","title_canon_sha256":"8852ae37559b3afe4cb70f99f1e8806487f22f0bafa624e5b92a65cf1c644228"},"schema_version":"1.0","source":{"id":"2301.10841","kind":"arxiv","version":2}},"canonical_sha256":"1fca75381f9989b893eee8ae37368ac6649acbf584b7b8fe24142a6a094b45e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fca75381f9989b893eee8ae37368ac6649acbf584b7b8fe24142a6a094b45e2","first_computed_at":"2026-07-05T05:36:33.386674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:36:33.386674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JO+7hzpawr8CivDD095XJRn49aVJBQf/78jLUV5RMzSE6AYqBHub5SdOsu1EI16nO4s3tjjkXyxGQ1qoEqRrDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:36:33.387204Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.10841","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1e099487eddddddd9ce8cc1a77bd165d2d46f838bd17b19eb113739307166b4","sha256:f077bc448fa7f058a0996c5ed201e04826ecaa8c63108cd495dc98d49f6b2243"],"state_sha256":"575d639ad6513657207e727bda625a14c056501deea5aab6b9e3d73f7ab2e696"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A9fbhLFFK4BgwSjfs87Q5Sz42z81ww64dWu1531QXcsK2KZo/OPVJb4JTOLD0pbXHThsZHEzks6wMoC8gC3SBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T01:08:07.758107Z","bundle_sha256":"df413e42572dd37e9a3b51a80132a852be13ec8e02eb803d02c84a592d7d6998"}}