{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WRGMTBSYMWZIQDC4JUIC7JFUNX","short_pith_number":"pith:WRGMTBSY","schema_version":"1.0","canonical_sha256":"b44cc9865865b2880c5c4d102fa4b46dea01f96009ab1d166b3c2af452413a88","source":{"kind":"arxiv","id":"2306.02461","version":1},"attestation_state":"computed","paper":{"title":"The Semi-implicit DLN Algorithm for the Navier Stokes Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Wenlong Pei","submitted_at":"2023-06-04T20:30:18Z","abstract_excerpt":"Dahlquist, Liniger, and Nevanlinna design a family of one-leg, two-step methods (the DLN method) that is second order, A- and G-stable for arbitrary, non-uniform time steps. Recently, the implementation of the DLN method can be simplified by the refactorization process (adding time filters on backward Euler scheme). Due to these fine properties, the DLN method has strong potential for the numerical simulation of time-dependent fluid models. In the report, we propose a semi-implicit DLN algorithm for the Navier Stokes equations (avoiding non-linear solver at each time step) and prove the uncond"},"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":"2306.02461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-06-04T20:30:18Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"4ac2dc27aa8301f6feae9d56229dba878f4d9a56bb2c9519472512617c17d2ce","abstract_canon_sha256":"3e2b438bd71b2786ec210a05d61f4ae064393a7b34a6808ff388b449c01f7aa7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:17:17.630355Z","signature_b64":"3LIHinqfMCY/lYeVBYa9UFeoT5sO/bXNG4LPqSjiWhct3wUvfJUoh2ocsRHKkvmVOY+yNc08mTcTLpnZ1Z+JAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b44cc9865865b2880c5c4d102fa4b46dea01f96009ab1d166b3c2af452413a88","last_reissued_at":"2026-07-05T06:17:17.629932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:17:17.629932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Semi-implicit DLN Algorithm for the Navier Stokes Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Wenlong Pei","submitted_at":"2023-06-04T20:30:18Z","abstract_excerpt":"Dahlquist, Liniger, and Nevanlinna design a family of one-leg, two-step methods (the DLN method) that is second order, A- and G-stable for arbitrary, non-uniform time steps. Recently, the implementation of the DLN method can be simplified by the refactorization process (adding time filters on backward Euler scheme). Due to these fine properties, the DLN method has strong potential for the numerical simulation of time-dependent fluid models. In the report, we propose a semi-implicit DLN algorithm for the Navier Stokes equations (avoiding non-linear solver at each time step) and prove the uncond"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.02461","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/2306.02461/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":"2306.02461","created_at":"2026-07-05T06:17:17.630001+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.02461v1","created_at":"2026-07-05T06:17:17.630001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.02461","created_at":"2026-07-05T06:17:17.630001+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRGMTBSYMWZI","created_at":"2026-07-05T06:17:17.630001+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRGMTBSYMWZIQDC4","created_at":"2026-07-05T06:17:17.630001+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRGMTBSY","created_at":"2026-07-05T06:17:17.630001+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/WRGMTBSYMWZIQDC4JUIC7JFUNX","json":"https://pith.science/pith/WRGMTBSYMWZIQDC4JUIC7JFUNX.json","graph_json":"https://pith.science/api/pith-number/WRGMTBSYMWZIQDC4JUIC7JFUNX/graph.json","events_json":"https://pith.science/api/pith-number/WRGMTBSYMWZIQDC4JUIC7JFUNX/events.json","paper":"https://pith.science/paper/WRGMTBSY"},"agent_actions":{"view_html":"https://pith.science/pith/WRGMTBSYMWZIQDC4JUIC7JFUNX","download_json":"https://pith.science/pith/WRGMTBSYMWZIQDC4JUIC7JFUNX.json","view_paper":"https://pith.science/paper/WRGMTBSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.02461&json=true","fetch_graph":"https://pith.science/api/pith-number/WRGMTBSYMWZIQDC4JUIC7JFUNX/graph.json","fetch_events":"https://pith.science/api/pith-number/WRGMTBSYMWZIQDC4JUIC7JFUNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRGMTBSYMWZIQDC4JUIC7JFUNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRGMTBSYMWZIQDC4JUIC7JFUNX/action/storage_attestation","attest_author":"https://pith.science/pith/WRGMTBSYMWZIQDC4JUIC7JFUNX/action/author_attestation","sign_citation":"https://pith.science/pith/WRGMTBSYMWZIQDC4JUIC7JFUNX/action/citation_signature","submit_replication":"https://pith.science/pith/WRGMTBSYMWZIQDC4JUIC7JFUNX/action/replication_record"}},"created_at":"2026-07-05T06:17:17.630001+00:00","updated_at":"2026-07-05T06:17:17.630001+00:00"}