{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GR5QKOB7KO5NWZC554NGCPEBXK","short_pith_number":"pith:GR5QKOB7","canonical_record":{"source":{"id":"1908.08162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-22T01:24:09Z","cross_cats_sorted":[],"title_canon_sha256":"d11520a676801b2d2363eea5c661d87ab138eddc4ca9b693c01613e0cbe4ad16","abstract_canon_sha256":"8f0c05a6e598caedc6a90b69ff9a695dad2e2bf7f8575f05cacfc21e9cbc1b70"},"schema_version":"1.0"},"canonical_sha256":"347b05383f53badb645def1a613c81ba86f5fc1953d8063d7fc6798b04478a1c","source":{"kind":"arxiv","id":"1908.08162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08162","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08162v1","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08162","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"GR5QKOB7KO5N","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_16","alias_value":"GR5QKOB7KO5NWZC5","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_8","alias_value":"GR5QKOB7","created_at":"2026-07-04T23:59:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GR5QKOB7KO5NWZC554NGCPEBXK","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-22T01:24:09Z","cross_cats_sorted":[],"title_canon_sha256":"d11520a676801b2d2363eea5c661d87ab138eddc4ca9b693c01613e0cbe4ad16","abstract_canon_sha256":"8f0c05a6e598caedc6a90b69ff9a695dad2e2bf7f8575f05cacfc21e9cbc1b70"},"schema_version":"1.0"},"canonical_sha256":"347b05383f53badb645def1a613c81ba86f5fc1953d8063d7fc6798b04478a1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:10.131721Z","signature_b64":"QR+yQEwOCRA0b5Yen7TQ6PnVS0X3Op9R6zTBX6OFY6BXNKcoPlX/aSiCEY2nlq9h+dmv64LyRGdAMXOTD/DqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"347b05383f53badb645def1a613c81ba86f5fc1953d8063d7fc6798b04478a1c","last_reissued_at":"2026-07-04T23:59:10.131352Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:10.131352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08162","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-04T23:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IyViNo0PPHQSvMyfZijm2JwHi2dcndSIweg50FtScYkBadtVYJa8ZngsnpgxkmU4+B9AA/9EPpSIxTM+Hn0eDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:56:55.101329Z"},"content_sha256":"3a75fd0b2473f8b3c499f31692748423472833fae1dd2e62bc8cc6f64edefa29","schema_version":"1.0","event_id":"sha256:3a75fd0b2473f8b3c499f31692748423472833fae1dd2e62bc8cc6f64edefa29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GR5QKOB7KO5NWZC554NGCPEBXK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Globally optimal registration of noisy point clouds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Howie Choset, Rangaprasad Arun Srivatsan, Tejas Zodage","submitted_at":"2019-08-22T01:24:09Z","abstract_excerpt":"Registration of 3D point clouds is a fundamental task in several applications of robotics and computer vision. While registration methods such as iterative closest point and variants are very popular, they are only locally optimal. There has been some recent work on globally optimal registration, but they perform poorly in the presence of noise in the measurements. In this work we develop a mixed integer programming-based approach for globally optimal registration that explicitly considers uncertainty in its optimization, and hence produces more accurate estimates. Furthermore, from a practica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08162","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/1908.08162/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-04T23:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hgYXdLZDCqlF6N2AvH+fTS2Q90QggO1KvTPYpVG7zc1PKfOAoJWMmHCWO1OXOjnrh1Mlk3bH+eE3JlzvwFe3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:56:55.103539Z"},"content_sha256":"096276ab1060e939be2a22e774d9957f6acd8d5eeb7b4a8bf40da9336928acc4","schema_version":"1.0","event_id":"sha256:096276ab1060e939be2a22e774d9957f6acd8d5eeb7b4a8bf40da9336928acc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GR5QKOB7KO5NWZC554NGCPEBXK/bundle.json","state_url":"https://pith.science/pith/GR5QKOB7KO5NWZC554NGCPEBXK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GR5QKOB7KO5NWZC554NGCPEBXK/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-08-16T10:56:55Z","links":{"resolver":"https://pith.science/pith/GR5QKOB7KO5NWZC554NGCPEBXK","bundle":"https://pith.science/pith/GR5QKOB7KO5NWZC554NGCPEBXK/bundle.json","state":"https://pith.science/pith/GR5QKOB7KO5NWZC554NGCPEBXK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GR5QKOB7KO5NWZC554NGCPEBXK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GR5QKOB7KO5NWZC554NGCPEBXK","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":"8f0c05a6e598caedc6a90b69ff9a695dad2e2bf7f8575f05cacfc21e9cbc1b70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-22T01:24:09Z","title_canon_sha256":"d11520a676801b2d2363eea5c661d87ab138eddc4ca9b693c01613e0cbe4ad16"},"schema_version":"1.0","source":{"id":"1908.08162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08162","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08162v1","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08162","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"GR5QKOB7KO5N","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_16","alias_value":"GR5QKOB7KO5NWZC5","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_8","alias_value":"GR5QKOB7","created_at":"2026-07-04T23:59:10Z"}],"graph_snapshots":[{"event_id":"sha256:096276ab1060e939be2a22e774d9957f6acd8d5eeb7b4a8bf40da9336928acc4","target":"graph","created_at":"2026-07-04T23:59:10Z","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/1908.08162/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Registration of 3D point clouds is a fundamental task in several applications of robotics and computer vision. While registration methods such as iterative closest point and variants are very popular, they are only locally optimal. There has been some recent work on globally optimal registration, but they perform poorly in the presence of noise in the measurements. In this work we develop a mixed integer programming-based approach for globally optimal registration that explicitly considers uncertainty in its optimization, and hence produces more accurate estimates. Furthermore, from a practica","authors_text":"Howie Choset, Rangaprasad Arun Srivatsan, Tejas Zodage","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-22T01:24:09Z","title":"Globally optimal registration of noisy point clouds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08162","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:3a75fd0b2473f8b3c499f31692748423472833fae1dd2e62bc8cc6f64edefa29","target":"record","created_at":"2026-07-04T23:59:10Z","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":"8f0c05a6e598caedc6a90b69ff9a695dad2e2bf7f8575f05cacfc21e9cbc1b70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-22T01:24:09Z","title_canon_sha256":"d11520a676801b2d2363eea5c661d87ab138eddc4ca9b693c01613e0cbe4ad16"},"schema_version":"1.0","source":{"id":"1908.08162","kind":"arxiv","version":1}},"canonical_sha256":"347b05383f53badb645def1a613c81ba86f5fc1953d8063d7fc6798b04478a1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"347b05383f53badb645def1a613c81ba86f5fc1953d8063d7fc6798b04478a1c","first_computed_at":"2026-07-04T23:59:10.131352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:10.131352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QR+yQEwOCRA0b5Yen7TQ6PnVS0X3Op9R6zTBX6OFY6BXNKcoPlX/aSiCEY2nlq9h+dmv64LyRGdAMXOTD/DqAw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:10.131721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a75fd0b2473f8b3c499f31692748423472833fae1dd2e62bc8cc6f64edefa29","sha256:096276ab1060e939be2a22e774d9957f6acd8d5eeb7b4a8bf40da9336928acc4"],"state_sha256":"4cdf62196d230a48136386eadbefc41163bf6e2f5534073a9631595e6ce003e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BvdrnSi8zJ3BvJuF2WWlR6COE7dcHPeHTCR47Ft02KccbprNNJPISlwE5jGntr++tVEtVVvy72iciAW2reZMCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T10:56:55.122390Z","bundle_sha256":"e09dcfe3df0b587fc5d9d588267cb80c599b031924d4dc4f82f0bbbd3aab0652"}}