{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IO5DTHDPZOG6EKNOVS3T6CHROV","short_pith_number":"pith:IO5DTHDP","schema_version":"1.0","canonical_sha256":"43ba399c6fcb8de229aeacb73f08f1754dc2fe9eeba9c7a62bd91e888df3470f","source":{"kind":"arxiv","id":"2411.06844","version":2},"attestation_state":"computed","paper":{"title":"A stable multiplicative dynamical low-rank discretization for the linear Boltzmann-BGK equation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Christian Klingenberg, Jonas Kusch, Lena Baumann, Lukas Einkemmer","submitted_at":"2024-11-11T10:22:17Z","abstract_excerpt":"The numerical method of dynamical low-rank approximation (DLRA) has recently been applied to various kinetic equations showing a significant reduction of the computational effort. In this paper, we apply this concept to the linear Boltzmann-Bhatnagar-Gross-Krook (Boltzmann-BGK) equation which due its high dimensionality is challenging to solve. Inspired by the special structure of the non-linear Boltzmann-BGK problem, we consider a multiplicative splitting of the distribution function. We propose a rank-adaptive DLRA scheme making use of the basis update & Galerkin integrator and combine it wi"},"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":"2411.06844","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2024-11-11T10:22:17Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"22e568f880ae651ad8e0c492fdd58755cc02535e58e45d564f0e79914ca6f5c4","abstract_canon_sha256":"a7af818cd4cc60ad79213d66addeb3dcfd60c605edfdab10e7f63bf03707239d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:03:18.514847Z","signature_b64":"/TaNUYKlMf/fkyhkg2wptDorb93d+yBor4ch/BWbhlVJRcKpPUe1y17tP8iHWDc6PvJHVDKb8n491d6E2Ae2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43ba399c6fcb8de229aeacb73f08f1754dc2fe9eeba9c7a62bd91e888df3470f","last_reissued_at":"2026-06-01T02:03:18.513766Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:03:18.513766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A stable multiplicative dynamical low-rank discretization for the linear Boltzmann-BGK equation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Christian Klingenberg, Jonas Kusch, Lena Baumann, Lukas Einkemmer","submitted_at":"2024-11-11T10:22:17Z","abstract_excerpt":"The numerical method of dynamical low-rank approximation (DLRA) has recently been applied to various kinetic equations showing a significant reduction of the computational effort. In this paper, we apply this concept to the linear Boltzmann-Bhatnagar-Gross-Krook (Boltzmann-BGK) equation which due its high dimensionality is challenging to solve. Inspired by the special structure of the non-linear Boltzmann-BGK problem, we consider a multiplicative splitting of the distribution function. We propose a rank-adaptive DLRA scheme making use of the basis update & Galerkin integrator and combine it wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.06844","kind":"arxiv","version":2},"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/2411.06844/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":"2411.06844","created_at":"2026-06-01T02:03:18.513900+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.06844v2","created_at":"2026-06-01T02:03:18.513900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.06844","created_at":"2026-06-01T02:03:18.513900+00:00"},{"alias_kind":"pith_short_12","alias_value":"IO5DTHDPZOG6","created_at":"2026-06-01T02:03:18.513900+00:00"},{"alias_kind":"pith_short_16","alias_value":"IO5DTHDPZOG6EKNO","created_at":"2026-06-01T02:03:18.513900+00:00"},{"alias_kind":"pith_short_8","alias_value":"IO5DTHDP","created_at":"2026-06-01T02:03:18.513900+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.03008","citing_title":"An energy stable and conservative multiplicative dynamical low-rank discretization for the Su-Olson problem","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IO5DTHDPZOG6EKNOVS3T6CHROV","json":"https://pith.science/pith/IO5DTHDPZOG6EKNOVS3T6CHROV.json","graph_json":"https://pith.science/api/pith-number/IO5DTHDPZOG6EKNOVS3T6CHROV/graph.json","events_json":"https://pith.science/api/pith-number/IO5DTHDPZOG6EKNOVS3T6CHROV/events.json","paper":"https://pith.science/paper/IO5DTHDP"},"agent_actions":{"view_html":"https://pith.science/pith/IO5DTHDPZOG6EKNOVS3T6CHROV","download_json":"https://pith.science/pith/IO5DTHDPZOG6EKNOVS3T6CHROV.json","view_paper":"https://pith.science/paper/IO5DTHDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.06844&json=true","fetch_graph":"https://pith.science/api/pith-number/IO5DTHDPZOG6EKNOVS3T6CHROV/graph.json","fetch_events":"https://pith.science/api/pith-number/IO5DTHDPZOG6EKNOVS3T6CHROV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IO5DTHDPZOG6EKNOVS3T6CHROV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IO5DTHDPZOG6EKNOVS3T6CHROV/action/storage_attestation","attest_author":"https://pith.science/pith/IO5DTHDPZOG6EKNOVS3T6CHROV/action/author_attestation","sign_citation":"https://pith.science/pith/IO5DTHDPZOG6EKNOVS3T6CHROV/action/citation_signature","submit_replication":"https://pith.science/pith/IO5DTHDPZOG6EKNOVS3T6CHROV/action/replication_record"}},"created_at":"2026-06-01T02:03:18.513900+00:00","updated_at":"2026-06-01T02:03:18.513900+00:00"}