{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HHCTJHVOF226YK6JREXC53EQFF","short_pith_number":"pith:HHCTJHVO","canonical_record":{"source":{"id":"1802.10519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-28T16:27:45Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"0215a0ee70a6818397c70201dae366679c51659a23fca04f7cb674d9c3c3401f","abstract_canon_sha256":"48f2a14f651292870ecc0e7efa59645bc41c6d6c28e14d3c3bac2ffb399f3fd4"},"schema_version":"1.0"},"canonical_sha256":"39c5349eae2eb5ec2bc9892e2eec9029738dac59b73169718185090294bd18c5","source":{"kind":"arxiv","id":"1802.10519","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10519","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10519v1","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10519","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"HHCTJHVOF226","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HHCTJHVOF226YK6J","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HHCTJHVO","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HHCTJHVOF226YK6JREXC53EQFF","target":"record","payload":{"canonical_record":{"source":{"id":"1802.10519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-28T16:27:45Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"0215a0ee70a6818397c70201dae366679c51659a23fca04f7cb674d9c3c3401f","abstract_canon_sha256":"48f2a14f651292870ecc0e7efa59645bc41c6d6c28e14d3c3bac2ffb399f3fd4"},"schema_version":"1.0"},"canonical_sha256":"39c5349eae2eb5ec2bc9892e2eec9029738dac59b73169718185090294bd18c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.937504Z","signature_b64":"yfdk9K85vAaBmztn7mFZ15B/ozM4eTsgEkBbHWPcfUcIG3+miC9C2MiOoNDhyNtLmpNCGarMyRprcUy2iznoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39c5349eae2eb5ec2bc9892e2eec9029738dac59b73169718185090294bd18c5","last_reissued_at":"2026-05-18T00:22:16.936945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.936945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.10519","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:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvy0DLZYHp4mUc5kznditC9kXdCs8s10OWDqaDrs59i6UYGLP82pF8cSTwfdu9WYoE1fGBz7TzuIuL9clXtuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:11:13.035791Z"},"content_sha256":"06bde5a6c17b705fc4dc3e7adbbee07579f553371e0a887da0b27db2ff6a18c9","schema_version":"1.0","event_id":"sha256:06bde5a6c17b705fc4dc3e7adbbee07579f553371e0a887da0b27db2ff6a18c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HHCTJHVOF226YK6JREXC53EQFF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Lie bracket approximation approach to distributed optimization: Extensions and limitations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Bahman Gharesifard, Christian Ebenbauer, Simon Michalowsky","submitted_at":"2018-02-28T16:27:45Z","abstract_excerpt":"We consider the problem of solving a smooth convex optimization problem with equality and inequality constraints in a distributed fashion. Assuming that we have a group of agents available capable of communicating over a communication network described by a time-invariant directed graph, we derive distributed continuous-time agent dynamics that ensure convergence to a neighborhood of the optimal solution of the optimization problem. Following the ideas introduced in our previous work, we combine saddle-point dynamics with Lie bracket approximation techniques. While the methodology was previous"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10519","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:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3c+bSWcfk8ceTeWAf6SM+u5hdNQCtsWborYm1Hi2NBCYm63fIK6ieO2KF06R4RaOJMCQT7EQN3WSVonOp+rDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:11:13.036128Z"},"content_sha256":"7eedd98cf2b1aa0d9363dc42ea17c5639c84f4b0b8a60496ba3b7bdee3dd5266","schema_version":"1.0","event_id":"sha256:7eedd98cf2b1aa0d9363dc42ea17c5639c84f4b0b8a60496ba3b7bdee3dd5266"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF/bundle.json","state_url":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHCTJHVOF226YK6JREXC53EQFF/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-27T16:11:13Z","links":{"resolver":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF","bundle":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF/bundle.json","state":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHCTJHVOF226YK6JREXC53EQFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HHCTJHVOF226YK6JREXC53EQFF","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":"48f2a14f651292870ecc0e7efa59645bc41c6d6c28e14d3c3bac2ffb399f3fd4","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-28T16:27:45Z","title_canon_sha256":"0215a0ee70a6818397c70201dae366679c51659a23fca04f7cb674d9c3c3401f"},"schema_version":"1.0","source":{"id":"1802.10519","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.10519","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1802.10519v1","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10519","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"HHCTJHVOF226","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HHCTJHVOF226YK6J","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HHCTJHVO","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:7eedd98cf2b1aa0d9363dc42ea17c5639c84f4b0b8a60496ba3b7bdee3dd5266","target":"graph","created_at":"2026-05-18T00:22:16Z","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 consider the problem of solving a smooth convex optimization problem with equality and inequality constraints in a distributed fashion. Assuming that we have a group of agents available capable of communicating over a communication network described by a time-invariant directed graph, we derive distributed continuous-time agent dynamics that ensure convergence to a neighborhood of the optimal solution of the optimization problem. Following the ideas introduced in our previous work, we combine saddle-point dynamics with Lie bracket approximation techniques. While the methodology was previous","authors_text":"Bahman Gharesifard, Christian Ebenbauer, Simon Michalowsky","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-28T16:27:45Z","title":"On the Lie bracket approximation approach to distributed optimization: Extensions and limitations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10519","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:06bde5a6c17b705fc4dc3e7adbbee07579f553371e0a887da0b27db2ff6a18c9","target":"record","created_at":"2026-05-18T00:22:16Z","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":"48f2a14f651292870ecc0e7efa59645bc41c6d6c28e14d3c3bac2ffb399f3fd4","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-28T16:27:45Z","title_canon_sha256":"0215a0ee70a6818397c70201dae366679c51659a23fca04f7cb674d9c3c3401f"},"schema_version":"1.0","source":{"id":"1802.10519","kind":"arxiv","version":1}},"canonical_sha256":"39c5349eae2eb5ec2bc9892e2eec9029738dac59b73169718185090294bd18c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39c5349eae2eb5ec2bc9892e2eec9029738dac59b73169718185090294bd18c5","first_computed_at":"2026-05-18T00:22:16.936945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:16.936945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yfdk9K85vAaBmztn7mFZ15B/ozM4eTsgEkBbHWPcfUcIG3+miC9C2MiOoNDhyNtLmpNCGarMyRprcUy2iznoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:16.937504Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.10519","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06bde5a6c17b705fc4dc3e7adbbee07579f553371e0a887da0b27db2ff6a18c9","sha256:7eedd98cf2b1aa0d9363dc42ea17c5639c84f4b0b8a60496ba3b7bdee3dd5266"],"state_sha256":"b1bf514431343af06ef496732479d37ab1b65b165b0b2c80f79ed8aa1722880c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4hircH/j4t5P5KgKbt+YUaOXcQj/uFM5vJvP51bxp0riogKfbgbyv5OGKTVNwBzGfY8Trw3WQfgsVImkdTqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:11:13.038086Z","bundle_sha256":"163a82f6d5c4a758717806233aa08129d487d14f4ca93eda7ac3c6982f837f1a"}}