{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7KWOIFA6GZZ5EYLXQGEDV2E5BC","short_pith_number":"pith:7KWOIFA6","schema_version":"1.0","canonical_sha256":"faace4141e3673d2617781883ae89d08a5eda134ba29022ce300ea7261320a8a","source":{"kind":"arxiv","id":"2203.00851","version":2},"attestation_state":"computed","paper":{"title":"Distributed Riemannian Optimization with Lazy Communication for Collaborative Geometric Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Alec Koppel, Amrit Singh Bedi, David M. Rosen, Jonathan P. How, Miguel Calvo-Fullana, Yulun Tian","submitted_at":"2022-03-02T03:52:49Z","abstract_excerpt":"We present the first distributed optimization algorithm with lazy communication for collaborative geometric estimation, the backbone of modern collaborative simultaneous localization and mapping (SLAM) and structure-from-motion (SfM) applications. Our method allows agents to cooperatively reconstruct a shared geometric model on a central server by fusing individual observations, but without the need to transmit potentially sensitive information about the agents themselves (such as their locations). Furthermore, to alleviate the burden of communication during iterative optimization, we design a"},"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":"2203.00851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-03-02T03:52:49Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"193e89b90ea1b00f1308c7ee1322720a2fd23bffce6a6b847f51bf782c05951f","abstract_canon_sha256":"8f8c15436de3b650f21b615d5c93ab4f03432997624e0e0f7bae91d1cd5a5910"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:44:42.828179Z","signature_b64":"IFcQ9fsFovcJ8nlY1K4rf/Vma8Oqj+LGOd8g6E434ePkpIhsyOfRIxZaZA1uKiJJShbJmqbXdlkVFh4+uVSwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faace4141e3673d2617781883ae89d08a5eda134ba29022ce300ea7261320a8a","last_reissued_at":"2026-07-05T04:44:42.827709Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:44:42.827709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Riemannian Optimization with Lazy Communication for Collaborative Geometric Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"Alec Koppel, Amrit Singh Bedi, David M. Rosen, Jonathan P. How, Miguel Calvo-Fullana, Yulun Tian","submitted_at":"2022-03-02T03:52:49Z","abstract_excerpt":"We present the first distributed optimization algorithm with lazy communication for collaborative geometric estimation, the backbone of modern collaborative simultaneous localization and mapping (SLAM) and structure-from-motion (SfM) applications. Our method allows agents to cooperatively reconstruct a shared geometric model on a central server by fusing individual observations, but without the need to transmit potentially sensitive information about the agents themselves (such as their locations). Furthermore, to alleviate the burden of communication during iterative optimization, we design a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00851","kind":"arxiv","version":2},"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/2203.00851/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":"2203.00851","created_at":"2026-07-05T04:44:42.827768+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.00851v2","created_at":"2026-07-05T04:44:42.827768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00851","created_at":"2026-07-05T04:44:42.827768+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KWOIFA6GZZ5","created_at":"2026-07-05T04:44:42.827768+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KWOIFA6GZZ5EYLX","created_at":"2026-07-05T04:44:42.827768+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KWOIFA6","created_at":"2026-07-05T04:44:42.827768+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24489","citing_title":"Decentralized Pose Graph Riemannian Optimization for Object-based Multi-Robot SLAM","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7KWOIFA6GZZ5EYLXQGEDV2E5BC","json":"https://pith.science/pith/7KWOIFA6GZZ5EYLXQGEDV2E5BC.json","graph_json":"https://pith.science/api/pith-number/7KWOIFA6GZZ5EYLXQGEDV2E5BC/graph.json","events_json":"https://pith.science/api/pith-number/7KWOIFA6GZZ5EYLXQGEDV2E5BC/events.json","paper":"https://pith.science/paper/7KWOIFA6"},"agent_actions":{"view_html":"https://pith.science/pith/7KWOIFA6GZZ5EYLXQGEDV2E5BC","download_json":"https://pith.science/pith/7KWOIFA6GZZ5EYLXQGEDV2E5BC.json","view_paper":"https://pith.science/paper/7KWOIFA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.00851&json=true","fetch_graph":"https://pith.science/api/pith-number/7KWOIFA6GZZ5EYLXQGEDV2E5BC/graph.json","fetch_events":"https://pith.science/api/pith-number/7KWOIFA6GZZ5EYLXQGEDV2E5BC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KWOIFA6GZZ5EYLXQGEDV2E5BC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KWOIFA6GZZ5EYLXQGEDV2E5BC/action/storage_attestation","attest_author":"https://pith.science/pith/7KWOIFA6GZZ5EYLXQGEDV2E5BC/action/author_attestation","sign_citation":"https://pith.science/pith/7KWOIFA6GZZ5EYLXQGEDV2E5BC/action/citation_signature","submit_replication":"https://pith.science/pith/7KWOIFA6GZZ5EYLXQGEDV2E5BC/action/replication_record"}},"created_at":"2026-07-05T04:44:42.827768+00:00","updated_at":"2026-07-05T04:44:42.827768+00:00"}