{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QYQBOMEVFMYMUTIYXMZEJNSVFQ","short_pith_number":"pith:QYQBOMEV","schema_version":"1.0","canonical_sha256":"86201730952b30ca4d18bb3244b6552c13329e0f55f1fa92af82d6a857cb23a0","source":{"kind":"arxiv","id":"2403.11874","version":3},"attestation_state":"computed","paper":{"title":"Benchmarking Analytical Query Processing in Intel SGXv2","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"(2) SAP SE, 3) ((1) Technical University of Darmstadt, (3) DFKI), Adrian Lutsch (1), Carsten Binnig (1, Daniel Ritter (2), Matthias Heinrich (1), Muhammad El-Hindi (1), Zsolt Istv\\'an (1)","submitted_at":"2024-03-18T15:27:35Z","abstract_excerpt":"Trusted Execution Environments (TEEs), such as Intel's Software Guard Extensions (SGX), are increasingly being adopted to address trust and compliance issues in the public cloud. Intel SGX's second generation (SGXv2) addresses many limitations of its predecessor (SGXv1), offering the potential for secure and efficient analytical cloud DBMSs. We assess this potential and conduct the first in-depth evaluation study of analytical query processing algorithms inside SGXv2. Our study reveals that, unlike SGXv1, state-of-the-art algorithms like radix joins and SIMD-based scans are a good starting poi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2403.11874","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2024-03-18T15:27:35Z","cross_cats_sorted":[],"title_canon_sha256":"c7e1210981c723068043efdccebc4202cf1d6040906ef13c4f20bbf6e7a534dc","abstract_canon_sha256":"aed4c010bc333d71c80e81c2a90895f2e14c9da54cf912575abb814af8582976"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:12.177023Z","signature_b64":"QdipWpyuFiK1lvM6GZZhB6L3QQ9cSCanuHFSJ6uN/uy5EAI7fTjT4fExLfMpoxcjtBIwWanlsWYuLDfBME1hCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86201730952b30ca4d18bb3244b6552c13329e0f55f1fa92af82d6a857cb23a0","last_reissued_at":"2026-07-05T10:04:12.176600Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:12.176600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benchmarking Analytical Query Processing in Intel SGXv2","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"(2) SAP SE, 3) ((1) Technical University of Darmstadt, (3) DFKI), Adrian Lutsch (1), Carsten Binnig (1, Daniel Ritter (2), Matthias Heinrich (1), Muhammad El-Hindi (1), Zsolt Istv\\'an (1)","submitted_at":"2024-03-18T15:27:35Z","abstract_excerpt":"Trusted Execution Environments (TEEs), such as Intel's Software Guard Extensions (SGX), are increasingly being adopted to address trust and compliance issues in the public cloud. Intel SGX's second generation (SGXv2) addresses many limitations of its predecessor (SGXv1), offering the potential for secure and efficient analytical cloud DBMSs. We assess this potential and conduct the first in-depth evaluation study of analytical query processing algorithms inside SGXv2. Our study reveals that, unlike SGXv1, state-of-the-art algorithms like radix joins and SIMD-based scans are a good starting poi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.11874","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/2403.11874/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.11874","created_at":"2026-07-05T10:04:12.176657+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.11874v3","created_at":"2026-07-05T10:04:12.176657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.11874","created_at":"2026-07-05T10:04:12.176657+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYQBOMEVFMYM","created_at":"2026-07-05T10:04:12.176657+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYQBOMEVFMYMUTIY","created_at":"2026-07-05T10:04:12.176657+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYQBOMEV","created_at":"2026-07-05T10:04:12.176657+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26385","citing_title":"Query Cost Model Calibration in Confidential Virtual Machines","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QYQBOMEVFMYMUTIYXMZEJNSVFQ","json":"https://pith.science/pith/QYQBOMEVFMYMUTIYXMZEJNSVFQ.json","graph_json":"https://pith.science/api/pith-number/QYQBOMEVFMYMUTIYXMZEJNSVFQ/graph.json","events_json":"https://pith.science/api/pith-number/QYQBOMEVFMYMUTIYXMZEJNSVFQ/events.json","paper":"https://pith.science/paper/QYQBOMEV"},"agent_actions":{"view_html":"https://pith.science/pith/QYQBOMEVFMYMUTIYXMZEJNSVFQ","download_json":"https://pith.science/pith/QYQBOMEVFMYMUTIYXMZEJNSVFQ.json","view_paper":"https://pith.science/paper/QYQBOMEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.11874&json=true","fetch_graph":"https://pith.science/api/pith-number/QYQBOMEVFMYMUTIYXMZEJNSVFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/QYQBOMEVFMYMUTIYXMZEJNSVFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYQBOMEVFMYMUTIYXMZEJNSVFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYQBOMEVFMYMUTIYXMZEJNSVFQ/action/storage_attestation","attest_author":"https://pith.science/pith/QYQBOMEVFMYMUTIYXMZEJNSVFQ/action/author_attestation","sign_citation":"https://pith.science/pith/QYQBOMEVFMYMUTIYXMZEJNSVFQ/action/citation_signature","submit_replication":"https://pith.science/pith/QYQBOMEVFMYMUTIYXMZEJNSVFQ/action/replication_record"}},"created_at":"2026-07-05T10:04:12.176657+00:00","updated_at":"2026-07-05T10:04:12.176657+00:00"}