{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JXBWDTEMKSUXIJDISIAFTLURO2","short_pith_number":"pith:JXBWDTEM","canonical_record":{"source":{"id":"1604.04921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-17T20:32:50Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"902834bfce25751ddfdf8923ed9dc51ae26e9d6b286555aff397d00904adda62","abstract_canon_sha256":"e4fb996f4f3eeb788617d92ba038fd3900efc2c4da115e4859fef6d64f3d289d"},"schema_version":"1.0"},"canonical_sha256":"4dc361cc8c54a9742468920059ae91768e883c1c16901b63bca642d724f29867","source":{"kind":"arxiv","id":"1604.04921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04921","created_at":"2026-05-18T00:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04921v1","created_at":"2026-05-18T00:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04921","created_at":"2026-05-18T00:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"JXBWDTEMKSUX","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JXBWDTEMKSUXIJDI","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JXBWDTEM","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JXBWDTEMKSUXIJDISIAFTLURO2","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-17T20:32:50Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"902834bfce25751ddfdf8923ed9dc51ae26e9d6b286555aff397d00904adda62","abstract_canon_sha256":"e4fb996f4f3eeb788617d92ba038fd3900efc2c4da115e4859fef6d64f3d289d"},"schema_version":"1.0"},"canonical_sha256":"4dc361cc8c54a9742468920059ae91768e883c1c16901b63bca642d724f29867","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:00.293507Z","signature_b64":"hJhNHmbz0WgkSWFXzAKpZgQOo4QPEuJZF0dTzdV04jXw5bUcvjKT75TxLa15Wzi5/ojBXJh7o9FkZycILScPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dc361cc8c54a9742468920059ae91768e883c1c16901b63bca642d724f29867","last_reissued_at":"2026-05-18T00:15:00.292813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:00.292813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04921","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:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qrDr8/knL5+/Lrt/UP2G2JXCTJX9I1/u8K8o1+SiOgWGoY/vw0+Gt2rk6qsUxzGM1zuTiDdGlzFOGYX1ndbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:52:51.419221Z"},"content_sha256":"f2b7af24775639595d52fc57d864e670c894a61bd9cdc4112aa6b77b231495de","schema_version":"1.0","event_id":"sha256:f2b7af24775639595d52fc57d864e670c894a61bd9cdc4112aa6b77b231495de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JXBWDTEMKSUXIJDISIAFTLURO2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Certified Descent Algorithm for shape optimization driven by fully-computable a posteriori error estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Karim Trabelsi, Matteo Giacomini, Olivier Pantz","submitted_at":"2016-04-17T20:32:50Z","abstract_excerpt":"In this paper we introduce a novel certified shape optimization strategy - named Certified Descent Algorithm (CDA) - to account for the numerical error introduced by the Finite Element approximation of the shape gradient. We present a goal-oriented procedure to derive a certified upper bound of the error in the shape gradient and we construct a fully-computable, constant-free a posteriori error estimator inspired by the complementary energy principle. The resulting CDA is able to identify a genuine descent direction at each iteration and features a reliable stopping criterion. After validating"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04921","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:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TX/hFrvYqHQkoCKCX/mepzsZlrsPXRt0FIeFAJHCWqDdB9VyjYCUA4Fj9IvyuMvwoV75IW/OpgJiXpWrvPejDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:52:51.419576Z"},"content_sha256":"62e0b9306a15f1e66a03ebbf5ebf0ccdca6fc864607351ddebef108015a87490","schema_version":"1.0","event_id":"sha256:62e0b9306a15f1e66a03ebbf5ebf0ccdca6fc864607351ddebef108015a87490"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXBWDTEMKSUXIJDISIAFTLURO2/bundle.json","state_url":"https://pith.science/pith/JXBWDTEMKSUXIJDISIAFTLURO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXBWDTEMKSUXIJDISIAFTLURO2/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-07-06T17:52:51Z","links":{"resolver":"https://pith.science/pith/JXBWDTEMKSUXIJDISIAFTLURO2","bundle":"https://pith.science/pith/JXBWDTEMKSUXIJDISIAFTLURO2/bundle.json","state":"https://pith.science/pith/JXBWDTEMKSUXIJDISIAFTLURO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXBWDTEMKSUXIJDISIAFTLURO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JXBWDTEMKSUXIJDISIAFTLURO2","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":"e4fb996f4f3eeb788617d92ba038fd3900efc2c4da115e4859fef6d64f3d289d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-17T20:32:50Z","title_canon_sha256":"902834bfce25751ddfdf8923ed9dc51ae26e9d6b286555aff397d00904adda62"},"schema_version":"1.0","source":{"id":"1604.04921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04921","created_at":"2026-05-18T00:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04921v1","created_at":"2026-05-18T00:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04921","created_at":"2026-05-18T00:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"JXBWDTEMKSUX","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JXBWDTEMKSUXIJDI","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JXBWDTEM","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:62e0b9306a15f1e66a03ebbf5ebf0ccdca6fc864607351ddebef108015a87490","target":"graph","created_at":"2026-05-18T00:15:00Z","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":"In this paper we introduce a novel certified shape optimization strategy - named Certified Descent Algorithm (CDA) - to account for the numerical error introduced by the Finite Element approximation of the shape gradient. We present a goal-oriented procedure to derive a certified upper bound of the error in the shape gradient and we construct a fully-computable, constant-free a posteriori error estimator inspired by the complementary energy principle. The resulting CDA is able to identify a genuine descent direction at each iteration and features a reliable stopping criterion. After validating","authors_text":"Karim Trabelsi, Matteo Giacomini, Olivier Pantz","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-17T20:32:50Z","title":"Certified Descent Algorithm for shape optimization driven by fully-computable a posteriori error estimators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04921","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:f2b7af24775639595d52fc57d864e670c894a61bd9cdc4112aa6b77b231495de","target":"record","created_at":"2026-05-18T00:15:00Z","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":"e4fb996f4f3eeb788617d92ba038fd3900efc2c4da115e4859fef6d64f3d289d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-17T20:32:50Z","title_canon_sha256":"902834bfce25751ddfdf8923ed9dc51ae26e9d6b286555aff397d00904adda62"},"schema_version":"1.0","source":{"id":"1604.04921","kind":"arxiv","version":1}},"canonical_sha256":"4dc361cc8c54a9742468920059ae91768e883c1c16901b63bca642d724f29867","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4dc361cc8c54a9742468920059ae91768e883c1c16901b63bca642d724f29867","first_computed_at":"2026-05-18T00:15:00.292813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:00.292813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hJhNHmbz0WgkSWFXzAKpZgQOo4QPEuJZF0dTzdV04jXw5bUcvjKT75TxLa15Wzi5/ojBXJh7o9FkZycILScPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:00.293507Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2b7af24775639595d52fc57d864e670c894a61bd9cdc4112aa6b77b231495de","sha256:62e0b9306a15f1e66a03ebbf5ebf0ccdca6fc864607351ddebef108015a87490"],"state_sha256":"edb44cbe8729ee389a691f304fd7abf6fbb07b22d83bc50c3140a29b8d96da50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tp+gqygjmF52els4Sy8XTEIKRH80nRzih21knrB+cYJobwkuUnCPrLsn7Q9BHrH3D5OpDIvqPWHNHXcXT/POAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:52:51.421711Z","bundle_sha256":"ded40582ff3641ea2f6c6e9f9fb576213e2c63455a1ed15422a930e2d926aa93"}}