{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AOIGTMZJXQEDQS7X5YSSVL4RGP","short_pith_number":"pith:AOIGTMZJ","schema_version":"1.0","canonical_sha256":"039069b329bc08384bf7ee252aaf9133e565262dd7a8d9e5b6361414d8498a9e","source":{"kind":"arxiv","id":"1503.06883","version":1},"attestation_state":"computed","paper":{"title":"Fast, Accurate Second Order Methods for Network Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Jadbabaie, Haitham Bou Ammar, Rasul Tutunov","submitted_at":"2015-03-24T01:05:59Z","abstract_excerpt":"Dual descent methods are commonly used to solve network flow optimization problems, since their implementation can be distributed over the network. These algorithms, however, often exhibit slow convergence rates. Approximate Newton methods which compute descent directions locally have been proposed as alternatives to accelerate the convergence rates of conventional dual descent. The effectiveness of these methods, is limited by the accuracy of such approximations. In this paper, we propose an efficient and accurate distributed second order method for network flow problems. The proposed approac"},"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":"1503.06883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-24T01:05:59Z","cross_cats_sorted":[],"title_canon_sha256":"5a894cea9818297bc90e695665b562b0283997a8c79b5c888992ffe9dcdfca83","abstract_canon_sha256":"9a503b22ef545e4b6007c406a1d85180b41945f282bfa656af4d85a609fad286"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:29.864356Z","signature_b64":"GpiXzjuaDU2QL8AaPq382auTBzU4Tqit5DOTG07HotgG5AAZH2sQINiUkQWeblOVZa2Kcpu5TnRIRi7ZXnjzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"039069b329bc08384bf7ee252aaf9133e565262dd7a8d9e5b6361414d8498a9e","last_reissued_at":"2026-05-18T02:20:29.863826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:29.863826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast, Accurate Second Order Methods for Network Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Jadbabaie, Haitham Bou Ammar, Rasul Tutunov","submitted_at":"2015-03-24T01:05:59Z","abstract_excerpt":"Dual descent methods are commonly used to solve network flow optimization problems, since their implementation can be distributed over the network. These algorithms, however, often exhibit slow convergence rates. Approximate Newton methods which compute descent directions locally have been proposed as alternatives to accelerate the convergence rates of conventional dual descent. The effectiveness of these methods, is limited by the accuracy of such approximations. In this paper, we propose an efficient and accurate distributed second order method for network flow problems. The proposed approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06883","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":"1503.06883","created_at":"2026-05-18T02:20:29.863896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06883v1","created_at":"2026-05-18T02:20:29.863896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06883","created_at":"2026-05-18T02:20:29.863896+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOIGTMZJXQED","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOIGTMZJXQEDQS7X","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOIGTMZJ","created_at":"2026-05-18T12:29:10.953037+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/AOIGTMZJXQEDQS7X5YSSVL4RGP","json":"https://pith.science/pith/AOIGTMZJXQEDQS7X5YSSVL4RGP.json","graph_json":"https://pith.science/api/pith-number/AOIGTMZJXQEDQS7X5YSSVL4RGP/graph.json","events_json":"https://pith.science/api/pith-number/AOIGTMZJXQEDQS7X5YSSVL4RGP/events.json","paper":"https://pith.science/paper/AOIGTMZJ"},"agent_actions":{"view_html":"https://pith.science/pith/AOIGTMZJXQEDQS7X5YSSVL4RGP","download_json":"https://pith.science/pith/AOIGTMZJXQEDQS7X5YSSVL4RGP.json","view_paper":"https://pith.science/paper/AOIGTMZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06883&json=true","fetch_graph":"https://pith.science/api/pith-number/AOIGTMZJXQEDQS7X5YSSVL4RGP/graph.json","fetch_events":"https://pith.science/api/pith-number/AOIGTMZJXQEDQS7X5YSSVL4RGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOIGTMZJXQEDQS7X5YSSVL4RGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOIGTMZJXQEDQS7X5YSSVL4RGP/action/storage_attestation","attest_author":"https://pith.science/pith/AOIGTMZJXQEDQS7X5YSSVL4RGP/action/author_attestation","sign_citation":"https://pith.science/pith/AOIGTMZJXQEDQS7X5YSSVL4RGP/action/citation_signature","submit_replication":"https://pith.science/pith/AOIGTMZJXQEDQS7X5YSSVL4RGP/action/replication_record"}},"created_at":"2026-05-18T02:20:29.863896+00:00","updated_at":"2026-05-18T02:20:29.863896+00:00"}