{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:B7GCNDD3JSGH5OJ34MGLVBSXK3","short_pith_number":"pith:B7GCNDD3","schema_version":"1.0","canonical_sha256":"0fcc268c7b4c8c7eb93be30cba865756df64c64aef140bc64e435bf6fb4877f7","source":{"kind":"arxiv","id":"1907.08235","version":1},"attestation_state":"computed","paper":{"title":"Doubly-Adaptive Artificial Compression Methods for Incompressible Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Michael McLaughlin, William Layton","submitted_at":"2019-07-18T18:31:37Z","abstract_excerpt":"This report presents adaptive artificial compression methods in which the time-step and artificial compression parameter $\\varepsilon $ are independently adapted. The resulting algorithms are supported by analysis and numerical tests. The first and second-order methods are embedded. As a result, the computational, cognitive and space complexities of the adaptive $% \\varepsilon ,k$ algorithms are negligibly greater than that of the simplest, first-order, constant $\\varepsilon ,$ constant $k$ artificial compression method."},"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":"1907.08235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-18T18:31:37Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"b1a53bb64715c3d2988b84830a8451edb1092754c4e775c26e549618d0d2bd35","abstract_canon_sha256":"f22a8c0666f22b3f2260eeb5b4a56f41d5bcb29685a7933acb7f0e34a35bf35f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:10.483000Z","signature_b64":"Tc4yWbLsyDlKjQZaWn83i1Z1TkOU2xbMIZT827RzOtRvFEUNV5jpVZjXAtr9hsASJT+PEPY2e5OmywsKNO/0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fcc268c7b4c8c7eb93be30cba865756df64c64aef140bc64e435bf6fb4877f7","last_reissued_at":"2026-05-17T23:40:10.482417Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:10.482417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doubly-Adaptive Artificial Compression Methods for Incompressible Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Michael McLaughlin, William Layton","submitted_at":"2019-07-18T18:31:37Z","abstract_excerpt":"This report presents adaptive artificial compression methods in which the time-step and artificial compression parameter $\\varepsilon $ are independently adapted. The resulting algorithms are supported by analysis and numerical tests. The first and second-order methods are embedded. As a result, the computational, cognitive and space complexities of the adaptive $% \\varepsilon ,k$ algorithms are negligibly greater than that of the simplest, first-order, constant $\\varepsilon ,$ constant $k$ artificial compression method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08235","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":""},"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":"1907.08235","created_at":"2026-05-17T23:40:10.482490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08235v1","created_at":"2026-05-17T23:40:10.482490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08235","created_at":"2026-05-17T23:40:10.482490+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7GCNDD3JSGH","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7GCNDD3JSGH5OJ3","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7GCNDD3","created_at":"2026-05-18T12:33:12.712433+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/B7GCNDD3JSGH5OJ34MGLVBSXK3","json":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3.json","graph_json":"https://pith.science/api/pith-number/B7GCNDD3JSGH5OJ34MGLVBSXK3/graph.json","events_json":"https://pith.science/api/pith-number/B7GCNDD3JSGH5OJ34MGLVBSXK3/events.json","paper":"https://pith.science/paper/B7GCNDD3"},"agent_actions":{"view_html":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3","download_json":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3.json","view_paper":"https://pith.science/paper/B7GCNDD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08235&json=true","fetch_graph":"https://pith.science/api/pith-number/B7GCNDD3JSGH5OJ34MGLVBSXK3/graph.json","fetch_events":"https://pith.science/api/pith-number/B7GCNDD3JSGH5OJ34MGLVBSXK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3/action/storage_attestation","attest_author":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3/action/author_attestation","sign_citation":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3/action/citation_signature","submit_replication":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3/action/replication_record"}},"created_at":"2026-05-17T23:40:10.482490+00:00","updated_at":"2026-05-17T23:40:10.482490+00:00"}