{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E7QYVKMAZKOX3JFB75K2X3ITOD","short_pith_number":"pith:E7QYVKMA","canonical_record":{"source":{"id":"1512.02568","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-12-08T17:56:26Z","cross_cats_sorted":[],"title_canon_sha256":"9786c2dc4b0374a01f76059b8b9ca2dc8d4f140b0c5428d6712617d17330931c","abstract_canon_sha256":"2783608eb9764793345f8c0b5ee30cd0f65a77d7126f5565d9a152192b28d4f6"},"schema_version":"1.0"},"canonical_sha256":"27e18aa980ca9d7da4a1ff55abed1370e3e21557f9956e68b832bc12fc492230","source":{"kind":"arxiv","id":"1512.02568","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02568","created_at":"2026-05-18T00:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02568v2","created_at":"2026-05-18T00:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02568","created_at":"2026-05-18T00:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"E7QYVKMAZKOX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"E7QYVKMAZKOX3JFB","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"E7QYVKMA","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E7QYVKMAZKOX3JFB75K2X3ITOD","target":"record","payload":{"canonical_record":{"source":{"id":"1512.02568","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-12-08T17:56:26Z","cross_cats_sorted":[],"title_canon_sha256":"9786c2dc4b0374a01f76059b8b9ca2dc8d4f140b0c5428d6712617d17330931c","abstract_canon_sha256":"2783608eb9764793345f8c0b5ee30cd0f65a77d7126f5565d9a152192b28d4f6"},"schema_version":"1.0"},"canonical_sha256":"27e18aa980ca9d7da4a1ff55abed1370e3e21557f9956e68b832bc12fc492230","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:31.167267Z","signature_b64":"zF6JtzlrdDRRaOpnhxG+U+EDlj9LBJx/PDlkZoerbvn2aZA3cUeh/iJPZPnl4pormZX/slPl+jHaDe2hV9nZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27e18aa980ca9d7da4a1ff55abed1370e3e21557f9956e68b832bc12fc492230","last_reissued_at":"2026-05-18T00:52:31.166613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:31.166613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.02568","source_version":2,"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-18T00:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+i5wTljvmRkQLZ1ZvbvoEDiIOKEh7zcDNiogfjtIIUOFHEDE8px7Xy916tTGOpUau3EJEevoR6Hhlxzk5XwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:24:22.218396Z"},"content_sha256":"51d442695c456f80c3f816d3bb73f30d581983a498642f5e992ec4cb1895e81c","schema_version":"1.0","event_id":"sha256:51d442695c456f80c3f816d3bb73f30d581983a498642f5e992ec4cb1895e81c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E7QYVKMAZKOX3JFB75K2X3ITOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Provable Multi-Query Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"S. Sudarshan, Tarun Kathuria","submitted_at":"2015-12-08T17:56:26Z","abstract_excerpt":"Complex queries for massive data analysis jobs have become increasingly commonplace. Many such queries contain com- mon subexpressions, either within a single query or among multiple queries submitted as a batch. Conventional query optimizers do not exploit these subexpressions and produce sub-optimal plans. The problem of multi-query optimization (MQO) is to generate an optimal combined evaluation plan by computing common subexpressions once and reusing them. Exhaustive algorithms for MQO explore an O(n^n) search space. Thus, this problem has primarily been tackled using various heuristic alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02568","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":""},"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-18T00:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHf7+wsR08H8nf7gPrrtv+CYVRwzPGeCvVc9eNIIC6aXFOyR/YfpP8iGS2y07RrTgbjSNMkA4uweYf1wVQyzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:24:22.218752Z"},"content_sha256":"3eab549002c73a00fe19fdfc78370ba25fecf4fb680b4e53da4edb6cac70a3aa","schema_version":"1.0","event_id":"sha256:3eab549002c73a00fe19fdfc78370ba25fecf4fb680b4e53da4edb6cac70a3aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7QYVKMAZKOX3JFB75K2X3ITOD/bundle.json","state_url":"https://pith.science/pith/E7QYVKMAZKOX3JFB75K2X3ITOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7QYVKMAZKOX3JFB75K2X3ITOD/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-03T19:24:22Z","links":{"resolver":"https://pith.science/pith/E7QYVKMAZKOX3JFB75K2X3ITOD","bundle":"https://pith.science/pith/E7QYVKMAZKOX3JFB75K2X3ITOD/bundle.json","state":"https://pith.science/pith/E7QYVKMAZKOX3JFB75K2X3ITOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7QYVKMAZKOX3JFB75K2X3ITOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E7QYVKMAZKOX3JFB75K2X3ITOD","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":"2783608eb9764793345f8c0b5ee30cd0f65a77d7126f5565d9a152192b28d4f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-12-08T17:56:26Z","title_canon_sha256":"9786c2dc4b0374a01f76059b8b9ca2dc8d4f140b0c5428d6712617d17330931c"},"schema_version":"1.0","source":{"id":"1512.02568","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02568","created_at":"2026-05-18T00:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02568v2","created_at":"2026-05-18T00:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02568","created_at":"2026-05-18T00:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"E7QYVKMAZKOX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"E7QYVKMAZKOX3JFB","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"E7QYVKMA","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:3eab549002c73a00fe19fdfc78370ba25fecf4fb680b4e53da4edb6cac70a3aa","target":"graph","created_at":"2026-05-18T00:52:31Z","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":"Complex queries for massive data analysis jobs have become increasingly commonplace. Many such queries contain com- mon subexpressions, either within a single query or among multiple queries submitted as a batch. Conventional query optimizers do not exploit these subexpressions and produce sub-optimal plans. The problem of multi-query optimization (MQO) is to generate an optimal combined evaluation plan by computing common subexpressions once and reusing them. Exhaustive algorithms for MQO explore an O(n^n) search space. Thus, this problem has primarily been tackled using various heuristic alg","authors_text":"S. Sudarshan, Tarun Kathuria","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-12-08T17:56:26Z","title":"Efficient and Provable Multi-Query Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02568","kind":"arxiv","version":2},"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:51d442695c456f80c3f816d3bb73f30d581983a498642f5e992ec4cb1895e81c","target":"record","created_at":"2026-05-18T00:52:31Z","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":"2783608eb9764793345f8c0b5ee30cd0f65a77d7126f5565d9a152192b28d4f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-12-08T17:56:26Z","title_canon_sha256":"9786c2dc4b0374a01f76059b8b9ca2dc8d4f140b0c5428d6712617d17330931c"},"schema_version":"1.0","source":{"id":"1512.02568","kind":"arxiv","version":2}},"canonical_sha256":"27e18aa980ca9d7da4a1ff55abed1370e3e21557f9956e68b832bc12fc492230","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27e18aa980ca9d7da4a1ff55abed1370e3e21557f9956e68b832bc12fc492230","first_computed_at":"2026-05-18T00:52:31.166613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:31.166613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zF6JtzlrdDRRaOpnhxG+U+EDlj9LBJx/PDlkZoerbvn2aZA3cUeh/iJPZPnl4pormZX/slPl+jHaDe2hV9nZCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:31.167267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02568","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51d442695c456f80c3f816d3bb73f30d581983a498642f5e992ec4cb1895e81c","sha256:3eab549002c73a00fe19fdfc78370ba25fecf4fb680b4e53da4edb6cac70a3aa"],"state_sha256":"7f5d4c96100879fb6cf2e648bff11505aac61a9db85539497c9e91fffda82b23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B1BRT08bTrNl+TmSAOVvpXlk4ODaD4YrIBIiGsBkewYvMR0Jx/BV/AyaC6KhQfgCrmz1Pyn4reBM6NNyIMn8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:24:22.220733Z","bundle_sha256":"df5a47442ffa835cebbb62691c0c3e88ade5bdfbb0f9035e716620e44bc176f1"}}