{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VVKHFJRKX7N26GEVGOAMEJ5ABU","short_pith_number":"pith:VVKHFJRK","schema_version":"1.0","canonical_sha256":"ad5472a62abfdbaf18953380c227a00d1c630521408777623547c4fecf570ed6","source":{"kind":"arxiv","id":"1302.0234","version":1},"attestation_state":"computed","paper":{"title":"Routing for Energy Minimization with Discrete Cost Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Antonio Fern\\'andez Anta, Chenying Hou, Fa Zhang, Lin Wang, Zhiyong Liu","submitted_at":"2013-02-01T18:04:56Z","abstract_excerpt":"Energy saving is becoming an important issue in the design and use of computer networks. In this work we propose a problem that considers the use of rate adaptation as the energy saving strategy in networks. The problem is modeled as an integral demand-routing problem in a network with discrete cost functions at the links. The discreteness of the cost function comes from the different states (bandwidths) at which links can operate and, in particular, from the energy consumed at each state. This in its turn leads to the non-convexity of the cost function, and thus adds complexity to solve this "},"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":"1302.0234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-02-01T18:04:56Z","cross_cats_sorted":[],"title_canon_sha256":"7ed2bdbf4d7dd6a4fdd7e3550b7bd48e0176993f5b977561387f3e7f01d285ce","abstract_canon_sha256":"7abc4407a08b687eebe3bcf522ca5a10691a9c4a57bbf750906e832289470c7c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:47.018398Z","signature_b64":"2ePyYO430B0jd0x/W2UGKS03AmhcrgpAzt+B6yGEUHQGQr96AgrJZco1E4O3sCzC94vM1Lq8KjoXcuO07ONBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad5472a62abfdbaf18953380c227a00d1c630521408777623547c4fecf570ed6","last_reissued_at":"2026-05-18T03:34:47.017671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:47.017671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Routing for Energy Minimization with Discrete Cost Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Antonio Fern\\'andez Anta, Chenying Hou, Fa Zhang, Lin Wang, Zhiyong Liu","submitted_at":"2013-02-01T18:04:56Z","abstract_excerpt":"Energy saving is becoming an important issue in the design and use of computer networks. In this work we propose a problem that considers the use of rate adaptation as the energy saving strategy in networks. The problem is modeled as an integral demand-routing problem in a network with discrete cost functions at the links. The discreteness of the cost function comes from the different states (bandwidths) at which links can operate and, in particular, from the energy consumed at each state. This in its turn leads to the non-convexity of the cost function, and thus adds complexity to solve this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0234","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":"1302.0234","created_at":"2026-05-18T03:34:47.017787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.0234v1","created_at":"2026-05-18T03:34:47.017787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0234","created_at":"2026-05-18T03:34:47.017787+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVKHFJRKX7N2","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVKHFJRKX7N26GEV","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVKHFJRK","created_at":"2026-05-18T12:28:04.890932+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/VVKHFJRKX7N26GEVGOAMEJ5ABU","json":"https://pith.science/pith/VVKHFJRKX7N26GEVGOAMEJ5ABU.json","graph_json":"https://pith.science/api/pith-number/VVKHFJRKX7N26GEVGOAMEJ5ABU/graph.json","events_json":"https://pith.science/api/pith-number/VVKHFJRKX7N26GEVGOAMEJ5ABU/events.json","paper":"https://pith.science/paper/VVKHFJRK"},"agent_actions":{"view_html":"https://pith.science/pith/VVKHFJRKX7N26GEVGOAMEJ5ABU","download_json":"https://pith.science/pith/VVKHFJRKX7N26GEVGOAMEJ5ABU.json","view_paper":"https://pith.science/paper/VVKHFJRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.0234&json=true","fetch_graph":"https://pith.science/api/pith-number/VVKHFJRKX7N26GEVGOAMEJ5ABU/graph.json","fetch_events":"https://pith.science/api/pith-number/VVKHFJRKX7N26GEVGOAMEJ5ABU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVKHFJRKX7N26GEVGOAMEJ5ABU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVKHFJRKX7N26GEVGOAMEJ5ABU/action/storage_attestation","attest_author":"https://pith.science/pith/VVKHFJRKX7N26GEVGOAMEJ5ABU/action/author_attestation","sign_citation":"https://pith.science/pith/VVKHFJRKX7N26GEVGOAMEJ5ABU/action/citation_signature","submit_replication":"https://pith.science/pith/VVKHFJRKX7N26GEVGOAMEJ5ABU/action/replication_record"}},"created_at":"2026-05-18T03:34:47.017787+00:00","updated_at":"2026-05-18T03:34:47.017787+00:00"}