{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SIBTF3O4LBC2WBD65IS45LVC32","short_pith_number":"pith:SIBTF3O4","schema_version":"1.0","canonical_sha256":"920332eddc5845ab047eea25ceaea2dea043b4c3a88de2f53021c86859abb20b","source":{"kind":"arxiv","id":"1903.02343","version":1},"attestation_state":"computed","paper":{"title":"Low-rank updates and divide-and-conquer methods for quadratic matrix equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel Kressner, Patrick K\\\"urschner, Stefano Massei","submitted_at":"2019-03-06T12:48:06Z","abstract_excerpt":"In this work, we consider two types of large-scale quadratic matrix equations: Continuous-time algebraic Riccati equations, which play a central role in optimal and robust control, and unilateral quadratic matrix equations, which arise from stochastic processes on 2D lattices and vibrating systems. We propose a simple and fast way to update the solution to such matrix equations under low-rank modifications of the coefficients. Based on this procedure, we develop a divide-and-conquer method for quadratic matrix equations with coefficients that feature a specific type of hierarchical low-rank st"},"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":"1903.02343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-06T12:48:06Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"ce99bf56c2332449a1f7e83b9fc3aeaf91a17b5dd6f221b161c73b32113b489b","abstract_canon_sha256":"b958e3d1452e591e1d94eb6dc817c170381c37a651d2fbde5c3189fc55c1d074"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.560154Z","signature_b64":"sO64/Kb5VfeDWF70fgwObIq0e9RYorL7e+51g+oTWofT2Y8fcFVYbejAlFibQlu2OAagGBtZ2uV2L1j7AVOmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"920332eddc5845ab047eea25ceaea2dea043b4c3a88de2f53021c86859abb20b","last_reissued_at":"2026-05-17T23:51:55.559606Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.559606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-rank updates and divide-and-conquer methods for quadratic matrix equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel Kressner, Patrick K\\\"urschner, Stefano Massei","submitted_at":"2019-03-06T12:48:06Z","abstract_excerpt":"In this work, we consider two types of large-scale quadratic matrix equations: Continuous-time algebraic Riccati equations, which play a central role in optimal and robust control, and unilateral quadratic matrix equations, which arise from stochastic processes on 2D lattices and vibrating systems. We propose a simple and fast way to update the solution to such matrix equations under low-rank modifications of the coefficients. Based on this procedure, we develop a divide-and-conquer method for quadratic matrix equations with coefficients that feature a specific type of hierarchical low-rank st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02343","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.02343","created_at":"2026-05-17T23:51:55.559698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02343v1","created_at":"2026-05-17T23:51:55.559698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02343","created_at":"2026-05-17T23:51:55.559698+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIBTF3O4LBC2","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIBTF3O4LBC2WBD6","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIBTF3O4","created_at":"2026-05-18T12:33:27.125529+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/SIBTF3O4LBC2WBD65IS45LVC32","json":"https://pith.science/pith/SIBTF3O4LBC2WBD65IS45LVC32.json","graph_json":"https://pith.science/api/pith-number/SIBTF3O4LBC2WBD65IS45LVC32/graph.json","events_json":"https://pith.science/api/pith-number/SIBTF3O4LBC2WBD65IS45LVC32/events.json","paper":"https://pith.science/paper/SIBTF3O4"},"agent_actions":{"view_html":"https://pith.science/pith/SIBTF3O4LBC2WBD65IS45LVC32","download_json":"https://pith.science/pith/SIBTF3O4LBC2WBD65IS45LVC32.json","view_paper":"https://pith.science/paper/SIBTF3O4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02343&json=true","fetch_graph":"https://pith.science/api/pith-number/SIBTF3O4LBC2WBD65IS45LVC32/graph.json","fetch_events":"https://pith.science/api/pith-number/SIBTF3O4LBC2WBD65IS45LVC32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIBTF3O4LBC2WBD65IS45LVC32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIBTF3O4LBC2WBD65IS45LVC32/action/storage_attestation","attest_author":"https://pith.science/pith/SIBTF3O4LBC2WBD65IS45LVC32/action/author_attestation","sign_citation":"https://pith.science/pith/SIBTF3O4LBC2WBD65IS45LVC32/action/citation_signature","submit_replication":"https://pith.science/pith/SIBTF3O4LBC2WBD65IS45LVC32/action/replication_record"}},"created_at":"2026-05-17T23:51:55.559698+00:00","updated_at":"2026-05-17T23:51:55.559698+00:00"}