{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MNP6QAQ6MCZZBOZYV6GYUF7ACV","short_pith_number":"pith:MNP6QAQ6","canonical_record":{"source":{"id":"1803.06380","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-16T19:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"cdfa30349511cdbe801f22ddd82ded97dfacaf4cf6f0e2a5d7bfbde2970bb841","abstract_canon_sha256":"91fa41378674060d52eb4f086a198da8d6e3c0942476e233c50e31aa343ba207"},"schema_version":"1.0"},"canonical_sha256":"635fe8021e60b390bb38af8d8a17e0156355c986215b45fafc6de7c5ca794925","source":{"kind":"arxiv","id":"1803.06380","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06380","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06380v3","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06380","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"MNP6QAQ6MCZZ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MNP6QAQ6MCZZBOZY","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MNP6QAQ6","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MNP6QAQ6MCZZBOZYV6GYUF7ACV","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06380","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-16T19:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"cdfa30349511cdbe801f22ddd82ded97dfacaf4cf6f0e2a5d7bfbde2970bb841","abstract_canon_sha256":"91fa41378674060d52eb4f086a198da8d6e3c0942476e233c50e31aa343ba207"},"schema_version":"1.0"},"canonical_sha256":"635fe8021e60b390bb38af8d8a17e0156355c986215b45fafc6de7c5ca794925","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:45.905531Z","signature_b64":"T2s85rX888NcMgRvVBEZigZphfqGA2k4qYuYDRI+aiONU2pEUrNGc77ruwJsiNNKzMetfm+p/+7bxzuoEQ4QAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"635fe8021e60b390bb38af8d8a17e0156355c986215b45fafc6de7c5ca794925","last_reissued_at":"2026-05-17T23:48:45.905041Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:45.905041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06380","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-17T23:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d49aTn7imZWs88s09pVK+AZCRawUO+RXm4Dhrsmn6OjkC47A1YYhRZZWOlOh1Gr+/OkHb8ul0e4tVFVrzDy/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:40:45.028564Z"},"content_sha256":"dcc2ea5868a31936c266e1632409cb2640081d42d177200a9b8049ad825b5905","schema_version":"1.0","event_id":"sha256:dcc2ea5868a31936c266e1632409cb2640081d42d177200a9b8049ad825b5905"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MNP6QAQ6MCZZBOZYV6GYUF7ACV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Optimization for Second-Order Multi-Agent Systems with Dynamic Event-Triggered Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jemin George, Karl H. Johansson, Lisha Yao, Tao Yang, Xinlei Yi","submitted_at":"2018-03-16T19:35:36Z","abstract_excerpt":"In this paper, we propose a fully distributed algorithm for second-order continuous-time multi-agent systems to solve the distributed optimization problem. The global objective function is a sum of private cost functions associated with the individual agents and the interaction between agents is described by a weighted undirected graph. We show the exponential convergence of the proposed algorithm if the underlying graph is connected, each private cost function is locally gradient-Lipschitz-continuous, and the global objective function is restricted strongly convex with respect to the global m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06380","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-17T23:48:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EuZQEGpfMhf7S9WGcHTpB52fLzSa/Zko7gufvrOzH5or/b8jT9gJ+2oViJWqI12vxcmHjy8PxBh8F+GxdW+QDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:40:45.029237Z"},"content_sha256":"e1b430cbe4cba6e27559baf3abbf799cfb2b1edbdd997e5e45e6b45a5bc1902e","schema_version":"1.0","event_id":"sha256:e1b430cbe4cba6e27559baf3abbf799cfb2b1edbdd997e5e45e6b45a5bc1902e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MNP6QAQ6MCZZBOZYV6GYUF7ACV/bundle.json","state_url":"https://pith.science/pith/MNP6QAQ6MCZZBOZYV6GYUF7ACV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MNP6QAQ6MCZZBOZYV6GYUF7ACV/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-26T02:40:45Z","links":{"resolver":"https://pith.science/pith/MNP6QAQ6MCZZBOZYV6GYUF7ACV","bundle":"https://pith.science/pith/MNP6QAQ6MCZZBOZYV6GYUF7ACV/bundle.json","state":"https://pith.science/pith/MNP6QAQ6MCZZBOZYV6GYUF7ACV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MNP6QAQ6MCZZBOZYV6GYUF7ACV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MNP6QAQ6MCZZBOZYV6GYUF7ACV","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":"91fa41378674060d52eb4f086a198da8d6e3c0942476e233c50e31aa343ba207","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-16T19:35:36Z","title_canon_sha256":"cdfa30349511cdbe801f22ddd82ded97dfacaf4cf6f0e2a5d7bfbde2970bb841"},"schema_version":"1.0","source":{"id":"1803.06380","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06380","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06380v3","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06380","created_at":"2026-05-17T23:48:45Z"},{"alias_kind":"pith_short_12","alias_value":"MNP6QAQ6MCZZ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MNP6QAQ6MCZZBOZY","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MNP6QAQ6","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:e1b430cbe4cba6e27559baf3abbf799cfb2b1edbdd997e5e45e6b45a5bc1902e","target":"graph","created_at":"2026-05-17T23:48:45Z","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 propose a fully distributed algorithm for second-order continuous-time multi-agent systems to solve the distributed optimization problem. The global objective function is a sum of private cost functions associated with the individual agents and the interaction between agents is described by a weighted undirected graph. We show the exponential convergence of the proposed algorithm if the underlying graph is connected, each private cost function is locally gradient-Lipschitz-continuous, and the global objective function is restricted strongly convex with respect to the global m","authors_text":"Jemin George, Karl H. Johansson, Lisha Yao, Tao Yang, Xinlei Yi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-16T19:35:36Z","title":"Distributed Optimization for Second-Order Multi-Agent Systems with Dynamic Event-Triggered Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06380","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:dcc2ea5868a31936c266e1632409cb2640081d42d177200a9b8049ad825b5905","target":"record","created_at":"2026-05-17T23:48:45Z","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":"91fa41378674060d52eb4f086a198da8d6e3c0942476e233c50e31aa343ba207","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-16T19:35:36Z","title_canon_sha256":"cdfa30349511cdbe801f22ddd82ded97dfacaf4cf6f0e2a5d7bfbde2970bb841"},"schema_version":"1.0","source":{"id":"1803.06380","kind":"arxiv","version":3}},"canonical_sha256":"635fe8021e60b390bb38af8d8a17e0156355c986215b45fafc6de7c5ca794925","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"635fe8021e60b390bb38af8d8a17e0156355c986215b45fafc6de7c5ca794925","first_computed_at":"2026-05-17T23:48:45.905041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:45.905041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T2s85rX888NcMgRvVBEZigZphfqGA2k4qYuYDRI+aiONU2pEUrNGc77ruwJsiNNKzMetfm+p/+7bxzuoEQ4QAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:45.905531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06380","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcc2ea5868a31936c266e1632409cb2640081d42d177200a9b8049ad825b5905","sha256:e1b430cbe4cba6e27559baf3abbf799cfb2b1edbdd997e5e45e6b45a5bc1902e"],"state_sha256":"6688dc8395702e8bfdb6b31ef3d2c0f8a074bab7c4c8a3fd36fb0b5674022a24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aGXARRuuMu3zJVx9K/TuwUS4wNexvwkjL+StTbedmBBDSPhTj2O4zX35qczC3xDy5WU6Vc2ab5KLHCzMIz7ZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:40:45.032874Z","bundle_sha256":"7585ab621f7ad1c0561849721a468ce5f650ca496040a4fc70cd634c26e8ef20"}}