{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RTK3OZIREUK5ROCK5M7IU5MSY6","short_pith_number":"pith:RTK3OZIR","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"},"canonical_sha256":"8cd5b765112515d8b84aeb3e8a7592c7a19c0f3468cc300a0b1a43b4c4579f87","source":{"kind":"arxiv","id":"1707.04598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04598","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04598v1","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04598","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"RTK3OZIREUK5","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RTK3OZIREUK5ROCK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RTK3OZIR","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RTK3OZIREUK5ROCK5M7IU5MSY6","target":"record","payload":{"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"},"canonical_sha256":"8cd5b765112515d8b84aeb3e8a7592c7a19c0f3468cc300a0b1a43b4c4579f87","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"},"source_kind":"arxiv","source_id":"1707.04598","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-18T00:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bg8GmtJ4LLcXl9OLI0loG6HuCT+cwlJCgdS3FBkccoa3gzcYCFdo7wB/y5kIp7Kaf6HZaXxXizSmD2ibJ7M4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:09:22.071517Z"},"content_sha256":"0ee282904097d701d63b1fc7513f8f627d8d75d8ac288b3fb26400e45d2fc7ad","schema_version":"1.0","event_id":"sha256:0ee282904097d701d63b1fc7513f8f627d8d75d8ac288b3fb26400e45d2fc7ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RTK3OZIREUK5ROCK5M7IU5MSY6","target":"graph","payload":{"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"},"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-18T00:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l19vaeLtc5FS3AzLNHmb7mUPn6jz4tUufwnKhOPj/ztPY3AYFs2UGxC4LAwnAcsN3NFV72RGNh+uX+yWmp4iBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:09:22.071874Z"},"content_sha256":"9c3cca72dda13a1f4ba6145a75e2ed6dd7a64debb2305786f546910b2ab30abc","schema_version":"1.0","event_id":"sha256:9c3cca72dda13a1f4ba6145a75e2ed6dd7a64debb2305786f546910b2ab30abc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6/bundle.json","state_url":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTK3OZIREUK5ROCK5M7IU5MSY6/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-05-30T05:09:22Z","links":{"resolver":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6","bundle":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6/bundle.json","state":"https://pith.science/pith/RTK3OZIREUK5ROCK5M7IU5MSY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTK3OZIREUK5ROCK5M7IU5MSY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RTK3OZIREUK5ROCK5M7IU5MSY6","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":"383bcb38d67f1bf0d58f32c7fc2bf1db01007195fda7d70c2ef5ce9dcdd6848a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-14T18:23:06Z","title_canon_sha256":"ac31fa303b480d2a78ad017b8b8ba765ca2cec8448ec6e2b2aa5017caca3112b"},"schema_version":"1.0","source":{"id":"1707.04598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04598","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04598v1","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04598","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"RTK3OZIREUK5","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RTK3OZIREUK5ROCK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RTK3OZIR","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:9c3cca72dda13a1f4ba6145a75e2ed6dd7a64debb2305786f546910b2ab30abc","target":"graph","created_at":"2026-05-18T00:40:17Z","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":"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","authors_text":"Ion Matei, John S. Baras","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-14T18:23:06Z","title":"Nonlinear Programming Methods for Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04598","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:0ee282904097d701d63b1fc7513f8f627d8d75d8ac288b3fb26400e45d2fc7ad","target":"record","created_at":"2026-05-18T00:40:17Z","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":"383bcb38d67f1bf0d58f32c7fc2bf1db01007195fda7d70c2ef5ce9dcdd6848a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-14T18:23:06Z","title_canon_sha256":"ac31fa303b480d2a78ad017b8b8ba765ca2cec8448ec6e2b2aa5017caca3112b"},"schema_version":"1.0","source":{"id":"1707.04598","kind":"arxiv","version":1}},"canonical_sha256":"8cd5b765112515d8b84aeb3e8a7592c7a19c0f3468cc300a0b1a43b4c4579f87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cd5b765112515d8b84aeb3e8a7592c7a19c0f3468cc300a0b1a43b4c4579f87","first_computed_at":"2026-05-18T00:40:17.135079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:17.135079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hBvlqC1YaGYz/cEPeICvGaJNeNuKswHKVAurmZZg3NV6/dUNXkfgshnm/bqj5YVcw4d7vMRTZ7r039be5blNAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:17.135689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ee282904097d701d63b1fc7513f8f627d8d75d8ac288b3fb26400e45d2fc7ad","sha256:9c3cca72dda13a1f4ba6145a75e2ed6dd7a64debb2305786f546910b2ab30abc"],"state_sha256":"a92c9b38bdf245878f56965c2301db203569cee77c9d469a1189094d20534b73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3YAf/nW7uokRcAjjKCq9tTDycpzKZlCQOvuoSXhDNZM8GOsJJq3BDU90CX9ZJydzmpuHPyZSMHBSYtErjV+IAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:09:22.073886Z","bundle_sha256":"0ad9b8675178864874f2653584c6db6ddb728a273a30e0f394788dbf6aa0af7a"}}