{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:STQPFWCYF5JSFDCJJMCQA3WFPE","short_pith_number":"pith:STQPFWCY","canonical_record":{"source":{"id":"1807.00368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-01T18:28:20Z","cross_cats_sorted":[],"title_canon_sha256":"de778d952ca0c8954c2ab0510a05d58760e9d121d773080962dab5f3181d6a6e","abstract_canon_sha256":"f041d04e371e97642a27ffbfd1fe5bd5f74405867b53948ea2dc4089d0c29a50"},"schema_version":"1.0"},"canonical_sha256":"94e0f2d8582f53228c494b05006ec5790b7e42df4d6a54303131455c9599dcc8","source":{"kind":"arxiv","id":"1807.00368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00368","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00368v1","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00368","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"STQPFWCYF5JS","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"STQPFWCYF5JSFDCJ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"STQPFWCY","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:STQPFWCYF5JSFDCJJMCQA3WFPE","target":"record","payload":{"canonical_record":{"source":{"id":"1807.00368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-01T18:28:20Z","cross_cats_sorted":[],"title_canon_sha256":"de778d952ca0c8954c2ab0510a05d58760e9d121d773080962dab5f3181d6a6e","abstract_canon_sha256":"f041d04e371e97642a27ffbfd1fe5bd5f74405867b53948ea2dc4089d0c29a50"},"schema_version":"1.0"},"canonical_sha256":"94e0f2d8582f53228c494b05006ec5790b7e42df4d6a54303131455c9599dcc8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:55.081555Z","signature_b64":"QAjmlvEN+bQ60L7NizGuAQhHvS6qh3O/nM77ccYgJLwMoO1zazMjhINL6Qr6fUY/WHfHqNg4plvgUtabOEq+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94e0f2d8582f53228c494b05006ec5790b7e42df4d6a54303131455c9599dcc8","last_reissued_at":"2026-05-18T00:11:55.080683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:55.080683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.00368","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-18T00:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vuKkX0qu7HC/tjvuCuR5S+Rwxg5DHvbdpgPn55lk983nOZEoU/wWN0glpY2QUCj1V4OYqXkgOTyxuoarq6YlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:46:15.458124Z"},"content_sha256":"ee70661b3593041e5e4e717159f33d36f4a221bbf894fac9ad84474661edd2f5","schema_version":"1.0","event_id":"sha256:ee70661b3593041e5e4e717159f33d36f4a221bbf894fac9ad84474661edd2f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:STQPFWCYF5JSFDCJJMCQA3WFPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Data-Driven Approach to Dynamically Adjust Resource Allocation for Compute Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Damiano Carra, Daniele Venzano, Dimitrios Milios, Francesco Pace, Pietro Michiardi","submitted_at":"2018-07-01T18:28:20Z","abstract_excerpt":"Nowadays, data-centers are largely under-utilized because resource allocation is based on reservation mechanisms which ignore actual resource utilization. Indeed, it is common to reserve resources for peak demand, which may occur only for a small portion of the application life time. As a consequence, cluster resources often go under-utilized.\n  In this work, we propose a mechanism that improves cluster utilization, thus decreasing the average turnaround time, while preventing application failures due to contention in accessing finite resources such as RAM. Our approach monitors resource utili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00368","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-18T00:11:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rdz2V5eUovvaBU2vOSw8nJMcWrRyJrQoNFcfuFZ3ygXFVrJXAq3LM4rWg1LUo0RFNLbyvmM8NCIttmOgubI0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:46:15.458487Z"},"content_sha256":"3c15d29b47490d258c2e75a72e38f6944c1131e718b1a0c9db8984d1e846aa22","schema_version":"1.0","event_id":"sha256:3c15d29b47490d258c2e75a72e38f6944c1131e718b1a0c9db8984d1e846aa22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/STQPFWCYF5JSFDCJJMCQA3WFPE/bundle.json","state_url":"https://pith.science/pith/STQPFWCYF5JSFDCJJMCQA3WFPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/STQPFWCYF5JSFDCJJMCQA3WFPE/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-21T22:46:15Z","links":{"resolver":"https://pith.science/pith/STQPFWCYF5JSFDCJJMCQA3WFPE","bundle":"https://pith.science/pith/STQPFWCYF5JSFDCJJMCQA3WFPE/bundle.json","state":"https://pith.science/pith/STQPFWCYF5JSFDCJJMCQA3WFPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/STQPFWCYF5JSFDCJJMCQA3WFPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:STQPFWCYF5JSFDCJJMCQA3WFPE","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":"f041d04e371e97642a27ffbfd1fe5bd5f74405867b53948ea2dc4089d0c29a50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-01T18:28:20Z","title_canon_sha256":"de778d952ca0c8954c2ab0510a05d58760e9d121d773080962dab5f3181d6a6e"},"schema_version":"1.0","source":{"id":"1807.00368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00368","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00368v1","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00368","created_at":"2026-05-18T00:11:55Z"},{"alias_kind":"pith_short_12","alias_value":"STQPFWCYF5JS","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"STQPFWCYF5JSFDCJ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"STQPFWCY","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:3c15d29b47490d258c2e75a72e38f6944c1131e718b1a0c9db8984d1e846aa22","target":"graph","created_at":"2026-05-18T00:11:55Z","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":"Nowadays, data-centers are largely under-utilized because resource allocation is based on reservation mechanisms which ignore actual resource utilization. Indeed, it is common to reserve resources for peak demand, which may occur only for a small portion of the application life time. As a consequence, cluster resources often go under-utilized.\n  In this work, we propose a mechanism that improves cluster utilization, thus decreasing the average turnaround time, while preventing application failures due to contention in accessing finite resources such as RAM. Our approach monitors resource utili","authors_text":"Damiano Carra, Daniele Venzano, Dimitrios Milios, Francesco Pace, Pietro Michiardi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-01T18:28:20Z","title":"A Data-Driven Approach to Dynamically Adjust Resource Allocation for Compute Clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00368","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:ee70661b3593041e5e4e717159f33d36f4a221bbf894fac9ad84474661edd2f5","target":"record","created_at":"2026-05-18T00:11:55Z","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":"f041d04e371e97642a27ffbfd1fe5bd5f74405867b53948ea2dc4089d0c29a50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-01T18:28:20Z","title_canon_sha256":"de778d952ca0c8954c2ab0510a05d58760e9d121d773080962dab5f3181d6a6e"},"schema_version":"1.0","source":{"id":"1807.00368","kind":"arxiv","version":1}},"canonical_sha256":"94e0f2d8582f53228c494b05006ec5790b7e42df4d6a54303131455c9599dcc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94e0f2d8582f53228c494b05006ec5790b7e42df4d6a54303131455c9599dcc8","first_computed_at":"2026-05-18T00:11:55.080683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:55.080683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QAjmlvEN+bQ60L7NizGuAQhHvS6qh3O/nM77ccYgJLwMoO1zazMjhINL6Qr6fUY/WHfHqNg4plvgUtabOEq+DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:55.081555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee70661b3593041e5e4e717159f33d36f4a221bbf894fac9ad84474661edd2f5","sha256:3c15d29b47490d258c2e75a72e38f6944c1131e718b1a0c9db8984d1e846aa22"],"state_sha256":"b6ed99b480967703b0946eb219b5a5ed818fdf35e1ae6160249c02332dfbb05d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSGHEB4q6AE2c2SEDmWg57M6qGaFgZsfxnkfmKrbm7vosY9gDOyNe+w0MVJyA4IrzxBwcaOkXDD2x33qURpNDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:46:15.461993Z","bundle_sha256":"f8b0f88753d5d952521351e22bcdb9c16d383a0acef50ce07f8a4d35b719e264"}}