{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Y2DCDS22TV7GYFP6MYHVZ4QEBW","short_pith_number":"pith:Y2DCDS22","schema_version":"1.0","canonical_sha256":"c68621cb5a9d7e6c15fe660f5cf2040dbad94f112cfbbcad1945bfb62f85779c","source":{"kind":"arxiv","id":"1405.7484","version":1},"attestation_state":"computed","paper":{"title":"Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Athanasios V. Vasilakos, Fa Zhang, Kai Zheng, Lin Wang, Shaolei Ren, Zhiyong Liu","submitted_at":"2014-05-29T07:43:18Z","abstract_excerpt":"The power consumption of enormous network devices in data centers has emerged as a big concern to data center operators. Despite many traffic-engineering-based solutions, very little attention has been paid on performance-guaranteed energy saving schemes. In this paper, we propose a novel energy-saving model for data center networks by scheduling and routing \"deadline-constrained flows\" where the transmission of every flow has to be accomplished before a rigorous deadline, being the most critical requirement in production data center networks. Based on speed scaling and power-down energy savin"},"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":"1405.7484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-29T07:43:18Z","cross_cats_sorted":[],"title_canon_sha256":"e6da7a1fca2980a4a5f2480ae8f1045a566ae50e1cfaa419dad89f7c79f547b1","abstract_canon_sha256":"682fe600f3cc9cb0e1b7d9fca713201bb6dc54fe6733c4306c0264b9e6faecf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:51.151843Z","signature_b64":"D0k6Elsb+ooH+OcovBUIwxLYK0CV7byyJITVhGATvwjr4FsikpVX6hV2Cx2DusycmUGTWyPk32jhHgK33EfpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c68621cb5a9d7e6c15fe660f5cf2040dbad94f112cfbbcad1945bfb62f85779c","last_reissued_at":"2026-05-18T02:50:51.151247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:51.151247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Athanasios V. Vasilakos, Fa Zhang, Kai Zheng, Lin Wang, Shaolei Ren, Zhiyong Liu","submitted_at":"2014-05-29T07:43:18Z","abstract_excerpt":"The power consumption of enormous network devices in data centers has emerged as a big concern to data center operators. Despite many traffic-engineering-based solutions, very little attention has been paid on performance-guaranteed energy saving schemes. In this paper, we propose a novel energy-saving model for data center networks by scheduling and routing \"deadline-constrained flows\" where the transmission of every flow has to be accomplished before a rigorous deadline, being the most critical requirement in production data center networks. Based on speed scaling and power-down energy savin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7484","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.7484","created_at":"2026-05-18T02:50:51.151338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7484v1","created_at":"2026-05-18T02:50:51.151338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7484","created_at":"2026-05-18T02:50:51.151338+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2DCDS22TV7G","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2DCDS22TV7GYFP6","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2DCDS22","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW","json":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW.json","graph_json":"https://pith.science/api/pith-number/Y2DCDS22TV7GYFP6MYHVZ4QEBW/graph.json","events_json":"https://pith.science/api/pith-number/Y2DCDS22TV7GYFP6MYHVZ4QEBW/events.json","paper":"https://pith.science/paper/Y2DCDS22"},"agent_actions":{"view_html":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW","download_json":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW.json","view_paper":"https://pith.science/paper/Y2DCDS22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7484&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2DCDS22TV7GYFP6MYHVZ4QEBW/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2DCDS22TV7GYFP6MYHVZ4QEBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW/action/storage_attestation","attest_author":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW/action/author_attestation","sign_citation":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW/action/citation_signature","submit_replication":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW/action/replication_record"}},"created_at":"2026-05-18T02:50:51.151338+00:00","updated_at":"2026-05-18T02:50:51.151338+00:00"}