{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DISN7NEWAJ7MUMR7XNBXR7YENT","short_pith_number":"pith:DISN7NEW","canonical_record":{"source":{"id":"1203.1952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-08T22:35:29Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"caecce63ec823130d49f2eddf3f952db7cf9044c65345e113e6bdfcc2e0583ea","abstract_canon_sha256":"80d41c8224b1ec49381b8d1011519a1da195a5c0335fc89b2062097527e8e390"},"schema_version":"1.0"},"canonical_sha256":"1a24dfb496027eca323fbb4378ff046cf9f3f5c2346b588ef3a7bd0ee069d61c","source":{"kind":"arxiv","id":"1203.1952","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1952","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1952v1","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1952","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"DISN7NEWAJ7M","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DISN7NEWAJ7MUMR7","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DISN7NEW","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DISN7NEWAJ7MUMR7XNBXR7YENT","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-08T22:35:29Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"caecce63ec823130d49f2eddf3f952db7cf9044c65345e113e6bdfcc2e0583ea","abstract_canon_sha256":"80d41c8224b1ec49381b8d1011519a1da195a5c0335fc89b2062097527e8e390"},"schema_version":"1.0"},"canonical_sha256":"1a24dfb496027eca323fbb4378ff046cf9f3f5c2346b588ef3a7bd0ee069d61c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:27.912976Z","signature_b64":"nXp48k5mdrycpV0A1BsIa+8UOvHd5atjHSaJSJfgAEHn/OYoARNYolUKiVi0RJw6u5O1Yl+PujlDvOF+6AuaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a24dfb496027eca323fbb4378ff046cf9f3f5c2346b588ef3a7bd0ee069d61c","last_reissued_at":"2026-05-18T04:00:27.912484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:27.912484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1952","source_version":1,"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-05-18T04:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6EGazmlMizn2MNs9tO5Lj/SHJSs9pK4mjXKyNwgUzeI/GtTCLApQEAIvEJC4ebQd0szXONbnUysQWr4yWkQBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T18:49:21.698455Z"},"content_sha256":"8c804134689741aa69a979105093b1247f21f9badeaabf73af22ffb9cc25ddfe","schema_version":"1.0","event_id":"sha256:8c804134689741aa69a979105093b1247f21f9badeaabf73af22ffb9cc25ddfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DISN7NEWAJ7MUMR7XNBXR7YENT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Worst-case Optimal Join Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DB","authors_text":"Atri Rudra, Christopher R\\'e, Ely Porat, Hung Q. Ngo","submitted_at":"2012-03-08T22:35:29Z","abstract_excerpt":"Efficient join processing is one of the most fundamental and well-studied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a novel algorithm to process these queries optimally in terms of worst-case data complexity. Our result builds on recent work by Atserias, Grohe, and Marx, who gave bounds on the size of a full conjunctive query in terms of the sizes of the individual relations in the body of the query. These bounds, however, are not constructive: they rely on Shearer's entropy inequality which is information-theoreti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1952","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"},"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-05-18T04:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QL+pCzPDsLBfM9+7HRZYB/eG1fRPtxyNuaAjDQ1Tnzl07hB9lY//TRyXenGjcZk0Lmgj4C6T7e96KP8cD8qIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T18:49:21.698919Z"},"content_sha256":"6233c4a1ae578f432a9d05ff93dee1d7e1ae038c086930de482ca8554ffde4f0","schema_version":"1.0","event_id":"sha256:6233c4a1ae578f432a9d05ff93dee1d7e1ae038c086930de482ca8554ffde4f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT/bundle.json","state_url":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DISN7NEWAJ7MUMR7XNBXR7YENT/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-10T18:49:21Z","links":{"resolver":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT","bundle":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT/bundle.json","state":"https://pith.science/pith/DISN7NEWAJ7MUMR7XNBXR7YENT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DISN7NEWAJ7MUMR7XNBXR7YENT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DISN7NEWAJ7MUMR7XNBXR7YENT","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":"80d41c8224b1ec49381b8d1011519a1da195a5c0335fc89b2062097527e8e390","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-08T22:35:29Z","title_canon_sha256":"caecce63ec823130d49f2eddf3f952db7cf9044c65345e113e6bdfcc2e0583ea"},"schema_version":"1.0","source":{"id":"1203.1952","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1952","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1952v1","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1952","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"DISN7NEWAJ7M","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DISN7NEWAJ7MUMR7","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DISN7NEW","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:6233c4a1ae578f432a9d05ff93dee1d7e1ae038c086930de482ca8554ffde4f0","target":"graph","created_at":"2026-05-18T04:00:27Z","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"},"paper":{"abstract_excerpt":"Efficient join processing is one of the most fundamental and well-studied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a novel algorithm to process these queries optimally in terms of worst-case data complexity. Our result builds on recent work by Atserias, Grohe, and Marx, who gave bounds on the size of a full conjunctive query in terms of the sizes of the individual relations in the body of the query. These bounds, however, are not constructive: they rely on Shearer's entropy inequality which is information-theoreti","authors_text":"Atri Rudra, Christopher R\\'e, Ely Porat, Hung Q. Ngo","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-08T22:35:29Z","title":"Worst-case Optimal Join Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1952","kind":"arxiv","version":1},"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:8c804134689741aa69a979105093b1247f21f9badeaabf73af22ffb9cc25ddfe","target":"record","created_at":"2026-05-18T04:00:27Z","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":"80d41c8224b1ec49381b8d1011519a1da195a5c0335fc89b2062097527e8e390","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-08T22:35:29Z","title_canon_sha256":"caecce63ec823130d49f2eddf3f952db7cf9044c65345e113e6bdfcc2e0583ea"},"schema_version":"1.0","source":{"id":"1203.1952","kind":"arxiv","version":1}},"canonical_sha256":"1a24dfb496027eca323fbb4378ff046cf9f3f5c2346b588ef3a7bd0ee069d61c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a24dfb496027eca323fbb4378ff046cf9f3f5c2346b588ef3a7bd0ee069d61c","first_computed_at":"2026-05-18T04:00:27.912484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:27.912484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nXp48k5mdrycpV0A1BsIa+8UOvHd5atjHSaJSJfgAEHn/OYoARNYolUKiVi0RJw6u5O1Yl+PujlDvOF+6AuaBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:27.912976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1952","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c804134689741aa69a979105093b1247f21f9badeaabf73af22ffb9cc25ddfe","sha256:6233c4a1ae578f432a9d05ff93dee1d7e1ae038c086930de482ca8554ffde4f0"],"state_sha256":"f8f62d82d188d2ed9bfa0a23d26ebc82c7d8ac4e3c4acb8e0a3b60d7dd6c759f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TcY0iC5HeFVcZ/ayewqzN/uw8+z9QZEZU8SSzqmIX6lE3JgGnoY5ddoEugqFI3BZBGyQm9mXGi2uvIj/VmcpBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T18:49:21.703418Z","bundle_sha256":"59a9c2762f0fdf7cb219941dbcdea58b3a19c0018ee2e0968cdb2a5c42a2848e"}}