{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RTK3OZIREUK5ROCK5M7IU5MSY6","short_pith_number":"pith:RTK3OZIR","schema_version":"1.0","canonical_sha256":"8cd5b765112515d8b84aeb3e8a7592c7a19c0f3468cc300a0b1a43b4c4579f87","source":{"kind":"arxiv","id":"1707.04598","version":1},"attestation_state":"computed","paper":{"title":"Nonlinear Programming Methods for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ion Matei, John S. Baras","submitted_at":"2017-07-14T18:23:06Z","abstract_excerpt":"In this paper we investigate how standard nonlinear programming algorithms can be used to solve constrained optimization problems in a distributed manner. The optimization setup consists of a set of agents interacting through a communication graph that have as common goal the minimization of a function expressed as a sum of (possibly non-convex) differentiable functions. Each function in the sum corresponds to an agent and each agent has associated an equality constraint. By re-casting the distributed optimization problem into an equivalent, augmented centralized problem, we show that distribu"},"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":"1707.04598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-14T18:23:06Z","cross_cats_sorted":[],"title_canon_sha256":"ac31fa303b480d2a78ad017b8b8ba765ca2cec8448ec6e2b2aa5017caca3112b","abstract_canon_sha256":"383bcb38d67f1bf0d58f32c7fc2bf1db01007195fda7d70c2ef5ce9dcdd6848a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:17.135689Z","signature_b64":"hBvlqC1YaGYz/cEPeICvGaJNeNuKswHKVAurmZZg3NV6/dUNXkfgshnm/bqj5YVcw4d7vMRTZ7r039be5blNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cd5b765112515d8b84aeb3e8a7592c7a19c0f3468cc300a0b1a43b4c4579f87","last_reissued_at":"2026-05-18T00:40:17.135079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:17.135079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonlinear Programming Methods for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ion Matei, John S. Baras","submitted_at":"2017-07-14T18:23:06Z","abstract_excerpt":"In this paper we investigate how standard nonlinear programming algorithms can be used to solve constrained optimization problems in a distributed manner. The optimization setup consists of a set of agents interacting through a communication graph that have as common goal the minimization of a function expressed as a sum of (possibly non-convex) differentiable functions. Each function in the sum corresponds to an agent and each agent has associated an equality constraint. By re-casting the distributed optimization problem into an equivalent, augmented centralized problem, we show that distribu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04598","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":"1707.04598","created_at":"2026-05-18T00:40:17.135162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04598v1","created_at":"2026-05-18T00:40:17.135162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04598","created_at":"2026-05-18T00:40:17.135162+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTK3OZIREUK5","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTK3OZIREUK5ROCK","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTK3OZIR","created_at":"2026-05-18T12:31:39.905425+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/RTK3OZIREUK5ROCK5M7IU5MSY6","json":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6.json","graph_json":"https://pith.science/api/pith-number/RTK3OZIREUK5ROCK5M7IU5MSY6/graph.json","events_json":"https://pith.science/api/pith-number/RTK3OZIREUK5ROCK5M7IU5MSY6/events.json","paper":"https://pith.science/paper/RTK3OZIR"},"agent_actions":{"view_html":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6","download_json":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6.json","view_paper":"https://pith.science/paper/RTK3OZIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04598&json=true","fetch_graph":"https://pith.science/api/pith-number/RTK3OZIREUK5ROCK5M7IU5MSY6/graph.json","fetch_events":"https://pith.science/api/pith-number/RTK3OZIREUK5ROCK5M7IU5MSY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6/action/storage_attestation","attest_author":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6/action/author_attestation","sign_citation":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6/action/citation_signature","submit_replication":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6/action/replication_record"}},"created_at":"2026-05-18T00:40:17.135162+00:00","updated_at":"2026-05-18T00:40:17.135162+00:00"}