{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:XCNCU6CHMFJUKMVSRRTRHUCZKY","short_pith_number":"pith:XCNCU6CH","schema_version":"1.0","canonical_sha256":"b89a2a784761534532b28c6713d059560985d64f44ec2d2fec7ed87e1a5dabe4","source":{"kind":"arxiv","id":"0812.1817","version":1},"attestation_state":"computed","paper":{"title":"Least-Squares Approximation by Elements from Matrix Orbits Achieved by Gradient Flows on Compact Lie Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.OC","quant-ph"],"primary_cat":"math.NA","authors_text":"C.K. Li, T. Schulte-Herbrueggen, Y.T. Poon","submitted_at":"2008-12-09T23:48:37Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0812.1817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2008-12-09T23:48:37Z","cross_cats_sorted":["math.DS","math.OC","quant-ph"],"title_canon_sha256":"0dfdd4c05418582401fda8858b187841275d24abf01eb8a1dbf05b897cdb0b67","abstract_canon_sha256":"fc60004a9220edabb5c2787bb94aa3539080585ec72366d7212518c9c554e3b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:19.267961Z","signature_b64":"nnG5Q3hnSd6JLly5iwlpGJUN4arI/2J5bj1fxVaP0w9VDl0I389Q+aL9zfjObqUHryH5rgd2hzDdcNMr/cQSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89a2a784761534532b28c6713d059560985d64f44ec2d2fec7ed87e1a5dabe4","last_reissued_at":"2026-05-18T03:37:19.267538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:19.267538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Least-Squares Approximation by Elements from Matrix Orbits Achieved by Gradient Flows on Compact Lie Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.OC","quant-ph"],"primary_cat":"math.NA","authors_text":"C.K. Li, T. Schulte-Herbrueggen, Y.T. Poon","submitted_at":"2008-12-09T23:48:37Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.1817","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0812.1817","created_at":"2026-05-18T03:37:19.267615+00:00"},{"alias_kind":"arxiv_version","alias_value":"0812.1817v1","created_at":"2026-05-18T03:37:19.267615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.1817","created_at":"2026-05-18T03:37:19.267615+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCNCU6CHMFJU","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCNCU6CHMFJUKMVS","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCNCU6CH","created_at":"2026-05-18T12:25:58.018023+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCNCU6CHMFJUKMVSRRTRHUCZKY","json":"https://pith.science/pith/XCNCU6CHMFJUKMVSRRTRHUCZKY.json","graph_json":"https://pith.science/api/pith-number/XCNCU6CHMFJUKMVSRRTRHUCZKY/graph.json","events_json":"https://pith.science/api/pith-number/XCNCU6CHMFJUKMVSRRTRHUCZKY/events.json","paper":"https://pith.science/paper/XCNCU6CH"},"agent_actions":{"view_html":"https://pith.science/pith/XCNCU6CHMFJUKMVSRRTRHUCZKY","download_json":"https://pith.science/pith/XCNCU6CHMFJUKMVSRRTRHUCZKY.json","view_paper":"https://pith.science/paper/XCNCU6CH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0812.1817&json=true","fetch_graph":"https://pith.science/api/pith-number/XCNCU6CHMFJUKMVSRRTRHUCZKY/graph.json","fetch_events":"https://pith.science/api/pith-number/XCNCU6CHMFJUKMVSRRTRHUCZKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCNCU6CHMFJUKMVSRRTRHUCZKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCNCU6CHMFJUKMVSRRTRHUCZKY/action/storage_attestation","attest_author":"https://pith.science/pith/XCNCU6CHMFJUKMVSRRTRHUCZKY/action/author_attestation","sign_citation":"https://pith.science/pith/XCNCU6CHMFJUKMVSRRTRHUCZKY/action/citation_signature","submit_replication":"https://pith.science/pith/XCNCU6CHMFJUKMVSRRTRHUCZKY/action/replication_record"}},"created_at":"2026-05-18T03:37:19.267615+00:00","updated_at":"2026-05-18T03:37:19.267615+00:00"}