{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GXUALDT6JBKVLFKWOMOXMXGMNG","short_pith_number":"pith:GXUALDT6","canonical_record":{"source":{"id":"1709.06675","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-19T23:15:24Z","cross_cats_sorted":[],"title_canon_sha256":"d78f180bc463f4cbd9c71820039a0a6cb432be0c7b1d7c44e5b1f8b8247ef7bd","abstract_canon_sha256":"64c67f10b9bae62b05d40df8ca0740ab773962af2de4fe227af3e355edfd9de4"},"schema_version":"1.0"},"canonical_sha256":"35e8058e7e4855559556731d765ccc69884b3375ccb2fd130dc47fdc951abab3","source":{"kind":"arxiv","id":"1709.06675","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06675","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06675v4","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06675","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"GXUALDT6JBKV","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GXUALDT6JBKVLFKW","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GXUALDT6","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GXUALDT6JBKVLFKWOMOXMXGMNG","target":"record","payload":{"canonical_record":{"source":{"id":"1709.06675","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-19T23:15:24Z","cross_cats_sorted":[],"title_canon_sha256":"d78f180bc463f4cbd9c71820039a0a6cb432be0c7b1d7c44e5b1f8b8247ef7bd","abstract_canon_sha256":"64c67f10b9bae62b05d40df8ca0740ab773962af2de4fe227af3e355edfd9de4"},"schema_version":"1.0"},"canonical_sha256":"35e8058e7e4855559556731d765ccc69884b3375ccb2fd130dc47fdc951abab3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:34.693467Z","signature_b64":"+6U9l341b+52SZzp9lfU9CsnWYlTj0nz30Mt29ixrkV9mcxFdd85KH94ngYobEh7buLU4umsGR1Fns7ojvdKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35e8058e7e4855559556731d765ccc69884b3375ccb2fd130dc47fdc951abab3","last_reissued_at":"2026-05-18T00:21:34.692808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:34.692808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.06675","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lREDf0MriDi2UaV24eWZ6DTxPGQ52iq5ZVAKRGlphktlA4h/qMb6KNZ/0cttLR4NY5CeD5P+/RnhT8hTbpD8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T07:19:37.750091Z"},"content_sha256":"e07924c9841d6d63097ec6d3f6f1aa0f9df9fa492db0ba0f05aba8c33f96147d","schema_version":"1.0","event_id":"sha256:e07924c9841d6d63097ec6d3f6f1aa0f9df9fa492db0ba0f05aba8c33f96147d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GXUALDT6JBKVLFKWOMOXMXGMNG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Talk Resource-Efficiently to Me: Optimal Communication Planning for Distributed Loop Closure Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jonathan P. How, Kasra Khosoussi, Matthew Giamou","submitted_at":"2017-09-19T23:15:24Z","abstract_excerpt":"Due to the distributed nature of cooperative simultaneous localization and mapping (CSLAM), detecting inter-robot loop closures necessitates sharing sensory data with other robots. A na\\\"{\\i}ve approach to data sharing can easily lead to a waste of mission-critical resources. This paper investigates the logistical aspects of CSLAM. Particularly, we present a general resource-efficient communication planning framework that takes into account both the total amount of exchanged data and the induced division of labor between the participating robots. Compared to other state-of-the-art approaches, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06675","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S/AWWo2Ha327xN9iiH3k9uAoSJ2KLLd+WKSNoPwGbSi8GkXa8D5Vi5vCwCgvJXMUgXkOiAjxELQofBpK7oK8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T07:19:37.750451Z"},"content_sha256":"647046a55454b8a9ad2ec40e0e59215e3632df57eeaecfbfba5890353a31b786","schema_version":"1.0","event_id":"sha256:647046a55454b8a9ad2ec40e0e59215e3632df57eeaecfbfba5890353a31b786"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXUALDT6JBKVLFKWOMOXMXGMNG/bundle.json","state_url":"https://pith.science/pith/GXUALDT6JBKVLFKWOMOXMXGMNG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXUALDT6JBKVLFKWOMOXMXGMNG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T07:19:37Z","links":{"resolver":"https://pith.science/pith/GXUALDT6JBKVLFKWOMOXMXGMNG","bundle":"https://pith.science/pith/GXUALDT6JBKVLFKWOMOXMXGMNG/bundle.json","state":"https://pith.science/pith/GXUALDT6JBKVLFKWOMOXMXGMNG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXUALDT6JBKVLFKWOMOXMXGMNG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GXUALDT6JBKVLFKWOMOXMXGMNG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"64c67f10b9bae62b05d40df8ca0740ab773962af2de4fe227af3e355edfd9de4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-19T23:15:24Z","title_canon_sha256":"d78f180bc463f4cbd9c71820039a0a6cb432be0c7b1d7c44e5b1f8b8247ef7bd"},"schema_version":"1.0","source":{"id":"1709.06675","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06675","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06675v4","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06675","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"GXUALDT6JBKV","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GXUALDT6JBKVLFKW","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GXUALDT6","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:647046a55454b8a9ad2ec40e0e59215e3632df57eeaecfbfba5890353a31b786","target":"graph","created_at":"2026-05-18T00:21:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Due to the distributed nature of cooperative simultaneous localization and mapping (CSLAM), detecting inter-robot loop closures necessitates sharing sensory data with other robots. A na\\\"{\\i}ve approach to data sharing can easily lead to a waste of mission-critical resources. This paper investigates the logistical aspects of CSLAM. Particularly, we present a general resource-efficient communication planning framework that takes into account both the total amount of exchanged data and the induced division of labor between the participating robots. Compared to other state-of-the-art approaches, ","authors_text":"Jonathan P. How, Kasra Khosoussi, Matthew Giamou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-19T23:15:24Z","title":"Talk Resource-Efficiently to Me: Optimal Communication Planning for Distributed Loop Closure Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06675","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e07924c9841d6d63097ec6d3f6f1aa0f9df9fa492db0ba0f05aba8c33f96147d","target":"record","created_at":"2026-05-18T00:21:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"64c67f10b9bae62b05d40df8ca0740ab773962af2de4fe227af3e355edfd9de4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-09-19T23:15:24Z","title_canon_sha256":"d78f180bc463f4cbd9c71820039a0a6cb432be0c7b1d7c44e5b1f8b8247ef7bd"},"schema_version":"1.0","source":{"id":"1709.06675","kind":"arxiv","version":4}},"canonical_sha256":"35e8058e7e4855559556731d765ccc69884b3375ccb2fd130dc47fdc951abab3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35e8058e7e4855559556731d765ccc69884b3375ccb2fd130dc47fdc951abab3","first_computed_at":"2026-05-18T00:21:34.692808Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:34.692808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+6U9l341b+52SZzp9lfU9CsnWYlTj0nz30Mt29ixrkV9mcxFdd85KH94ngYobEh7buLU4umsGR1Fns7ojvdKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:34.693467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06675","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e07924c9841d6d63097ec6d3f6f1aa0f9df9fa492db0ba0f05aba8c33f96147d","sha256:647046a55454b8a9ad2ec40e0e59215e3632df57eeaecfbfba5890353a31b786"],"state_sha256":"fe1ff62a3e102af8f675f876ef9f76a80e80e198e0d6880f9e18d7c8bb3e045d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5bvrJTKI9q58AL0C4XHZKRfnk80t95Z70tl070djYpeOaueMLYswdJMswk41YKSJdOR9xNaITfA+/Sq1fhYECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T07:19:37.752268Z","bundle_sha256":"8eedf3755903b6c484c3599661b20c2b781417bc2fb0e0dbfa92a561c211a2ae"}}