{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VQFXICPANSRMBZ3VC6JMGTLX4H","short_pith_number":"pith:VQFXICPA","schema_version":"1.0","canonical_sha256":"ac0b7409e06ca2c0e7751792c34d77e1fac8f92340667e3e5645612d0ccc17c6","source":{"kind":"arxiv","id":"1609.02836","version":1},"attestation_state":"computed","paper":{"title":"A Cut Finite Element Method for the Bernoulli Free Boundary Value Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daniel Elfverson, Erik Burman, Karl Larsson, Mats G. Larson, Peter Hansbo","submitted_at":"2016-09-09T15:42:33Z","abstract_excerpt":"We develop a cut finite element method for the Bernoulli free boundary problem. The free boundary, represented by an approximate signed distance function on a fixed background mesh, is allowed to intersect elements in an arbitrary fashion. This leads to so called cut elements in the vicinity of the boundary. To obtain a stable method, stabilization terms is added in the vicinity of the cut elements penalizing the gradient jumps across element sides. The stabilization also ensures good conditioning of the resulting discrete system. We develop a method for shape optimization based on moving the "},"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":"1609.02836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-09-09T15:42:33Z","cross_cats_sorted":[],"title_canon_sha256":"f1c5c3473cfa4a674b25e58b67c29a8f46e07ccd9f7499690811dffc76074de4","abstract_canon_sha256":"5309bb0399c0f05314d7740835d0a9d3a9569a1a9a433f99159af8810d4babef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:10.825896Z","signature_b64":"aWIPZr3eXhu1iUaPgeU+8iIVbrXTvLb9TIZQVLGTKDepBUdFKXSdPZ/qTDBwwpaw6ucQWo6avjuWxDW28GeIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac0b7409e06ca2c0e7751792c34d77e1fac8f92340667e3e5645612d0ccc17c6","last_reissued_at":"2026-05-18T00:47:10.825184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:10.825184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Cut Finite Element Method for the Bernoulli Free Boundary Value Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daniel Elfverson, Erik Burman, Karl Larsson, Mats G. Larson, Peter Hansbo","submitted_at":"2016-09-09T15:42:33Z","abstract_excerpt":"We develop a cut finite element method for the Bernoulli free boundary problem. The free boundary, represented by an approximate signed distance function on a fixed background mesh, is allowed to intersect elements in an arbitrary fashion. This leads to so called cut elements in the vicinity of the boundary. To obtain a stable method, stabilization terms is added in the vicinity of the cut elements penalizing the gradient jumps across element sides. The stabilization also ensures good conditioning of the resulting discrete system. We develop a method for shape optimization based on moving the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02836","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":"1609.02836","created_at":"2026-05-18T00:47:10.825283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02836v1","created_at":"2026-05-18T00:47:10.825283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02836","created_at":"2026-05-18T00:47:10.825283+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQFXICPANSRM","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQFXICPANSRMBZ3V","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQFXICPA","created_at":"2026-05-18T12:30:48.956258+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/VQFXICPANSRMBZ3VC6JMGTLX4H","json":"https://pith.science/pith/VQFXICPANSRMBZ3VC6JMGTLX4H.json","graph_json":"https://pith.science/api/pith-number/VQFXICPANSRMBZ3VC6JMGTLX4H/graph.json","events_json":"https://pith.science/api/pith-number/VQFXICPANSRMBZ3VC6JMGTLX4H/events.json","paper":"https://pith.science/paper/VQFXICPA"},"agent_actions":{"view_html":"https://pith.science/pith/VQFXICPANSRMBZ3VC6JMGTLX4H","download_json":"https://pith.science/pith/VQFXICPANSRMBZ3VC6JMGTLX4H.json","view_paper":"https://pith.science/paper/VQFXICPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02836&json=true","fetch_graph":"https://pith.science/api/pith-number/VQFXICPANSRMBZ3VC6JMGTLX4H/graph.json","fetch_events":"https://pith.science/api/pith-number/VQFXICPANSRMBZ3VC6JMGTLX4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQFXICPANSRMBZ3VC6JMGTLX4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQFXICPANSRMBZ3VC6JMGTLX4H/action/storage_attestation","attest_author":"https://pith.science/pith/VQFXICPANSRMBZ3VC6JMGTLX4H/action/author_attestation","sign_citation":"https://pith.science/pith/VQFXICPANSRMBZ3VC6JMGTLX4H/action/citation_signature","submit_replication":"https://pith.science/pith/VQFXICPANSRMBZ3VC6JMGTLX4H/action/replication_record"}},"created_at":"2026-05-18T00:47:10.825283+00:00","updated_at":"2026-05-18T00:47:10.825283+00:00"}