{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LGJ3WTAMPGQUSDV2ZZG3HCR5TX","short_pith_number":"pith:LGJ3WTAM","schema_version":"1.0","canonical_sha256":"5993bb4c0c79a1490ebace4db38a3d9de45f4ea5b6c4d8005d43c1c2535cb9ca","source":{"kind":"arxiv","id":"2307.12444","version":7},"attestation_state":"computed","paper":{"title":"Proximal Galerkin: A structure-preserving finite element method for pointwise bound constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Brendan Keith, Thomas M. Surowiec","submitted_at":"2023-07-23T22:12:20Z","abstract_excerpt":"The proximal Galerkin finite element method is a high-order, low-iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of point-wise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin 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":"2307.12444","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-07-23T22:12:20Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"e873df3e52a8737b201a6c04fe6ffa262530f86081054f736abd211baea61363","abstract_canon_sha256":"b786f1b7f42710fac42e49d706c6a8fb80ce9347a0358e08dde60e6479a5d768"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:29.565564Z","signature_b64":"rbCYEngtQ3mT/wDEsOkIo/VZMUNG66szhAz6HUC7rO3bmCfHA2HRTkQ2V94FzFUZ/vwDBDtItm2YQ/gf7NPPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5993bb4c0c79a1490ebace4db38a3d9de45f4ea5b6c4d8005d43c1c2535cb9ca","last_reissued_at":"2026-07-05T09:50:29.565054Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:29.565054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximal Galerkin: A structure-preserving finite element method for pointwise bound constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Brendan Keith, Thomas M. Surowiec","submitted_at":"2023-07-23T22:12:20Z","abstract_excerpt":"The proximal Galerkin finite element method is a high-order, low-iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of point-wise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.12444","kind":"arxiv","version":7},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.12444/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.12444","created_at":"2026-07-05T09:50:29.565117+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.12444v7","created_at":"2026-07-05T09:50:29.565117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.12444","created_at":"2026-07-05T09:50:29.565117+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGJ3WTAMPGQU","created_at":"2026-07-05T09:50:29.565117+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGJ3WTAMPGQUSDV2","created_at":"2026-07-05T09:50:29.565117+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGJ3WTAM","created_at":"2026-07-05T09:50:29.565117+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.18565","citing_title":"A neural network approach to learning solutions of a class of elliptic variational inequalities","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LGJ3WTAMPGQUSDV2ZZG3HCR5TX","json":"https://pith.science/pith/LGJ3WTAMPGQUSDV2ZZG3HCR5TX.json","graph_json":"https://pith.science/api/pith-number/LGJ3WTAMPGQUSDV2ZZG3HCR5TX/graph.json","events_json":"https://pith.science/api/pith-number/LGJ3WTAMPGQUSDV2ZZG3HCR5TX/events.json","paper":"https://pith.science/paper/LGJ3WTAM"},"agent_actions":{"view_html":"https://pith.science/pith/LGJ3WTAMPGQUSDV2ZZG3HCR5TX","download_json":"https://pith.science/pith/LGJ3WTAMPGQUSDV2ZZG3HCR5TX.json","view_paper":"https://pith.science/paper/LGJ3WTAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.12444&json=true","fetch_graph":"https://pith.science/api/pith-number/LGJ3WTAMPGQUSDV2ZZG3HCR5TX/graph.json","fetch_events":"https://pith.science/api/pith-number/LGJ3WTAMPGQUSDV2ZZG3HCR5TX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGJ3WTAMPGQUSDV2ZZG3HCR5TX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGJ3WTAMPGQUSDV2ZZG3HCR5TX/action/storage_attestation","attest_author":"https://pith.science/pith/LGJ3WTAMPGQUSDV2ZZG3HCR5TX/action/author_attestation","sign_citation":"https://pith.science/pith/LGJ3WTAMPGQUSDV2ZZG3HCR5TX/action/citation_signature","submit_replication":"https://pith.science/pith/LGJ3WTAMPGQUSDV2ZZG3HCR5TX/action/replication_record"}},"created_at":"2026-07-05T09:50:29.565117+00:00","updated_at":"2026-07-05T09:50:29.565117+00:00"}