{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6HMUAXQ5GAZLIW7V4CANQPJ4DQ","short_pith_number":"pith:6HMUAXQ5","schema_version":"1.0","canonical_sha256":"f1d9405e1d3032b45bf5e080d83d3c1c3d4c8e3c47bc1dd07652ab88d10a6541","source":{"kind":"arxiv","id":"2406.07371","version":1},"attestation_state":"computed","paper":{"title":"iMESA: Incremental Distributed Optimization for Collaborative Simultaneous Localization and Mapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Daniel McGann, Michael Kaess","submitted_at":"2024-06-11T15:40:44Z","abstract_excerpt":"This paper introduces a novel incremental distributed back-end algorithm for Collaborative Simultaneous Localization and Mapping (C-SLAM). For real-world deployments, robotic teams require algorithms to compute a consistent state estimate accurately, within online runtime constraints, and with potentially limited communication. Existing centralized, decentralized, and distributed approaches to solving C-SLAM problems struggle to achieve all of these goals. To address this capability gap, we present Incremental Manifold Edge-based Separable ADMM (iMESA) a fully distributed C-SLAM back-end algor"},"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":"2406.07371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-06-11T15:40:44Z","cross_cats_sorted":[],"title_canon_sha256":"9e8dac974464dfb4f5ada9e7f6fd127de734a2865aae37c981ab47b481245d19","abstract_canon_sha256":"c3bc98afb85a99393562b7ac3bd7bc9e09bc97392ced5b358ad2eccc3de91980"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:30:22.469562Z","signature_b64":"OFHpBCnKDhBb2uVY7xDqfHCvQHPDLV2Ap/4jIO3eaI27sCFzdj8MQ7B0YAZRyP/gDNF9hMm4U5ugSImAoMeiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1d9405e1d3032b45bf5e080d83d3c1c3d4c8e3c47bc1dd07652ab88d10a6541","last_reissued_at":"2026-07-05T08:30:22.469130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:30:22.469130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"iMESA: Incremental Distributed Optimization for Collaborative Simultaneous Localization and Mapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Daniel McGann, Michael Kaess","submitted_at":"2024-06-11T15:40:44Z","abstract_excerpt":"This paper introduces a novel incremental distributed back-end algorithm for Collaborative Simultaneous Localization and Mapping (C-SLAM). For real-world deployments, robotic teams require algorithms to compute a consistent state estimate accurately, within online runtime constraints, and with potentially limited communication. Existing centralized, decentralized, and distributed approaches to solving C-SLAM problems struggle to achieve all of these goals. To address this capability gap, we present Incremental Manifold Edge-based Separable ADMM (iMESA) a fully distributed C-SLAM back-end algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07371","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/2406.07371/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":"2406.07371","created_at":"2026-07-05T08:30:22.469195+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.07371v1","created_at":"2026-07-05T08:30:22.469195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07371","created_at":"2026-07-05T08:30:22.469195+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HMUAXQ5GAZL","created_at":"2026-07-05T08:30:22.469195+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HMUAXQ5GAZLIW7V","created_at":"2026-07-05T08:30:22.469195+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HMUAXQ5","created_at":"2026-07-05T08:30:22.469195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08735","citing_title":"Learning Adaptive Solvers for Distributed Factor Graph Optimization on Matrix Lie Groups","ref_index":110,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6HMUAXQ5GAZLIW7V4CANQPJ4DQ","json":"https://pith.science/pith/6HMUAXQ5GAZLIW7V4CANQPJ4DQ.json","graph_json":"https://pith.science/api/pith-number/6HMUAXQ5GAZLIW7V4CANQPJ4DQ/graph.json","events_json":"https://pith.science/api/pith-number/6HMUAXQ5GAZLIW7V4CANQPJ4DQ/events.json","paper":"https://pith.science/paper/6HMUAXQ5"},"agent_actions":{"view_html":"https://pith.science/pith/6HMUAXQ5GAZLIW7V4CANQPJ4DQ","download_json":"https://pith.science/pith/6HMUAXQ5GAZLIW7V4CANQPJ4DQ.json","view_paper":"https://pith.science/paper/6HMUAXQ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.07371&json=true","fetch_graph":"https://pith.science/api/pith-number/6HMUAXQ5GAZLIW7V4CANQPJ4DQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6HMUAXQ5GAZLIW7V4CANQPJ4DQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HMUAXQ5GAZLIW7V4CANQPJ4DQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HMUAXQ5GAZLIW7V4CANQPJ4DQ/action/storage_attestation","attest_author":"https://pith.science/pith/6HMUAXQ5GAZLIW7V4CANQPJ4DQ/action/author_attestation","sign_citation":"https://pith.science/pith/6HMUAXQ5GAZLIW7V4CANQPJ4DQ/action/citation_signature","submit_replication":"https://pith.science/pith/6HMUAXQ5GAZLIW7V4CANQPJ4DQ/action/replication_record"}},"created_at":"2026-07-05T08:30:22.469195+00:00","updated_at":"2026-07-05T08:30:22.469195+00:00"}