{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GFI6B27ZJPI2I4QA7QAT3B6SLF","short_pith_number":"pith:GFI6B27Z","canonical_record":{"source":{"id":"1905.00774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-02T14:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"d756c213bd032711472a66f4226aa9f54c2f27d106b3160856dcaad0ff5f116d","abstract_canon_sha256":"47e660aa3272869895ac6b8edb3b9382e22b0985e04a406cd339fb366de783d8"},"schema_version":"1.0"},"canonical_sha256":"3151e0ebf94bd1a47200fc013d87d259602fc21e70a86a78f26779fa94925dd5","source":{"kind":"arxiv","id":"1905.00774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00774","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00774v1","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00774","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"GFI6B27ZJPI2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GFI6B27ZJPI2I4QA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GFI6B27Z","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GFI6B27ZJPI2I4QA7QAT3B6SLF","target":"record","payload":{"canonical_record":{"source":{"id":"1905.00774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-02T14:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"d756c213bd032711472a66f4226aa9f54c2f27d106b3160856dcaad0ff5f116d","abstract_canon_sha256":"47e660aa3272869895ac6b8edb3b9382e22b0985e04a406cd339fb366de783d8"},"schema_version":"1.0"},"canonical_sha256":"3151e0ebf94bd1a47200fc013d87d259602fc21e70a86a78f26779fa94925dd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:09.337385Z","signature_b64":"VhOA39nsfI3z7qeRSxB7kGciLR7QvxBtLzhDvXUI1HM0Z1RuEUuNBZC5oQ0jF+hGkX4xEI+8nfIAl12pIhjlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3151e0ebf94bd1a47200fc013d87d259602fc21e70a86a78f26779fa94925dd5","last_reissued_at":"2026-05-17T23:47:09.336802Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:09.336802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.00774","source_version":1,"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:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C4/8WIwrZS7PVzAPgcWScZ7DSdMqy5AxvSRNGXl1SUxV3KOiGHCjxKe5nnojZgdq/yoa8bKA/2+3Gx6F6Ll4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:54:00.488728Z"},"content_sha256":"13f9948c2598fc998bf1ea125f6d8f41a0805f89a6853f14bf7c08a31bde7ec9","schema_version":"1.0","event_id":"sha256:13f9948c2598fc998bf1ea125f6d8f41a0805f89a6853f14bf7c08a31bde7ec9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GFI6B27ZJPI2I4QA7QAT3B6SLF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Can the Optimizer Cost be Used to Predict Query Execution Times?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Anthony Kleerekoper, Javier Navaridas, Mikel Lujan","submitted_at":"2019-05-02T14:35:47Z","abstract_excerpt":"Predicting the execution time of queries is an important problem with applications in scheduling, service level agreements and error detection. During query planning, a cost is associated with the chosen execution plan and used to rank competing plans. It would be convenient to use that cost to predict execution time, but it has been claimed in the literature that this is not possible. In this paper, we thoroughly investigate this claim considering both linear and non-linear models. We find that the accuracy using more complex models with only the optimizer cost is comparable to the reported a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00774","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":""},"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:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRjqecBvHDNb1FigF2Jd2aibjU0FPO68zg+wdMjogkmQvcKQ8txtd2hqzObgLvyra1db8CUoMTWfwVq/+yIqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:54:00.489070Z"},"content_sha256":"6ce567cc9026a18717ef63fa4a686ad706c8a67b17f64614989cfd0faa34db15","schema_version":"1.0","event_id":"sha256:6ce567cc9026a18717ef63fa4a686ad706c8a67b17f64614989cfd0faa34db15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GFI6B27ZJPI2I4QA7QAT3B6SLF/bundle.json","state_url":"https://pith.science/pith/GFI6B27ZJPI2I4QA7QAT3B6SLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GFI6B27ZJPI2I4QA7QAT3B6SLF/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-26T13:54:00Z","links":{"resolver":"https://pith.science/pith/GFI6B27ZJPI2I4QA7QAT3B6SLF","bundle":"https://pith.science/pith/GFI6B27ZJPI2I4QA7QAT3B6SLF/bundle.json","state":"https://pith.science/pith/GFI6B27ZJPI2I4QA7QAT3B6SLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GFI6B27ZJPI2I4QA7QAT3B6SLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GFI6B27ZJPI2I4QA7QAT3B6SLF","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":"47e660aa3272869895ac6b8edb3b9382e22b0985e04a406cd339fb366de783d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-02T14:35:47Z","title_canon_sha256":"d756c213bd032711472a66f4226aa9f54c2f27d106b3160856dcaad0ff5f116d"},"schema_version":"1.0","source":{"id":"1905.00774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00774","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00774v1","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00774","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"GFI6B27ZJPI2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GFI6B27ZJPI2I4QA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GFI6B27Z","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:6ce567cc9026a18717ef63fa4a686ad706c8a67b17f64614989cfd0faa34db15","target":"graph","created_at":"2026-05-17T23:47:09Z","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":"Predicting the execution time of queries is an important problem with applications in scheduling, service level agreements and error detection. During query planning, a cost is associated with the chosen execution plan and used to rank competing plans. It would be convenient to use that cost to predict execution time, but it has been claimed in the literature that this is not possible. In this paper, we thoroughly investigate this claim considering both linear and non-linear models. We find that the accuracy using more complex models with only the optimizer cost is comparable to the reported a","authors_text":"Anthony Kleerekoper, Javier Navaridas, Mikel Lujan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-02T14:35:47Z","title":"Can the Optimizer Cost be Used to Predict Query Execution Times?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00774","kind":"arxiv","version":1},"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:13f9948c2598fc998bf1ea125f6d8f41a0805f89a6853f14bf7c08a31bde7ec9","target":"record","created_at":"2026-05-17T23:47:09Z","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":"47e660aa3272869895ac6b8edb3b9382e22b0985e04a406cd339fb366de783d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-05-02T14:35:47Z","title_canon_sha256":"d756c213bd032711472a66f4226aa9f54c2f27d106b3160856dcaad0ff5f116d"},"schema_version":"1.0","source":{"id":"1905.00774","kind":"arxiv","version":1}},"canonical_sha256":"3151e0ebf94bd1a47200fc013d87d259602fc21e70a86a78f26779fa94925dd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3151e0ebf94bd1a47200fc013d87d259602fc21e70a86a78f26779fa94925dd5","first_computed_at":"2026-05-17T23:47:09.336802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:09.336802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VhOA39nsfI3z7qeRSxB7kGciLR7QvxBtLzhDvXUI1HM0Z1RuEUuNBZC5oQ0jF+hGkX4xEI+8nfIAl12pIhjlBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:09.337385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13f9948c2598fc998bf1ea125f6d8f41a0805f89a6853f14bf7c08a31bde7ec9","sha256:6ce567cc9026a18717ef63fa4a686ad706c8a67b17f64614989cfd0faa34db15"],"state_sha256":"2f610b70311e96fbd67be6c90ebf065b1e1890f0b0bfb6433a3aef2359da5925"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebpW3DpSWr4NlJaEhfYfrqxWbsKpUeCqmTJq1GrUtfaNbJNYpRe250b+8iKtY/ldPUtpQSMR0x/cwDokMkUiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:54:00.490956Z","bundle_sha256":"9186c9eaf7ac504a367ae35e49151581943684f5edfa858c43aa82bbf5e3f425"}}