{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QAU7MRJ72ZCIRGSBIIKID2CEN7","short_pith_number":"pith:QAU7MRJ7","schema_version":"1.0","canonical_sha256":"8029f6453fd644889a41421481e8446fc84d9628d6d154816e4584d4e6aca8ac","source":{"kind":"arxiv","id":"2308.08054","version":1},"attestation_state":"computed","paper":{"title":"Consensus on Lie groups for the Riemannian Center of Mass","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Mehran Mesbahi, Shahriar Talebi, Spencer Kraisler","submitted_at":"2023-08-15T21:49:32Z","abstract_excerpt":"In this paper, we develop a consensus algorithm for distributed computation of the Riemannian center of mass (RCM) on Lie Groups. The algorithm is built upon a distributed optimization reformulation that allows developing an intrinsic, distributed (without relying on a consensus subroutine), and a computationally efficient protocol for the RCM computation. The novel idea for developing this fast distributed algorithm is to utilize a Riemannian version of distributed gradient flow combined with a gradient tracking technique. We first guarantee that, under certain conditions, the limit point of "},"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":"2308.08054","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-15T21:49:32Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"7b08a949195f53aa1d9014e2c315f1719bb08229c6e9d354833c85fe9a3e86c8","abstract_canon_sha256":"9fbc8f060cb0d704a86dcad277091d0add1bba2ab9b7671a8f6443aba301c933"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:35.556060Z","signature_b64":"P6xuF7zk4Fgg8036ba44iQQxAj1Xh4Qe2Lq5qDCNsWrt1nZtGsy3U1G38NCZ9q2fs05N/URONVXXN+OzSXyWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8029f6453fd644889a41421481e8446fc84d9628d6d154816e4584d4e6aca8ac","last_reissued_at":"2026-07-05T06:44:35.555593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:35.555593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consensus on Lie groups for the Riemannian Center of Mass","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Mehran Mesbahi, Shahriar Talebi, Spencer Kraisler","submitted_at":"2023-08-15T21:49:32Z","abstract_excerpt":"In this paper, we develop a consensus algorithm for distributed computation of the Riemannian center of mass (RCM) on Lie Groups. The algorithm is built upon a distributed optimization reformulation that allows developing an intrinsic, distributed (without relying on a consensus subroutine), and a computationally efficient protocol for the RCM computation. The novel idea for developing this fast distributed algorithm is to utilize a Riemannian version of distributed gradient flow combined with a gradient tracking technique. We first guarantee that, under certain conditions, the limit point of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.08054","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.08054/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.08054","created_at":"2026-07-05T06:44:35.555651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.08054v1","created_at":"2026-07-05T06:44:35.555651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.08054","created_at":"2026-07-05T06:44:35.555651+00:00"},{"alias_kind":"pith_short_12","alias_value":"QAU7MRJ72ZCI","created_at":"2026-07-05T06:44:35.555651+00:00"},{"alias_kind":"pith_short_16","alias_value":"QAU7MRJ72ZCIRGSB","created_at":"2026-07-05T06:44:35.555651+00:00"},{"alias_kind":"pith_short_8","alias_value":"QAU7MRJ7","created_at":"2026-07-05T06:44:35.555651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00714","citing_title":"The Cartan-Topos Protocol: A Unified Geometric and Categorical Framework for Resilient Multi-Agent Coordination","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QAU7MRJ72ZCIRGSBIIKID2CEN7","json":"https://pith.science/pith/QAU7MRJ72ZCIRGSBIIKID2CEN7.json","graph_json":"https://pith.science/api/pith-number/QAU7MRJ72ZCIRGSBIIKID2CEN7/graph.json","events_json":"https://pith.science/api/pith-number/QAU7MRJ72ZCIRGSBIIKID2CEN7/events.json","paper":"https://pith.science/paper/QAU7MRJ7"},"agent_actions":{"view_html":"https://pith.science/pith/QAU7MRJ72ZCIRGSBIIKID2CEN7","download_json":"https://pith.science/pith/QAU7MRJ72ZCIRGSBIIKID2CEN7.json","view_paper":"https://pith.science/paper/QAU7MRJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.08054&json=true","fetch_graph":"https://pith.science/api/pith-number/QAU7MRJ72ZCIRGSBIIKID2CEN7/graph.json","fetch_events":"https://pith.science/api/pith-number/QAU7MRJ72ZCIRGSBIIKID2CEN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QAU7MRJ72ZCIRGSBIIKID2CEN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QAU7MRJ72ZCIRGSBIIKID2CEN7/action/storage_attestation","attest_author":"https://pith.science/pith/QAU7MRJ72ZCIRGSBIIKID2CEN7/action/author_attestation","sign_citation":"https://pith.science/pith/QAU7MRJ72ZCIRGSBIIKID2CEN7/action/citation_signature","submit_replication":"https://pith.science/pith/QAU7MRJ72ZCIRGSBIIKID2CEN7/action/replication_record"}},"created_at":"2026-07-05T06:44:35.555651+00:00","updated_at":"2026-07-05T06:44:35.555651+00:00"}