{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EW4MYOZ2X7E2T3ZT4DSCFDTC4M","short_pith_number":"pith:EW4MYOZ2","canonical_record":{"source":{"id":"1112.1333","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2011-12-06T16:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"7eb6cbc93cb0b33787c9912e72665435301b9bb43cd0c8b4f7ccdc53112d01b9","abstract_canon_sha256":"6b8042787e42d3f212e295dfb2f521bb5224beb87187673c8e79c93dc99c8f5b"},"schema_version":"1.0"},"canonical_sha256":"25b8cc3b3abfc9a9ef33e0e4228e62e321a4cf94fabb222802ff24d70a90f78c","source":{"kind":"arxiv","id":"1112.1333","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1333","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1333v2","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1333","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"EW4MYOZ2X7E2","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EW4MYOZ2X7E2T3ZT","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EW4MYOZ2","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EW4MYOZ2X7E2T3ZT4DSCFDTC4M","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1333","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2011-12-06T16:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"7eb6cbc93cb0b33787c9912e72665435301b9bb43cd0c8b4f7ccdc53112d01b9","abstract_canon_sha256":"6b8042787e42d3f212e295dfb2f521bb5224beb87187673c8e79c93dc99c8f5b"},"schema_version":"1.0"},"canonical_sha256":"25b8cc3b3abfc9a9ef33e0e4228e62e321a4cf94fabb222802ff24d70a90f78c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:27.697368Z","signature_b64":"Hk4r2NdsSQCMFh7Qz6j2wCtXsAJh4I5QbH2bTyJnCpoxD7+rsLmFVwYP7AbNYHmF4hfgn8lziD4Hv/+IIk1gCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25b8cc3b3abfc9a9ef33e0e4228e62e321a4cf94fabb222802ff24d70a90f78c","last_reissued_at":"2026-05-18T02:21:27.696618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:27.696618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1333","source_version":2,"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-18T02:21:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nmve07M/BrBPx3iApPx9Kpwiyyd4GWpFrMci2z3BsFQxKaccxMUMaK06vtCjghIfCDVLw/en+4rnbYdmdcm5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:34:30.960285Z"},"content_sha256":"75224796858d7811be7582b3f2fc593f08b7a0441c32be24b9c2405ecc56815f","schema_version":"1.0","event_id":"sha256:75224796858d7811be7582b3f2fc593f08b7a0441c32be24b9c2405ecc56815f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EW4MYOZ2X7E2T3ZT4DSCFDTC4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reaching an Optimal Consensus: Dynamical Systems that Compute Intersections of Convex Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Guodong Shi, Karl Henrik Johansson, Yiguang Hong","submitted_at":"2011-12-06T16:25:21Z","abstract_excerpt":"In this paper, multi-agent systems minimizing a sum of objective functions, where each component is only known to a particular node, is considered for continuous-time dynamics with time-varying interconnection topologies. Assuming that each node can observe a convex solution set of its optimization component, and the intersection of all such sets is nonempty, the considered optimization problem is converted to an intersection computation problem. By a simple distributed control rule, the considered multi-agent system with continuous-time dynamics achieves not only a consensus, but also an opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1333","kind":"arxiv","version":2},"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-18T02:21:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NU/JAwpSJCHqtoUVeu3LtZeCquHxfd0Z22Vd7ccoJI1lYtE9tGQ6jIlG2Fm3Ax1CY2omD9xh9KJFZtBwBwyWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:34:30.960886Z"},"content_sha256":"95396858f30a81e790abd92c6e958a6e42b057ff42887ffccc2a0140a2204405","schema_version":"1.0","event_id":"sha256:95396858f30a81e790abd92c6e958a6e42b057ff42887ffccc2a0140a2204405"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EW4MYOZ2X7E2T3ZT4DSCFDTC4M/bundle.json","state_url":"https://pith.science/pith/EW4MYOZ2X7E2T3ZT4DSCFDTC4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EW4MYOZ2X7E2T3ZT4DSCFDTC4M/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:34:30Z","links":{"resolver":"https://pith.science/pith/EW4MYOZ2X7E2T3ZT4DSCFDTC4M","bundle":"https://pith.science/pith/EW4MYOZ2X7E2T3ZT4DSCFDTC4M/bundle.json","state":"https://pith.science/pith/EW4MYOZ2X7E2T3ZT4DSCFDTC4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EW4MYOZ2X7E2T3ZT4DSCFDTC4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EW4MYOZ2X7E2T3ZT4DSCFDTC4M","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":"6b8042787e42d3f212e295dfb2f521bb5224beb87187673c8e79c93dc99c8f5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2011-12-06T16:25:21Z","title_canon_sha256":"7eb6cbc93cb0b33787c9912e72665435301b9bb43cd0c8b4f7ccdc53112d01b9"},"schema_version":"1.0","source":{"id":"1112.1333","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1333","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1333v2","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1333","created_at":"2026-05-18T02:21:27Z"},{"alias_kind":"pith_short_12","alias_value":"EW4MYOZ2X7E2","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EW4MYOZ2X7E2T3ZT","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EW4MYOZ2","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:95396858f30a81e790abd92c6e958a6e42b057ff42887ffccc2a0140a2204405","target":"graph","created_at":"2026-05-18T02:21:27Z","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, multi-agent systems minimizing a sum of objective functions, where each component is only known to a particular node, is considered for continuous-time dynamics with time-varying interconnection topologies. Assuming that each node can observe a convex solution set of its optimization component, and the intersection of all such sets is nonempty, the considered optimization problem is converted to an intersection computation problem. By a simple distributed control rule, the considered multi-agent system with continuous-time dynamics achieves not only a consensus, but also an opti","authors_text":"Guodong Shi, Karl Henrik Johansson, Yiguang Hong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2011-12-06T16:25:21Z","title":"Reaching an Optimal Consensus: Dynamical Systems that Compute Intersections of Convex Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1333","kind":"arxiv","version":2},"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:75224796858d7811be7582b3f2fc593f08b7a0441c32be24b9c2405ecc56815f","target":"record","created_at":"2026-05-18T02:21:27Z","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":"6b8042787e42d3f212e295dfb2f521bb5224beb87187673c8e79c93dc99c8f5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2011-12-06T16:25:21Z","title_canon_sha256":"7eb6cbc93cb0b33787c9912e72665435301b9bb43cd0c8b4f7ccdc53112d01b9"},"schema_version":"1.0","source":{"id":"1112.1333","kind":"arxiv","version":2}},"canonical_sha256":"25b8cc3b3abfc9a9ef33e0e4228e62e321a4cf94fabb222802ff24d70a90f78c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25b8cc3b3abfc9a9ef33e0e4228e62e321a4cf94fabb222802ff24d70a90f78c","first_computed_at":"2026-05-18T02:21:27.696618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:27.696618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hk4r2NdsSQCMFh7Qz6j2wCtXsAJh4I5QbH2bTyJnCpoxD7+rsLmFVwYP7AbNYHmF4hfgn8lziD4Hv/+IIk1gCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:27.697368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1333","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75224796858d7811be7582b3f2fc593f08b7a0441c32be24b9c2405ecc56815f","sha256:95396858f30a81e790abd92c6e958a6e42b057ff42887ffccc2a0140a2204405"],"state_sha256":"81f60ed03e87a215068c764d0a509d6130ec360530c870dc750f9744852a4f7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+FHtXOeEvv8X1gs3ojlB0P1yL9hw5XSvB3Ldf9iIPbCmkUTFEkanLgX1lASaTGPU6nPr9YTRnZCumHJ28fAuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T23:34:30.963750Z","bundle_sha256":"dda34a2783829d17c85a25bed83d2c78bb9822822ef42237767dff9a483877db"}}