{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:XCNCU6CHMFJUKMVSRRTRHUCZKY","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":"fc60004a9220edabb5c2787bb94aa3539080585ec72366d7212518c9c554e3b7","cross_cats_sorted":["math.DS","math.OC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-12-09T23:48:37Z","title_canon_sha256":"0dfdd4c05418582401fda8858b187841275d24abf01eb8a1dbf05b897cdb0b67"},"schema_version":"1.0","source":{"id":"0812.1817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.1817","created_at":"2026-05-18T03:37:19Z"},{"alias_kind":"arxiv_version","alias_value":"0812.1817v1","created_at":"2026-05-18T03:37:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.1817","created_at":"2026-05-18T03:37:19Z"},{"alias_kind":"pith_short_12","alias_value":"XCNCU6CHMFJU","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"XCNCU6CHMFJUKMVS","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"XCNCU6CH","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:61e625c0bd697c868e6baf19537f7107a1fa2477d16e1a93583eb5aaf2b7ff8a","target":"graph","created_at":"2026-05-18T03:37:19Z","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":"Let $S(A)$ denote the orbit of a complex or real matrix $A$ under a certain equivalence relation such as unitary similarity, unitary equivalence, unitary congruences etc. Efficient gradient-flow algorithms are constructed to determine the best approximation of a given matrix $A_0$ by the sum of matrices in $S(A_1), ..., S(A_N)$ in the sense of finding the Euclidean least-squares distance $$\\min \\{\\|X_1+ ... + X_N - A_0\\|: X_j \\in S(A_j), j = 1, >..., N\\}.$$ Connections of the results to different pure and applied areas are discussed.","authors_text":"C.K. Li, T. Schulte-Herbrueggen, Y.T. Poon","cross_cats":["math.DS","math.OC","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-12-09T23:48:37Z","title":"Least-Squares Approximation by Elements from Matrix Orbits Achieved by Gradient Flows on Compact Lie Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.1817","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:404ce48b3e25eab3dcfdcf8d4a2e76cfebb6428ca622d51b7b52f7ce65c65c58","target":"record","created_at":"2026-05-18T03:37:19Z","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":"fc60004a9220edabb5c2787bb94aa3539080585ec72366d7212518c9c554e3b7","cross_cats_sorted":["math.DS","math.OC","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-12-09T23:48:37Z","title_canon_sha256":"0dfdd4c05418582401fda8858b187841275d24abf01eb8a1dbf05b897cdb0b67"},"schema_version":"1.0","source":{"id":"0812.1817","kind":"arxiv","version":1}},"canonical_sha256":"b89a2a784761534532b28c6713d059560985d64f44ec2d2fec7ed87e1a5dabe4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b89a2a784761534532b28c6713d059560985d64f44ec2d2fec7ed87e1a5dabe4","first_computed_at":"2026-05-18T03:37:19.267538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:19.267538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nnG5Q3hnSd6JLly5iwlpGJUN4arI/2J5bj1fxVaP0w9VDl0I389Q+aL9zfjObqUHryH5rgd2hzDdcNMr/cQSBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:19.267961Z","signed_message":"canonical_sha256_bytes"},"source_id":"0812.1817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:404ce48b3e25eab3dcfdcf8d4a2e76cfebb6428ca622d51b7b52f7ce65c65c58","sha256:61e625c0bd697c868e6baf19537f7107a1fa2477d16e1a93583eb5aaf2b7ff8a"],"state_sha256":"5e40620288a758aadf4d129fa936c2740a6f00031d0fe848f62795b658dc8168"}