{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HHNY4MZSOY6UZ7BCV74RTIZZQH","short_pith_number":"pith:HHNY4MZS","canonical_record":{"source":{"id":"2303.07614","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-03-14T03:29:16Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"e7113f9f82453db956a4177b89825a2314ad58240dda2760ae685b3b43a19fe9","abstract_canon_sha256":"580a654bfbd513763ce90fe96f04d51688f7433adf11d9f098d4355e854548db"},"schema_version":"1.0"},"canonical_sha256":"39db8e3332763d4cfc22aff919a33981cfe9e4098d44897acdab577b7065e2cb","source":{"kind":"arxiv","id":"2303.07614","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.07614","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"2303.07614v2","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.07614","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"HHNY4MZSOY6U","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"pith_short_16","alias_value":"HHNY4MZSOY6UZ7BC","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"pith_short_8","alias_value":"HHNY4MZS","created_at":"2026-07-05T05:58:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HHNY4MZSOY6UZ7BCV74RTIZZQH","target":"record","payload":{"canonical_record":{"source":{"id":"2303.07614","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-03-14T03:29:16Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"e7113f9f82453db956a4177b89825a2314ad58240dda2760ae685b3b43a19fe9","abstract_canon_sha256":"580a654bfbd513763ce90fe96f04d51688f7433adf11d9f098d4355e854548db"},"schema_version":"1.0"},"canonical_sha256":"39db8e3332763d4cfc22aff919a33981cfe9e4098d44897acdab577b7065e2cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:58:20.139883Z","signature_b64":"Q8xagGI1hIgyU+XngeQa0uRHxM+NIlrQnciWz7znbX+RqY+ObLgAxXjgYp3y6EGjQ9zGc1sHs8val2ejtZCeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39db8e3332763d4cfc22aff919a33981cfe9e4098d44897acdab577b7065e2cb","last_reissued_at":"2026-07-05T05:58:20.139470Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:58:20.139470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.07614","source_version":2,"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-05T05:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wrdY6O4vii4OR4PPqryUgaYqlccAKS7S9QQh1kCnFQiXBISEJM1YqGrFGZc/wH0XLKC+qEG/DJHg1QlEYN4ABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:46:19.614944Z"},"content_sha256":"6291a92573ac850066768bc0dcf67299add6884c98b672800b8f7bb56da5afb6","schema_version":"1.0","event_id":"sha256:6291a92573ac850066768bc0dcf67299add6884c98b672800b8f7bb56da5afb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HHNY4MZSOY6UZ7BCV74RTIZZQH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Iterative Methods for Complex-Variable Matrix Optimization Problems in Frobenius Norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Sai Wang, Yi Gong","submitted_at":"2023-03-14T03:29:16Z","abstract_excerpt":"Complex-variable matrix optimization problems (CMOPs) in Frobenius norm emerge in many areas of applied mathematics and engineering applications. In this letter, we focus on solving CMOPs by iterative methods. For unconstrained CMOPs, we prove that the gradient descent (GD) method is feasible in the complex domain. Further, in view of reducing the computation complexity, constrained CMOPs are solved by a projection gradient descent (PGD) method. The theoretical analysis shows that the PGD method maintains a good convergence in the complex domain. Experiment results well support the theoretical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.07614","kind":"arxiv","version":2},"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/2303.07614/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-05T05:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2TspOwdvfkZhBj8hrNvlAMHzSZ72useRSFIQ40SMnKq/Xz6M6Kjh+xXQSM8xCqL2xvjzsl1pm/9YA/n5KmRMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:46:19.615382Z"},"content_sha256":"d4684d144886bdb2d17bb4863b21da4a2cb7b12af3eed7b0ac682dcf2471c8bc","schema_version":"1.0","event_id":"sha256:d4684d144886bdb2d17bb4863b21da4a2cb7b12af3eed7b0ac682dcf2471c8bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHNY4MZSOY6UZ7BCV74RTIZZQH/bundle.json","state_url":"https://pith.science/pith/HHNY4MZSOY6UZ7BCV74RTIZZQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHNY4MZSOY6UZ7BCV74RTIZZQH/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-11T04:46:19Z","links":{"resolver":"https://pith.science/pith/HHNY4MZSOY6UZ7BCV74RTIZZQH","bundle":"https://pith.science/pith/HHNY4MZSOY6UZ7BCV74RTIZZQH/bundle.json","state":"https://pith.science/pith/HHNY4MZSOY6UZ7BCV74RTIZZQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHNY4MZSOY6UZ7BCV74RTIZZQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HHNY4MZSOY6UZ7BCV74RTIZZQH","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":"580a654bfbd513763ce90fe96f04d51688f7433adf11d9f098d4355e854548db","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-03-14T03:29:16Z","title_canon_sha256":"e7113f9f82453db956a4177b89825a2314ad58240dda2760ae685b3b43a19fe9"},"schema_version":"1.0","source":{"id":"2303.07614","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.07614","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"2303.07614v2","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.07614","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"HHNY4MZSOY6U","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"pith_short_16","alias_value":"HHNY4MZSOY6UZ7BC","created_at":"2026-07-05T05:58:20Z"},{"alias_kind":"pith_short_8","alias_value":"HHNY4MZS","created_at":"2026-07-05T05:58:20Z"}],"graph_snapshots":[{"event_id":"sha256:d4684d144886bdb2d17bb4863b21da4a2cb7b12af3eed7b0ac682dcf2471c8bc","target":"graph","created_at":"2026-07-05T05:58:20Z","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/2303.07614/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Complex-variable matrix optimization problems (CMOPs) in Frobenius norm emerge in many areas of applied mathematics and engineering applications. In this letter, we focus on solving CMOPs by iterative methods. For unconstrained CMOPs, we prove that the gradient descent (GD) method is feasible in the complex domain. Further, in view of reducing the computation complexity, constrained CMOPs are solved by a projection gradient descent (PGD) method. The theoretical analysis shows that the PGD method maintains a good convergence in the complex domain. Experiment results well support the theoretical","authors_text":"Sai Wang, Yi Gong","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-03-14T03:29:16Z","title":"Low-Complexity Iterative Methods for Complex-Variable Matrix Optimization Problems in Frobenius Norm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.07614","kind":"arxiv","version":2},"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:6291a92573ac850066768bc0dcf67299add6884c98b672800b8f7bb56da5afb6","target":"record","created_at":"2026-07-05T05:58:20Z","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":"580a654bfbd513763ce90fe96f04d51688f7433adf11d9f098d4355e854548db","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-03-14T03:29:16Z","title_canon_sha256":"e7113f9f82453db956a4177b89825a2314ad58240dda2760ae685b3b43a19fe9"},"schema_version":"1.0","source":{"id":"2303.07614","kind":"arxiv","version":2}},"canonical_sha256":"39db8e3332763d4cfc22aff919a33981cfe9e4098d44897acdab577b7065e2cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39db8e3332763d4cfc22aff919a33981cfe9e4098d44897acdab577b7065e2cb","first_computed_at":"2026-07-05T05:58:20.139470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:58:20.139470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q8xagGI1hIgyU+XngeQa0uRHxM+NIlrQnciWz7znbX+RqY+ObLgAxXjgYp3y6EGjQ9zGc1sHs8val2ejtZCeDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:58:20.139883Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.07614","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6291a92573ac850066768bc0dcf67299add6884c98b672800b8f7bb56da5afb6","sha256:d4684d144886bdb2d17bb4863b21da4a2cb7b12af3eed7b0ac682dcf2471c8bc"],"state_sha256":"577a945c403544eb1ffd1bc65553747b60c91ebca6874e90ade44e3695aa5237"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lDf8gdUwZgK3ATDmYiTTCywYX4ZWdvq80Aqie4SuPd9MG3+/5VIL2Kc5LHIeGZJBX4bzdatTW8aJcmav3XQ4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T04:46:19.618356Z","bundle_sha256":"c5f4ad21d551274a1b53708c077bf0ba28a89a98502ed6d07bd6c3eecdff846a"}}