{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TB3P7U7QQ2YTBPTC24AJGDXWPZ","short_pith_number":"pith:TB3P7U7Q","schema_version":"1.0","canonical_sha256":"9876ffd3f086b130be62d700930ef67e4257399d13ccb7877fd2119c31a64515","source":{"kind":"arxiv","id":"2508.16731","version":2},"attestation_state":"computed","paper":{"title":"COSMO-Bench: A Benchmark for Collaborative SLAM Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Daniel McGann, Easton R. Potokar, Michael Kaess","submitted_at":"2025-08-22T18:13:03Z","abstract_excerpt":"Recent years have seen a focus on research into distributed optimization algorithms for multi-robot Collaborative Simultaneous Localization and Mapping (C-SLAM). Research in this domain, however, is made difficult by a lack of standard benchmark datasets. Such datasets have been used to great effect in the field of single-robot SLAM, and researchers focused on multi-robot problems would benefit greatly from dedicated benchmark datasets. To address this gap, we design and release the Collaborative Open-Source Multi-robot Optimization Benchmark (COSMO-Bench) -- a suite of 24 datasets derived fro"},"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":"2508.16731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-08-22T18:13:03Z","cross_cats_sorted":[],"title_canon_sha256":"c1e31f04629bcf4c80ed6dddf7f13f71b86e9596cb6a3be0b831d989c6b66d86","abstract_canon_sha256":"ed0a080a2cf808b90f3c167d0ad62d93a14f5df4343132be92c807d7b020705a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:20.031527Z","signature_b64":"NBiUZo3RgTCeq0nHnKe/2fJ1lC0QKayVCpqyp4mascvhIpuOMgmmHyFTYOb9mKY0gaiQjc40LjBwfe2AVHhHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9876ffd3f086b130be62d700930ef67e4257399d13ccb7877fd2119c31a64515","last_reissued_at":"2026-07-05T12:11:20.031046Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:20.031046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"COSMO-Bench: A Benchmark for Collaborative SLAM Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Daniel McGann, Easton R. Potokar, Michael Kaess","submitted_at":"2025-08-22T18:13:03Z","abstract_excerpt":"Recent years have seen a focus on research into distributed optimization algorithms for multi-robot Collaborative Simultaneous Localization and Mapping (C-SLAM). Research in this domain, however, is made difficult by a lack of standard benchmark datasets. Such datasets have been used to great effect in the field of single-robot SLAM, and researchers focused on multi-robot problems would benefit greatly from dedicated benchmark datasets. To address this gap, we design and release the Collaborative Open-Source Multi-robot Optimization Benchmark (COSMO-Bench) -- a suite of 24 datasets derived fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.16731","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/2508.16731/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":"2508.16731","created_at":"2026-07-05T12:11:20.031105+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.16731v2","created_at":"2026-07-05T12:11:20.031105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.16731","created_at":"2026-07-05T12:11:20.031105+00:00"},{"alias_kind":"pith_short_12","alias_value":"TB3P7U7QQ2YT","created_at":"2026-07-05T12:11:20.031105+00:00"},{"alias_kind":"pith_short_16","alias_value":"TB3P7U7QQ2YTBPTC","created_at":"2026-07-05T12:11:20.031105+00:00"},{"alias_kind":"pith_short_8","alias_value":"TB3P7U7Q","created_at":"2026-07-05T12:11:20.031105+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":177,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TB3P7U7QQ2YTBPTC24AJGDXWPZ","json":"https://pith.science/pith/TB3P7U7QQ2YTBPTC24AJGDXWPZ.json","graph_json":"https://pith.science/api/pith-number/TB3P7U7QQ2YTBPTC24AJGDXWPZ/graph.json","events_json":"https://pith.science/api/pith-number/TB3P7U7QQ2YTBPTC24AJGDXWPZ/events.json","paper":"https://pith.science/paper/TB3P7U7Q"},"agent_actions":{"view_html":"https://pith.science/pith/TB3P7U7QQ2YTBPTC24AJGDXWPZ","download_json":"https://pith.science/pith/TB3P7U7QQ2YTBPTC24AJGDXWPZ.json","view_paper":"https://pith.science/paper/TB3P7U7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.16731&json=true","fetch_graph":"https://pith.science/api/pith-number/TB3P7U7QQ2YTBPTC24AJGDXWPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TB3P7U7QQ2YTBPTC24AJGDXWPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TB3P7U7QQ2YTBPTC24AJGDXWPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TB3P7U7QQ2YTBPTC24AJGDXWPZ/action/storage_attestation","attest_author":"https://pith.science/pith/TB3P7U7QQ2YTBPTC24AJGDXWPZ/action/author_attestation","sign_citation":"https://pith.science/pith/TB3P7U7QQ2YTBPTC24AJGDXWPZ/action/citation_signature","submit_replication":"https://pith.science/pith/TB3P7U7QQ2YTBPTC24AJGDXWPZ/action/replication_record"}},"created_at":"2026-07-05T12:11:20.031105+00:00","updated_at":"2026-07-05T12:11:20.031105+00:00"}