{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RLUTGCBEKEA4D5DQJS46PYZFIB","short_pith_number":"pith:RLUTGCBE","canonical_record":{"source":{"id":"1906.05745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-13T15:15:20Z","cross_cats_sorted":[],"title_canon_sha256":"33e065a9c81da50fcbd2eed52e0a4882faefcbb49131e17e9684316163dd6314","abstract_canon_sha256":"b7dff0a4df57afe70d8432c84915758a936118e1eaab6bf602698da530855890"},"schema_version":"1.0"},"canonical_sha256":"8ae93308245101c1f4704cb9e7e325406a7516f28350a83683ce9548d49a3820","source":{"kind":"arxiv","id":"1906.05745","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05745","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05745v2","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05745","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"RLUTGCBEKEA4","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RLUTGCBEKEA4D5DQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RLUTGCBE","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RLUTGCBEKEA4D5DQJS46PYZFIB","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-13T15:15:20Z","cross_cats_sorted":[],"title_canon_sha256":"33e065a9c81da50fcbd2eed52e0a4882faefcbb49131e17e9684316163dd6314","abstract_canon_sha256":"b7dff0a4df57afe70d8432c84915758a936118e1eaab6bf602698da530855890"},"schema_version":"1.0"},"canonical_sha256":"8ae93308245101c1f4704cb9e7e325406a7516f28350a83683ce9548d49a3820","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:14.016573Z","signature_b64":"G8irLJVwTB2qa+s8/lhDcID9IDztiIsyLD+/P5Dr9/PqfD1JP3Vs95WWYry3B3SWIo+aeAvT3d601uMMGfFEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ae93308245101c1f4704cb9e7e325406a7516f28350a83683ce9548d49a3820","last_reissued_at":"2026-05-17T23:43:14.016143Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:14.016143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05745","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-05-17T23:43:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RFTLD3Rjods++ZG/OeVOC8JmSzHryMt1+zRO6PBP+pJ1yasLXC5RwVO3a6G2yVja8KNs1waQCygA9F6+GjM3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:09:52.600156Z"},"content_sha256":"14bff8b271b62f46f74edca5a73dfe892d38f05b7282c9f6c614813555ee8c75","schema_version":"1.0","event_id":"sha256:14bff8b271b62f46f74edca5a73dfe892d38f05b7282c9f6c614813555ee8c75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RLUTGCBEKEA4D5DQJS46PYZFIB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory-Efficient Group-by Aggregates over Multi-Way Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amol Deshpande, Konstantinos Xirogiannopoulos","submitted_at":"2019-06-13T15:15:20Z","abstract_excerpt":"Aggregate computation in relational databases has long been done using the standard unary aggregation and binary join operators. These implement the classical model of computing joins between relations two at a time, materializing the intermediate results, and then proceeding to do either sort-based or hash-based aggregate computation to derive the final result. This approach, however, can be dramatically sub-optimal in the case of low-selectivity joins, and often ends up generating large intermediate results even if the relations involved as well as the final result sets themselves are quite "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05745","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":""},"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-17T23:43:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gu0pw0VMoJVMcP+vKBgTn9pUbaQ6hLiIQUs5lWcU7LBJ996l3dFxmb3k5NmidBQEGiCGQFMDHgjeI9N3Z6oNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:09:52.600793Z"},"content_sha256":"93b91b9b6510bafbfccde636af25b4593a5858e816dd71bf951beaa9747fc3c6","schema_version":"1.0","event_id":"sha256:93b91b9b6510bafbfccde636af25b4593a5858e816dd71bf951beaa9747fc3c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB/bundle.json","state_url":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLUTGCBEKEA4D5DQJS46PYZFIB/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-06-05T21:09:52Z","links":{"resolver":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB","bundle":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB/bundle.json","state":"https://pith.science/pith/RLUTGCBEKEA4D5DQJS46PYZFIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLUTGCBEKEA4D5DQJS46PYZFIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RLUTGCBEKEA4D5DQJS46PYZFIB","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":"b7dff0a4df57afe70d8432c84915758a936118e1eaab6bf602698da530855890","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-13T15:15:20Z","title_canon_sha256":"33e065a9c81da50fcbd2eed52e0a4882faefcbb49131e17e9684316163dd6314"},"schema_version":"1.0","source":{"id":"1906.05745","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05745","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05745v2","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05745","created_at":"2026-05-17T23:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"RLUTGCBEKEA4","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RLUTGCBEKEA4D5DQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RLUTGCBE","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:93b91b9b6510bafbfccde636af25b4593a5858e816dd71bf951beaa9747fc3c6","target":"graph","created_at":"2026-05-17T23:43:14Z","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":"Aggregate computation in relational databases has long been done using the standard unary aggregation and binary join operators. These implement the classical model of computing joins between relations two at a time, materializing the intermediate results, and then proceeding to do either sort-based or hash-based aggregate computation to derive the final result. This approach, however, can be dramatically sub-optimal in the case of low-selectivity joins, and often ends up generating large intermediate results even if the relations involved as well as the final result sets themselves are quite ","authors_text":"Amol Deshpande, Konstantinos Xirogiannopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-13T15:15:20Z","title":"Memory-Efficient Group-by Aggregates over Multi-Way Joins"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05745","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:14bff8b271b62f46f74edca5a73dfe892d38f05b7282c9f6c614813555ee8c75","target":"record","created_at":"2026-05-17T23:43:14Z","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":"b7dff0a4df57afe70d8432c84915758a936118e1eaab6bf602698da530855890","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-06-13T15:15:20Z","title_canon_sha256":"33e065a9c81da50fcbd2eed52e0a4882faefcbb49131e17e9684316163dd6314"},"schema_version":"1.0","source":{"id":"1906.05745","kind":"arxiv","version":2}},"canonical_sha256":"8ae93308245101c1f4704cb9e7e325406a7516f28350a83683ce9548d49a3820","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ae93308245101c1f4704cb9e7e325406a7516f28350a83683ce9548d49a3820","first_computed_at":"2026-05-17T23:43:14.016143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:14.016143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G8irLJVwTB2qa+s8/lhDcID9IDztiIsyLD+/P5Dr9/PqfD1JP3Vs95WWYry3B3SWIo+aeAvT3d601uMMGfFEBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:14.016573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05745","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14bff8b271b62f46f74edca5a73dfe892d38f05b7282c9f6c614813555ee8c75","sha256:93b91b9b6510bafbfccde636af25b4593a5858e816dd71bf951beaa9747fc3c6"],"state_sha256":"a9223052d97101d12aec85bd4e33faedeb6fd3ef041e7019067ffa850501ace8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L4MeE4bhtCU9PwPTtVdQXAo7Wb6yoMZFGCP2CmlOqIbM4G71SS2j8lGcLfAsD95iGDNgp8FFjngmzcwx0WZhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:09:52.603861Z","bundle_sha256":"79be2a7e4fcd80220bf85d4612bcacc821a9c77c247cbef60e6c640d7078a5a3"}}