{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZTGO6HUO7ZEHDSJ4UD5SH2NWQI","short_pith_number":"pith:ZTGO6HUO","schema_version":"1.0","canonical_sha256":"ccccef1e8efe4871c93ca0fb23e9b6823ee5ffa169b4191980a7f52eb9b06af1","source":{"kind":"arxiv","id":"1810.10735","version":1},"attestation_state":"computed","paper":{"title":"Numerical approximation of optimal convex shapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gerd Wachsmuth, S\\\"oren Bartels","submitted_at":"2018-10-25T06:24:10Z","abstract_excerpt":"This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem. Moreover, we prove the convergence of discretizations in two-dimensional situations. A numerical algorithm is devised that iteratively solves the discrete formulation. Numerical experiments show that optimal convex shapes are generally non-smooth and that three-dimensional problems require an appropriate relaxation of the convexity condition."},"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":"1810.10735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-25T06:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"253e0ee57f006f08c640af4a41b530012d7dbba6cd30aa1807126f057950ff02","abstract_canon_sha256":"b5731d8a0e6fd6d680c8021dc18c4f45de304320b50d1ca3682bc7b75791cf54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:19.780744Z","signature_b64":"0l9FdtEmaZa1dwDNfENX1qc0FOI09f/t5giCYygW/BcnaBdieYwuOa7zB3oKa0Tdze7Hn+xYDuoPltc1cQaQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccccef1e8efe4871c93ca0fb23e9b6823ee5ffa169b4191980a7f52eb9b06af1","last_reissued_at":"2026-05-18T00:02:19.780392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:19.780392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical approximation of optimal convex shapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gerd Wachsmuth, S\\\"oren Bartels","submitted_at":"2018-10-25T06:24:10Z","abstract_excerpt":"This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem. Moreover, we prove the convergence of discretizations in two-dimensional situations. A numerical algorithm is devised that iteratively solves the discrete formulation. Numerical experiments show that optimal convex shapes are generally non-smooth and that three-dimensional problems require an appropriate relaxation of the convexity condition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10735","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":"1810.10735","created_at":"2026-05-18T00:02:19.780446+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10735v1","created_at":"2026-05-18T00:02:19.780446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10735","created_at":"2026-05-18T00:02:19.780446+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTGO6HUO7ZEH","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTGO6HUO7ZEHDSJ4","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTGO6HUO","created_at":"2026-05-18T12:33:07.085635+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/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI","json":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI.json","graph_json":"https://pith.science/api/pith-number/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/graph.json","events_json":"https://pith.science/api/pith-number/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/events.json","paper":"https://pith.science/paper/ZTGO6HUO"},"agent_actions":{"view_html":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI","download_json":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI.json","view_paper":"https://pith.science/paper/ZTGO6HUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10735&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/action/storage_attestation","attest_author":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/action/author_attestation","sign_citation":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/action/citation_signature","submit_replication":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/action/replication_record"}},"created_at":"2026-05-18T00:02:19.780446+00:00","updated_at":"2026-05-18T00:02:19.780446+00:00"}