{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ROGLZXAC3WAKT7RHF57K553PJC","short_pith_number":"pith:ROGLZXAC","schema_version":"1.0","canonical_sha256":"8b8cbcdc02dd80a9fe272f7eaef76f48a951a4f4bc26a06a4fff5e825e7c2d37","source":{"kind":"arxiv","id":"2412.09400","version":1},"attestation_state":"computed","paper":{"title":"High-Order Implicit Low-Rank Method with Spectral Deferred Correction for Matrix Differential Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Shun Li, Yan Jiang, Yingda Cheng","submitted_at":"2024-12-12T16:06:57Z","abstract_excerpt":"In this paper, we develop a low-rank method with high-order temporal accuracy using spectral deferred correction (SDC) to compute linear matrix differential equations. In [1], a low rank numerical method is proposed to correct the modeling error of the basis update and the Galerkin (BUG) method, which is a computational approach for DLRA. This method (merge-BUG/mBUG method) has been demonstrated to be first order convergent for general advection-diffusion problems.\n  In this paper, we explore using SDC to elevate the convergence order of the mBUG method. In SDC, we start by computing a first-o"},"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":"2412.09400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-12-12T16:06:57Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"7e86a2bce2fab6ca89e97cf0476d2b3eeb5741b446a009cdb9e904618ef01bf8","abstract_canon_sha256":"fa89dabba4802a18ab643f674906af56aa0bc6d4e57a3bdc8fbd57883ec1a11b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:48:24.073934Z","signature_b64":"uUCnrec4HL+FlkdGdZmluFy0QymC/zBVKCwv3GH+cwqHhu+fc89MxwkZHQGC/RsppPelslPh/HjSHJCQVA1DBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b8cbcdc02dd80a9fe272f7eaef76f48a951a4f4bc26a06a4fff5e825e7c2d37","last_reissued_at":"2026-07-05T09:48:24.073454Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:48:24.073454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-Order Implicit Low-Rank Method with Spectral Deferred Correction for Matrix Differential Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Shun Li, Yan Jiang, Yingda Cheng","submitted_at":"2024-12-12T16:06:57Z","abstract_excerpt":"In this paper, we develop a low-rank method with high-order temporal accuracy using spectral deferred correction (SDC) to compute linear matrix differential equations. In [1], a low rank numerical method is proposed to correct the modeling error of the basis update and the Galerkin (BUG) method, which is a computational approach for DLRA. This method (merge-BUG/mBUG method) has been demonstrated to be first order convergent for general advection-diffusion problems.\n  In this paper, we explore using SDC to elevate the convergence order of the mBUG method. In SDC, we start by computing a first-o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.09400","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/2412.09400/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":"2412.09400","created_at":"2026-07-05T09:48:24.073525+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.09400v1","created_at":"2026-07-05T09:48:24.073525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.09400","created_at":"2026-07-05T09:48:24.073525+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROGLZXAC3WAK","created_at":"2026-07-05T09:48:24.073525+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROGLZXAC3WAKT7RH","created_at":"2026-07-05T09:48:24.073525+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROGLZXAC","created_at":"2026-07-05T09:48:24.073525+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.15848","citing_title":"Iterative thresholding low-rank time integration","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ROGLZXAC3WAKT7RHF57K553PJC","json":"https://pith.science/pith/ROGLZXAC3WAKT7RHF57K553PJC.json","graph_json":"https://pith.science/api/pith-number/ROGLZXAC3WAKT7RHF57K553PJC/graph.json","events_json":"https://pith.science/api/pith-number/ROGLZXAC3WAKT7RHF57K553PJC/events.json","paper":"https://pith.science/paper/ROGLZXAC"},"agent_actions":{"view_html":"https://pith.science/pith/ROGLZXAC3WAKT7RHF57K553PJC","download_json":"https://pith.science/pith/ROGLZXAC3WAKT7RHF57K553PJC.json","view_paper":"https://pith.science/paper/ROGLZXAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.09400&json=true","fetch_graph":"https://pith.science/api/pith-number/ROGLZXAC3WAKT7RHF57K553PJC/graph.json","fetch_events":"https://pith.science/api/pith-number/ROGLZXAC3WAKT7RHF57K553PJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROGLZXAC3WAKT7RHF57K553PJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROGLZXAC3WAKT7RHF57K553PJC/action/storage_attestation","attest_author":"https://pith.science/pith/ROGLZXAC3WAKT7RHF57K553PJC/action/author_attestation","sign_citation":"https://pith.science/pith/ROGLZXAC3WAKT7RHF57K553PJC/action/citation_signature","submit_replication":"https://pith.science/pith/ROGLZXAC3WAKT7RHF57K553PJC/action/replication_record"}},"created_at":"2026-07-05T09:48:24.073525+00:00","updated_at":"2026-07-05T09:48:24.073525+00:00"}