{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:4JPIUOZO67FTG4OKTOAY77QL7U","short_pith_number":"pith:4JPIUOZO","canonical_record":{"source":{"id":"2301.08178","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-01-19T17:10:30Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"6e0896d3ba3e30ab96674df2f6677b71e90516890fa3616f925975321cbba337","abstract_canon_sha256":"590189ee01deb544db19557b4011683b787d131beaf5260d92bab7cc515f2d36"},"schema_version":"1.0"},"canonical_sha256":"e25e8a3b2ef7cb3371ca9b818ffe0bfd371e818ed687d8c74fc769c471565aac","source":{"kind":"arxiv","id":"2301.08178","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.08178","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"2301.08178v4","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08178","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"4JPIUOZO67FT","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"4JPIUOZO67FTG4OK","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"4JPIUOZO","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:4JPIUOZO67FTG4OKTOAY77QL7U","target":"record","payload":{"canonical_record":{"source":{"id":"2301.08178","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-01-19T17:10:30Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"6e0896d3ba3e30ab96674df2f6677b71e90516890fa3616f925975321cbba337","abstract_canon_sha256":"590189ee01deb544db19557b4011683b787d131beaf5260d92bab7cc515f2d36"},"schema_version":"1.0"},"canonical_sha256":"e25e8a3b2ef7cb3371ca9b818ffe0bfd371e818ed687d8c74fc769c471565aac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:39.855585Z","signature_b64":"qvh47q/oVfUbRbcxT9cARvCB4czGv9W0i50qcvmgVCeGDjrYNJQOvU8H1pigsPvfzxJ3zdNixRWEx7jYrpiiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e25e8a3b2ef7cb3371ca9b818ffe0bfd371e818ed687d8c74fc769c471565aac","last_reissued_at":"2026-05-18T02:44:39.855100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:39.855100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.08178","source_version":4,"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-18T02:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QxTyzmHGUOQj13DuONZheKZfbgnp4fDLqaUM/xUT6L2u7LvahIsvfti71SVvn8AAv16gtMAhH734EJ5vFO0oCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:51:22.795290Z"},"content_sha256":"53f97de62b00a42f398174c79f4ba6deeabc65248dc1cf47c1af0148f96d3a94","schema_version":"1.0","event_id":"sha256:53f97de62b00a42f398174c79f4ba6deeabc65248dc1cf47c1af0148f96d3a94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:4JPIUOZO67FTG4OKTOAY77QL7U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Work-Efficient Query Evaluation in Constant Time with PRAMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DB","authors_text":"Christopher Spinrath, Jens Keppeler, Thomas Schwentick","submitted_at":"2023-01-19T17:10:30Z","abstract_excerpt":"The article studies query evaluation in parallel constant time in the CRCW PRAM model. While it is well-known that all relational algebra queries can be evaluated in constant time on an appropriate CRCW PRAM model, this article is interested in the efficiency of evaluation algorithms, that is, in the number of processors or, asymptotically equivalent, in the work. Naive evaluation in the parallel setting results in huge (polynomial) bounds on the work of such algorithms and in presentations of the result sets that can be extremely scattered in memory. The article discusses some obstacles for c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08178","kind":"arxiv","version":4},"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-18T02:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sXmYy9c+Eyk4RyaGukAeFiIzs8gScRTjM69+oIXYPavYzcjoARSPkJmRG+s+E4uGlT+CUu3wq0IbOKkhOC9tCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:51:22.795687Z"},"content_sha256":"dc21c815b6a04e8fc92f0955009b39cf2670b566c7b146b53232487f46d4bb14","schema_version":"1.0","event_id":"sha256:dc21c815b6a04e8fc92f0955009b39cf2670b566c7b146b53232487f46d4bb14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JPIUOZO67FTG4OKTOAY77QL7U/bundle.json","state_url":"https://pith.science/pith/4JPIUOZO67FTG4OKTOAY77QL7U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JPIUOZO67FTG4OKTOAY77QL7U/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-05-27T11:51:22Z","links":{"resolver":"https://pith.science/pith/4JPIUOZO67FTG4OKTOAY77QL7U","bundle":"https://pith.science/pith/4JPIUOZO67FTG4OKTOAY77QL7U/bundle.json","state":"https://pith.science/pith/4JPIUOZO67FTG4OKTOAY77QL7U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JPIUOZO67FTG4OKTOAY77QL7U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4JPIUOZO67FTG4OKTOAY77QL7U","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":"590189ee01deb544db19557b4011683b787d131beaf5260d92bab7cc515f2d36","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-01-19T17:10:30Z","title_canon_sha256":"6e0896d3ba3e30ab96674df2f6677b71e90516890fa3616f925975321cbba337"},"schema_version":"1.0","source":{"id":"2301.08178","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.08178","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"2301.08178v4","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08178","created_at":"2026-05-18T02:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"4JPIUOZO67FT","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"4JPIUOZO67FTG4OK","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"4JPIUOZO","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:dc21c815b6a04e8fc92f0955009b39cf2670b566c7b146b53232487f46d4bb14","target":"graph","created_at":"2026-05-18T02:44:39Z","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":"The article studies query evaluation in parallel constant time in the CRCW PRAM model. While it is well-known that all relational algebra queries can be evaluated in constant time on an appropriate CRCW PRAM model, this article is interested in the efficiency of evaluation algorithms, that is, in the number of processors or, asymptotically equivalent, in the work. Naive evaluation in the parallel setting results in huge (polynomial) bounds on the work of such algorithms and in presentations of the result sets that can be extremely scattered in memory. The article discusses some obstacles for c","authors_text":"Christopher Spinrath, Jens Keppeler, Thomas Schwentick","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-01-19T17:10:30Z","title":"Work-Efficient Query Evaluation in Constant Time with PRAMs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08178","kind":"arxiv","version":4},"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:53f97de62b00a42f398174c79f4ba6deeabc65248dc1cf47c1af0148f96d3a94","target":"record","created_at":"2026-05-18T02:44:39Z","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":"590189ee01deb544db19557b4011683b787d131beaf5260d92bab7cc515f2d36","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2023-01-19T17:10:30Z","title_canon_sha256":"6e0896d3ba3e30ab96674df2f6677b71e90516890fa3616f925975321cbba337"},"schema_version":"1.0","source":{"id":"2301.08178","kind":"arxiv","version":4}},"canonical_sha256":"e25e8a3b2ef7cb3371ca9b818ffe0bfd371e818ed687d8c74fc769c471565aac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e25e8a3b2ef7cb3371ca9b818ffe0bfd371e818ed687d8c74fc769c471565aac","first_computed_at":"2026-05-18T02:44:39.855100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:39.855100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qvh47q/oVfUbRbcxT9cARvCB4czGv9W0i50qcvmgVCeGDjrYNJQOvU8H1pigsPvfzxJ3zdNixRWEx7jYrpiiDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:39.855585Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.08178","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53f97de62b00a42f398174c79f4ba6deeabc65248dc1cf47c1af0148f96d3a94","sha256:dc21c815b6a04e8fc92f0955009b39cf2670b566c7b146b53232487f46d4bb14"],"state_sha256":"4d559c609d12b47719969ee1238cde9751fc4f5987f1ffef721f0bed9c000360"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k4OOszf1/LqYmK5Js1A+DGQRN6unJB+zyWxZVB1fhbIgoL18gKcHXtJ4PGMSdQcUJpqzyQxNGe0HwaeELnxsBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:51:22.797976Z","bundle_sha256":"22b64948f73e59b96f21fbf9eaf5fb2bfc73c09e403ee03f7f3bf3da50ba4093"}}