{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6VSEEFKXVWBO6ZESH2W47TWJGC","short_pith_number":"pith:6VSEEFKX","schema_version":"1.0","canonical_sha256":"f564421557ad82ef64923eadcfcec930901e59f66457f3c05794d924d6348059","source":{"kind":"arxiv","id":"2502.09717","version":1},"attestation_state":"computed","paper":{"title":"Carbon- and Precedence-Aware Scheduling for Data Processing Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.SY","eess.SY"],"primary_cat":"cs.DC","authors_text":"Adam Lechowicz, Adam Wierman, Christina Delimitrou, Mohammad Hajiesmaili, Noman Bashir, Rohan Shenoy","submitted_at":"2025-02-13T19:06:10Z","abstract_excerpt":"As large-scale data processing workloads continue to grow, their carbon footprint raises concerns. Prior research on carbon-aware schedulers has focused on shifting computation to align with availability of low-carbon energy, but these approaches assume that each task can be executed independently. In contrast, data processing jobs have precedence constraints (i.e., outputs of one task are inputs for another) that complicate decisions, since delaying an upstream ``bottleneck'' task to a low-carbon period will also block downstream tasks, impacting the entire job's completion time. In this pape"},"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":"2502.09717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-02-13T19:06:10Z","cross_cats_sorted":["cs.CY","cs.SY","eess.SY"],"title_canon_sha256":"518b034acb2ba9ce66eb9178eecb94e1277ee385a4fecb087b5df158fce27a57","abstract_canon_sha256":"c04ba5fb7ce19b955bb953f9bf29f7af5d3621213fc06b056b2f97b37e097812"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:11.178562Z","signature_b64":"rDlKtWL/wnmNE9ulfQD81m+SI992bhC+fv5SjD0gdF1s5bF5Chgzqh8uzA2h3ZtUh0g6XKSxxhoJjsKu9S98BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f564421557ad82ef64923eadcfcec930901e59f66457f3c05794d924d6348059","last_reissued_at":"2026-07-05T10:14:11.178074Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:11.178074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Carbon- and Precedence-Aware Scheduling for Data Processing Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.SY","eess.SY"],"primary_cat":"cs.DC","authors_text":"Adam Lechowicz, Adam Wierman, Christina Delimitrou, Mohammad Hajiesmaili, Noman Bashir, Rohan Shenoy","submitted_at":"2025-02-13T19:06:10Z","abstract_excerpt":"As large-scale data processing workloads continue to grow, their carbon footprint raises concerns. Prior research on carbon-aware schedulers has focused on shifting computation to align with availability of low-carbon energy, but these approaches assume that each task can be executed independently. In contrast, data processing jobs have precedence constraints (i.e., outputs of one task are inputs for another) that complicate decisions, since delaying an upstream ``bottleneck'' task to a low-carbon period will also block downstream tasks, impacting the entire job's completion time. In this pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09717","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/2502.09717/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":"2502.09717","created_at":"2026-07-05T10:14:11.178133+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.09717v1","created_at":"2026-07-05T10:14:11.178133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09717","created_at":"2026-07-05T10:14:11.178133+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VSEEFKXVWBO","created_at":"2026-07-05T10:14:11.178133+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VSEEFKXVWBO6ZES","created_at":"2026-07-05T10:14:11.178133+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VSEEFKX","created_at":"2026-07-05T10:14:11.178133+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.05929","citing_title":"LLM Harms: A Taxonomy and Discussion","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2601.00823","citing_title":"Energy-Aware Routing to Large Reasoning Models","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6VSEEFKXVWBO6ZESH2W47TWJGC","json":"https://pith.science/pith/6VSEEFKXVWBO6ZESH2W47TWJGC.json","graph_json":"https://pith.science/api/pith-number/6VSEEFKXVWBO6ZESH2W47TWJGC/graph.json","events_json":"https://pith.science/api/pith-number/6VSEEFKXVWBO6ZESH2W47TWJGC/events.json","paper":"https://pith.science/paper/6VSEEFKX"},"agent_actions":{"view_html":"https://pith.science/pith/6VSEEFKXVWBO6ZESH2W47TWJGC","download_json":"https://pith.science/pith/6VSEEFKXVWBO6ZESH2W47TWJGC.json","view_paper":"https://pith.science/paper/6VSEEFKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.09717&json=true","fetch_graph":"https://pith.science/api/pith-number/6VSEEFKXVWBO6ZESH2W47TWJGC/graph.json","fetch_events":"https://pith.science/api/pith-number/6VSEEFKXVWBO6ZESH2W47TWJGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VSEEFKXVWBO6ZESH2W47TWJGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VSEEFKXVWBO6ZESH2W47TWJGC/action/storage_attestation","attest_author":"https://pith.science/pith/6VSEEFKXVWBO6ZESH2W47TWJGC/action/author_attestation","sign_citation":"https://pith.science/pith/6VSEEFKXVWBO6ZESH2W47TWJGC/action/citation_signature","submit_replication":"https://pith.science/pith/6VSEEFKXVWBO6ZESH2W47TWJGC/action/replication_record"}},"created_at":"2026-07-05T10:14:11.178133+00:00","updated_at":"2026-07-05T10:14:11.178133+00:00"}