{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GGQEKSW7YM56TUQRXGMLHWZPH4","short_pith_number":"pith:GGQEKSW7","canonical_record":{"source":{"id":"1701.00951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-04T10:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"b3143d511b9326e98e8bd653c35c08ae0e1c18b31be69641063e3ec3a327e9a8","abstract_canon_sha256":"36dc8fe56dc6509baca72e3927f45d61f6a02fd941fd0177d06c91760f049482"},"schema_version":"1.0"},"canonical_sha256":"31a0454adfc33be9d211b998b3db2f3f2a6c9c639511f48a61bdd493a126c635","source":{"kind":"arxiv","id":"1701.00951","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00951","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00951v1","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00951","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"GGQEKSW7YM56","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GGQEKSW7YM56TUQR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GGQEKSW7","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GGQEKSW7YM56TUQRXGMLHWZPH4","target":"record","payload":{"canonical_record":{"source":{"id":"1701.00951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-04T10:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"b3143d511b9326e98e8bd653c35c08ae0e1c18b31be69641063e3ec3a327e9a8","abstract_canon_sha256":"36dc8fe56dc6509baca72e3927f45d61f6a02fd941fd0177d06c91760f049482"},"schema_version":"1.0"},"canonical_sha256":"31a0454adfc33be9d211b998b3db2f3f2a6c9c639511f48a61bdd493a126c635","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:21.829949Z","signature_b64":"ZcFhvgF3Rdi7k4JsbE2Sc9VkzHkpNICYRMKnY3i1jy/ABmeQWUTCVw9raYoUm3DcGzB1SH2N7UdiR12/7LBBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31a0454adfc33be9d211b998b3db2f3f2a6c9c639511f48a61bdd493a126c635","last_reissued_at":"2026-05-18T00:53:21.829506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:21.829506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.00951","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-05-18T00:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EC+bTT5XvXnwckQRhiqI3Up7bUodto71v8xZgYuioeu0DFBNs865T+2GmGfpha+29Sl2Hq++eAWgdhuJVhmYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:16:25.591718Z"},"content_sha256":"405da5f1e9f4c6eb73af43adfb62d75e5f55931b72a4f189954f96f900e9cdea","schema_version":"1.0","event_id":"sha256:405da5f1e9f4c6eb73af43adfb62d75e5f55931b72a4f189954f96f900e9cdea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GGQEKSW7YM56TUQRXGMLHWZPH4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Concave Optimization Algorithm for Matching Partially Overlapping Point Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Lei Zhang, Wei Lian","submitted_at":"2017-01-04T10:28:10Z","abstract_excerpt":"Point matching refers to the process of finding spatial transformation and correspondences between two sets of points. In this paper, we focus on the case that there is only partial overlap between two point sets. Following the approach of the robust point matching method, we model point matching as a mixed linear assignment-least square problem and show that after eliminating the transformation variable, the resulting problem of minimization with respect to point correspondence is a concave optimization problem. Furthermore, this problem has the property that the objective function can be con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00951","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":""},"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-18T00:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V46Yf5PQVcUfaH1ExGO4QcN6wabZSO5FwSjhUKMBRdNwleqbQZc7mTfUW5BKJh1e+d0istnc9+Bur0yAyVfZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:16:25.592184Z"},"content_sha256":"9f8211588d555c02aea7b5b887f003abc0aa28d45b2b918f827def54dede3f69","schema_version":"1.0","event_id":"sha256:9f8211588d555c02aea7b5b887f003abc0aa28d45b2b918f827def54dede3f69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGQEKSW7YM56TUQRXGMLHWZPH4/bundle.json","state_url":"https://pith.science/pith/GGQEKSW7YM56TUQRXGMLHWZPH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGQEKSW7YM56TUQRXGMLHWZPH4/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-24T06:16:25Z","links":{"resolver":"https://pith.science/pith/GGQEKSW7YM56TUQRXGMLHWZPH4","bundle":"https://pith.science/pith/GGQEKSW7YM56TUQRXGMLHWZPH4/bundle.json","state":"https://pith.science/pith/GGQEKSW7YM56TUQRXGMLHWZPH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGQEKSW7YM56TUQRXGMLHWZPH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GGQEKSW7YM56TUQRXGMLHWZPH4","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":"36dc8fe56dc6509baca72e3927f45d61f6a02fd941fd0177d06c91760f049482","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-04T10:28:10Z","title_canon_sha256":"b3143d511b9326e98e8bd653c35c08ae0e1c18b31be69641063e3ec3a327e9a8"},"schema_version":"1.0","source":{"id":"1701.00951","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00951","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00951v1","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00951","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"GGQEKSW7YM56","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GGQEKSW7YM56TUQR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GGQEKSW7","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:9f8211588d555c02aea7b5b887f003abc0aa28d45b2b918f827def54dede3f69","target":"graph","created_at":"2026-05-18T00:53:21Z","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":"Point matching refers to the process of finding spatial transformation and correspondences between two sets of points. In this paper, we focus on the case that there is only partial overlap between two point sets. Following the approach of the robust point matching method, we model point matching as a mixed linear assignment-least square problem and show that after eliminating the transformation variable, the resulting problem of minimization with respect to point correspondence is a concave optimization problem. Furthermore, this problem has the property that the objective function can be con","authors_text":"Lei Zhang, Wei Lian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-04T10:28:10Z","title":"A Concave Optimization Algorithm for Matching Partially Overlapping Point Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00951","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:405da5f1e9f4c6eb73af43adfb62d75e5f55931b72a4f189954f96f900e9cdea","target":"record","created_at":"2026-05-18T00:53:21Z","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":"36dc8fe56dc6509baca72e3927f45d61f6a02fd941fd0177d06c91760f049482","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-04T10:28:10Z","title_canon_sha256":"b3143d511b9326e98e8bd653c35c08ae0e1c18b31be69641063e3ec3a327e9a8"},"schema_version":"1.0","source":{"id":"1701.00951","kind":"arxiv","version":1}},"canonical_sha256":"31a0454adfc33be9d211b998b3db2f3f2a6c9c639511f48a61bdd493a126c635","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31a0454adfc33be9d211b998b3db2f3f2a6c9c639511f48a61bdd493a126c635","first_computed_at":"2026-05-18T00:53:21.829506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:21.829506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZcFhvgF3Rdi7k4JsbE2Sc9VkzHkpNICYRMKnY3i1jy/ABmeQWUTCVw9raYoUm3DcGzB1SH2N7UdiR12/7LBBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:21.829949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00951","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:405da5f1e9f4c6eb73af43adfb62d75e5f55931b72a4f189954f96f900e9cdea","sha256:9f8211588d555c02aea7b5b887f003abc0aa28d45b2b918f827def54dede3f69"],"state_sha256":"179a5e0e226aa9fc438686569172078e7a363d4aff92391cbeaab5d68d0aa70e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NAfgVSh+/v4z2+6NT3lv1Sqwlziq4GDOn74uZB4l5ArXtlxsgr7avsIMbRmkfSh/545CSXkYHTk5nO5x3lbiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:16:25.595976Z","bundle_sha256":"acfc245861780fff6b31bf8bd5faed263ada90d2d9fc882669cbc548c47ddc64"}}