{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BWIVPYWSTB5HFYRMVZAS37673H","short_pith_number":"pith:BWIVPYWS","schema_version":"1.0","canonical_sha256":"0d9157e2d2987a72e22cae412dffdfd9d7d3a6be18c309a40f5928d8790ac2d6","source":{"kind":"arxiv","id":"1711.05486","version":3},"attestation_state":"computed","paper":{"title":"A Lie bracket approximation approach to distributed optimization over directed graphs","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":"2017-11-15T10:16:41Z","abstract_excerpt":"We consider a group of computation units trying to cooperatively solve a distributed optimization problem with shared linear equality and inequality constraints. Assuming that the computation units are communicating over a network whose topology is described by a time-invariant directed graph, by combining saddle-point dynamics with Lie bracket approximation techniques we derive a methodology that allows to design distributed continuous-time optimization algorithms that solve this problem under minimal assumptions on the graph topology as well as on the structure of the constraints. We discuss"},"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":"1711.05486","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-15T10:16:41Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"0f7e6b6c28ca35177ae72da89062eec1ff13ca1bd32b3a73dea9529196ddd1e5","abstract_canon_sha256":"b063646ff1270cd9554951acd0855c30ce346597eb07d0cb9660a74edcd341c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:10.331513Z","signature_b64":"hUs50oxxluuQ8daKCL1LlKwB1ZesE25vZTUWieq/tBwaho26NqDaBZsIHrdWs0rwbchqDvKNkOGre6Bql3DUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d9157e2d2987a72e22cae412dffdfd9d7d3a6be18c309a40f5928d8790ac2d6","last_reissued_at":"2026-05-17T23:44:10.330519Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:10.330519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lie bracket approximation approach to distributed optimization over directed graphs","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":"2017-11-15T10:16:41Z","abstract_excerpt":"We consider a group of computation units trying to cooperatively solve a distributed optimization problem with shared linear equality and inequality constraints. Assuming that the computation units are communicating over a network whose topology is described by a time-invariant directed graph, by combining saddle-point dynamics with Lie bracket approximation techniques we derive a methodology that allows to design distributed continuous-time optimization algorithms that solve this problem under minimal assumptions on the graph topology as well as on the structure of the constraints. We discuss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05486","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.05486","created_at":"2026-05-17T23:44:10.330947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.05486v3","created_at":"2026-05-17T23:44:10.330947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05486","created_at":"2026-05-17T23:44:10.330947+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWIVPYWSTB5H","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWIVPYWSTB5HFYRM","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWIVPYWS","created_at":"2026-05-18T12:31:08.081275+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/BWIVPYWSTB5HFYRMVZAS37673H","json":"https://pith.science/pith/BWIVPYWSTB5HFYRMVZAS37673H.json","graph_json":"https://pith.science/api/pith-number/BWIVPYWSTB5HFYRMVZAS37673H/graph.json","events_json":"https://pith.science/api/pith-number/BWIVPYWSTB5HFYRMVZAS37673H/events.json","paper":"https://pith.science/paper/BWIVPYWS"},"agent_actions":{"view_html":"https://pith.science/pith/BWIVPYWSTB5HFYRMVZAS37673H","download_json":"https://pith.science/pith/BWIVPYWSTB5HFYRMVZAS37673H.json","view_paper":"https://pith.science/paper/BWIVPYWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.05486&json=true","fetch_graph":"https://pith.science/api/pith-number/BWIVPYWSTB5HFYRMVZAS37673H/graph.json","fetch_events":"https://pith.science/api/pith-number/BWIVPYWSTB5HFYRMVZAS37673H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWIVPYWSTB5HFYRMVZAS37673H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWIVPYWSTB5HFYRMVZAS37673H/action/storage_attestation","attest_author":"https://pith.science/pith/BWIVPYWSTB5HFYRMVZAS37673H/action/author_attestation","sign_citation":"https://pith.science/pith/BWIVPYWSTB5HFYRMVZAS37673H/action/citation_signature","submit_replication":"https://pith.science/pith/BWIVPYWSTB5HFYRMVZAS37673H/action/replication_record"}},"created_at":"2026-05-17T23:44:10.330947+00:00","updated_at":"2026-05-17T23:44:10.330947+00:00"}