{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RRKY7GNU4BOJOFT55M6NEPLQHY","short_pith_number":"pith:RRKY7GNU","schema_version":"1.0","canonical_sha256":"8c558f99b4e05c97167deb3cd23d703e2883edde9ffa028395c21b9afecb980a","source":{"kind":"arxiv","id":"2409.06384","version":1},"attestation_state":"computed","paper":{"title":"Randomized low-rank Runge-Kutta methods","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel Kressner, Gianluca Ceruti, Hei Yin Lam","submitted_at":"2024-09-10T10:07:21Z","abstract_excerpt":"This work proposes and analyzes a new class of numerical integrators for computing low-rank approximations to solutions of matrix differential equation. We combine an explicit Runge-Kutta method with repeated randomized low-rank approximation to keep the rank of the stages limited. The so-called generalized Nystr\\\"om method is particularly well suited for this purpose; it builds low-rank approximations from random sketches of the discretized dynamics. In contrast, all existing dynamical low-rank approximation methods are deterministic and usually perform tangent space projections to limit rank"},"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":"2409.06384","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2024-09-10T10:07:21Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"affebf68c08549d3f80a97eb30951567b85adce65d15e9cf893f7aae7ab810d6","abstract_canon_sha256":"b2bd651e1720c50e5482081fbe60cae7733a811fb1b1b1def12dc16a1cdd689e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:05:23.683109Z","signature_b64":"xY7iPrVls0/06lpSNe/HkJ11cRqv++zlT0GHhUtA6Bs2cGJEwIV+dv45TWY+G4bkhBcbXKa0JPRGV2EfbPXkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c558f99b4e05c97167deb3cd23d703e2883edde9ffa028395c21b9afecb980a","last_reissued_at":"2026-07-05T09:05:23.682643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:05:23.682643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized low-rank Runge-Kutta methods","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Daniel Kressner, Gianluca Ceruti, Hei Yin Lam","submitted_at":"2024-09-10T10:07:21Z","abstract_excerpt":"This work proposes and analyzes a new class of numerical integrators for computing low-rank approximations to solutions of matrix differential equation. We combine an explicit Runge-Kutta method with repeated randomized low-rank approximation to keep the rank of the stages limited. The so-called generalized Nystr\\\"om method is particularly well suited for this purpose; it builds low-rank approximations from random sketches of the discretized dynamics. In contrast, all existing dynamical low-rank approximation methods are deterministic and usually perform tangent space projections to limit rank"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.06384","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/2409.06384/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":"2409.06384","created_at":"2026-07-05T09:05:23.682700+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.06384v1","created_at":"2026-07-05T09:05:23.682700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.06384","created_at":"2026-07-05T09:05:23.682700+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRKY7GNU4BOJ","created_at":"2026-07-05T09:05:23.682700+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRKY7GNU4BOJOFT5","created_at":"2026-07-05T09:05:23.682700+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRKY7GNU","created_at":"2026-07-05T09:05:23.682700+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08029","citing_title":"Understanding the Kronecker Matrix-Vector Complexity of Linear Algebra","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RRKY7GNU4BOJOFT55M6NEPLQHY","json":"https://pith.science/pith/RRKY7GNU4BOJOFT55M6NEPLQHY.json","graph_json":"https://pith.science/api/pith-number/RRKY7GNU4BOJOFT55M6NEPLQHY/graph.json","events_json":"https://pith.science/api/pith-number/RRKY7GNU4BOJOFT55M6NEPLQHY/events.json","paper":"https://pith.science/paper/RRKY7GNU"},"agent_actions":{"view_html":"https://pith.science/pith/RRKY7GNU4BOJOFT55M6NEPLQHY","download_json":"https://pith.science/pith/RRKY7GNU4BOJOFT55M6NEPLQHY.json","view_paper":"https://pith.science/paper/RRKY7GNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.06384&json=true","fetch_graph":"https://pith.science/api/pith-number/RRKY7GNU4BOJOFT55M6NEPLQHY/graph.json","fetch_events":"https://pith.science/api/pith-number/RRKY7GNU4BOJOFT55M6NEPLQHY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRKY7GNU4BOJOFT55M6NEPLQHY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRKY7GNU4BOJOFT55M6NEPLQHY/action/storage_attestation","attest_author":"https://pith.science/pith/RRKY7GNU4BOJOFT55M6NEPLQHY/action/author_attestation","sign_citation":"https://pith.science/pith/RRKY7GNU4BOJOFT55M6NEPLQHY/action/citation_signature","submit_replication":"https://pith.science/pith/RRKY7GNU4BOJOFT55M6NEPLQHY/action/replication_record"}},"created_at":"2026-07-05T09:05:23.682700+00:00","updated_at":"2026-07-05T09:05:23.682700+00:00"}