{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:E2O2CF4BVE42RUGZ6G6ZKYL7YA","short_pith_number":"pith:E2O2CF4B","schema_version":"1.0","canonical_sha256":"269da11781a939a8d0d9f1bd95617fc0268fab1daf05344dd253ee09a24c1b8c","source":{"kind":"arxiv","id":"2606.31662","version":1},"attestation_state":"computed","paper":{"title":"Positivity-preserving dynamical low-rank methods for the Vlasov equation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Junjie Wen, Katharina Kormann, Murtazo Nazarov","submitted_at":"2026-06-30T13:41:41Z","abstract_excerpt":"In this manuscript, we introduce positivity-preserving correction methods for low-rank approximations of the Vlasov equation. The key idea is to formulate structural properties, including positivity-preservation, as constraints and to seek a minimal correction term that is added to the low-rank solution, by solving a quadratic programming problem. As a result, the corrected solution satisfies the constraints and preserve these properties, while remaining close to the original low-rank solution. Two positivity-preserving schemes are proposed in this work, and one of them also preserves the tota"},"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":"2606.31662","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-06-30T13:41:41Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"b15aeecdd9b2e68845cc57539d62a2ce4f9a6c79bc2c015b7db2a41aabbe5daf","abstract_canon_sha256":"de4e8d278bdc409a0a7113c47b1dabea6cffd379117bcdadcaf285241051daeb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:10.952335Z","signature_b64":"c+mYOgbEbE+H6x5ZTBSEX0vVlseehhMeF9IkwGi2dFH7Cqp5cHvhciAAe+I5aJKe08Z6lqo4ork6Mphw9QUtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"269da11781a939a8d0d9f1bd95617fc0268fab1daf05344dd253ee09a24c1b8c","last_reissued_at":"2026-07-01T01:18:10.951837Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:10.951837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Positivity-preserving dynamical low-rank methods for the Vlasov equation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Junjie Wen, Katharina Kormann, Murtazo Nazarov","submitted_at":"2026-06-30T13:41:41Z","abstract_excerpt":"In this manuscript, we introduce positivity-preserving correction methods for low-rank approximations of the Vlasov equation. The key idea is to formulate structural properties, including positivity-preservation, as constraints and to seek a minimal correction term that is added to the low-rank solution, by solving a quadratic programming problem. As a result, the corrected solution satisfies the constraints and preserve these properties, while remaining close to the original low-rank solution. Two positivity-preserving schemes are proposed in this work, and one of them also preserves the tota"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31662","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/2606.31662/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":"2606.31662","created_at":"2026-07-01T01:18:10.951912+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.31662v1","created_at":"2026-07-01T01:18:10.951912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31662","created_at":"2026-07-01T01:18:10.951912+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2O2CF4BVE42","created_at":"2026-07-01T01:18:10.951912+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2O2CF4BVE42RUGZ","created_at":"2026-07-01T01:18:10.951912+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2O2CF4B","created_at":"2026-07-01T01:18:10.951912+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/E2O2CF4BVE42RUGZ6G6ZKYL7YA","json":"https://pith.science/pith/E2O2CF4BVE42RUGZ6G6ZKYL7YA.json","graph_json":"https://pith.science/api/pith-number/E2O2CF4BVE42RUGZ6G6ZKYL7YA/graph.json","events_json":"https://pith.science/api/pith-number/E2O2CF4BVE42RUGZ6G6ZKYL7YA/events.json","paper":"https://pith.science/paper/E2O2CF4B"},"agent_actions":{"view_html":"https://pith.science/pith/E2O2CF4BVE42RUGZ6G6ZKYL7YA","download_json":"https://pith.science/pith/E2O2CF4BVE42RUGZ6G6ZKYL7YA.json","view_paper":"https://pith.science/paper/E2O2CF4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.31662&json=true","fetch_graph":"https://pith.science/api/pith-number/E2O2CF4BVE42RUGZ6G6ZKYL7YA/graph.json","fetch_events":"https://pith.science/api/pith-number/E2O2CF4BVE42RUGZ6G6ZKYL7YA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2O2CF4BVE42RUGZ6G6ZKYL7YA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2O2CF4BVE42RUGZ6G6ZKYL7YA/action/storage_attestation","attest_author":"https://pith.science/pith/E2O2CF4BVE42RUGZ6G6ZKYL7YA/action/author_attestation","sign_citation":"https://pith.science/pith/E2O2CF4BVE42RUGZ6G6ZKYL7YA/action/citation_signature","submit_replication":"https://pith.science/pith/E2O2CF4BVE42RUGZ6G6ZKYL7YA/action/replication_record"}},"created_at":"2026-07-01T01:18:10.951912+00:00","updated_at":"2026-07-01T01:18:10.951912+00:00"}