{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:H6X7NITGU4CXRPFYDZZF3BMKNO","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":"3b54b6925f09b5f592e777a9107633b62db332b40e563603520a2fe01c44b13c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-26T14:17:38Z","title_canon_sha256":"e6d1cab744a15bbbd38470db1a09dbc3f36d91a38b1080e033aa75bdf098af9d"},"schema_version":"1.0","source":{"id":"1811.10378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10378","created_at":"2026-05-17T23:59:56Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10378v1","created_at":"2026-05-17T23:59:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10378","created_at":"2026-05-17T23:59:56Z"},{"alias_kind":"pith_short_12","alias_value":"H6X7NITGU4CX","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H6X7NITGU4CXRPFY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H6X7NITG","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:5aab47b4345a78ccfc79b21e186d4c39fb92793c6506e3cae4508862a8e5a510","target":"graph","created_at":"2026-05-17T23:59:56Z","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":"In this paper, an iterative algorithm is presented for solving Sylvester tensor equation $\\mathscr{A}*_M\\mathscr{X}+\\mathscr{X}*_N\\mathscr{C}=\\mathscr{D}$, where $\\mathscr{A}$, $\\mathscr{C}$ and $\\mathscr{D}$ are given tensors with appropriate sizes, and the symbol $*_N$ denotes the Einstein product. By this algorithm, the solvability of this tensor equation can be determined automatically, and the solution of which (when it is solvable) can be derived within finite iteration steps for any initial iteration tensors in the absence of roundoff errors. Particularly, the least F-norm solution of t","authors_text":"Bing Zheng, Maolin Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-26T14:17:38Z","title":"Gradient-based iterative algorithms for solving Sylvester tensor equations and the associated tensor nearness problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10378","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:132e52663ba0fb2d9c4ee611999785086917f7f88e04df6d64ecd0ca9a2a7e9f","target":"record","created_at":"2026-05-17T23:59:56Z","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":"3b54b6925f09b5f592e777a9107633b62db332b40e563603520a2fe01c44b13c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-26T14:17:38Z","title_canon_sha256":"e6d1cab744a15bbbd38470db1a09dbc3f36d91a38b1080e033aa75bdf098af9d"},"schema_version":"1.0","source":{"id":"1811.10378","kind":"arxiv","version":1}},"canonical_sha256":"3faff6a266a70578bcb81e725d858a6b8a354bda2088d2aa5d0f416c99b36dcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3faff6a266a70578bcb81e725d858a6b8a354bda2088d2aa5d0f416c99b36dcb","first_computed_at":"2026-05-17T23:59:56.632988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:56.632988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dNspVi6HGHGO2aAUEPR4fs7k6kin/d3lLjelZR41VJROmEgpuzqISe1Xf6YGPGFZfCkqOx9r6ahWGjp7W0FZCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:56.633600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:132e52663ba0fb2d9c4ee611999785086917f7f88e04df6d64ecd0ca9a2a7e9f","sha256:5aab47b4345a78ccfc79b21e186d4c39fb92793c6506e3cae4508862a8e5a510"],"state_sha256":"e0b55826fd670e8693cea963b6d6e2d1695dfd62fe93f1540558e61166a12f0c"}