{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FVZ5GGGL7MQLDKMRPM7CFKRHUH","short_pith_number":"pith:FVZ5GGGL","schema_version":"1.0","canonical_sha256":"2d73d318cbfb20b1a9917b3e22aa27a1fee6333e15403edc1bf56702f1c6ad43","source":{"kind":"arxiv","id":"2505.18357","version":1},"attestation_state":"computed","paper":{"title":"CarbonFlex: Enabling Carbon-aware Provisioning and Scheduling for Cloud Clusters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"David Irwin, Li Wu, Prashant Shenoy, Walid A. Hanafy","submitted_at":"2025-05-23T20:32:49Z","abstract_excerpt":"Accelerating computing demand, largely from AI applications, has led to concerns about its carbon footprint. Fortunately, a significant fraction of computing demand comes from batch jobs that are often delay-tolerant and elastic, which enables schedulers to reduce carbon by suspending/resuming jobs and scaling their resources down/up when carbon is high/low. However, prior work on carbon-aware scheduling generally focuses on optimizing carbon for individual jobs in the cloud, and not provisioning and scheduling resources for many parallel jobs in cloud clusters.\n  To address the problem, we pr"},"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":"2505.18357","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-23T20:32:49Z","cross_cats_sorted":[],"title_canon_sha256":"50d325f0c74daf3c332c4a46e402b9c9bd90d1b933cdc5aa262e5eb0ae7a9476","abstract_canon_sha256":"dc5ab507a738d557753033737173769cdfac7da4014cf770bc1bea29995a749c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:45.233201Z","signature_b64":"c/6Zy/rUHqj1W1AKQzDyO4L59svZdJfjHI5OEG7pXCQImXun5xSywdMOGWA56y4gnkjVi4PPTuC5fX4DUfo/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d73d318cbfb20b1a9917b3e22aa27a1fee6333e15403edc1bf56702f1c6ad43","last_reissued_at":"2026-07-05T11:08:45.232780Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:45.232780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CarbonFlex: Enabling Carbon-aware Provisioning and Scheduling for Cloud Clusters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"David Irwin, Li Wu, Prashant Shenoy, Walid A. Hanafy","submitted_at":"2025-05-23T20:32:49Z","abstract_excerpt":"Accelerating computing demand, largely from AI applications, has led to concerns about its carbon footprint. Fortunately, a significant fraction of computing demand comes from batch jobs that are often delay-tolerant and elastic, which enables schedulers to reduce carbon by suspending/resuming jobs and scaling their resources down/up when carbon is high/low. However, prior work on carbon-aware scheduling generally focuses on optimizing carbon for individual jobs in the cloud, and not provisioning and scheduling resources for many parallel jobs in cloud clusters.\n  To address the problem, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18357","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/2505.18357/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":"2505.18357","created_at":"2026-07-05T11:08:45.232837+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.18357v1","created_at":"2026-07-05T11:08:45.232837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18357","created_at":"2026-07-05T11:08:45.232837+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVZ5GGGL7MQL","created_at":"2026-07-05T11:08:45.232837+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVZ5GGGL7MQLDKMR","created_at":"2026-07-05T11:08:45.232837+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVZ5GGGL","created_at":"2026-07-05T11:08:45.232837+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.21354","citing_title":"The Workload-Router-Pool Architecture for LLM Inference Optimization: A Vision Paper from the vLLM Semantic Router Project","ref_index":100,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FVZ5GGGL7MQLDKMRPM7CFKRHUH","json":"https://pith.science/pith/FVZ5GGGL7MQLDKMRPM7CFKRHUH.json","graph_json":"https://pith.science/api/pith-number/FVZ5GGGL7MQLDKMRPM7CFKRHUH/graph.json","events_json":"https://pith.science/api/pith-number/FVZ5GGGL7MQLDKMRPM7CFKRHUH/events.json","paper":"https://pith.science/paper/FVZ5GGGL"},"agent_actions":{"view_html":"https://pith.science/pith/FVZ5GGGL7MQLDKMRPM7CFKRHUH","download_json":"https://pith.science/pith/FVZ5GGGL7MQLDKMRPM7CFKRHUH.json","view_paper":"https://pith.science/paper/FVZ5GGGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.18357&json=true","fetch_graph":"https://pith.science/api/pith-number/FVZ5GGGL7MQLDKMRPM7CFKRHUH/graph.json","fetch_events":"https://pith.science/api/pith-number/FVZ5GGGL7MQLDKMRPM7CFKRHUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVZ5GGGL7MQLDKMRPM7CFKRHUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVZ5GGGL7MQLDKMRPM7CFKRHUH/action/storage_attestation","attest_author":"https://pith.science/pith/FVZ5GGGL7MQLDKMRPM7CFKRHUH/action/author_attestation","sign_citation":"https://pith.science/pith/FVZ5GGGL7MQLDKMRPM7CFKRHUH/action/citation_signature","submit_replication":"https://pith.science/pith/FVZ5GGGL7MQLDKMRPM7CFKRHUH/action/replication_record"}},"created_at":"2026-07-05T11:08:45.232837+00:00","updated_at":"2026-07-05T11:08:45.232837+00:00"}