{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7CJ25ZJUPTBXAVMP3TVRF346GE","short_pith_number":"pith:7CJ25ZJU","schema_version":"1.0","canonical_sha256":"f893aee5347cc370558fdceb12ef9e3116d052c64195e885bf345162da1b646b","source":{"kind":"arxiv","id":"1805.08083","version":1},"attestation_state":"computed","paper":{"title":"Assessment of continuous and discrete adjoint method for sensitivity analysis in two-phase flow simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.comp-ph","authors_text":"Guojun Hu, Tomasz Kozlowski","submitted_at":"2018-05-18T14:51:09Z","abstract_excerpt":"The efficient method for computing the sensitivities is the adjoint method. The cost of solving an adjoint equation is comparable to the cost of solving the governing equation. Once the adjoint solution is obtained, the sensitivities to any number of parameters can be obtained with little effort. There are two methods to develop the adjoint equations: continuous method and discrete method. In the continuous method, the control theory is applied to the forward governing equation and produces an analytical partial differential equation for solving the adjoint variable; in the discrete method, th"},"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":"1805.08083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2018-05-18T14:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"909eb1bc2607ec928cf8ef891d6cf5247ea9e625db7fcc27c5aea896ab56806f","abstract_canon_sha256":"cb5618a2e9b50216c935d91c49513c4d4c82796b651b5fae5f272e3930d270b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:31.757324Z","signature_b64":"8yBADLKN81KRIbFYG2ALKcBhIXZHH42GVYvdC1BJQX87I9O2siRqhYM1nLGTfSne8BlpioRlAStp4hoahe7dBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f893aee5347cc370558fdceb12ef9e3116d052c64195e885bf345162da1b646b","last_reissued_at":"2026-05-18T00:15:31.756583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:31.756583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Assessment of continuous and discrete adjoint method for sensitivity analysis in two-phase flow simulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.comp-ph","authors_text":"Guojun Hu, Tomasz Kozlowski","submitted_at":"2018-05-18T14:51:09Z","abstract_excerpt":"The efficient method for computing the sensitivities is the adjoint method. The cost of solving an adjoint equation is comparable to the cost of solving the governing equation. Once the adjoint solution is obtained, the sensitivities to any number of parameters can be obtained with little effort. There are two methods to develop the adjoint equations: continuous method and discrete method. In the continuous method, the control theory is applied to the forward governing equation and produces an analytical partial differential equation for solving the adjoint variable; in the discrete method, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08083","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":"1805.08083","created_at":"2026-05-18T00:15:31.756709+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08083v1","created_at":"2026-05-18T00:15:31.756709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08083","created_at":"2026-05-18T00:15:31.756709+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CJ25ZJUPTBX","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CJ25ZJUPTBXAVMP","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CJ25ZJU","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2001.04385","citing_title":"Universal Differential Equations for Scientific Machine Learning","ref_index":102,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7CJ25ZJUPTBXAVMP3TVRF346GE","json":"https://pith.science/pith/7CJ25ZJUPTBXAVMP3TVRF346GE.json","graph_json":"https://pith.science/api/pith-number/7CJ25ZJUPTBXAVMP3TVRF346GE/graph.json","events_json":"https://pith.science/api/pith-number/7CJ25ZJUPTBXAVMP3TVRF346GE/events.json","paper":"https://pith.science/paper/7CJ25ZJU"},"agent_actions":{"view_html":"https://pith.science/pith/7CJ25ZJUPTBXAVMP3TVRF346GE","download_json":"https://pith.science/pith/7CJ25ZJUPTBXAVMP3TVRF346GE.json","view_paper":"https://pith.science/paper/7CJ25ZJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08083&json=true","fetch_graph":"https://pith.science/api/pith-number/7CJ25ZJUPTBXAVMP3TVRF346GE/graph.json","fetch_events":"https://pith.science/api/pith-number/7CJ25ZJUPTBXAVMP3TVRF346GE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CJ25ZJUPTBXAVMP3TVRF346GE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CJ25ZJUPTBXAVMP3TVRF346GE/action/storage_attestation","attest_author":"https://pith.science/pith/7CJ25ZJUPTBXAVMP3TVRF346GE/action/author_attestation","sign_citation":"https://pith.science/pith/7CJ25ZJUPTBXAVMP3TVRF346GE/action/citation_signature","submit_replication":"https://pith.science/pith/7CJ25ZJUPTBXAVMP3TVRF346GE/action/replication_record"}},"created_at":"2026-05-18T00:15:31.756709+00:00","updated_at":"2026-05-18T00:15:31.756709+00:00"}