{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VAL4K4TMANVGHQ34UYOLM52WXY","short_pith_number":"pith:VAL4K4TM","canonical_record":{"source":{"id":"1903.08588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-20T16:16:28Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"0630be6d644cf0666c90d59be06139a8b24a35e53b9483895d0ab55be41552b8","abstract_canon_sha256":"619d0df07bea66d652ee0f92a6761c4ac3148d5da7a51352a90ed9e39eede51d"},"schema_version":"1.0"},"canonical_sha256":"a817c5726c036a63c37ca61cb67756be25b5b699ac3c4038c8904fe6b2b157d3","source":{"kind":"arxiv","id":"1903.08588","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08588","created_at":"2026-05-17T23:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08588v2","created_at":"2026-05-17T23:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08588","created_at":"2026-05-17T23:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"VAL4K4TMANVG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VAL4K4TMANVGHQ34","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VAL4K4TM","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VAL4K4TMANVGHQ34UYOLM52WXY","target":"record","payload":{"canonical_record":{"source":{"id":"1903.08588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-20T16:16:28Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"0630be6d644cf0666c90d59be06139a8b24a35e53b9483895d0ab55be41552b8","abstract_canon_sha256":"619d0df07bea66d652ee0f92a6761c4ac3148d5da7a51352a90ed9e39eede51d"},"schema_version":"1.0"},"canonical_sha256":"a817c5726c036a63c37ca61cb67756be25b5b699ac3c4038c8904fe6b2b157d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:53.261536Z","signature_b64":"3dMu9rmOD14t7mK9vEx99pNRMLYpBqemjnRnuv8hJp7kgpqmIGIznBWWVLGM4dZnrgd0xNzhbJam0z8r38Y3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a817c5726c036a63c37ca61cb67756be25b5b699ac3c4038c8904fe6b2b157d3","last_reissued_at":"2026-05-17T23:41:53.261092Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:53.261092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.08588","source_version":2,"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:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUyDUbea1ydKc+FZyaQb14AB9QjKSvHCTuxe/rCcK2DT6aIXCJkvVvbfRWd/C2HgPSGLOI0JEhZnhX2wsOTTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:18:38.681561Z"},"content_sha256":"fcf5c9fa85464bf6530595b6f9245aa690d411fe1f777015c16f318f5c549013","schema_version":"1.0","event_id":"sha256:fcf5c9fa85464bf6530595b6f9245aa690d411fe1f777015c16f318f5c549013"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VAL4K4TMANVGHQ34UYOLM52WXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial-time Solution for Robust Registration with Extreme Outlier Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Heng Yang, Luca Carlone","submitted_at":"2019-03-20T16:16:28Z","abstract_excerpt":"We propose a robust approach for the registration of two sets of 3D points in the presence of a large amount of outliers. Our first contribution is to reformulate the registration problem using a Truncated Least Squares (TLS) cost that makes the estimation insensitive to a large fraction of spurious point-to-point correspondences. The second contribution is a general framework to decouple rotation, translation, and scale estimation, which allows solving in cascade for the three transformations. Since each subproblem (scale, rotation, and translation estimation) is still non-convex and combinat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08588","kind":"arxiv","version":2},"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:41:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0lSR7pzL5j5UStdbc0qXaqneRuNR/qHfZeSqhaLxOxqCEuvzeZQKUgxSwdcyyECdYIqVHi9UgPBYBrjWhNkaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:18:38.681907Z"},"content_sha256":"6201faf390c8cd5b6cd3425d95d520561bc106438e65c427026cbc542cc8cdb8","schema_version":"1.0","event_id":"sha256:6201faf390c8cd5b6cd3425d95d520561bc106438e65c427026cbc542cc8cdb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VAL4K4TMANVGHQ34UYOLM52WXY/bundle.json","state_url":"https://pith.science/pith/VAL4K4TMANVGHQ34UYOLM52WXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VAL4K4TMANVGHQ34UYOLM52WXY/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-02T01:18:38Z","links":{"resolver":"https://pith.science/pith/VAL4K4TMANVGHQ34UYOLM52WXY","bundle":"https://pith.science/pith/VAL4K4TMANVGHQ34UYOLM52WXY/bundle.json","state":"https://pith.science/pith/VAL4K4TMANVGHQ34UYOLM52WXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VAL4K4TMANVGHQ34UYOLM52WXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VAL4K4TMANVGHQ34UYOLM52WXY","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":"619d0df07bea66d652ee0f92a6761c4ac3148d5da7a51352a90ed9e39eede51d","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-20T16:16:28Z","title_canon_sha256":"0630be6d644cf0666c90d59be06139a8b24a35e53b9483895d0ab55be41552b8"},"schema_version":"1.0","source":{"id":"1903.08588","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08588","created_at":"2026-05-17T23:41:53Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08588v2","created_at":"2026-05-17T23:41:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08588","created_at":"2026-05-17T23:41:53Z"},{"alias_kind":"pith_short_12","alias_value":"VAL4K4TMANVG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VAL4K4TMANVGHQ34","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VAL4K4TM","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:6201faf390c8cd5b6cd3425d95d520561bc106438e65c427026cbc542cc8cdb8","target":"graph","created_at":"2026-05-17T23:41:53Z","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":"We propose a robust approach for the registration of two sets of 3D points in the presence of a large amount of outliers. Our first contribution is to reformulate the registration problem using a Truncated Least Squares (TLS) cost that makes the estimation insensitive to a large fraction of spurious point-to-point correspondences. The second contribution is a general framework to decouple rotation, translation, and scale estimation, which allows solving in cascade for the three transformations. Since each subproblem (scale, rotation, and translation estimation) is still non-convex and combinat","authors_text":"Heng Yang, Luca Carlone","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-20T16:16:28Z","title":"A Polynomial-time Solution for Robust Registration with Extreme Outlier Rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08588","kind":"arxiv","version":2},"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:fcf5c9fa85464bf6530595b6f9245aa690d411fe1f777015c16f318f5c549013","target":"record","created_at":"2026-05-17T23:41:53Z","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":"619d0df07bea66d652ee0f92a6761c4ac3148d5da7a51352a90ed9e39eede51d","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-03-20T16:16:28Z","title_canon_sha256":"0630be6d644cf0666c90d59be06139a8b24a35e53b9483895d0ab55be41552b8"},"schema_version":"1.0","source":{"id":"1903.08588","kind":"arxiv","version":2}},"canonical_sha256":"a817c5726c036a63c37ca61cb67756be25b5b699ac3c4038c8904fe6b2b157d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a817c5726c036a63c37ca61cb67756be25b5b699ac3c4038c8904fe6b2b157d3","first_computed_at":"2026-05-17T23:41:53.261092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:53.261092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3dMu9rmOD14t7mK9vEx99pNRMLYpBqemjnRnuv8hJp7kgpqmIGIznBWWVLGM4dZnrgd0xNzhbJam0z8r38Y3CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:53.261536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.08588","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcf5c9fa85464bf6530595b6f9245aa690d411fe1f777015c16f318f5c549013","sha256:6201faf390c8cd5b6cd3425d95d520561bc106438e65c427026cbc542cc8cdb8"],"state_sha256":"8409a4ea93aa7f14f1592ace043e0a3bf371f3c67c70090712d520aa9850cc21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x35bqBX+O5r0fEdb47ycp5owyLl3oy2CKSR5GMvuHy3iQjqLY/7MbqaPU0GrVieOE+8NURH5if/TKGASOfvLCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:18:38.683915Z","bundle_sha256":"842d44ecbbfa5c8b2c8802e7bdb73f1a04123eb69b0563f97edffb731a6e6a13"}}