{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RYKQN7PKB7IFORF6AXYRKDLQL6","short_pith_number":"pith:RYKQN7PK","schema_version":"1.0","canonical_sha256":"8e1506fdea0fd05744be05f1150d705fa4dfc321ab050c39c0730ef45187bd3b","source":{"kind":"arxiv","id":"2605.16954","version":1},"attestation_state":"computed","paper":{"title":"Block Krylov subspaces and orthogonal matrix polynomials: a structural correspondence with applications to unitary matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Polynomial block Krylov subspaces are isometrically isomorphic to spaces of matrix polynomials of bounded degree under a no-deflation assumption.","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Michele Rinelli, Raf Vandebril","submitted_at":"2026-05-16T12:11:31Z","abstract_excerpt":"We study the connection between block Krylov subspaces and matrix orthogonal functions.\n  Under a no-deflation assumption, we show that polynomial block Krylov subspaces are isometrically isomorphic to spaces of matrix polynomials of bounded degree, providing a unified framework for the analysis and construction of orthonormal bases and recurrence relations. The same correspondence holds for rational block Krylov subspaces and matrix-valued rational functions, and in the extended Krylov setting this leads naturally to Laurent matrix polynomials.\n  When the matrix $A$ is normal, we prove that t"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.16954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-05-16T12:11:31Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"343438720a38e7a86951387ca3193e4bc8b23d7b956832338f09cd0d3d3a8ce9","abstract_canon_sha256":"bc4e5d1d62f1fb967a202bc51b31bf557cad54b0efc3f9d10a35f98e99a54feb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:32.737902Z","signature_b64":"7+jc8zai41kQfBUh3Z5MGPbrciXz8If2qbDe59zXmNvk144wD/zMvh+8QmtRbJqmCobSG1vd3Iq/vaMHnWWCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e1506fdea0fd05744be05f1150d705fa4dfc321ab050c39c0730ef45187bd3b","last_reissued_at":"2026-05-20T00:03:32.737305Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:32.737305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block Krylov subspaces and orthogonal matrix polynomials: a structural correspondence with applications to unitary matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Polynomial block Krylov subspaces are isometrically isomorphic to spaces of matrix polynomials of bounded degree under a no-deflation assumption.","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Michele Rinelli, Raf Vandebril","submitted_at":"2026-05-16T12:11:31Z","abstract_excerpt":"We study the connection between block Krylov subspaces and matrix orthogonal functions.\n  Under a no-deflation assumption, we show that polynomial block Krylov subspaces are isometrically isomorphic to spaces of matrix polynomials of bounded degree, providing a unified framework for the analysis and construction of orthonormal bases and recurrence relations. The same correspondence holds for rational block Krylov subspaces and matrix-valued rational functions, and in the extended Krylov setting this leads naturally to Laurent matrix polynomials.\n  When the matrix $A$ is normal, we prove that t"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Under a no-deflation assumption, polynomial block Krylov subspaces are isometrically isomorphic to spaces of matrix polynomials of bounded degree, providing a unified framework for the analysis and construction of orthonormal bases and recurrence relations; for unitary matrices this transfers the Szegő recurrence and CMV framework to yield efficient orthogonalization procedures.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The no-deflation assumption on the block Krylov process, which is invoked to guarantee that the generated subspace has full dimension and that the isometric isomorphism to the matrix-polynomial space holds without breakdown (abstract, paragraph on polynomial block Krylov subspaces).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Block Krylov subspaces correspond isometrically to matrix polynomial spaces, allowing transfer of Szegő recurrences and CMV frameworks to orthogonalize polynomial and extended block Krylov bases for unitary matrices.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Polynomial block Krylov subspaces are isometrically isomorphic to spaces of matrix polynomials of bounded degree under a no-deflation assumption.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"0acd4dc28491ce0ed86aa7643c5f6372ec767f617ecc82b27f0b99eeb574faae"},"source":{"id":"2605.16954","kind":"arxiv","version":1},"verdict":{"id":"944884ae-f01f-498c-ac46-834ca70ab65d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:29:46.713301Z","strongest_claim":"Under a no-deflation assumption, polynomial block Krylov subspaces are isometrically isomorphic to spaces of matrix polynomials of bounded degree, providing a unified framework for the analysis and construction of orthonormal bases and recurrence relations; for unitary matrices this transfers the Szegő recurrence and CMV framework to yield efficient orthogonalization procedures.","one_line_summary":"Block Krylov subspaces correspond isometrically to matrix polynomial spaces, allowing transfer of Szegő recurrences and CMV frameworks to orthogonalize polynomial and extended block Krylov bases for unitary matrices.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The no-deflation assumption on the block Krylov process, which is invoked to guarantee that the generated subspace has full dimension and that the isometric isomorphism to the matrix-polynomial space holds without breakdown (abstract, paragraph on polynomial block Krylov subspaces).","pith_extraction_headline":"Polynomial block Krylov subspaces are isometrically isomorphic to spaces of matrix polynomials of bounded degree under a no-deflation assumption."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16954/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:18.927828Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T19:51:58.864592Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:40:41.952705Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.235819Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.320124Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"f20800945f34d2c17e1901d7de36888dd4de9e3ba1692cccdf6d0ceceeeac74a"},"references":{"count":27,"sample":[{"doi":"","year":2005,"title":"A. C. Antoulas.Approximation of large-scale dynamical systems, volume 6 ofAdvances in Design and Control. Society for Industrial and Applied Mathematics, 2005","work_id":"b41f5e4c-a362-42f4-80d2-23df1dc00e17","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"E. Carson, K. Lund, M. Rozloˇ zn´ ık, and S. Thomas. Block Gram-Schmidt algorithms and their stability proper- ties.Linear Algebra Appl., 638:150–195, 2022","work_id":"5df9564a-f935-4102-acc8-1f1254b3c762","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"D. Damanik, M. Embree, and J. Fillman. Gap labels for zeros of the partition function of the 1D Ising model via the Schwartzman homomorphism.Indag. Math. (N.S.), 35(5):813–836, 2024","work_id":"f39d9262-85b1-41d4-b37a-92bf3d2df03f","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2008,"title":"D. Damanik, A. Pushnitski, and B. Simon. The analytic theory of matrix orthogonal polynomials.Surv. Approx. Theory, 4:1–85, 2008","work_id":"a3cec6d9-b18e-4d28-a05f-2f522a3294bc","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"V. Druskin and L. Knizhnerman. Extended Krylov subspaces: approximation of the matrix square root and related functions.SIAM J. Matrix Anal. Appl., 19(3):755–771, 1998","work_id":"c97b3a08-33e1-4dcd-ae51-f5473e36a3f2","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":27,"snapshot_sha256":"a6665d1676e244968638fcf0738211fd6bd296b52277a85be3ddf67803221262","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"bf920d489a929611b71ac9818e825e59a4b99af43c113e0613821d53ef518a3c"},"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.16954","created_at":"2026-05-20T00:03:32.737417+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16954v1","created_at":"2026-05-20T00:03:32.737417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16954","created_at":"2026-05-20T00:03:32.737417+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYKQN7PKB7IF","created_at":"2026-05-20T00:03:32.737417+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYKQN7PKB7IFORF6","created_at":"2026-05-20T00:03:32.737417+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYKQN7PK","created_at":"2026-05-20T00:03:32.737417+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RYKQN7PKB7IFORF6AXYRKDLQL6","json":"https://pith.science/pith/RYKQN7PKB7IFORF6AXYRKDLQL6.json","graph_json":"https://pith.science/api/pith-number/RYKQN7PKB7IFORF6AXYRKDLQL6/graph.json","events_json":"https://pith.science/api/pith-number/RYKQN7PKB7IFORF6AXYRKDLQL6/events.json","paper":"https://pith.science/paper/RYKQN7PK"},"agent_actions":{"view_html":"https://pith.science/pith/RYKQN7PKB7IFORF6AXYRKDLQL6","download_json":"https://pith.science/pith/RYKQN7PKB7IFORF6AXYRKDLQL6.json","view_paper":"https://pith.science/paper/RYKQN7PK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16954&json=true","fetch_graph":"https://pith.science/api/pith-number/RYKQN7PKB7IFORF6AXYRKDLQL6/graph.json","fetch_events":"https://pith.science/api/pith-number/RYKQN7PKB7IFORF6AXYRKDLQL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYKQN7PKB7IFORF6AXYRKDLQL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYKQN7PKB7IFORF6AXYRKDLQL6/action/storage_attestation","attest_author":"https://pith.science/pith/RYKQN7PKB7IFORF6AXYRKDLQL6/action/author_attestation","sign_citation":"https://pith.science/pith/RYKQN7PKB7IFORF6AXYRKDLQL6/action/citation_signature","submit_replication":"https://pith.science/pith/RYKQN7PKB7IFORF6AXYRKDLQL6/action/replication_record"}},"created_at":"2026-05-20T00:03:32.737417+00:00","updated_at":"2026-05-20T00:03:32.737417+00:00"}