{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:C6QRNEMHNZXTLS3RNQSNYBEIWW","short_pith_number":"pith:C6QRNEMH","schema_version":"1.0","canonical_sha256":"17a11691876e6f35cb716c24dc0488b59e093601858fc71886d1fafbb6c228d1","source":{"kind":"arxiv","id":"2403.02286","version":1},"attestation_state":"computed","paper":{"title":"Stage: Query Execution Time Prediction in Amazon Redshift","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Balakrishnan Narayanaswamy, Gaurav Saxena, Mohammad Rahman, Parimarjan Negi, Pascal Pfeil, Ryan Marcus, Tim Kraska, Vikram Nathan, Zhengchun Liu, Ziniu Wu","submitted_at":"2024-03-04T18:17:18Z","abstract_excerpt":"Query performance (e.g., execution time) prediction is a critical component of modern DBMSes. As a pioneering cloud data warehouse, Amazon Redshift relies on an accurate execution time prediction for many downstream tasks, ranging from high-level optimizations, such as automatically creating materialized views, to low-level tasks on the critical path of query execution, such as admission, scheduling, and execution resource control. Unfortunately, many existing execution time prediction techniques, including those used in Redshift, suffer from cold start issues, inaccurate estimation, and are n"},"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.02286","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-03-04T18:17:18Z","cross_cats_sorted":[],"title_canon_sha256":"e5b783fde51636550a5f1663b741c1169d7082577ea5e2175fdc56d69305e547","abstract_canon_sha256":"f477d37a57fdaaea8b1a361a2ef6ff141921ee041277ff3cf91065b8cf099537"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:58.839456Z","signature_b64":"F9c77bRm4Ufzpxwu0r7H1yp8WSXBa6ELmSFwQ03GXeWaT8RU4abW41Pa+q+tvXc3JDj2XXt4vwZz51aGq46CCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17a11691876e6f35cb716c24dc0488b59e093601858fc71886d1fafbb6c228d1","last_reissued_at":"2026-07-05T07:51:58.838853Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:58.838853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stage: Query Execution Time Prediction in Amazon Redshift","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Balakrishnan Narayanaswamy, Gaurav Saxena, Mohammad Rahman, Parimarjan Negi, Pascal Pfeil, Ryan Marcus, Tim Kraska, Vikram Nathan, Zhengchun Liu, Ziniu Wu","submitted_at":"2024-03-04T18:17:18Z","abstract_excerpt":"Query performance (e.g., execution time) prediction is a critical component of modern DBMSes. As a pioneering cloud data warehouse, Amazon Redshift relies on an accurate execution time prediction for many downstream tasks, ranging from high-level optimizations, such as automatically creating materialized views, to low-level tasks on the critical path of query execution, such as admission, scheduling, and execution resource control. Unfortunately, many existing execution time prediction techniques, including those used in Redshift, suffer from cold start issues, inaccurate estimation, and are n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02286","kind":"arxiv","version":1},"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.02286/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.02286","created_at":"2026-07-05T07:51:58.838928+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.02286v1","created_at":"2026-07-05T07:51:58.838928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02286","created_at":"2026-07-05T07:51:58.838928+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6QRNEMHNZXT","created_at":"2026-07-05T07:51:58.838928+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6QRNEMHNZXTLS3R","created_at":"2026-07-05T07:51:58.838928+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6QRNEMH","created_at":"2026-07-05T07:51:58.838928+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2512.11001","citing_title":"Rethinking Query Optimization for Multi-Agent Systems [Vision]","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C6QRNEMHNZXTLS3RNQSNYBEIWW","json":"https://pith.science/pith/C6QRNEMHNZXTLS3RNQSNYBEIWW.json","graph_json":"https://pith.science/api/pith-number/C6QRNEMHNZXTLS3RNQSNYBEIWW/graph.json","events_json":"https://pith.science/api/pith-number/C6QRNEMHNZXTLS3RNQSNYBEIWW/events.json","paper":"https://pith.science/paper/C6QRNEMH"},"agent_actions":{"view_html":"https://pith.science/pith/C6QRNEMHNZXTLS3RNQSNYBEIWW","download_json":"https://pith.science/pith/C6QRNEMHNZXTLS3RNQSNYBEIWW.json","view_paper":"https://pith.science/paper/C6QRNEMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.02286&json=true","fetch_graph":"https://pith.science/api/pith-number/C6QRNEMHNZXTLS3RNQSNYBEIWW/graph.json","fetch_events":"https://pith.science/api/pith-number/C6QRNEMHNZXTLS3RNQSNYBEIWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6QRNEMHNZXTLS3RNQSNYBEIWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6QRNEMHNZXTLS3RNQSNYBEIWW/action/storage_attestation","attest_author":"https://pith.science/pith/C6QRNEMHNZXTLS3RNQSNYBEIWW/action/author_attestation","sign_citation":"https://pith.science/pith/C6QRNEMHNZXTLS3RNQSNYBEIWW/action/citation_signature","submit_replication":"https://pith.science/pith/C6QRNEMHNZXTLS3RNQSNYBEIWW/action/replication_record"}},"created_at":"2026-07-05T07:51:58.838928+00:00","updated_at":"2026-07-05T07:51:58.838928+00:00"}