{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:H6X7NITGU4CXRPFYDZZF3BMKNO","short_pith_number":"pith:H6X7NITG","canonical_record":{"source":{"id":"1811.10378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-26T14:17:38Z","cross_cats_sorted":[],"title_canon_sha256":"e6d1cab744a15bbbd38470db1a09dbc3f36d91a38b1080e033aa75bdf098af9d","abstract_canon_sha256":"3b54b6925f09b5f592e777a9107633b62db332b40e563603520a2fe01c44b13c"},"schema_version":"1.0"},"canonical_sha256":"3faff6a266a70578bcb81e725d858a6b8a354bda2088d2aa5d0f416c99b36dcb","source":{"kind":"arxiv","id":"1811.10378","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:H6X7NITGU4CXRPFYDZZF3BMKNO","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10378","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-26T14:17:38Z","cross_cats_sorted":[],"title_canon_sha256":"e6d1cab744a15bbbd38470db1a09dbc3f36d91a38b1080e033aa75bdf098af9d","abstract_canon_sha256":"3b54b6925f09b5f592e777a9107633b62db332b40e563603520a2fe01c44b13c"},"schema_version":"1.0"},"canonical_sha256":"3faff6a266a70578bcb81e725d858a6b8a354bda2088d2aa5d0f416c99b36dcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:56.633600Z","signature_b64":"dNspVi6HGHGO2aAUEPR4fs7k6kin/d3lLjelZR41VJROmEgpuzqISe1Xf6YGPGFZfCkqOx9r6ahWGjp7W0FZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3faff6a266a70578bcb81e725d858a6b8a354bda2088d2aa5d0f416c99b36dcb","last_reissued_at":"2026-05-17T23:59:56.632988Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:56.632988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10378","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-17T23:59:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hfDnbRCppOQZDF1TWdjiBpDu0Pk99xvnAANTCg3+oazjhzdf8wU7iucthaz7VCyQvH7lEjCiu1S+mb0qjQqMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:34:08.993615Z"},"content_sha256":"132e52663ba0fb2d9c4ee611999785086917f7f88e04df6d64ecd0ca9a2a7e9f","schema_version":"1.0","event_id":"sha256:132e52663ba0fb2d9c4ee611999785086917f7f88e04df6d64ecd0ca9a2a7e9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:H6X7NITGU4CXRPFYDZZF3BMKNO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient-based iterative algorithms for solving Sylvester tensor equations and the associated tensor nearness problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Bing Zheng, Maolin Liang","submitted_at":"2018-11-26T14:17:38Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10378","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-17T23:59:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tyideeWsoHTQa1SkWshznR9ow7WRVg7C0RFLQmk+C0tSqL0A8caHySYd+y7IjWCt5oMhSOaDOrg68DwG5QfADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:34:08.993959Z"},"content_sha256":"5aab47b4345a78ccfc79b21e186d4c39fb92793c6506e3cae4508862a8e5a510","schema_version":"1.0","event_id":"sha256:5aab47b4345a78ccfc79b21e186d4c39fb92793c6506e3cae4508862a8e5a510"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6X7NITGU4CXRPFYDZZF3BMKNO/bundle.json","state_url":"https://pith.science/pith/H6X7NITGU4CXRPFYDZZF3BMKNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6X7NITGU4CXRPFYDZZF3BMKNO/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-24T21:34:08Z","links":{"resolver":"https://pith.science/pith/H6X7NITGU4CXRPFYDZZF3BMKNO","bundle":"https://pith.science/pith/H6X7NITGU4CXRPFYDZZF3BMKNO/bundle.json","state":"https://pith.science/pith/H6X7NITGU4CXRPFYDZZF3BMKNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6X7NITGU4CXRPFYDZZF3BMKNO/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RSOmD2ZU/e5/dYKhdDkroqjU/F2z5K+eio9U76G3ctTJ2mwxxdMRlZ1TXijokKqpvChhzVycEIOYxpUlmEN+Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:34:08.995900Z","bundle_sha256":"ab2167d372ac9eb8667b34261ffdc97e676bf6ec1279c529f591ea2074f4c1c5"}}