{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CRWF4BF6DOJWHAU2VL2BQXMJZN","short_pith_number":"pith:CRWF4BF6","canonical_record":{"source":{"id":"1503.04904","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-17T03:47:41Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c54b5add96e0731527c094f60ccc8c78942322e906050590667675a3e0150741","abstract_canon_sha256":"1474132d896cf86e967aa32a4f80f553a5aac18cda2124491dd07d0c92314dd2"},"schema_version":"1.0"},"canonical_sha256":"146c5e04be1b9363829aaaf4185d89cb70390811017020cfe4f12a555960fb45","source":{"kind":"arxiv","id":"1503.04904","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04904","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04904v3","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04904","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"CRWF4BF6DOJW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CRWF4BF6DOJWHAU2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CRWF4BF6","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CRWF4BF6DOJWHAU2VL2BQXMJZN","target":"record","payload":{"canonical_record":{"source":{"id":"1503.04904","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-17T03:47:41Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c54b5add96e0731527c094f60ccc8c78942322e906050590667675a3e0150741","abstract_canon_sha256":"1474132d896cf86e967aa32a4f80f553a5aac18cda2124491dd07d0c92314dd2"},"schema_version":"1.0"},"canonical_sha256":"146c5e04be1b9363829aaaf4185d89cb70390811017020cfe4f12a555960fb45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:23.122417Z","signature_b64":"Bs47tSNwg61FMoARLMd7tn+xLgphZJZreSRq0gBrAiOV8hbyFu8hZxSNdoz3PC2tZ6Zra1Ot9p/i6nMU4L44CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"146c5e04be1b9363829aaaf4185d89cb70390811017020cfe4f12a555960fb45","last_reissued_at":"2026-05-18T01:21:23.121851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:23.121851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.04904","source_version":3,"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-18T01:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLrL6vP/HxC0YZUfDz2wp7P3n7M7GTJrBpo9st+JvOZYn8xLdAl2PNkDJiv9dmhc5O9UnWbLAcrf8Sv69wkjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:11:09.846819Z"},"content_sha256":"e6a277048da49c1709b47d7fd488983f99e92639a300cbfc55bca5626d947f89","schema_version":"1.0","event_id":"sha256:e6a277048da49c1709b47d7fd488983f99e92639a300cbfc55bca5626d947f89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CRWF4BF6DOJWHAU2VL2BQXMJZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Continuous-time Approximate Projection Protocols for Shortest Distance Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Shouyang Wang, Yiguang Hong, Youcheng Lou","submitted_at":"2015-03-17T03:47:41Z","abstract_excerpt":"In this paper, we investigate the distributed shortest distance optimization problem for a multi-agent network to cooperatively minimize the sum of the quadratic distances from some convex sets, where each set is only associated with one agent. To deal with the optimization problem with projection uncertainties, we propose a distributed continuous-time dynamical protocol based on a new concept of approximate projection. Here each agent can only obtain an approximate projection point on the boundary of its convex set, and communicate with its neighbors over a time-varying communication graph. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04904","kind":"arxiv","version":3},"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-18T01:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5R1IXsM3hwz/GBiK7nT8imjzxlS9mzaiu3HQrcEfBY2ofbMXnHw7a1nkYM+Ippap+IFLvtsz30rdHEAW6MWPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:11:09.847172Z"},"content_sha256":"5c7626b8a11b6a129977d462d543c105299da80f01f67963604064724b384665","schema_version":"1.0","event_id":"sha256:5c7626b8a11b6a129977d462d543c105299da80f01f67963604064724b384665"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRWF4BF6DOJWHAU2VL2BQXMJZN/bundle.json","state_url":"https://pith.science/pith/CRWF4BF6DOJWHAU2VL2BQXMJZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRWF4BF6DOJWHAU2VL2BQXMJZN/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-06-30T23:11:09Z","links":{"resolver":"https://pith.science/pith/CRWF4BF6DOJWHAU2VL2BQXMJZN","bundle":"https://pith.science/pith/CRWF4BF6DOJWHAU2VL2BQXMJZN/bundle.json","state":"https://pith.science/pith/CRWF4BF6DOJWHAU2VL2BQXMJZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRWF4BF6DOJWHAU2VL2BQXMJZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CRWF4BF6DOJWHAU2VL2BQXMJZN","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":"1474132d896cf86e967aa32a4f80f553a5aac18cda2124491dd07d0c92314dd2","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-17T03:47:41Z","title_canon_sha256":"c54b5add96e0731527c094f60ccc8c78942322e906050590667675a3e0150741"},"schema_version":"1.0","source":{"id":"1503.04904","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04904","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04904v3","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04904","created_at":"2026-05-18T01:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"CRWF4BF6DOJW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CRWF4BF6DOJWHAU2","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CRWF4BF6","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:5c7626b8a11b6a129977d462d543c105299da80f01f67963604064724b384665","target":"graph","created_at":"2026-05-18T01:21:23Z","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 the distributed shortest distance optimization problem for a multi-agent network to cooperatively minimize the sum of the quadratic distances from some convex sets, where each set is only associated with one agent. To deal with the optimization problem with projection uncertainties, we propose a distributed continuous-time dynamical protocol based on a new concept of approximate projection. Here each agent can only obtain an approximate projection point on the boundary of its convex set, and communicate with its neighbors over a time-varying communication graph. F","authors_text":"Shouyang Wang, Yiguang Hong, Youcheng Lou","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-17T03:47:41Z","title":"Distributed Continuous-time Approximate Projection Protocols for Shortest Distance Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04904","kind":"arxiv","version":3},"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:e6a277048da49c1709b47d7fd488983f99e92639a300cbfc55bca5626d947f89","target":"record","created_at":"2026-05-18T01:21:23Z","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":"1474132d896cf86e967aa32a4f80f553a5aac18cda2124491dd07d0c92314dd2","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-17T03:47:41Z","title_canon_sha256":"c54b5add96e0731527c094f60ccc8c78942322e906050590667675a3e0150741"},"schema_version":"1.0","source":{"id":"1503.04904","kind":"arxiv","version":3}},"canonical_sha256":"146c5e04be1b9363829aaaf4185d89cb70390811017020cfe4f12a555960fb45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"146c5e04be1b9363829aaaf4185d89cb70390811017020cfe4f12a555960fb45","first_computed_at":"2026-05-18T01:21:23.121851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:23.121851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bs47tSNwg61FMoARLMd7tn+xLgphZJZreSRq0gBrAiOV8hbyFu8hZxSNdoz3PC2tZ6Zra1Ot9p/i6nMU4L44CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:23.122417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04904","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6a277048da49c1709b47d7fd488983f99e92639a300cbfc55bca5626d947f89","sha256:5c7626b8a11b6a129977d462d543c105299da80f01f67963604064724b384665"],"state_sha256":"b7f4916321d5074b23890eea79f0d4ffcada461dcf08e26226bcdbee9534ff6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fyRQUiESpJDk7g+3pA05+NcONUPe5LAL5UoEs1efQLmxHYsNTNcbQoShmazCFCSAFEru+m+koHlOuU7yxH6ZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T23:11:09.849145Z","bundle_sha256":"8e0a3114a8f4256d7ced3617748a81c46bd1e3c4027a33b4612523ba81397fec"}}