{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3KLRFSGCLBGN2LN2WM42UWE3ZG","short_pith_number":"pith:3KLRFSGC","canonical_record":{"source":{"id":"1901.05925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-01-17T17:44:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"23e6dfa6ba8e35992e2a8073e0189d313cb897784814610e0ae4f8b5111d3d24","abstract_canon_sha256":"71406c981664a11ab063c2a7aaa8749effff733c60ad0d0bb94f6631df94db89"},"schema_version":"1.0"},"canonical_sha256":"da9712c8c2584cdd2dbab339aa589bc9908a5714e9c28bad74a7b33f5134cf58","source":{"kind":"arxiv","id":"1901.05925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05925","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05925v1","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05925","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"3KLRFSGCLBGN","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3KLRFSGCLBGN2LN2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3KLRFSGC","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3KLRFSGCLBGN2LN2WM42UWE3ZG","target":"record","payload":{"canonical_record":{"source":{"id":"1901.05925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-01-17T17:44:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"23e6dfa6ba8e35992e2a8073e0189d313cb897784814610e0ae4f8b5111d3d24","abstract_canon_sha256":"71406c981664a11ab063c2a7aaa8749effff733c60ad0d0bb94f6631df94db89"},"schema_version":"1.0"},"canonical_sha256":"da9712c8c2584cdd2dbab339aa589bc9908a5714e9c28bad74a7b33f5134cf58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:05.781195Z","signature_b64":"OsIuToljcJ8Hf0DGOoVb8mnO+WEswtuxWUJCLXjk2j4gy/vbwwYggp0j/aI5GHY4OAKItRaJjMFaVmuMxhFwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da9712c8c2584cdd2dbab339aa589bc9908a5714e9c28bad74a7b33f5134cf58","last_reissued_at":"2026-05-17T23:56:05.780686Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:05.780686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.05925","source_version":1,"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-17T23:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O3w47xoDj0YO0ffzKneSz6ZEJ/Ij+FQLyJ+mpiEuOyFgCNhhqmwpegGrTsAtHtdCOBCMN3cGlhAuShThCapYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:03:30.591549Z"},"content_sha256":"8702be301ae129ea1002bd3546074b0605c98b892d288e3dddc06344a79adea8","schema_version":"1.0","event_id":"sha256:8702be301ae129ea1002bd3546074b0605c98b892d288e3dddc06344a79adea8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3KLRFSGCLBGN2LN2WM42UWE3ZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource-Aware Algorithms for Distributed Loop Closure Detection with Provable Performance Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.RO","authors_text":"Jonathan P. How, Kasra Khosoussi, Yulun Tian","submitted_at":"2019-01-17T17:44:10Z","abstract_excerpt":"Inter-robot loop closure detection, e.g., for collaborative simultaneous localization and mapping (CSLAM), is a fundamental capability for many multirobot applications in GPS-denied regimes. In real-world scenarios, this is a resource-intensive process that involves exchanging observations and verifying potential matches. This poses severe challenges especially for small-size and low-cost robots with various operational and resource constraints that limit, e.g., energy consumption, communication bandwidth, and computation capacity. This paper presents resource-aware algorithms for distributed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05925","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"},"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-17T23:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOENl9M3HKdAoaYXZMDQZerJikk8Rq19vyajau8L7sNeUnkhWZC+7pUMjSxDdLGxv4Ydrs2yiYgPeRsKniQwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:03:30.592150Z"},"content_sha256":"1eff6ecd379b2e191525c8a40c8dca2eb612cb6db3dc590a83da77757a7421f0","schema_version":"1.0","event_id":"sha256:1eff6ecd379b2e191525c8a40c8dca2eb612cb6db3dc590a83da77757a7421f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3KLRFSGCLBGN2LN2WM42UWE3ZG/bundle.json","state_url":"https://pith.science/pith/3KLRFSGCLBGN2LN2WM42UWE3ZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3KLRFSGCLBGN2LN2WM42UWE3ZG/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-05-28T20:03:30Z","links":{"resolver":"https://pith.science/pith/3KLRFSGCLBGN2LN2WM42UWE3ZG","bundle":"https://pith.science/pith/3KLRFSGCLBGN2LN2WM42UWE3ZG/bundle.json","state":"https://pith.science/pith/3KLRFSGCLBGN2LN2WM42UWE3ZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3KLRFSGCLBGN2LN2WM42UWE3ZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3KLRFSGCLBGN2LN2WM42UWE3ZG","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":"71406c981664a11ab063c2a7aaa8749effff733c60ad0d0bb94f6631df94db89","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-01-17T17:44:10Z","title_canon_sha256":"23e6dfa6ba8e35992e2a8073e0189d313cb897784814610e0ae4f8b5111d3d24"},"schema_version":"1.0","source":{"id":"1901.05925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05925","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05925v1","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05925","created_at":"2026-05-17T23:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"3KLRFSGCLBGN","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3KLRFSGCLBGN2LN2","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3KLRFSGC","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:1eff6ecd379b2e191525c8a40c8dca2eb612cb6db3dc590a83da77757a7421f0","target":"graph","created_at":"2026-05-17T23:56:05Z","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":"Inter-robot loop closure detection, e.g., for collaborative simultaneous localization and mapping (CSLAM), is a fundamental capability for many multirobot applications in GPS-denied regimes. In real-world scenarios, this is a resource-intensive process that involves exchanging observations and verifying potential matches. This poses severe challenges especially for small-size and low-cost robots with various operational and resource constraints that limit, e.g., energy consumption, communication bandwidth, and computation capacity. This paper presents resource-aware algorithms for distributed ","authors_text":"Jonathan P. How, Kasra Khosoussi, Yulun Tian","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-01-17T17:44:10Z","title":"Resource-Aware Algorithms for Distributed Loop Closure Detection with Provable Performance Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05925","kind":"arxiv","version":1},"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:8702be301ae129ea1002bd3546074b0605c98b892d288e3dddc06344a79adea8","target":"record","created_at":"2026-05-17T23:56:05Z","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":"71406c981664a11ab063c2a7aaa8749effff733c60ad0d0bb94f6631df94db89","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-01-17T17:44:10Z","title_canon_sha256":"23e6dfa6ba8e35992e2a8073e0189d313cb897784814610e0ae4f8b5111d3d24"},"schema_version":"1.0","source":{"id":"1901.05925","kind":"arxiv","version":1}},"canonical_sha256":"da9712c8c2584cdd2dbab339aa589bc9908a5714e9c28bad74a7b33f5134cf58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da9712c8c2584cdd2dbab339aa589bc9908a5714e9c28bad74a7b33f5134cf58","first_computed_at":"2026-05-17T23:56:05.780686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:05.780686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OsIuToljcJ8Hf0DGOoVb8mnO+WEswtuxWUJCLXjk2j4gy/vbwwYggp0j/aI5GHY4OAKItRaJjMFaVmuMxhFwAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:05.781195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8702be301ae129ea1002bd3546074b0605c98b892d288e3dddc06344a79adea8","sha256:1eff6ecd379b2e191525c8a40c8dca2eb612cb6db3dc590a83da77757a7421f0"],"state_sha256":"338e750d6e1dc59344012a972616e4cc764cf3c3f46a75ac8c156b6aaf555184"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Acc7+X50wBCzrL5pY9o4VB74F7V80snRD7xNbfS8hftQsz3e89e8aHifE/PKvf04yM/dwvvjA2uGNicp3kmzDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:03:30.595764Z","bundle_sha256":"ec84cbd9bc35cfd126cfd1d85c38849625e519b2776c8815b6ca90a177e16810"}}