{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:B7GCNDD3JSGH5OJ34MGLVBSXK3","short_pith_number":"pith:B7GCNDD3","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"},"canonical_sha256":"0fcc268c7b4c8c7eb93be30cba865756df64c64aef140bc64e435bf6fb4877f7","source":{"kind":"arxiv","id":"1907.08235","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08235","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08235v1","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08235","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"B7GCNDD3JSGH","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B7GCNDD3JSGH5OJ3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B7GCNDD3","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:B7GCNDD3JSGH5OJ34MGLVBSXK3","target":"record","payload":{"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"},"canonical_sha256":"0fcc268c7b4c8c7eb93be30cba865756df64c64aef140bc64e435bf6fb4877f7","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"},"source_kind":"arxiv","source_id":"1907.08235","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5yZh/5ytueQbEGdt5sEtXNPi0IdBM7gBfw3ULFzC3ubfC0xFL0S4XxCWcugZ9Wpdg4vGQq49Z/Rd4T6iOUiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:27:50.333651Z"},"content_sha256":"aaec29c1bdfa4be55e5a2a226cc0fda0e35771ac3b77dfc9c7053b5070a77d9e","schema_version":"1.0","event_id":"sha256:aaec29c1bdfa4be55e5a2a226cc0fda0e35771ac3b77dfc9c7053b5070a77d9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:B7GCNDD3JSGH5OJ34MGLVBSXK3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDj/DdenS0obvUTs2PLAoTNmJBiNG+eGy1Oa8KrB9MKDh0y/sV7R4t78RD4tlLHT8PATbqmHv7bw+TBmNoeUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:27:50.334000Z"},"content_sha256":"0430ca0ffabd943be04d5ea877bc5a61465c57aea66212248f453681c7c06f2d","schema_version":"1.0","event_id":"sha256:0430ca0ffabd943be04d5ea877bc5a61465c57aea66212248f453681c7c06f2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3/bundle.json","state_url":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T07:27:50Z","links":{"resolver":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3","bundle":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3/bundle.json","state":"https://pith.science/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7GCNDD3JSGH5OJ34MGLVBSXK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:B7GCNDD3JSGH5OJ34MGLVBSXK3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f22a8c0666f22b3f2260eeb5b4a56f41d5bcb29685a7933acb7f0e34a35bf35f","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-18T18:31:37Z","title_canon_sha256":"b1a53bb64715c3d2988b84830a8451edb1092754c4e775c26e549618d0d2bd35"},"schema_version":"1.0","source":{"id":"1907.08235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08235","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08235v1","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08235","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"B7GCNDD3JSGH","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B7GCNDD3JSGH5OJ3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B7GCNDD3","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:0430ca0ffabd943be04d5ea877bc5a61465c57aea66212248f453681c7c06f2d","target":"graph","created_at":"2026-05-17T23:40:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Michael McLaughlin, William Layton","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-18T18:31:37Z","title":"Doubly-Adaptive Artificial Compression Methods for Incompressible Flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08235","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aaec29c1bdfa4be55e5a2a226cc0fda0e35771ac3b77dfc9c7053b5070a77d9e","target":"record","created_at":"2026-05-17T23:40:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f22a8c0666f22b3f2260eeb5b4a56f41d5bcb29685a7933acb7f0e34a35bf35f","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-18T18:31:37Z","title_canon_sha256":"b1a53bb64715c3d2988b84830a8451edb1092754c4e775c26e549618d0d2bd35"},"schema_version":"1.0","source":{"id":"1907.08235","kind":"arxiv","version":1}},"canonical_sha256":"0fcc268c7b4c8c7eb93be30cba865756df64c64aef140bc64e435bf6fb4877f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fcc268c7b4c8c7eb93be30cba865756df64c64aef140bc64e435bf6fb4877f7","first_computed_at":"2026-05-17T23:40:10.482417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:10.482417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tc4yWbLsyDlKjQZaWn83i1Z1TkOU2xbMIZT827RzOtRvFEUNV5jpVZjXAtr9hsASJT+PEPY2e5OmywsKNO/0Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:10.483000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaec29c1bdfa4be55e5a2a226cc0fda0e35771ac3b77dfc9c7053b5070a77d9e","sha256:0430ca0ffabd943be04d5ea877bc5a61465c57aea66212248f453681c7c06f2d"],"state_sha256":"8cc91d07c3ed3518856421ddcf895a87d4ddf13363dfa57b60dbaa4a4f8be02e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCSBwAN4OSLzX105X3fRHe3VtkY6gmST9XGCabKbAqOaGB5h3MbjvX8HNpyjm/Mf7ROYZx3FuUs61JVeYq9UDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:27:50.335985Z","bundle_sha256":"3b48538b5af17df20230e0d47e8ad2f8f27ebe69f46943c1bf586d5dca64bd49"}}