{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:H3DHLOVAECGZH75ENH5WZSVE5L","short_pith_number":"pith:H3DHLOVA","canonical_record":{"source":{"id":"2208.11327","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2022-08-24T06:49:43Z","cross_cats_sorted":[],"title_canon_sha256":"871196ae54712d6c768dbd688dc6d1de74d5f5b9c291ffdec34cb4f6848a519e","abstract_canon_sha256":"60b347f7fe7a7a41fb46f401bdb80885d873b3277b4c58b3cf69f4691618ef69"},"schema_version":"1.0"},"canonical_sha256":"3ec675baa0208d93ffa469fb6ccaa4eacf65cbe3c5e14072a0663d19587db9ad","source":{"kind":"arxiv","id":"2208.11327","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.11327","created_at":"2026-07-05T04:51:13Z"},{"alias_kind":"arxiv_version","alias_value":"2208.11327v1","created_at":"2026-07-05T04:51:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.11327","created_at":"2026-07-05T04:51:13Z"},{"alias_kind":"pith_short_12","alias_value":"H3DHLOVAECGZ","created_at":"2026-07-05T04:51:13Z"},{"alias_kind":"pith_short_16","alias_value":"H3DHLOVAECGZH75E","created_at":"2026-07-05T04:51:13Z"},{"alias_kind":"pith_short_8","alias_value":"H3DHLOVA","created_at":"2026-07-05T04:51:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:H3DHLOVAECGZH75ENH5WZSVE5L","target":"record","payload":{"canonical_record":{"source":{"id":"2208.11327","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2022-08-24T06:49:43Z","cross_cats_sorted":[],"title_canon_sha256":"871196ae54712d6c768dbd688dc6d1de74d5f5b9c291ffdec34cb4f6848a519e","abstract_canon_sha256":"60b347f7fe7a7a41fb46f401bdb80885d873b3277b4c58b3cf69f4691618ef69"},"schema_version":"1.0"},"canonical_sha256":"3ec675baa0208d93ffa469fb6ccaa4eacf65cbe3c5e14072a0663d19587db9ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:51:13.757770Z","signature_b64":"udQ+53eIt3QT41Hp7vICy3F59sw7nPEgiqHfp3EJ7JgVB/TOOyg/ZNCMNVnSlJ/Vi/X69RJfP1EBeSwFN2VDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ec675baa0208d93ffa469fb6ccaa4eacf65cbe3c5e14072a0663d19587db9ad","last_reissued_at":"2026-07-05T04:51:13.757411Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:51:13.757411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.11327","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-05T04:51:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mq0mGbq2v5cKSUt8aoRF6vEQ4uk45l9Zzl6i+hzdTLpQq16R8Rtqoutjp/G/8UJDaJ+XwFj9BkyWWz8QrIA2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T05:39:54.517058Z"},"content_sha256":"84ebdc2cb9567ae4e7c7caf823ff8dc40a94c87e1a6554a05237462f93bef232","schema_version":"1.0","event_id":"sha256:84ebdc2cb9567ae4e7c7caf823ff8dc40a94c87e1a6554a05237462f93bef232"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:H3DHLOVAECGZH75ENH5WZSVE5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Motion Averaging for Multi-view Registration of Point Sets Based Maximum Correntropy Criterion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Haitao Liu, Tian Huang, Yugeng Huang","submitted_at":"2022-08-24T06:49:43Z","abstract_excerpt":"As an efficient algorithm to solve the multi-view registration problem,the motion averaging (MA) algorithm has been extensively studied and many MA-based algorithms have been introduced. They aim at recovering global motions from relative motions and exploiting information redundancy to average accumulative errors. However, one property of these methods is that they use Guass-Newton method to solve a least squares problem for the increment of global motions, which may lead to low efficiency and poor robustness to outliers. In this paper, we propose a novel motion averaging framework for the mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.11327","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/2208.11327/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-05T04:51:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XLNRBRByaBm4KsOtyn3krPykBwLvYrV+p3XTpN5Z/HVcngCiTlHDepkcIMvzJ5flrk80C4XsioiBujzbvYHZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T05:39:54.517579Z"},"content_sha256":"f968a5dfc472dab521f58dc8ca148e4cb6debc67ba30aa50337b1900cd0b528f","schema_version":"1.0","event_id":"sha256:f968a5dfc472dab521f58dc8ca148e4cb6debc67ba30aa50337b1900cd0b528f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3DHLOVAECGZH75ENH5WZSVE5L/bundle.json","state_url":"https://pith.science/pith/H3DHLOVAECGZH75ENH5WZSVE5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3DHLOVAECGZH75ENH5WZSVE5L/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-01T05:39:54Z","links":{"resolver":"https://pith.science/pith/H3DHLOVAECGZH75ENH5WZSVE5L","bundle":"https://pith.science/pith/H3DHLOVAECGZH75ENH5WZSVE5L/bundle.json","state":"https://pith.science/pith/H3DHLOVAECGZH75ENH5WZSVE5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3DHLOVAECGZH75ENH5WZSVE5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:H3DHLOVAECGZH75ENH5WZSVE5L","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":"60b347f7fe7a7a41fb46f401bdb80885d873b3277b4c58b3cf69f4691618ef69","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2022-08-24T06:49:43Z","title_canon_sha256":"871196ae54712d6c768dbd688dc6d1de74d5f5b9c291ffdec34cb4f6848a519e"},"schema_version":"1.0","source":{"id":"2208.11327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.11327","created_at":"2026-07-05T04:51:13Z"},{"alias_kind":"arxiv_version","alias_value":"2208.11327v1","created_at":"2026-07-05T04:51:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.11327","created_at":"2026-07-05T04:51:13Z"},{"alias_kind":"pith_short_12","alias_value":"H3DHLOVAECGZ","created_at":"2026-07-05T04:51:13Z"},{"alias_kind":"pith_short_16","alias_value":"H3DHLOVAECGZH75E","created_at":"2026-07-05T04:51:13Z"},{"alias_kind":"pith_short_8","alias_value":"H3DHLOVA","created_at":"2026-07-05T04:51:13Z"}],"graph_snapshots":[{"event_id":"sha256:f968a5dfc472dab521f58dc8ca148e4cb6debc67ba30aa50337b1900cd0b528f","target":"graph","created_at":"2026-07-05T04:51:13Z","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/2208.11327/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As an efficient algorithm to solve the multi-view registration problem,the motion averaging (MA) algorithm has been extensively studied and many MA-based algorithms have been introduced. They aim at recovering global motions from relative motions and exploiting information redundancy to average accumulative errors. However, one property of these methods is that they use Guass-Newton method to solve a least squares problem for the increment of global motions, which may lead to low efficiency and poor robustness to outliers. In this paper, we propose a novel motion averaging framework for the mu","authors_text":"Haitao Liu, Tian Huang, Yugeng Huang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2022-08-24T06:49:43Z","title":"Robust Motion Averaging for Multi-view Registration of Point Sets Based Maximum Correntropy Criterion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.11327","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:84ebdc2cb9567ae4e7c7caf823ff8dc40a94c87e1a6554a05237462f93bef232","target":"record","created_at":"2026-07-05T04:51:13Z","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":"60b347f7fe7a7a41fb46f401bdb80885d873b3277b4c58b3cf69f4691618ef69","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2022-08-24T06:49:43Z","title_canon_sha256":"871196ae54712d6c768dbd688dc6d1de74d5f5b9c291ffdec34cb4f6848a519e"},"schema_version":"1.0","source":{"id":"2208.11327","kind":"arxiv","version":1}},"canonical_sha256":"3ec675baa0208d93ffa469fb6ccaa4eacf65cbe3c5e14072a0663d19587db9ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ec675baa0208d93ffa469fb6ccaa4eacf65cbe3c5e14072a0663d19587db9ad","first_computed_at":"2026-07-05T04:51:13.757411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:51:13.757411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"udQ+53eIt3QT41Hp7vICy3F59sw7nPEgiqHfp3EJ7JgVB/TOOyg/ZNCMNVnSlJ/Vi/X69RJfP1EBeSwFN2VDAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:51:13.757770Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.11327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84ebdc2cb9567ae4e7c7caf823ff8dc40a94c87e1a6554a05237462f93bef232","sha256:f968a5dfc472dab521f58dc8ca148e4cb6debc67ba30aa50337b1900cd0b528f"],"state_sha256":"d43eca1fb375e0dd84ba1f3e17fac55374d5d5b8049787722d27d5215c3afb4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EtE9Ix0PpxMTWI+How2k1oT+Y/PAuUFXlPuSHEQw4ZhKq+31v/O9ZBy7GWcLudN+U7Po8Lw6lTRH5l+7U7u9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T05:39:54.522056Z","bundle_sha256":"3ceaac3ef833c473f4b663a688295b006af331669a2b83718554350eeadc27f6"}}