{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y","short_pith_number":"pith:FOWIQ6SS","schema_version":"1.0","canonical_sha256":"2bac887a5267f302b93bcf587ae070f63331b85e27fba3bfc510e3619862a732","source":{"kind":"arxiv","id":"1108.1989","version":1},"attestation_state":"computed","paper":{"title":"A Distributed Newton Approach for Joint Multi-Hop Routing and Flow Control: Theory and Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT","math.OC"],"primary_cat":"cs.NI","authors_text":"Hanif D. Sherali, Jia Liu","submitted_at":"2011-08-09T17:23:59Z","abstract_excerpt":"The fast growing scale and heterogeneity of current communication networks necessitate the design of distributed cross-layer optimization algorithms. So far, the standard approach of distributed cross-layer design is based on dual decomposition and the subgradient algorithm, which is a first-order method that has a slow convergence rate. In this paper, we focus on solving a joint multi-path routing and flow control (MRFC) problem by designing a new distributed Newton's method, which is a second-order method and enjoys a quadratic rate of convergence. The major challenges in developing a distri"},"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":"1108.1989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-08-09T17:23:59Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT","math.OC"],"title_canon_sha256":"7cb173645463c99d4e826e1cddf1e0e605c39a5e2784b5ca9c62e674c88df71e","abstract_canon_sha256":"e8bf0d891d94c65cd8880167627c2be44c9b7fe0f01d25efd2c5025dc7b2e679"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:49.524566Z","signature_b64":"D7jxFTZgKgrHnbzAEwrAlY0E6OI5yJCGO3G7Mqfq76SA5CWGKGnkpVwV8CaF1mSf+xyTL8Hy57C6AB4e3WFgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bac887a5267f302b93bcf587ae070f63331b85e27fba3bfc510e3619862a732","last_reissued_at":"2026-05-18T04:15:49.523964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:49.523964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Distributed Newton Approach for Joint Multi-Hop Routing and Flow Control: Theory and Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT","math.OC"],"primary_cat":"cs.NI","authors_text":"Hanif D. Sherali, Jia Liu","submitted_at":"2011-08-09T17:23:59Z","abstract_excerpt":"The fast growing scale and heterogeneity of current communication networks necessitate the design of distributed cross-layer optimization algorithms. So far, the standard approach of distributed cross-layer design is based on dual decomposition and the subgradient algorithm, which is a first-order method that has a slow convergence rate. In this paper, we focus on solving a joint multi-path routing and flow control (MRFC) problem by designing a new distributed Newton's method, which is a second-order method and enjoys a quadratic rate of convergence. The major challenges in developing a distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1989","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":"1108.1989","created_at":"2026-05-18T04:15:49.524060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.1989v1","created_at":"2026-05-18T04:15:49.524060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1989","created_at":"2026-05-18T04:15:49.524060+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOWIQ6SSM7ZQ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOWIQ6SSM7ZQFOJ3","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOWIQ6SS","created_at":"2026-05-18T12:26:28.662955+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/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y","json":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y.json","graph_json":"https://pith.science/api/pith-number/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/graph.json","events_json":"https://pith.science/api/pith-number/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/events.json","paper":"https://pith.science/paper/FOWIQ6SS"},"agent_actions":{"view_html":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y","download_json":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y.json","view_paper":"https://pith.science/paper/FOWIQ6SS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.1989&json=true","fetch_graph":"https://pith.science/api/pith-number/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/graph.json","fetch_events":"https://pith.science/api/pith-number/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/action/storage_attestation","attest_author":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/action/author_attestation","sign_citation":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/action/citation_signature","submit_replication":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/action/replication_record"}},"created_at":"2026-05-18T04:15:49.524060+00:00","updated_at":"2026-05-18T04:15:49.524060+00:00"}