{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:ZFX3BOYRXFZLPSWMWOHLWRJI7A","short_pith_number":"pith:ZFX3BOYR","canonical_record":{"source":{"id":"cs/0612112","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DB","submitted_at":"2006-12-21T21:51:55Z","cross_cats_sorted":[],"title_canon_sha256":"9ffd6e57322515523eb2b5e9c41380ff9e4d8491e0d796fdead552b83a84c462","abstract_canon_sha256":"315dc2c829bb185d427aaae4c1630c1dd962bc973af5fead85e7bf2f8605e3de"},"schema_version":"1.0"},"canonical_sha256":"c96fb0bb11b972b7caccb38ebb4528f828f321ec9d62b7b623c360c4a5a83769","source":{"kind":"arxiv","id":"cs/0612112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0612112","created_at":"2026-07-04T14:58:21Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0612112v1","created_at":"2026-07-04T14:58:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0612112","created_at":"2026-07-04T14:58:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZFX3BOYRXFZL","created_at":"2026-07-04T14:58:21Z"},{"alias_kind":"pith_short_16","alias_value":"ZFX3BOYRXFZLPSWM","created_at":"2026-07-04T14:58:21Z"},{"alias_kind":"pith_short_8","alias_value":"ZFX3BOYR","created_at":"2026-07-04T14:58:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:ZFX3BOYRXFZLPSWMWOHLWRJI7A","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0612112","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DB","submitted_at":"2006-12-21T21:51:55Z","cross_cats_sorted":[],"title_canon_sha256":"9ffd6e57322515523eb2b5e9c41380ff9e4d8491e0d796fdead552b83a84c462","abstract_canon_sha256":"315dc2c829bb185d427aaae4c1630c1dd962bc973af5fead85e7bf2f8605e3de"},"schema_version":"1.0"},"canonical_sha256":"c96fb0bb11b972b7caccb38ebb4528f828f321ec9d62b7b623c360c4a5a83769","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:58:21.667181Z","signature_b64":"71yOdEWGZKmIfM9m2SGoI+NzPcsN5+56jSfNTAIzeMz18oumrOib1z7U4E0icLF/ZytqNbFR8qclVUtpsuY6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c96fb0bb11b972b7caccb38ebb4528f828f321ec9d62b7b623c360c4a5a83769","last_reissued_at":"2026-07-04T14:58:21.666824Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:58:21.666824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0612112","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-07-04T14:58:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JlmML69/FJZmXO4y3JTgXIbHjLfTXTBysCZNL9bU/fHZdnZYTHrYoLOZ/7JKfl1Bix2LreNwpVQ6pld6BFHeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:28:33.429945Z"},"content_sha256":"8e75512c2173c2a01c3bb84b31ae126ec45ad05265ac06a9af71ab5c0a63b5a3","schema_version":"1.0","event_id":"sha256:8e75512c2173c2a01c3bb84b31ae126ec45ad05265ac06a9af71ab5c0a63b5a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:ZFX3BOYRXFZLPSWMWOHLWRJI7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Managing Query Compilation Memory Consumption to Improve DBMS Throughput","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Boris Baryshnikov, Cipri Clinciu, Conor Cunningham, Leo Giakoumakis, Slava Oks, Stefano Stefani","submitted_at":"2006-12-21T21:51:55Z","abstract_excerpt":"While there are known performance trade-offs between database page buffer pool and query execution memory allocation policies, little has been written on the impact of query compilation memory use on overall throughput of the database management system (DBMS). We present a new aspect of the query optimization problem and offer a solution implemented in Microsoft SQL Server 2005. The solution provides stable throughput for a range of workloads even when memory requests outstrip the ability of the hardware to service those requests."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0612112","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/cs/0612112/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"},"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-07-04T14:58:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BO6a1ccWJ49Hgq0TZLCnf8N0J/gy+xxpEXZrO9H+MOUbWrZKavhE/Mn/5xg78gKsiWKCQJYpxLoniM0WXiymDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:28:33.430779Z"},"content_sha256":"d77bcd381fe564a87f5997beea9a3a580df19f6f2969602137dabd5ad9cd4850","schema_version":"1.0","event_id":"sha256:d77bcd381fe564a87f5997beea9a3a580df19f6f2969602137dabd5ad9cd4850"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZFX3BOYRXFZLPSWMWOHLWRJI7A/bundle.json","state_url":"https://pith.science/pith/ZFX3BOYRXFZLPSWMWOHLWRJI7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZFX3BOYRXFZLPSWMWOHLWRJI7A/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-08-05T14:28:33Z","links":{"resolver":"https://pith.science/pith/ZFX3BOYRXFZLPSWMWOHLWRJI7A","bundle":"https://pith.science/pith/ZFX3BOYRXFZLPSWMWOHLWRJI7A/bundle.json","state":"https://pith.science/pith/ZFX3BOYRXFZLPSWMWOHLWRJI7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZFX3BOYRXFZLPSWMWOHLWRJI7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:ZFX3BOYRXFZLPSWMWOHLWRJI7A","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":"315dc2c829bb185d427aaae4c1630c1dd962bc973af5fead85e7bf2f8605e3de","cross_cats_sorted":[],"license":"","primary_cat":"cs.DB","submitted_at":"2006-12-21T21:51:55Z","title_canon_sha256":"9ffd6e57322515523eb2b5e9c41380ff9e4d8491e0d796fdead552b83a84c462"},"schema_version":"1.0","source":{"id":"cs/0612112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0612112","created_at":"2026-07-04T14:58:21Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0612112v1","created_at":"2026-07-04T14:58:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0612112","created_at":"2026-07-04T14:58:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZFX3BOYRXFZL","created_at":"2026-07-04T14:58:21Z"},{"alias_kind":"pith_short_16","alias_value":"ZFX3BOYRXFZLPSWM","created_at":"2026-07-04T14:58:21Z"},{"alias_kind":"pith_short_8","alias_value":"ZFX3BOYR","created_at":"2026-07-04T14:58:21Z"}],"graph_snapshots":[{"event_id":"sha256:d77bcd381fe564a87f5997beea9a3a580df19f6f2969602137dabd5ad9cd4850","target":"graph","created_at":"2026-07-04T14:58:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0612112/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"While there are known performance trade-offs between database page buffer pool and query execution memory allocation policies, little has been written on the impact of query compilation memory use on overall throughput of the database management system (DBMS). We present a new aspect of the query optimization problem and offer a solution implemented in Microsoft SQL Server 2005. The solution provides stable throughput for a range of workloads even when memory requests outstrip the ability of the hardware to service those requests.","authors_text":"Boris Baryshnikov, Cipri Clinciu, Conor Cunningham, Leo Giakoumakis, Slava Oks, Stefano Stefani","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DB","submitted_at":"2006-12-21T21:51:55Z","title":"Managing Query Compilation Memory Consumption to Improve DBMS Throughput"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0612112","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:8e75512c2173c2a01c3bb84b31ae126ec45ad05265ac06a9af71ab5c0a63b5a3","target":"record","created_at":"2026-07-04T14:58:21Z","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":"315dc2c829bb185d427aaae4c1630c1dd962bc973af5fead85e7bf2f8605e3de","cross_cats_sorted":[],"license":"","primary_cat":"cs.DB","submitted_at":"2006-12-21T21:51:55Z","title_canon_sha256":"9ffd6e57322515523eb2b5e9c41380ff9e4d8491e0d796fdead552b83a84c462"},"schema_version":"1.0","source":{"id":"cs/0612112","kind":"arxiv","version":1}},"canonical_sha256":"c96fb0bb11b972b7caccb38ebb4528f828f321ec9d62b7b623c360c4a5a83769","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c96fb0bb11b972b7caccb38ebb4528f828f321ec9d62b7b623c360c4a5a83769","first_computed_at":"2026-07-04T14:58:21.666824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:58:21.666824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"71yOdEWGZKmIfM9m2SGoI+NzPcsN5+56jSfNTAIzeMz18oumrOib1z7U4E0icLF/ZytqNbFR8qclVUtpsuY6DA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:58:21.667181Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0612112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e75512c2173c2a01c3bb84b31ae126ec45ad05265ac06a9af71ab5c0a63b5a3","sha256:d77bcd381fe564a87f5997beea9a3a580df19f6f2969602137dabd5ad9cd4850"],"state_sha256":"4d168b9a73adc10203eef7e4e573ebf4751171f6a7c7aef3d73914b2033e1de8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOZAmxy/Or81yOn8Wzh6Ot4/ww9V6OSSemylzljB/HFqM1p/KYt36BIV8Ge2GAzMgjuwzJx2SphQ+zfMc1JbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T14:28:33.436926Z","bundle_sha256":"34b5c4c0c70fa59cf357e3134334206a1c9a9257a9df0100f1f0103b4e2b5991"}}