{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Y2DCDS22TV7GYFP6MYHVZ4QEBW","short_pith_number":"pith:Y2DCDS22","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"},"canonical_sha256":"c68621cb5a9d7e6c15fe660f5cf2040dbad94f112cfbbcad1945bfb62f85779c","source":{"kind":"arxiv","id":"1405.7484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7484","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7484v1","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7484","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"Y2DCDS22TV7G","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"Y2DCDS22TV7GYFP6","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"Y2DCDS22","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Y2DCDS22TV7GYFP6MYHVZ4QEBW","target":"record","payload":{"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"},"canonical_sha256":"c68621cb5a9d7e6c15fe660f5cf2040dbad94f112cfbbcad1945bfb62f85779c","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"},"source_kind":"arxiv","source_id":"1405.7484","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-18T02:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6DzKcVGBqeGdg89lbCWp5FH5UDyUlKNk9jfgc9bIOsBblitOCJRZeCem90db2nmL3abuS4Sw1+2VJgAyyo2iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:27:19.256160Z"},"content_sha256":"755054ded85fed790e43d6a0b198655e18a5176ca869ef6032b50869b7d4bdc3","schema_version":"1.0","event_id":"sha256:755054ded85fed790e43d6a0b198655e18a5176ca869ef6032b50869b7d4bdc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Y2DCDS22TV7GYFP6MYHVZ4QEBW","target":"graph","payload":{"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"},"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-18T02:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wvmKMC6Olrpv66mEWtSP6jWXPzsySS1E7F7Jr0/0Lm86/5/6l/HqfTqkjvawxuGsxSGtXmUxFxxMkZEGAYEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:27:19.256535Z"},"content_sha256":"2b96e0dbf089632375391476808b87e4ab9ad9bb076d71b4110f9c447b514158","schema_version":"1.0","event_id":"sha256:2b96e0dbf089632375391476808b87e4ab9ad9bb076d71b4110f9c447b514158"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW/bundle.json","state_url":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW/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-05-28T09:27:19Z","links":{"resolver":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW","bundle":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW/bundle.json","state":"https://pith.science/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2DCDS22TV7GYFP6MYHVZ4QEBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Y2DCDS22TV7GYFP6MYHVZ4QEBW","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":"682fe600f3cc9cb0e1b7d9fca713201bb6dc54fe6733c4306c0264b9e6faecf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-29T07:43:18Z","title_canon_sha256":"e6da7a1fca2980a4a5f2480ae8f1045a566ae50e1cfaa419dad89f7c79f547b1"},"schema_version":"1.0","source":{"id":"1405.7484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7484","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7484v1","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7484","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"Y2DCDS22TV7G","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"Y2DCDS22TV7GYFP6","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"Y2DCDS22","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:2b96e0dbf089632375391476808b87e4ab9ad9bb076d71b4110f9c447b514158","target":"graph","created_at":"2026-05-18T02:50:51Z","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":"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","authors_text":"Athanasios V. Vasilakos, Fa Zhang, Kai Zheng, Lin Wang, Shaolei Ren, Zhiyong Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-29T07:43:18Z","title":"Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7484","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:755054ded85fed790e43d6a0b198655e18a5176ca869ef6032b50869b7d4bdc3","target":"record","created_at":"2026-05-18T02:50:51Z","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":"682fe600f3cc9cb0e1b7d9fca713201bb6dc54fe6733c4306c0264b9e6faecf9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-29T07:43:18Z","title_canon_sha256":"e6da7a1fca2980a4a5f2480ae8f1045a566ae50e1cfaa419dad89f7c79f547b1"},"schema_version":"1.0","source":{"id":"1405.7484","kind":"arxiv","version":1}},"canonical_sha256":"c68621cb5a9d7e6c15fe660f5cf2040dbad94f112cfbbcad1945bfb62f85779c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c68621cb5a9d7e6c15fe660f5cf2040dbad94f112cfbbcad1945bfb62f85779c","first_computed_at":"2026-05-18T02:50:51.151247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:51.151247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D0k6Elsb+ooH+OcovBUIwxLYK0CV7byyJITVhGATvwjr4FsikpVX6hV2Cx2DusycmUGTWyPk32jhHgK33EfpBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:51.151843Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:755054ded85fed790e43d6a0b198655e18a5176ca869ef6032b50869b7d4bdc3","sha256:2b96e0dbf089632375391476808b87e4ab9ad9bb076d71b4110f9c447b514158"],"state_sha256":"659c6507a87dc8044cd87641bc6af5871d7872464845e3d0a40f4dde705e5aee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ncw7dVGO2HnxunwG+08npz0yBkILJCVXAXIJBugZexArVHGrrQbTXuAOcg1NqAhpABsiWIovWA6qY5Dt4G2HBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:27:19.258466Z","bundle_sha256":"dc38a35d52b06b818d2282c97bef1b76da35402ceef65b09206a26452d429e60"}}