{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:L5GTRSNWVPM3Q4HX2WBPBSYSWR","short_pith_number":"pith:L5GTRSNW","canonical_record":{"source":{"id":"2010.00152","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-10-01T00:11:37Z","cross_cats_sorted":[],"title_canon_sha256":"95cadc3283753045d6496e581729440a127b60cc691a45418c111ffbf8ed51bb","abstract_canon_sha256":"6b9a640376dd483e233b0220df6c6e773948f90112a118945b01215b74ae309d"},"schema_version":"1.0"},"canonical_sha256":"5f4d38c9b6abd9b870f7d582f0cb12b463e98fce1264c8f371d7bf25c9988db4","source":{"kind":"arxiv","id":"2010.00152","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.00152","created_at":"2026-07-05T05:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"2010.00152v3","created_at":"2026-07-05T05:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00152","created_at":"2026-07-05T05:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"L5GTRSNWVPM3","created_at":"2026-07-05T05:00:35Z"},{"alias_kind":"pith_short_16","alias_value":"L5GTRSNWVPM3Q4HX","created_at":"2026-07-05T05:00:35Z"},{"alias_kind":"pith_short_8","alias_value":"L5GTRSNW","created_at":"2026-07-05T05:00:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:L5GTRSNWVPM3Q4HX2WBPBSYSWR","target":"record","payload":{"canonical_record":{"source":{"id":"2010.00152","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-10-01T00:11:37Z","cross_cats_sorted":[],"title_canon_sha256":"95cadc3283753045d6496e581729440a127b60cc691a45418c111ffbf8ed51bb","abstract_canon_sha256":"6b9a640376dd483e233b0220df6c6e773948f90112a118945b01215b74ae309d"},"schema_version":"1.0"},"canonical_sha256":"5f4d38c9b6abd9b870f7d582f0cb12b463e98fce1264c8f371d7bf25c9988db4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:00:35.687401Z","signature_b64":"lshPehvAZAeApzyBf5GT0WgQSSlQnCMI5SUnGi/T8Dg2k4/G82f1h4gresGpoqtL82NxdgNfUGHjC7O/u812BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f4d38c9b6abd9b870f7d582f0cb12b463e98fce1264c8f371d7bf25c9988db4","last_reissued_at":"2026-07-05T05:00:35.687023Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:00:35.687023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.00152","source_version":3,"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:00:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LpK6qw4AjSd689UJC+C5ZULadCwg5Fevoia1t62q59BF4mlmlKGyo5xgFZbKgWhN+KJi9aWc5bH0/pZ0oRfeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:27:32.320709Z"},"content_sha256":"36b318d2ce50079a7a4944c6a6a98bff5329deaf525b2a894cc4cf7bfa44ea7d","schema_version":"1.0","event_id":"sha256:36b318d2ce50079a7a4944c6a6a98bff5329deaf525b2a894cc4cf7bfa44ea7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:L5GTRSNWVPM3Q4HX2WBPBSYSWR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient sorting, duplicate removal, grouping, and aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Goetz Graefe, Jeffrey Naughton, Thanh Do","submitted_at":"2020-10-01T00:11:37Z","abstract_excerpt":"Database query processing requires algorithms for duplicate removal, grouping, and aggregation. Three algorithms exist: in-stream aggregation is most efficient by far but requires sorted input; sort-based aggregation relies on external merge sort; and hash aggregation relies on an in-memory hash table plus hash partitioning to temporary storage. Cost-based query optimization chooses which algorithm to use based on several factors including the sort order of the input, input and output sizes, and the need for sorted output. For example, hash-based aggregation is ideal for output smaller than th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00152","kind":"arxiv","version":3},"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/2010.00152/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:00:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDF/1u7kSvDW8+2zc+TQ6faLi4UcYU+KY6KHwN4BImFN5h1mB4gvTJzHENXlsLr/E8qdTn3by02/UmexFmu5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:27:32.322817Z"},"content_sha256":"9cb2bfc053a2f7abb674028536d8d8c6afd0d328848d9b4320d5eed9a114123b","schema_version":"1.0","event_id":"sha256:9cb2bfc053a2f7abb674028536d8d8c6afd0d328848d9b4320d5eed9a114123b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5GTRSNWVPM3Q4HX2WBPBSYSWR/bundle.json","state_url":"https://pith.science/pith/L5GTRSNWVPM3Q4HX2WBPBSYSWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5GTRSNWVPM3Q4HX2WBPBSYSWR/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-03T17:27:32Z","links":{"resolver":"https://pith.science/pith/L5GTRSNWVPM3Q4HX2WBPBSYSWR","bundle":"https://pith.science/pith/L5GTRSNWVPM3Q4HX2WBPBSYSWR/bundle.json","state":"https://pith.science/pith/L5GTRSNWVPM3Q4HX2WBPBSYSWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5GTRSNWVPM3Q4HX2WBPBSYSWR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:L5GTRSNWVPM3Q4HX2WBPBSYSWR","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":"6b9a640376dd483e233b0220df6c6e773948f90112a118945b01215b74ae309d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-10-01T00:11:37Z","title_canon_sha256":"95cadc3283753045d6496e581729440a127b60cc691a45418c111ffbf8ed51bb"},"schema_version":"1.0","source":{"id":"2010.00152","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.00152","created_at":"2026-07-05T05:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"2010.00152v3","created_at":"2026-07-05T05:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00152","created_at":"2026-07-05T05:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"L5GTRSNWVPM3","created_at":"2026-07-05T05:00:35Z"},{"alias_kind":"pith_short_16","alias_value":"L5GTRSNWVPM3Q4HX","created_at":"2026-07-05T05:00:35Z"},{"alias_kind":"pith_short_8","alias_value":"L5GTRSNW","created_at":"2026-07-05T05:00:35Z"}],"graph_snapshots":[{"event_id":"sha256:9cb2bfc053a2f7abb674028536d8d8c6afd0d328848d9b4320d5eed9a114123b","target":"graph","created_at":"2026-07-05T05:00:35Z","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/2010.00152/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Database query processing requires algorithms for duplicate removal, grouping, and aggregation. Three algorithms exist: in-stream aggregation is most efficient by far but requires sorted input; sort-based aggregation relies on external merge sort; and hash aggregation relies on an in-memory hash table plus hash partitioning to temporary storage. Cost-based query optimization chooses which algorithm to use based on several factors including the sort order of the input, input and output sizes, and the need for sorted output. For example, hash-based aggregation is ideal for output smaller than th","authors_text":"Goetz Graefe, Jeffrey Naughton, Thanh Do","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-10-01T00:11:37Z","title":"Efficient sorting, duplicate removal, grouping, and aggregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00152","kind":"arxiv","version":3},"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:36b318d2ce50079a7a4944c6a6a98bff5329deaf525b2a894cc4cf7bfa44ea7d","target":"record","created_at":"2026-07-05T05:00:35Z","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":"6b9a640376dd483e233b0220df6c6e773948f90112a118945b01215b74ae309d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-10-01T00:11:37Z","title_canon_sha256":"95cadc3283753045d6496e581729440a127b60cc691a45418c111ffbf8ed51bb"},"schema_version":"1.0","source":{"id":"2010.00152","kind":"arxiv","version":3}},"canonical_sha256":"5f4d38c9b6abd9b870f7d582f0cb12b463e98fce1264c8f371d7bf25c9988db4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f4d38c9b6abd9b870f7d582f0cb12b463e98fce1264c8f371d7bf25c9988db4","first_computed_at":"2026-07-05T05:00:35.687023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:00:35.687023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lshPehvAZAeApzyBf5GT0WgQSSlQnCMI5SUnGi/T8Dg2k4/G82f1h4gresGpoqtL82NxdgNfUGHjC7O/u812BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:00:35.687401Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.00152","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36b318d2ce50079a7a4944c6a6a98bff5329deaf525b2a894cc4cf7bfa44ea7d","sha256:9cb2bfc053a2f7abb674028536d8d8c6afd0d328848d9b4320d5eed9a114123b"],"state_sha256":"33eb180e76ea03e8b06d8ab7f1f20e751b9cd77d14e269c3bfb608dde19d1687"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFnVOeCCq4OEEIEeRo/crFV7FDkenDCdGpWc4HwCcnh+PDlHes8Pu7ELifRAWNEAwRFPmX+KgLO5YflP7SwsBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:27:32.335896Z","bundle_sha256":"b074cf8619288adf9afafd2bbec1ce6d86929b9bc0b6c2d44292d70433ea837a"}}