{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:E7VVO2GSSZEI5WHAT3EEO5ZCMD","short_pith_number":"pith:E7VVO2GS","canonical_record":{"source":{"id":"2110.08639","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2021-10-16T18:48:59Z","cross_cats_sorted":[],"title_canon_sha256":"9351b28bc457a6792c9f5c25d4acc86cd5229c1f2d443119f57277a43fa72c80","abstract_canon_sha256":"ed239e220449a65f8d69e5d7216c33bd49830d0716b439b4cf628e209f9a6e49"},"schema_version":"1.0"},"canonical_sha256":"27eb5768d296488ed8e09ec847772260e7fbc5693ff9fa6f66f2af1eadd456fe","source":{"kind":"arxiv","id":"2110.08639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.08639","created_at":"2026-07-05T03:23:18Z"},{"alias_kind":"arxiv_version","alias_value":"2110.08639v1","created_at":"2026-07-05T03:23:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.08639","created_at":"2026-07-05T03:23:18Z"},{"alias_kind":"pith_short_12","alias_value":"E7VVO2GSSZEI","created_at":"2026-07-05T03:23:18Z"},{"alias_kind":"pith_short_16","alias_value":"E7VVO2GSSZEI5WHA","created_at":"2026-07-05T03:23:18Z"},{"alias_kind":"pith_short_8","alias_value":"E7VVO2GS","created_at":"2026-07-05T03:23:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:E7VVO2GSSZEI5WHAT3EEO5ZCMD","target":"record","payload":{"canonical_record":{"source":{"id":"2110.08639","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2021-10-16T18:48:59Z","cross_cats_sorted":[],"title_canon_sha256":"9351b28bc457a6792c9f5c25d4acc86cd5229c1f2d443119f57277a43fa72c80","abstract_canon_sha256":"ed239e220449a65f8d69e5d7216c33bd49830d0716b439b4cf628e209f9a6e49"},"schema_version":"1.0"},"canonical_sha256":"27eb5768d296488ed8e09ec847772260e7fbc5693ff9fa6f66f2af1eadd456fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:18.887362Z","signature_b64":"Cn1y/xd5WM7gotdYdFg9CNrYs3Ge99mRtv4k7s5yLSqptqEKR8f2wH5HTpQftrqZ2r31ciiwKngIBjpvaB3wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27eb5768d296488ed8e09ec847772260e7fbc5693ff9fa6f66f2af1eadd456fe","last_reissued_at":"2026-07-05T03:23:18.886980Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:18.886980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.08639","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-07-05T03:23:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlrXyY7ipyZG+r3v5teBXcpb8r2SaDC5MsL7B4HeUKHMC+B8XWGk5WOCHM7mFcvaVqWsSMTqnPbyeybWMlRYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:21:33.122606Z"},"content_sha256":"3c4c6cc34079eb42b2e4d30e90581dcce47fa2c331f452baafbd1cdd65e510c6","schema_version":"1.0","event_id":"sha256:3c4c6cc34079eb42b2e4d30e90581dcce47fa2c331f452baafbd1cdd65e510c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:E7VVO2GSSZEI5WHAT3EEO5ZCMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial Hierarchical Pose Graph Optimization for SLAM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Alexander Korovko, Dmitry Robustov","submitted_at":"2021-10-16T18:48:59Z","abstract_excerpt":"In this paper we consider a hierarchical pose graph optimization (HPGO) for Simultaneous Localization and Mapping (SLAM). We propose a fast incremental procedure for building hierarchy levels in pose graphs. We study the properties of this procedure and show that our solution delivers high execution speed, high reduction rate and good flexibility. We propose a way to do partial hierarchical optimization and compare it to other optimization modes. We show that given a comparatively large amount of poses, partial HPGO gives a 10x speed up comparing to the original optimization, not sacrificing t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.08639","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/2110.08639/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"},"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-07-05T03:23:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5SX4nEMbFR2K9yHImuff+8zYjTsPe3ztepZ4xCeSpy60XBEBamdfK7GUgxBRV/Z7oesYBw4OWZUgI4coDCE1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:21:33.122963Z"},"content_sha256":"8ff473b9f2c9dea8973baabdf6363e05de005a0e781c01e045f488c40406a6c9","schema_version":"1.0","event_id":"sha256:8ff473b9f2c9dea8973baabdf6363e05de005a0e781c01e045f488c40406a6c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E7VVO2GSSZEI5WHAT3EEO5ZCMD/bundle.json","state_url":"https://pith.science/pith/E7VVO2GSSZEI5WHAT3EEO5ZCMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E7VVO2GSSZEI5WHAT3EEO5ZCMD/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-07-07T12:21:33Z","links":{"resolver":"https://pith.science/pith/E7VVO2GSSZEI5WHAT3EEO5ZCMD","bundle":"https://pith.science/pith/E7VVO2GSSZEI5WHAT3EEO5ZCMD/bundle.json","state":"https://pith.science/pith/E7VVO2GSSZEI5WHAT3EEO5ZCMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E7VVO2GSSZEI5WHAT3EEO5ZCMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:E7VVO2GSSZEI5WHAT3EEO5ZCMD","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":"ed239e220449a65f8d69e5d7216c33bd49830d0716b439b4cf628e209f9a6e49","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2021-10-16T18:48:59Z","title_canon_sha256":"9351b28bc457a6792c9f5c25d4acc86cd5229c1f2d443119f57277a43fa72c80"},"schema_version":"1.0","source":{"id":"2110.08639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.08639","created_at":"2026-07-05T03:23:18Z"},{"alias_kind":"arxiv_version","alias_value":"2110.08639v1","created_at":"2026-07-05T03:23:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.08639","created_at":"2026-07-05T03:23:18Z"},{"alias_kind":"pith_short_12","alias_value":"E7VVO2GSSZEI","created_at":"2026-07-05T03:23:18Z"},{"alias_kind":"pith_short_16","alias_value":"E7VVO2GSSZEI5WHA","created_at":"2026-07-05T03:23:18Z"},{"alias_kind":"pith_short_8","alias_value":"E7VVO2GS","created_at":"2026-07-05T03:23:18Z"}],"graph_snapshots":[{"event_id":"sha256:8ff473b9f2c9dea8973baabdf6363e05de005a0e781c01e045f488c40406a6c9","target":"graph","created_at":"2026-07-05T03:23:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.08639/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we consider a hierarchical pose graph optimization (HPGO) for Simultaneous Localization and Mapping (SLAM). We propose a fast incremental procedure for building hierarchy levels in pose graphs. We study the properties of this procedure and show that our solution delivers high execution speed, high reduction rate and good flexibility. We propose a way to do partial hierarchical optimization and compare it to other optimization modes. We show that given a comparatively large amount of poses, partial HPGO gives a 10x speed up comparing to the original optimization, not sacrificing t","authors_text":"Alexander Korovko, Dmitry Robustov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2021-10-16T18:48:59Z","title":"Partial Hierarchical Pose Graph Optimization for SLAM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.08639","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:3c4c6cc34079eb42b2e4d30e90581dcce47fa2c331f452baafbd1cdd65e510c6","target":"record","created_at":"2026-07-05T03:23:18Z","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":"ed239e220449a65f8d69e5d7216c33bd49830d0716b439b4cf628e209f9a6e49","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2021-10-16T18:48:59Z","title_canon_sha256":"9351b28bc457a6792c9f5c25d4acc86cd5229c1f2d443119f57277a43fa72c80"},"schema_version":"1.0","source":{"id":"2110.08639","kind":"arxiv","version":1}},"canonical_sha256":"27eb5768d296488ed8e09ec847772260e7fbc5693ff9fa6f66f2af1eadd456fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27eb5768d296488ed8e09ec847772260e7fbc5693ff9fa6f66f2af1eadd456fe","first_computed_at":"2026-07-05T03:23:18.886980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:23:18.886980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cn1y/xd5WM7gotdYdFg9CNrYs3Ge99mRtv4k7s5yLSqptqEKR8f2wH5HTpQftrqZ2r31ciiwKngIBjpvaB3wCg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:23:18.887362Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.08639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c4c6cc34079eb42b2e4d30e90581dcce47fa2c331f452baafbd1cdd65e510c6","sha256:8ff473b9f2c9dea8973baabdf6363e05de005a0e781c01e045f488c40406a6c9"],"state_sha256":"b36bf2c7b4fe58aa9a09732467a1f75e6b6f7f961547e159dc9397de75be1a1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8iFT2geW6u2JCMH31dhymlk28WzwN23nSg6fdizQRts4Rtx+ocUruJOhON9RnntVMCdTL/g/hc/E/+LvZiW2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T12:21:33.124788Z","bundle_sha256":"8305f450263337aaabddd4f233b26a45f6a4eb9b9fe2f6aa6943af5bd7d16f91"}}