{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y","short_pith_number":"pith:FOWIQ6SS","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"},"canonical_sha256":"2bac887a5267f302b93bcf587ae070f63331b85e27fba3bfc510e3619862a732","source":{"kind":"arxiv","id":"1108.1989","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1989","created_at":"2026-05-18T04:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1989v1","created_at":"2026-05-18T04:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1989","created_at":"2026-05-18T04:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"FOWIQ6SSM7ZQ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FOWIQ6SSM7ZQFOJ3","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FOWIQ6SS","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y","target":"record","payload":{"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"},"canonical_sha256":"2bac887a5267f302b93bcf587ae070f63331b85e27fba3bfc510e3619862a732","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"},"source_kind":"arxiv","source_id":"1108.1989","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-18T04:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iqy+z1szaM7SEPR31PFrE4I3McdClNjAB4sQBX0v9H3+h25oKgPD1y+o8rGOdkZ/Rou6XnU3sD74bXOho+veCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:12:38.842064Z"},"content_sha256":"5b059f601db11286175fae45de3a2d5070ab11e1c16935a5faacb5b036918681","schema_version":"1.0","event_id":"sha256:5b059f601db11286175fae45de3a2d5070ab11e1c16935a5faacb5b036918681"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y","target":"graph","payload":{"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"},"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-18T04:15:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WLaY8NHUzuSAOuiElQzLGQ6h0yTH+zAgJIpTr4UZ+Mof9lsA5Jq/W4P86BppsTWBMF8BgNaS+oLpOlgVKZGJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:12:38.842763Z"},"content_sha256":"95fff7389b78bea883b1e62a17662633004eea578c511fd6e0f78f025789af7b","schema_version":"1.0","event_id":"sha256:95fff7389b78bea883b1e62a17662633004eea578c511fd6e0f78f025789af7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/bundle.json","state_url":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/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-06-09T09:12:38Z","links":{"resolver":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y","bundle":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/bundle.json","state":"https://pith.science/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FOWIQ6SSM7ZQFOJ3Z5MHVYDQ6Y","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":"e8bf0d891d94c65cd8880167627c2be44c9b7fe0f01d25efd2c5025dc7b2e679","cross_cats_sorted":["cs.IT","cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-08-09T17:23:59Z","title_canon_sha256":"7cb173645463c99d4e826e1cddf1e0e605c39a5e2784b5ca9c62e674c88df71e"},"schema_version":"1.0","source":{"id":"1108.1989","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1989","created_at":"2026-05-18T04:15:49Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1989v1","created_at":"2026-05-18T04:15:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1989","created_at":"2026-05-18T04:15:49Z"},{"alias_kind":"pith_short_12","alias_value":"FOWIQ6SSM7ZQ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FOWIQ6SSM7ZQFOJ3","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FOWIQ6SS","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:95fff7389b78bea883b1e62a17662633004eea578c511fd6e0f78f025789af7b","target":"graph","created_at":"2026-05-18T04:15:49Z","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 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","authors_text":"Hanif D. Sherali, Jia Liu","cross_cats":["cs.IT","cs.SY","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-08-09T17:23:59Z","title":"A Distributed Newton Approach for Joint Multi-Hop Routing and Flow Control: Theory and Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1989","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:5b059f601db11286175fae45de3a2d5070ab11e1c16935a5faacb5b036918681","target":"record","created_at":"2026-05-18T04:15:49Z","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":"e8bf0d891d94c65cd8880167627c2be44c9b7fe0f01d25efd2c5025dc7b2e679","cross_cats_sorted":["cs.IT","cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-08-09T17:23:59Z","title_canon_sha256":"7cb173645463c99d4e826e1cddf1e0e605c39a5e2784b5ca9c62e674c88df71e"},"schema_version":"1.0","source":{"id":"1108.1989","kind":"arxiv","version":1}},"canonical_sha256":"2bac887a5267f302b93bcf587ae070f63331b85e27fba3bfc510e3619862a732","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bac887a5267f302b93bcf587ae070f63331b85e27fba3bfc510e3619862a732","first_computed_at":"2026-05-18T04:15:49.523964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:49.523964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D7jxFTZgKgrHnbzAEwrAlY0E6OI5yJCGO3G7Mqfq76SA5CWGKGnkpVwV8CaF1mSf+xyTL8Hy57C6AB4e3WFgAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:49.524566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1989","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b059f601db11286175fae45de3a2d5070ab11e1c16935a5faacb5b036918681","sha256:95fff7389b78bea883b1e62a17662633004eea578c511fd6e0f78f025789af7b"],"state_sha256":"35af8df667886f2ff7dc044b1a3e28d3dc9725013b29b373eba3b7bcf0169632"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SqnqvjCZPrFrwjFkAvu83vzc0Kc7IM8TezBFhBlZ4XInZJI1SO0LvApaSXkj7wij7qyC8cBet5Pr9NbafR2ODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:12:38.846726Z","bundle_sha256":"1ea552f329b519aae072bb57ced25ce28b97e15532236ed4966e549ab6b56f11"}}