{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DCAFY3H52G45NGMVLCRNYA2TJ5","short_pith_number":"pith:DCAFY3H5","schema_version":"1.0","canonical_sha256":"18805c6cfdd1b9d6999558a2dc03534f40c647942cfba6f1e921235eb9967743","source":{"kind":"arxiv","id":"1806.00188","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Budgeted Data Exchange for Distributed Loop Closure Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.RO","authors_text":"Jonathan Kelly, Jonathan P. How, Kasra Khosoussi, Matthew Giamou, Yulun Tian","submitted_at":"2018-06-01T04:35:16Z","abstract_excerpt":"Inter-robot loop closure detection is a core problem in collaborative SLAM (CSLAM). Establishing inter-robot loop closures is a resource-demanding process, during which robots must consume a substantial amount of mission-critical resources (e.g., battery and bandwidth) to exchange sensory data. However, even with the most resource-efficient techniques, the resources available onboard may be insufficient for verifying every potential loop closure. This work addresses this critical challenge by proposing a resource-adaptive framework for distributed loop closure detection. We seek to maximize ta"},"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":"1806.00188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-06-01T04:35:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b9bc4273fb0d73cf9afc5f9446ca6c57c6ceb82fbde525b3f70c655c78d00468","abstract_canon_sha256":"68ee4badbcad8e2e77092b1a5d8af6c6b252a23cd5def0b5757699d42b95ee41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:27.696328Z","signature_b64":"bmT7V9hrv8VHX0N1Ocmp5L7pZE0vngKV+h/VCjf/BE/253KjdM4PQJseHOhNtGkNyuAywv08TEzVUK75Q8u9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18805c6cfdd1b9d6999558a2dc03534f40c647942cfba6f1e921235eb9967743","last_reissued_at":"2026-05-18T00:14:27.695636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:27.695636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Budgeted Data Exchange for Distributed Loop Closure Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.RO","authors_text":"Jonathan Kelly, Jonathan P. How, Kasra Khosoussi, Matthew Giamou, Yulun Tian","submitted_at":"2018-06-01T04:35:16Z","abstract_excerpt":"Inter-robot loop closure detection is a core problem in collaborative SLAM (CSLAM). Establishing inter-robot loop closures is a resource-demanding process, during which robots must consume a substantial amount of mission-critical resources (e.g., battery and bandwidth) to exchange sensory data. However, even with the most resource-efficient techniques, the resources available onboard may be insufficient for verifying every potential loop closure. This work addresses this critical challenge by proposing a resource-adaptive framework for distributed loop closure detection. We seek to maximize ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00188","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":""},"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":"1806.00188","created_at":"2026-05-18T00:14:27.695738+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00188v1","created_at":"2026-05-18T00:14:27.695738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00188","created_at":"2026-05-18T00:14:27.695738+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCAFY3H52G45","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCAFY3H52G45NGMV","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCAFY3H5","created_at":"2026-05-18T12:32:19.392346+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/DCAFY3H52G45NGMVLCRNYA2TJ5","json":"https://pith.science/pith/DCAFY3H52G45NGMVLCRNYA2TJ5.json","graph_json":"https://pith.science/api/pith-number/DCAFY3H52G45NGMVLCRNYA2TJ5/graph.json","events_json":"https://pith.science/api/pith-number/DCAFY3H52G45NGMVLCRNYA2TJ5/events.json","paper":"https://pith.science/paper/DCAFY3H5"},"agent_actions":{"view_html":"https://pith.science/pith/DCAFY3H52G45NGMVLCRNYA2TJ5","download_json":"https://pith.science/pith/DCAFY3H52G45NGMVLCRNYA2TJ5.json","view_paper":"https://pith.science/paper/DCAFY3H5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00188&json=true","fetch_graph":"https://pith.science/api/pith-number/DCAFY3H52G45NGMVLCRNYA2TJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/DCAFY3H52G45NGMVLCRNYA2TJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCAFY3H52G45NGMVLCRNYA2TJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCAFY3H52G45NGMVLCRNYA2TJ5/action/storage_attestation","attest_author":"https://pith.science/pith/DCAFY3H52G45NGMVLCRNYA2TJ5/action/author_attestation","sign_citation":"https://pith.science/pith/DCAFY3H52G45NGMVLCRNYA2TJ5/action/citation_signature","submit_replication":"https://pith.science/pith/DCAFY3H52G45NGMVLCRNYA2TJ5/action/replication_record"}},"created_at":"2026-05-18T00:14:27.695738+00:00","updated_at":"2026-05-18T00:14:27.695738+00:00"}