{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4IPQQOQO3LTY2YY5AZS4QMZQGS","short_pith_number":"pith:4IPQQOQO","schema_version":"1.0","canonical_sha256":"e21f083a0edae78d631d0665c833303483fcdfd676a7d78a21bb2eb345b16006","source":{"kind":"arxiv","id":"2603.02001","version":2},"attestation_state":"computed","paper":{"title":"Bespoke OLAP: Synthesizing Workload-Specific One-size-fits-one Database Engines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Carsten Binnig, Johannes Wehrstein, Matthias Jasny, Timo Eckmann","submitted_at":"2026-03-02T15:51:45Z","abstract_excerpt":"Modern OLAP engines are designed to support arbitrary analytical workloads, but this generality incurs structural overhead, including runtime schema interpretation, indirection layers, and abstraction boundaries, even in highly optimized systems. An engine specialized to a fixed workload can eliminate these costs and exploit workload-specific data structures and execution algorithms for substantially higher performance. Historically, constructing such bespoke engines has been economically impractical due to the high manual engineering effort. Recent advances in LLM-based code synthesis challen"},"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":"2603.02001","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2026-03-02T15:51:45Z","cross_cats_sorted":[],"title_canon_sha256":"5c476c0115073298d7917a7ae129de52a64e159bf012fbf2749f1f015b0d44aa","abstract_canon_sha256":"945d724e3a0b60281bc2b6ed84b077d66ec234ca774b35cfc924e8a7f9101800"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-24T01:24:08.786220Z","signature_b64":"RmLkxIwUlqLBJtDvsXLsHJXiAtbVZfN8t87GPlapgaaXsKWADg7znPJYDAnXemn10BTVIyuyHdGfN0QV1B6dCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e21f083a0edae78d631d0665c833303483fcdfd676a7d78a21bb2eb345b16006","last_reissued_at":"2026-07-24T01:24:08.785244Z","signature_status":"signed_v1","first_computed_at":"2026-07-24T01:24:08.785244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bespoke OLAP: Synthesizing Workload-Specific One-size-fits-one Database Engines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Carsten Binnig, Johannes Wehrstein, Matthias Jasny, Timo Eckmann","submitted_at":"2026-03-02T15:51:45Z","abstract_excerpt":"Modern OLAP engines are designed to support arbitrary analytical workloads, but this generality incurs structural overhead, including runtime schema interpretation, indirection layers, and abstraction boundaries, even in highly optimized systems. An engine specialized to a fixed workload can eliminate these costs and exploit workload-specific data structures and execution algorithms for substantially higher performance. Historically, constructing such bespoke engines has been economically impractical due to the high manual engineering effort. Recent advances in LLM-based code synthesis challen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.02001","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.02001/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":"2603.02001","created_at":"2026-07-24T01:24:08.785696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.02001v2","created_at":"2026-07-24T01:24:08.785696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.02001","created_at":"2026-07-24T01:24:08.785696+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IPQQOQO3LTY","created_at":"2026-07-24T01:24:08.785696+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IPQQOQO3LTY2YY5","created_at":"2026-07-24T01:24:08.785696+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IPQQOQO","created_at":"2026-07-24T01:24:08.785696+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":7,"sample":[{"citing_arxiv_id":"2607.07632","citing_title":"From Custom-Fit to Portable: Bridging the Gap Between Synthesized and Engineered GPU Query Execution","ref_index":46,"is_internal_anchor":true},{"citing_arxiv_id":"2607.07696","citing_title":"Breaking Database Lock-in: Agentic Regeneration of High Performance Storage Readers for Database Bypass","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2606.09361","citing_title":"Bespoke-Card: Why Tune When You Can Generate? Synthesizing Workload-Specific Cardinality Estimators","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2605.24096","citing_title":"The Time is Here for Just-in-Time Systems: Challenges and Opportunities","ref_index":55,"is_internal_anchor":true},{"citing_arxiv_id":"2605.31097","citing_title":"SpecDB: LLM-Generated Customized Databases via Feature-Oriented Decomposition","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2604.28079","citing_title":"Tailwind: A Practical Framework for Query Accelerators","ref_index":84,"is_internal_anchor":true},{"citing_arxiv_id":"2604.11556","citing_title":"FM-Agent: Scaling Formal Methods to Large Systems via LLM-Based Hoare-Style Reasoning","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4IPQQOQO3LTY2YY5AZS4QMZQGS","json":"https://pith.science/pith/4IPQQOQO3LTY2YY5AZS4QMZQGS.json","graph_json":"https://pith.science/api/pith-number/4IPQQOQO3LTY2YY5AZS4QMZQGS/graph.json","events_json":"https://pith.science/api/pith-number/4IPQQOQO3LTY2YY5AZS4QMZQGS/events.json","paper":"https://pith.science/paper/4IPQQOQO"},"agent_actions":{"view_html":"https://pith.science/pith/4IPQQOQO3LTY2YY5AZS4QMZQGS","download_json":"https://pith.science/pith/4IPQQOQO3LTY2YY5AZS4QMZQGS.json","view_paper":"https://pith.science/paper/4IPQQOQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.02001&json=true","fetch_graph":"https://pith.science/api/pith-number/4IPQQOQO3LTY2YY5AZS4QMZQGS/graph.json","fetch_events":"https://pith.science/api/pith-number/4IPQQOQO3LTY2YY5AZS4QMZQGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IPQQOQO3LTY2YY5AZS4QMZQGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IPQQOQO3LTY2YY5AZS4QMZQGS/action/storage_attestation","attest_author":"https://pith.science/pith/4IPQQOQO3LTY2YY5AZS4QMZQGS/action/author_attestation","sign_citation":"https://pith.science/pith/4IPQQOQO3LTY2YY5AZS4QMZQGS/action/citation_signature","submit_replication":"https://pith.science/pith/4IPQQOQO3LTY2YY5AZS4QMZQGS/action/replication_record"}},"created_at":"2026-07-24T01:24:08.785696+00:00","updated_at":"2026-07-24T01:24:08.785696+00:00"}