{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZTGO6HUO7ZEHDSJ4UD5SH2NWQI","short_pith_number":"pith:ZTGO6HUO","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"},"canonical_sha256":"ccccef1e8efe4871c93ca0fb23e9b6823ee5ffa169b4191980a7f52eb9b06af1","source":{"kind":"arxiv","id":"1810.10735","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10735","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10735v1","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10735","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZTGO6HUO7ZEH","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZTGO6HUO7ZEHDSJ4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZTGO6HUO","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZTGO6HUO7ZEHDSJ4UD5SH2NWQI","target":"record","payload":{"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"},"canonical_sha256":"ccccef1e8efe4871c93ca0fb23e9b6823ee5ffa169b4191980a7f52eb9b06af1","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"},"source_kind":"arxiv","source_id":"1810.10735","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3dMqCu+VKdM/Gag0AGHLwu+hu1ENl4IFvrvuGU/JB1G+DiUanhnNpgaZ3TMQHwWiuTBqzVTmkvtp39p7bkHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:05:39.001516Z"},"content_sha256":"5991eab3a7c623f7e699f0de23c505ae456c4e983c88fc423b058040a6690d6e","schema_version":"1.0","event_id":"sha256:5991eab3a7c623f7e699f0de23c505ae456c4e983c88fc423b058040a6690d6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZTGO6HUO7ZEHDSJ4UD5SH2NWQI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:02:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JA2acISmx32EjwdZ5swA+Zh/yqbNYMt8/ZUNp1LVmRU4HQh4iM8Mtbho7MpyKAJ2EZQKEBXfoGzNn+n4JacKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:05:39.002192Z"},"content_sha256":"08976b3f10b1eaac0c6d474d24fc0c6916423bb097413b7975317df5028b5bdc","schema_version":"1.0","event_id":"sha256:08976b3f10b1eaac0c6d474d24fc0c6916423bb097413b7975317df5028b5bdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/bundle.json","state_url":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T20:05:39Z","links":{"resolver":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI","bundle":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/bundle.json","state":"https://pith.science/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTGO6HUO7ZEHDSJ4UD5SH2NWQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZTGO6HUO7ZEHDSJ4UD5SH2NWQI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b5731d8a0e6fd6d680c8021dc18c4f45de304320b50d1ca3682bc7b75791cf54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-25T06:24:10Z","title_canon_sha256":"253e0ee57f006f08c640af4a41b530012d7dbba6cd30aa1807126f057950ff02"},"schema_version":"1.0","source":{"id":"1810.10735","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10735","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10735v1","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10735","created_at":"2026-05-18T00:02:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZTGO6HUO7ZEH","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZTGO6HUO7ZEHDSJ4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZTGO6HUO","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:08976b3f10b1eaac0c6d474d24fc0c6916423bb097413b7975317df5028b5bdc","target":"graph","created_at":"2026-05-18T00:02:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Gerd Wachsmuth, S\\\"oren Bartels","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-25T06:24:10Z","title":"Numerical approximation of optimal convex shapes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10735","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5991eab3a7c623f7e699f0de23c505ae456c4e983c88fc423b058040a6690d6e","target":"record","created_at":"2026-05-18T00:02:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b5731d8a0e6fd6d680c8021dc18c4f45de304320b50d1ca3682bc7b75791cf54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-25T06:24:10Z","title_canon_sha256":"253e0ee57f006f08c640af4a41b530012d7dbba6cd30aa1807126f057950ff02"},"schema_version":"1.0","source":{"id":"1810.10735","kind":"arxiv","version":1}},"canonical_sha256":"ccccef1e8efe4871c93ca0fb23e9b6823ee5ffa169b4191980a7f52eb9b06af1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccccef1e8efe4871c93ca0fb23e9b6823ee5ffa169b4191980a7f52eb9b06af1","first_computed_at":"2026-05-18T00:02:19.780392Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:19.780392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0l9FdtEmaZa1dwDNfENX1qc0FOI09f/t5giCYygW/BcnaBdieYwuOa7zB3oKa0Tdze7Hn+xYDuoPltc1cQaQBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:19.780744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10735","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5991eab3a7c623f7e699f0de23c505ae456c4e983c88fc423b058040a6690d6e","sha256:08976b3f10b1eaac0c6d474d24fc0c6916423bb097413b7975317df5028b5bdc"],"state_sha256":"c6e5f78919f06bc689d87eeb9567793569f6c02fef2384e7a5403d3b2e5999d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fi7o0l1aTH6ISJXPXwNYdsjBBv4gJ/VQfZ/wVfWuzF5IpmrBilDqHFQfbzFVsjcK7s6/EQQ7isrpg2rOAgT6AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:05:39.005958Z","bundle_sha256":"23b9de674966a3d4f0f01f811a8e194c824353db65e573c043512ffdc0325f0b"}}