{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4SB25WVAL242SCPTTYD4RWT4PJ","short_pith_number":"pith:4SB25WVA","canonical_record":{"source":{"id":"1706.07707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-21T18:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"f3ba3be35c74273866d4c2836fa6604e0cdb2ea36857f628dc8e98e685ba8d86","abstract_canon_sha256":"9372fb71c34b8d338ccc28b7b841866b449fd734907080e7799542bab0ffac8c"},"schema_version":"1.0"},"canonical_sha256":"e483aedaa05eb9a909f39e07c8da7c7a6c5d3f7a8f06959c45531c56c4a5d2a4","source":{"kind":"arxiv","id":"1706.07707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07707","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07707v1","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07707","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"4SB25WVAL242","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4SB25WVAL242SCPT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4SB25WVA","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4SB25WVAL242SCPTTYD4RWT4PJ","target":"record","payload":{"canonical_record":{"source":{"id":"1706.07707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-21T18:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"f3ba3be35c74273866d4c2836fa6604e0cdb2ea36857f628dc8e98e685ba8d86","abstract_canon_sha256":"9372fb71c34b8d338ccc28b7b841866b449fd734907080e7799542bab0ffac8c"},"schema_version":"1.0"},"canonical_sha256":"e483aedaa05eb9a909f39e07c8da7c7a6c5d3f7a8f06959c45531c56c4a5d2a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:48.396310Z","signature_b64":"DspXRpQUuPIWSVB8MP02z3qbuuRODBi7nj2mIbk7VuNaQSzw+OL6ZV+P7n7dTLQGAMxtHWKii2FB31U4BRLpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e483aedaa05eb9a909f39e07c8da7c7a6c5d3f7a8f06959c45531c56c4a5d2a4","last_reissued_at":"2026-05-18T00:41:48.395536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:48.395536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.07707","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:41:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XG4DvDH/Js0XDkKI3tBDCa47f0UX7N3VF2/xt6lsuyfuWAnwEycdOR1HJGuKsALYab4/RxnZISKbKujARKGKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T01:02:19.500720Z"},"content_sha256":"bd001478e3fe952bb1b502564b7b55126b887af69c1230d80b38d64fd8a0f9cb","schema_version":"1.0","event_id":"sha256:bd001478e3fe952bb1b502564b7b55126b887af69c1230d80b38d64fd8a0f9cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4SB25WVAL242SCPTTYD4RWT4PJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Subgradient Projection Algorithm over Directed Graphs: Alternate Proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chenguang Xi, Ran Xin, Usman A. Khan","submitted_at":"2017-06-21T18:59:35Z","abstract_excerpt":"We propose Directed-Distributed Projected Subgradient (D-DPS) to solve a constrained optimization problem over a multi-agent network, where the goal of agents is to collectively minimize the sum of locally known convex functions. Each agent in the network owns only its local objective function, constrained to a commonly known convex set. We focus on the circumstance when communications between agents are described by a \\emph{directed} network. The D-DPS combines surplus consensus to overcome the asymmetry caused by the directed communication network. The analysis shows the convergence rate to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07707","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:41:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3aB24/d0egqRA1CNHxp3hV0yrf1fcLMdVS+PINTaXP12E61riH9t5AGe2J7OYaqada7oE789KtDPeDNIfWFtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T01:02:19.501072Z"},"content_sha256":"9994d7d91642629fa1a35f1451ce411e81c31d3331f4ede7d8dcef6c3eff5e80","schema_version":"1.0","event_id":"sha256:9994d7d91642629fa1a35f1451ce411e81c31d3331f4ede7d8dcef6c3eff5e80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SB25WVAL242SCPTTYD4RWT4PJ/bundle.json","state_url":"https://pith.science/pith/4SB25WVAL242SCPTTYD4RWT4PJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SB25WVAL242SCPTTYD4RWT4PJ/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-07-15T01:02:19Z","links":{"resolver":"https://pith.science/pith/4SB25WVAL242SCPTTYD4RWT4PJ","bundle":"https://pith.science/pith/4SB25WVAL242SCPTTYD4RWT4PJ/bundle.json","state":"https://pith.science/pith/4SB25WVAL242SCPTTYD4RWT4PJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SB25WVAL242SCPTTYD4RWT4PJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4SB25WVAL242SCPTTYD4RWT4PJ","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":"9372fb71c34b8d338ccc28b7b841866b449fd734907080e7799542bab0ffac8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-21T18:59:35Z","title_canon_sha256":"f3ba3be35c74273866d4c2836fa6604e0cdb2ea36857f628dc8e98e685ba8d86"},"schema_version":"1.0","source":{"id":"1706.07707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07707","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07707v1","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07707","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"4SB25WVAL242","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4SB25WVAL242SCPT","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4SB25WVA","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:9994d7d91642629fa1a35f1451ce411e81c31d3331f4ede7d8dcef6c3eff5e80","target":"graph","created_at":"2026-05-18T00:41:48Z","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":"We propose Directed-Distributed Projected Subgradient (D-DPS) to solve a constrained optimization problem over a multi-agent network, where the goal of agents is to collectively minimize the sum of locally known convex functions. Each agent in the network owns only its local objective function, constrained to a commonly known convex set. We focus on the circumstance when communications between agents are described by a \\emph{directed} network. The D-DPS combines surplus consensus to overcome the asymmetry caused by the directed communication network. The analysis shows the convergence rate to ","authors_text":"Chenguang Xi, Ran Xin, Usman A. Khan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-21T18:59:35Z","title":"Distributed Subgradient Projection Algorithm over Directed Graphs: Alternate Proof"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07707","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:bd001478e3fe952bb1b502564b7b55126b887af69c1230d80b38d64fd8a0f9cb","target":"record","created_at":"2026-05-18T00:41:48Z","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":"9372fb71c34b8d338ccc28b7b841866b449fd734907080e7799542bab0ffac8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-21T18:59:35Z","title_canon_sha256":"f3ba3be35c74273866d4c2836fa6604e0cdb2ea36857f628dc8e98e685ba8d86"},"schema_version":"1.0","source":{"id":"1706.07707","kind":"arxiv","version":1}},"canonical_sha256":"e483aedaa05eb9a909f39e07c8da7c7a6c5d3f7a8f06959c45531c56c4a5d2a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e483aedaa05eb9a909f39e07c8da7c7a6c5d3f7a8f06959c45531c56c4a5d2a4","first_computed_at":"2026-05-18T00:41:48.395536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:48.395536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DspXRpQUuPIWSVB8MP02z3qbuuRODBi7nj2mIbk7VuNaQSzw+OL6ZV+P7n7dTLQGAMxtHWKii2FB31U4BRLpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:48.396310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd001478e3fe952bb1b502564b7b55126b887af69c1230d80b38d64fd8a0f9cb","sha256:9994d7d91642629fa1a35f1451ce411e81c31d3331f4ede7d8dcef6c3eff5e80"],"state_sha256":"3030c1f168b3c62e5952941e1dc7219ea8a0e36735bdd6942e605b275c7d6248"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+ZnN9A9sUK8jVI96iWKAjByszi52FHswzwwiU0h+DGyWPlnz6R+wXbuChCLCM9bOtkGLFYtbFv9l66nw8e5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-15T01:02:19.503386Z","bundle_sha256":"7b23cbdf0d6f7a204071ded88fcb6f3a03853d9677ea5aa290f1a5c9731eb718"}}