{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IFKR25JLKXVY6P6ECMAFOAOYCQ","short_pith_number":"pith:IFKR25JL","schema_version":"1.0","canonical_sha256":"41551d752b55eb8f3fc413005701d8142fac7cf1039971a9acc8881748dfc7bc","source":{"kind":"arxiv","id":"2605.28274","version":1},"attestation_state":"computed","paper":{"title":"Factorized Krylov subspace methods for solving large Sylvester equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Shao-Liang Zhang, Takeshi Fukaya, Tomohiro Sogabe, Yuki Satake","submitted_at":"2026-05-27T10:19:52Z","abstract_excerpt":"Krylov subspace methods, such as the Conjugate Gradient (CG) and BiCGSTAB methods, are widely used in scientific computing for solving linear systems. In this study, we propose a new framework for solving large Sylvester equations in a low-rank format by reconstructing matrix-oriented Krylov subspace methods. The framework realizes efficient algorithms that are mathematically equivalent to the matrix-oriented Krylov subspace methods by exploiting the mathematical properties of the Sylvester operator and the low-rank structure of the right-hand side. Specifically, by leveraging these properties"},"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":"2605.28274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-27T10:19:52Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"ab48924585cdeb0b42014c5d38028db9ed3bd1ee4050f31bf0f6cf4d2c965637","abstract_canon_sha256":"41e48580a51a887e8fce8a78430e394aad676de8c4f4cebe3c3ab48e02a461ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:05:04.855093Z","signature_b64":"J17sQJPrjhALJxyCqobQwSSAo26KV/TDxZHoz4vtnTH0K/9CxnEWzqHHNUkY83CxaC2Sdb9iulRj7j7Jl4eICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41551d752b55eb8f3fc413005701d8142fac7cf1039971a9acc8881748dfc7bc","last_reissued_at":"2026-05-28T01:05:04.854710Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:05:04.854710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factorized Krylov subspace methods for solving large Sylvester equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Shao-Liang Zhang, Takeshi Fukaya, Tomohiro Sogabe, Yuki Satake","submitted_at":"2026-05-27T10:19:52Z","abstract_excerpt":"Krylov subspace methods, such as the Conjugate Gradient (CG) and BiCGSTAB methods, are widely used in scientific computing for solving linear systems. In this study, we propose a new framework for solving large Sylvester equations in a low-rank format by reconstructing matrix-oriented Krylov subspace methods. The framework realizes efficient algorithms that are mathematically equivalent to the matrix-oriented Krylov subspace methods by exploiting the mathematical properties of the Sylvester operator and the low-rank structure of the right-hand side. Specifically, by leveraging these properties"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28274","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.28274/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.28274","created_at":"2026-05-28T01:05:04.854759+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.28274v1","created_at":"2026-05-28T01:05:04.854759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28274","created_at":"2026-05-28T01:05:04.854759+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFKR25JLKXVY","created_at":"2026-05-28T01:05:04.854759+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFKR25JLKXVY6P6E","created_at":"2026-05-28T01:05:04.854759+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFKR25JL","created_at":"2026-05-28T01:05:04.854759+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/IFKR25JLKXVY6P6ECMAFOAOYCQ","json":"https://pith.science/pith/IFKR25JLKXVY6P6ECMAFOAOYCQ.json","graph_json":"https://pith.science/api/pith-number/IFKR25JLKXVY6P6ECMAFOAOYCQ/graph.json","events_json":"https://pith.science/api/pith-number/IFKR25JLKXVY6P6ECMAFOAOYCQ/events.json","paper":"https://pith.science/paper/IFKR25JL"},"agent_actions":{"view_html":"https://pith.science/pith/IFKR25JLKXVY6P6ECMAFOAOYCQ","download_json":"https://pith.science/pith/IFKR25JLKXVY6P6ECMAFOAOYCQ.json","view_paper":"https://pith.science/paper/IFKR25JL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.28274&json=true","fetch_graph":"https://pith.science/api/pith-number/IFKR25JLKXVY6P6ECMAFOAOYCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IFKR25JLKXVY6P6ECMAFOAOYCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFKR25JLKXVY6P6ECMAFOAOYCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFKR25JLKXVY6P6ECMAFOAOYCQ/action/storage_attestation","attest_author":"https://pith.science/pith/IFKR25JLKXVY6P6ECMAFOAOYCQ/action/author_attestation","sign_citation":"https://pith.science/pith/IFKR25JLKXVY6P6ECMAFOAOYCQ/action/citation_signature","submit_replication":"https://pith.science/pith/IFKR25JLKXVY6P6ECMAFOAOYCQ/action/replication_record"}},"created_at":"2026-05-28T01:05:04.854759+00:00","updated_at":"2026-05-28T01:05:04.854759+00:00"}