{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HHCTJHVOF226YK6JREXC53EQFF","short_pith_number":"pith:HHCTJHVO","schema_version":"1.0","canonical_sha256":"39c5349eae2eb5ec2bc9892e2eec9029738dac59b73169718185090294bd18c5","source":{"kind":"arxiv","id":"1802.10519","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.10519","created_at":"2026-05-18T00:22:16.937043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10519v1","created_at":"2026-05-18T00:22:16.937043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10519","created_at":"2026-05-18T00:22:16.937043+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHCTJHVOF226","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHCTJHVOF226YK6J","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHCTJHVO","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF","json":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF.json","graph_json":"https://pith.science/api/pith-number/HHCTJHVOF226YK6JREXC53EQFF/graph.json","events_json":"https://pith.science/api/pith-number/HHCTJHVOF226YK6JREXC53EQFF/events.json","paper":"https://pith.science/paper/HHCTJHVO"},"agent_actions":{"view_html":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF","download_json":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF.json","view_paper":"https://pith.science/paper/HHCTJHVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10519&json=true","fetch_graph":"https://pith.science/api/pith-number/HHCTJHVOF226YK6JREXC53EQFF/graph.json","fetch_events":"https://pith.science/api/pith-number/HHCTJHVOF226YK6JREXC53EQFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF/action/storage_attestation","attest_author":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF/action/author_attestation","sign_citation":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF/action/citation_signature","submit_replication":"https://pith.science/pith/HHCTJHVOF226YK6JREXC53EQFF/action/replication_record"}},"created_at":"2026-05-18T00:22:16.937043+00:00","updated_at":"2026-05-18T00:22:16.937043+00:00"}