{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LHSVEWGUTIH7OVSXZVS2G3C2VL","short_pith_number":"pith:LHSVEWGU","schema_version":"1.0","canonical_sha256":"59e55258d49a0ff75657cd65a36c5aaaf06afac6031028694efd04fcf8a5f2cc","source":{"kind":"arxiv","id":"1203.1493","version":2},"attestation_state":"computed","paper":{"title":"A Riemannian View on Shape Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Volker Schulz","submitted_at":"2012-03-07T15:13:08Z","abstract_excerpt":"Shape optimization based on the shape calculus is numerically mostly performed by means of steepest descent methods. This paper provides a novel framework to analyze shape-Newton optimization methods by exploiting a Riemannian perspective. A Riemannian shape Hessian is defined yielding often sought properties like symmetry and quadratic convergence for Newton optimization methods."},"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":"1203.1493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-07T15:13:08Z","cross_cats_sorted":[],"title_canon_sha256":"5585054af0a24b6c42d10e7a37c578ad9ae2ded8df7e6972bee22ccb9f4c8ab0","abstract_canon_sha256":"4da2e4f0ebc554905275155317e8318e8009366b9e4d22eb7f4c2aeeb2d36649"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:04.405481Z","signature_b64":"ZrizyH6/aTe/rWDqteIvtXqaQk2ZBjZ19ze2eWKyIphGiBhSjWDyCdqJrXc0nHCFD99wZsGT4rUndEUQ+yj0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59e55258d49a0ff75657cd65a36c5aaaf06afac6031028694efd04fcf8a5f2cc","last_reissued_at":"2026-05-18T02:52:04.404986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:04.404986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Riemannian View on Shape Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Volker Schulz","submitted_at":"2012-03-07T15:13:08Z","abstract_excerpt":"Shape optimization based on the shape calculus is numerically mostly performed by means of steepest descent methods. This paper provides a novel framework to analyze shape-Newton optimization methods by exploiting a Riemannian perspective. A Riemannian shape Hessian is defined yielding often sought properties like symmetry and quadratic convergence for Newton optimization methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1493","kind":"arxiv","version":2},"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":"1203.1493","created_at":"2026-05-18T02:52:04.405058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1493v2","created_at":"2026-05-18T02:52:04.405058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1493","created_at":"2026-05-18T02:52:04.405058+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHSVEWGUTIH7","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHSVEWGUTIH7OVSX","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHSVEWGU","created_at":"2026-05-18T12:27:14.488303+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/LHSVEWGUTIH7OVSXZVS2G3C2VL","json":"https://pith.science/pith/LHSVEWGUTIH7OVSXZVS2G3C2VL.json","graph_json":"https://pith.science/api/pith-number/LHSVEWGUTIH7OVSXZVS2G3C2VL/graph.json","events_json":"https://pith.science/api/pith-number/LHSVEWGUTIH7OVSXZVS2G3C2VL/events.json","paper":"https://pith.science/paper/LHSVEWGU"},"agent_actions":{"view_html":"https://pith.science/pith/LHSVEWGUTIH7OVSXZVS2G3C2VL","download_json":"https://pith.science/pith/LHSVEWGUTIH7OVSXZVS2G3C2VL.json","view_paper":"https://pith.science/paper/LHSVEWGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1493&json=true","fetch_graph":"https://pith.science/api/pith-number/LHSVEWGUTIH7OVSXZVS2G3C2VL/graph.json","fetch_events":"https://pith.science/api/pith-number/LHSVEWGUTIH7OVSXZVS2G3C2VL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHSVEWGUTIH7OVSXZVS2G3C2VL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHSVEWGUTIH7OVSXZVS2G3C2VL/action/storage_attestation","attest_author":"https://pith.science/pith/LHSVEWGUTIH7OVSXZVS2G3C2VL/action/author_attestation","sign_citation":"https://pith.science/pith/LHSVEWGUTIH7OVSXZVS2G3C2VL/action/citation_signature","submit_replication":"https://pith.science/pith/LHSVEWGUTIH7OVSXZVS2G3C2VL/action/replication_record"}},"created_at":"2026-05-18T02:52:04.405058+00:00","updated_at":"2026-05-18T02:52:04.405058+00:00"}