{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:K2KQA43TIWGXOOXDUJVX7LCLJG","short_pith_number":"pith:K2KQA43T","schema_version":"1.0","canonical_sha256":"5695007373458d773ae3a26b7fac4b49977eb38a262bf25030241a2f63c51ffc","source":{"kind":"arxiv","id":"1204.5577","version":2},"attestation_state":"computed","paper":{"title":"Automated derivation of the adjoint of high-level transient finite element programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"(2) Department of Computing Imperial College London, 3), (3) Grantham Institute for Climate Change Imperial College London, (4) Simula Research Laboratory Lysaker Norway), David A. Ham (2, Engineering Imperial College London, Marie E. Rognes (4) ((1) Department of Earth Science, Patrick E. Farrell (1), Simon F. Funke (1","submitted_at":"2012-04-25T07:25:31Z","abstract_excerpt":"In this paper we demonstrate a new technique for deriving discrete adjoint and tangent linear models of finite element models. The technique is significantly more efficient and automatic than standard algorithmic differentiation techniques. The approach relies on a high-level symbolic representation of the forward problem. In contrast to developing a model directly in Fortran or C++, high-level systems allow the developer to express the variational problems to be solved in near-mathematical notation. As such, these systems have a key advantage: since the mathematical structure of the problem i"},"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":"1204.5577","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2012-04-25T07:25:31Z","cross_cats_sorted":[],"title_canon_sha256":"a0c8a2ba5a364a78950dedfca6f5d58535c322b1309f35983d8fc90f3a47e539","abstract_canon_sha256":"7e89cfb2d31065390de1354d543d054f1b4a0b5b71913fec4597d257ffa642eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:24.522937Z","signature_b64":"nkMvQAba0fNmr5Y2smoULYdkwBckRqOts/8P31XmDOgufAnDCZG4AFuMUk2p410MaTKj3SyHqNz2853ggJ8/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5695007373458d773ae3a26b7fac4b49977eb38a262bf25030241a2f63c51ffc","last_reissued_at":"2026-05-18T03:10:24.521975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:24.521975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated derivation of the adjoint of high-level transient finite element programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"(2) Department of Computing Imperial College London, 3), (3) Grantham Institute for Climate Change Imperial College London, (4) Simula Research Laboratory Lysaker Norway), David A. Ham (2, Engineering Imperial College London, Marie E. Rognes (4) ((1) Department of Earth Science, Patrick E. Farrell (1), Simon F. Funke (1","submitted_at":"2012-04-25T07:25:31Z","abstract_excerpt":"In this paper we demonstrate a new technique for deriving discrete adjoint and tangent linear models of finite element models. The technique is significantly more efficient and automatic than standard algorithmic differentiation techniques. The approach relies on a high-level symbolic representation of the forward problem. In contrast to developing a model directly in Fortran or C++, high-level systems allow the developer to express the variational problems to be solved in near-mathematical notation. As such, these systems have a key advantage: since the mathematical structure of the problem i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5577","kind":"arxiv","version":2},"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":"1204.5577","created_at":"2026-05-18T03:10:24.522115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5577v2","created_at":"2026-05-18T03:10:24.522115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5577","created_at":"2026-05-18T03:10:24.522115+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2KQA43TIWGX","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2KQA43TIWGXOOXD","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2KQA43T","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.00760","citing_title":"Variational Inference Using a Differentiable Multigrid Linear Solver","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K2KQA43TIWGXOOXDUJVX7LCLJG","json":"https://pith.science/pith/K2KQA43TIWGXOOXDUJVX7LCLJG.json","graph_json":"https://pith.science/api/pith-number/K2KQA43TIWGXOOXDUJVX7LCLJG/graph.json","events_json":"https://pith.science/api/pith-number/K2KQA43TIWGXOOXDUJVX7LCLJG/events.json","paper":"https://pith.science/paper/K2KQA43T"},"agent_actions":{"view_html":"https://pith.science/pith/K2KQA43TIWGXOOXDUJVX7LCLJG","download_json":"https://pith.science/pith/K2KQA43TIWGXOOXDUJVX7LCLJG.json","view_paper":"https://pith.science/paper/K2KQA43T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5577&json=true","fetch_graph":"https://pith.science/api/pith-number/K2KQA43TIWGXOOXDUJVX7LCLJG/graph.json","fetch_events":"https://pith.science/api/pith-number/K2KQA43TIWGXOOXDUJVX7LCLJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2KQA43TIWGXOOXDUJVX7LCLJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2KQA43TIWGXOOXDUJVX7LCLJG/action/storage_attestation","attest_author":"https://pith.science/pith/K2KQA43TIWGXOOXDUJVX7LCLJG/action/author_attestation","sign_citation":"https://pith.science/pith/K2KQA43TIWGXOOXDUJVX7LCLJG/action/citation_signature","submit_replication":"https://pith.science/pith/K2KQA43TIWGXOOXDUJVX7LCLJG/action/replication_record"}},"created_at":"2026-05-18T03:10:24.522115+00:00","updated_at":"2026-05-18T03:10:24.522115+00:00"}