{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TM23PPGUZUG4AQJEH5IWSF6YIU","short_pith_number":"pith:TM23PPGU","canonical_record":{"source":{"id":"1908.04384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-06T17:03:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"20a0972f3f27b2944c691c920035ce6fe8d7bc963485ee942f29be91889442a5","abstract_canon_sha256":"8ba0f7c3dbf1c820d9e54c6a68a220fbfa2b84fd7e878e833c1e4a2abab6b04e"},"schema_version":"1.0"},"canonical_sha256":"9b35b7bcd4cd0dc041243f516917d8453d8b28db0dbab6c183bda0f15998ae40","source":{"kind":"arxiv","id":"1908.04384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04384","created_at":"2026-07-04T23:54:30Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04384v1","created_at":"2026-07-04T23:54:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04384","created_at":"2026-07-04T23:54:30Z"},{"alias_kind":"pith_short_12","alias_value":"TM23PPGUZUG4","created_at":"2026-07-04T23:54:30Z"},{"alias_kind":"pith_short_16","alias_value":"TM23PPGUZUG4AQJE","created_at":"2026-07-04T23:54:30Z"},{"alias_kind":"pith_short_8","alias_value":"TM23PPGU","created_at":"2026-07-04T23:54:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TM23PPGUZUG4AQJEH5IWSF6YIU","target":"record","payload":{"canonical_record":{"source":{"id":"1908.04384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-06T17:03:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"20a0972f3f27b2944c691c920035ce6fe8d7bc963485ee942f29be91889442a5","abstract_canon_sha256":"8ba0f7c3dbf1c820d9e54c6a68a220fbfa2b84fd7e878e833c1e4a2abab6b04e"},"schema_version":"1.0"},"canonical_sha256":"9b35b7bcd4cd0dc041243f516917d8453d8b28db0dbab6c183bda0f15998ae40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:54:30.289456Z","signature_b64":"KtiXzkTB/UzJSUrhVWkB5uLWvcJdeb5zpHi7yB4t36VIP9BZ+uZItt7AhQiHEUC9ZAcmVM8JHYgtRQVwhf2vBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b35b7bcd4cd0dc041243f516917d8453d8b28db0dbab6c183bda0f15998ae40","last_reissued_at":"2026-07-04T23:54:30.289003Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:54:30.289003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.04384","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:54:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0JjHdQsGojLLALjvW40XU7LH6gb9WdGeyQcxzggBAE+mI6kKLvA++8gxA/BUwC9P40yjzlnlViEFxSi6KaySDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:01:40.338655Z"},"content_sha256":"6d40b65c5fa75c26d5cd28f9168a67eeda2b3a2fd29206d9be8064229972921c","schema_version":"1.0","event_id":"sha256:6d40b65c5fa75c26d5cd28f9168a67eeda2b3a2fd29206d9be8064229972921c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TM23PPGUZUG4AQJEH5IWSF6YIU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"A. Pasha Hosseinbor, A. Ushveridze, R. Zhdanov","submitted_at":"2019-08-06T17:03:53Z","abstract_excerpt":"An unsupervised, iterative point-set registration algorithm for an unlabeled (i.e. correspondence between points is unknown) N-dimensional Euclidean point-cloud is proposed. It is based on linear least squares, and considers all possible point pairings and iteratively aligns the two sets until the number of point pairs does not exceed the maximum number of allowable one-to-one pairings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04384","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.04384/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:54:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qbvcm/1o3Ak/yNdrJxiipNVPu3ZOB7a+vH6gSRIh96gx84B2edb4i6oRoKCxCT3kY3vmW+kwFebKcCAA2dVvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:01:40.339676Z"},"content_sha256":"c619004f2dff83e8a08ebcc3e2fd2c25b53dd1a20bf1ba1b5c41b04240c1502d","schema_version":"1.0","event_id":"sha256:c619004f2dff83e8a08ebcc3e2fd2c25b53dd1a20bf1ba1b5c41b04240c1502d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TM23PPGUZUG4AQJEH5IWSF6YIU/bundle.json","state_url":"https://pith.science/pith/TM23PPGUZUG4AQJEH5IWSF6YIU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TM23PPGUZUG4AQJEH5IWSF6YIU/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-16T05:01:40Z","links":{"resolver":"https://pith.science/pith/TM23PPGUZUG4AQJEH5IWSF6YIU","bundle":"https://pith.science/pith/TM23PPGUZUG4AQJEH5IWSF6YIU/bundle.json","state":"https://pith.science/pith/TM23PPGUZUG4AQJEH5IWSF6YIU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TM23PPGUZUG4AQJEH5IWSF6YIU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TM23PPGUZUG4AQJEH5IWSF6YIU","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":"8ba0f7c3dbf1c820d9e54c6a68a220fbfa2b84fd7e878e833c1e4a2abab6b04e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-06T17:03:53Z","title_canon_sha256":"20a0972f3f27b2944c691c920035ce6fe8d7bc963485ee942f29be91889442a5"},"schema_version":"1.0","source":{"id":"1908.04384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04384","created_at":"2026-07-04T23:54:30Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04384v1","created_at":"2026-07-04T23:54:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04384","created_at":"2026-07-04T23:54:30Z"},{"alias_kind":"pith_short_12","alias_value":"TM23PPGUZUG4","created_at":"2026-07-04T23:54:30Z"},{"alias_kind":"pith_short_16","alias_value":"TM23PPGUZUG4AQJE","created_at":"2026-07-04T23:54:30Z"},{"alias_kind":"pith_short_8","alias_value":"TM23PPGU","created_at":"2026-07-04T23:54:30Z"}],"graph_snapshots":[{"event_id":"sha256:c619004f2dff83e8a08ebcc3e2fd2c25b53dd1a20bf1ba1b5c41b04240c1502d","target":"graph","created_at":"2026-07-04T23:54:30Z","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.04384/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An unsupervised, iterative point-set registration algorithm for an unlabeled (i.e. correspondence between points is unknown) N-dimensional Euclidean point-cloud is proposed. It is based on linear least squares, and considers all possible point pairings and iteratively aligns the two sets until the number of point pairs does not exceed the maximum number of allowable one-to-one pairings.","authors_text":"A. Pasha Hosseinbor, A. Ushveridze, R. Zhdanov","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-06T17:03:53Z","title":"An Unsupervised, Iterative N-Dimensional Point-Set Registration Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04384","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:6d40b65c5fa75c26d5cd28f9168a67eeda2b3a2fd29206d9be8064229972921c","target":"record","created_at":"2026-07-04T23:54:30Z","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":"8ba0f7c3dbf1c820d9e54c6a68a220fbfa2b84fd7e878e833c1e4a2abab6b04e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-06T17:03:53Z","title_canon_sha256":"20a0972f3f27b2944c691c920035ce6fe8d7bc963485ee942f29be91889442a5"},"schema_version":"1.0","source":{"id":"1908.04384","kind":"arxiv","version":1}},"canonical_sha256":"9b35b7bcd4cd0dc041243f516917d8453d8b28db0dbab6c183bda0f15998ae40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b35b7bcd4cd0dc041243f516917d8453d8b28db0dbab6c183bda0f15998ae40","first_computed_at":"2026-07-04T23:54:30.289003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:54:30.289003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KtiXzkTB/UzJSUrhVWkB5uLWvcJdeb5zpHi7yB4t36VIP9BZ+uZItt7AhQiHEUC9ZAcmVM8JHYgtRQVwhf2vBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:54:30.289456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d40b65c5fa75c26d5cd28f9168a67eeda2b3a2fd29206d9be8064229972921c","sha256:c619004f2dff83e8a08ebcc3e2fd2c25b53dd1a20bf1ba1b5c41b04240c1502d"],"state_sha256":"bc2d02a35ab2b0ea9e122bea83341e671dbf9e3db04ee18b2595c97257ae208b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eo+26imvbQix31kPWtZuMqy4LVNSm0aS15qKIb6Xb8HiIBHi/Ha0avSZ7D9b9hucr1zq4l44XksXpWQZABbmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:01:40.345871Z","bundle_sha256":"6f1505469e67b9ef244d6dd306186c7ab464e450e2ac49ba2e227f5a992804db"}}