{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DSRH3YGEGDUCFSP2W5XC33OO23","short_pith_number":"pith:DSRH3YGE","schema_version":"1.0","canonical_sha256":"1ca27de0c430e822c9fab76e2dedced6fe96d81b32d0feccf6ac437f03fb80de","source":{"kind":"arxiv","id":"1504.06017","version":1},"attestation_state":"computed","paper":{"title":"Network Newton-Part I: Algorithm and Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Aryan Mokhtari, Qing Ling","submitted_at":"2015-04-23T00:57:23Z","abstract_excerpt":"We study the problem of minimizing a sum of convex objective functions where the components of the objective are available at different nodes of a network and nodes are allowed to only communicate with their neighbors. The use of distributed gradient methods is a common approach to solve this problem. Their popularity notwithstanding, these methods exhibit slow convergence and a consequent large number of communications between nodes to approach the optimal argument because they rely on first order information only. This paper proposes the network Newton (NN) method as a distributed algorithm "},"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":"1504.06017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-23T00:57:23Z","cross_cats_sorted":[],"title_canon_sha256":"19654ffcc14a7767e507007cc1c1b87b8fa070bd931d4074fa13fe7c6b1f622f","abstract_canon_sha256":"4c41a1cc849aceb39c31781c466589d2f4037b1c5f45188cce6e1474fe054a32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:02.887701Z","signature_b64":"jW0NnV5nVI05wUKBXE8ir/lA/DwKHWt+YN/HyFmrWymINUlVkxOul2kE01co2/LNeQw2eFub0qCrqKfTDjoSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ca27de0c430e822c9fab76e2dedced6fe96d81b32d0feccf6ac437f03fb80de","last_reissued_at":"2026-05-18T02:18:02.886999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:02.886999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Newton-Part I: Algorithm and Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Aryan Mokhtari, Qing Ling","submitted_at":"2015-04-23T00:57:23Z","abstract_excerpt":"We study the problem of minimizing a sum of convex objective functions where the components of the objective are available at different nodes of a network and nodes are allowed to only communicate with their neighbors. The use of distributed gradient methods is a common approach to solve this problem. Their popularity notwithstanding, these methods exhibit slow convergence and a consequent large number of communications between nodes to approach the optimal argument because they rely on first order information only. This paper proposes the network Newton (NN) method as a distributed algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06017","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":"1504.06017","created_at":"2026-05-18T02:18:02.887104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06017v1","created_at":"2026-05-18T02:18:02.887104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06017","created_at":"2026-05-18T02:18:02.887104+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSRH3YGEGDUC","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSRH3YGEGDUCFSP2","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSRH3YGE","created_at":"2026-05-18T12:29:17.054201+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/DSRH3YGEGDUCFSP2W5XC33OO23","json":"https://pith.science/pith/DSRH3YGEGDUCFSP2W5XC33OO23.json","graph_json":"https://pith.science/api/pith-number/DSRH3YGEGDUCFSP2W5XC33OO23/graph.json","events_json":"https://pith.science/api/pith-number/DSRH3YGEGDUCFSP2W5XC33OO23/events.json","paper":"https://pith.science/paper/DSRH3YGE"},"agent_actions":{"view_html":"https://pith.science/pith/DSRH3YGEGDUCFSP2W5XC33OO23","download_json":"https://pith.science/pith/DSRH3YGEGDUCFSP2W5XC33OO23.json","view_paper":"https://pith.science/paper/DSRH3YGE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06017&json=true","fetch_graph":"https://pith.science/api/pith-number/DSRH3YGEGDUCFSP2W5XC33OO23/graph.json","fetch_events":"https://pith.science/api/pith-number/DSRH3YGEGDUCFSP2W5XC33OO23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSRH3YGEGDUCFSP2W5XC33OO23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSRH3YGEGDUCFSP2W5XC33OO23/action/storage_attestation","attest_author":"https://pith.science/pith/DSRH3YGEGDUCFSP2W5XC33OO23/action/author_attestation","sign_citation":"https://pith.science/pith/DSRH3YGEGDUCFSP2W5XC33OO23/action/citation_signature","submit_replication":"https://pith.science/pith/DSRH3YGEGDUCFSP2W5XC33OO23/action/replication_record"}},"created_at":"2026-05-18T02:18:02.887104+00:00","updated_at":"2026-05-18T02:18:02.887104+00:00"}