{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3LHYNTOCHDFNLUSK62777Z7TTQ","short_pith_number":"pith:3LHYNTOC","schema_version":"1.0","canonical_sha256":"dacf86cdc238cad5d24af6bfffe7f39c2f28b536a1111829e2e276a0c96652db","source":{"kind":"arxiv","id":"1810.06705","version":3},"attestation_state":"computed","paper":{"title":"A time-accurate, adaptive discretization for fluid flow problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Haiyun Zhao, Victor DeCaria, William Layton","submitted_at":"2018-10-15T21:28:29Z","abstract_excerpt":"This report presents a low computational and cognitive complexity, stable, time accurate and adaptive method for the Navier-Stokes equations. The improved method requires a minimally intrusive modification to an existing program based on the fully implicit / backward Euler time discretization, does not add to the computational complexity, and is conceptually simple. The backward Euler approximation is simply post-processed with a two-step, linear time filter. The time filter additionally removes the overdamping of Backward Euler while remaining unconditionally energy stable, proven herein. Eve"},"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":"1810.06705","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-10-15T21:28:29Z","cross_cats_sorted":[],"title_canon_sha256":"7a13ddf4625bec6606f0f8db20d97939bd719b11cfa17ae3f508263db7f4889e","abstract_canon_sha256":"fe7bf0b906a8442a157fb8a05ead66e11b0720fd4abc3279a43ecdd513b5a61d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:03.219140Z","signature_b64":"YPh0cnLoilAhKVpf8Qeqg71tU3ns2PPemR+nt5grgWThRUMo0d7V2h8Ys5Nx6MotBPzbz/J8tgEiU3q5ie3fDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dacf86cdc238cad5d24af6bfffe7f39c2f28b536a1111829e2e276a0c96652db","last_reissued_at":"2026-05-17T23:55:03.218708Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:03.218708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A time-accurate, adaptive discretization for fluid flow problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Haiyun Zhao, Victor DeCaria, William Layton","submitted_at":"2018-10-15T21:28:29Z","abstract_excerpt":"This report presents a low computational and cognitive complexity, stable, time accurate and adaptive method for the Navier-Stokes equations. The improved method requires a minimally intrusive modification to an existing program based on the fully implicit / backward Euler time discretization, does not add to the computational complexity, and is conceptually simple. The backward Euler approximation is simply post-processed with a two-step, linear time filter. The time filter additionally removes the overdamping of Backward Euler while remaining unconditionally energy stable, proven herein. Eve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06705","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1810.06705","created_at":"2026-05-17T23:55:03.218772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06705v3","created_at":"2026-05-17T23:55:03.218772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06705","created_at":"2026-05-17T23:55:03.218772+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LHYNTOCHDFN","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LHYNTOCHDFNLUSK","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LHYNTOC","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08235","citing_title":"Doubly-Adaptive Artificial Compression Methods for Incompressible Flow","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3LHYNTOCHDFNLUSK62777Z7TTQ","json":"https://pith.science/pith/3LHYNTOCHDFNLUSK62777Z7TTQ.json","graph_json":"https://pith.science/api/pith-number/3LHYNTOCHDFNLUSK62777Z7TTQ/graph.json","events_json":"https://pith.science/api/pith-number/3LHYNTOCHDFNLUSK62777Z7TTQ/events.json","paper":"https://pith.science/paper/3LHYNTOC"},"agent_actions":{"view_html":"https://pith.science/pith/3LHYNTOCHDFNLUSK62777Z7TTQ","download_json":"https://pith.science/pith/3LHYNTOCHDFNLUSK62777Z7TTQ.json","view_paper":"https://pith.science/paper/3LHYNTOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06705&json=true","fetch_graph":"https://pith.science/api/pith-number/3LHYNTOCHDFNLUSK62777Z7TTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/3LHYNTOCHDFNLUSK62777Z7TTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LHYNTOCHDFNLUSK62777Z7TTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LHYNTOCHDFNLUSK62777Z7TTQ/action/storage_attestation","attest_author":"https://pith.science/pith/3LHYNTOCHDFNLUSK62777Z7TTQ/action/author_attestation","sign_citation":"https://pith.science/pith/3LHYNTOCHDFNLUSK62777Z7TTQ/action/citation_signature","submit_replication":"https://pith.science/pith/3LHYNTOCHDFNLUSK62777Z7TTQ/action/replication_record"}},"created_at":"2026-05-17T23:55:03.218772+00:00","updated_at":"2026-05-17T23:55:03.218772+00:00"}