{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:33SYJ4GSFNGAML7OINBPEXEKJB","short_pith_number":"pith:33SYJ4GS","schema_version":"1.0","canonical_sha256":"dee584f0d22b4c062fee4342f25c8a4874bffc798f23f9b404bef3cec59d20cc","source":{"kind":"arxiv","id":"2402.05347","version":4},"attestation_state":"computed","paper":{"title":"Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel Appel\\\"o, Yingda Cheng","submitted_at":"2024-02-08T01:46:58Z","abstract_excerpt":"In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac-Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) for DLRA. First, a prediction (basis update) step is made computing the approxima"},"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":"2402.05347","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-02-08T01:46:58Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"43f9b6dc076cd45a67797c533bc707d0acfb795e89539df114992d15a56ea463","abstract_canon_sha256":"f7904dbfad7d34a30a2d6eaf6804b06675c5577f4f50ac7d3022077d8581501d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:37.782797Z","signature_b64":"zfkI97gbmjFAcLRW23LCZctiyNpp02+tbxGc5NAlXfKK+8Ut0vwB9JPIUOAP6pOhmvnavNyOF/DRTcWm5t8wAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee584f0d22b4c062fee4342f25c8a4874bffc798f23f9b404bef3cec59d20cc","last_reissued_at":"2026-07-05T10:04:37.782310Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:37.782310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel Appel\\\"o, Yingda Cheng","submitted_at":"2024-02-08T01:46:58Z","abstract_excerpt":"In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac-Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) for DLRA. First, a prediction (basis update) step is made computing the approxima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05347","kind":"arxiv","version":4},"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/2402.05347/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":"2402.05347","created_at":"2026-07-05T10:04:37.782375+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.05347v4","created_at":"2026-07-05T10:04:37.782375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05347","created_at":"2026-07-05T10:04:37.782375+00:00"},{"alias_kind":"pith_short_12","alias_value":"33SYJ4GSFNGA","created_at":"2026-07-05T10:04:37.782375+00:00"},{"alias_kind":"pith_short_16","alias_value":"33SYJ4GSFNGAML7O","created_at":"2026-07-05T10:04:37.782375+00:00"},{"alias_kind":"pith_short_8","alias_value":"33SYJ4GS","created_at":"2026-07-05T10:04:37.782375+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.09400","citing_title":"High-Order Implicit Low-Rank Method with Spectral Deferred Correction for Matrix Differential Equations","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/33SYJ4GSFNGAML7OINBPEXEKJB","json":"https://pith.science/pith/33SYJ4GSFNGAML7OINBPEXEKJB.json","graph_json":"https://pith.science/api/pith-number/33SYJ4GSFNGAML7OINBPEXEKJB/graph.json","events_json":"https://pith.science/api/pith-number/33SYJ4GSFNGAML7OINBPEXEKJB/events.json","paper":"https://pith.science/paper/33SYJ4GS"},"agent_actions":{"view_html":"https://pith.science/pith/33SYJ4GSFNGAML7OINBPEXEKJB","download_json":"https://pith.science/pith/33SYJ4GSFNGAML7OINBPEXEKJB.json","view_paper":"https://pith.science/paper/33SYJ4GS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.05347&json=true","fetch_graph":"https://pith.science/api/pith-number/33SYJ4GSFNGAML7OINBPEXEKJB/graph.json","fetch_events":"https://pith.science/api/pith-number/33SYJ4GSFNGAML7OINBPEXEKJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33SYJ4GSFNGAML7OINBPEXEKJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33SYJ4GSFNGAML7OINBPEXEKJB/action/storage_attestation","attest_author":"https://pith.science/pith/33SYJ4GSFNGAML7OINBPEXEKJB/action/author_attestation","sign_citation":"https://pith.science/pith/33SYJ4GSFNGAML7OINBPEXEKJB/action/citation_signature","submit_replication":"https://pith.science/pith/33SYJ4GSFNGAML7OINBPEXEKJB/action/replication_record"}},"created_at":"2026-07-05T10:04:37.782375+00:00","updated_at":"2026-07-05T10:04:37.782375+00:00"}