{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5TL6CZBHOT2ZARFZH7FWMSRLCT","short_pith_number":"pith:5TL6CZBH","schema_version":"1.0","canonical_sha256":"ecd7e1642774f59044b93fcb664a2b14f454a32932e07bfda1f0eb5a84b36bbb","source":{"kind":"arxiv","id":"2502.08534","version":1},"attestation_state":"computed","paper":{"title":"Input convex neural networks: universal approximation theorem and implementation for isotropic polyconvex hyperelastic energies","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CE","authors_text":"David Wiedemann, Gian-Luca Geuken, J\\\"orn Mosler, Patrick Kurzeja","submitted_at":"2025-02-12T16:15:03Z","abstract_excerpt":"This paper presents a novel framework of neural networks for isotropic hyperelasticity that enforces necessary physical and mathematical constraints while simultaneously satisfying the universal approximation theorem. The two key ingredients are an input convex network architecture and a formulation in the elementary polynomials of the signed singular values of the deformation gradient. In line with previously published networks, it can rigorously capture frame-indifference and polyconvexity - as well as further constraints like balance of angular momentum and growth conditions. However and in"},"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":"2502.08534","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CE","submitted_at":"2025-02-12T16:15:03Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1ee3f10400734bbc3baac71e2adc7ff1baf6bed5387eb5a6e6e9c61e07a5cc57","abstract_canon_sha256":"f0839a51300fcd36662bddd9fa8b2eab23f9e4867ce3d99b33c81e954e92516b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:27.095340Z","signature_b64":"gOzFjivsEDt5CX+05SrSM+mfCG5lglOK9SRaz5ZntEur3mdGhWZWj5NgIByLSlD32TCCFNjUpTMFaRMePhNrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecd7e1642774f59044b93fcb664a2b14f454a32932e07bfda1f0eb5a84b36bbb","last_reissued_at":"2026-05-20T00:05:27.094091Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:27.094091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Input convex neural networks: universal approximation theorem and implementation for isotropic polyconvex hyperelastic energies","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CE","authors_text":"David Wiedemann, Gian-Luca Geuken, J\\\"orn Mosler, Patrick Kurzeja","submitted_at":"2025-02-12T16:15:03Z","abstract_excerpt":"This paper presents a novel framework of neural networks for isotropic hyperelasticity that enforces necessary physical and mathematical constraints while simultaneously satisfying the universal approximation theorem. The two key ingredients are an input convex network architecture and a formulation in the elementary polynomials of the signed singular values of the deformation gradient. In line with previously published networks, it can rigorously capture frame-indifference and polyconvexity - as well as further constraints like balance of angular momentum and growth conditions. However and in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08534","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.08534/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":"2502.08534","created_at":"2026-05-20T00:05:27.094303+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.08534v1","created_at":"2026-05-20T00:05:27.094303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08534","created_at":"2026-05-20T00:05:27.094303+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TL6CZBHOT2Z","created_at":"2026-05-20T00:05:27.094303+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TL6CZBHOT2ZARFZ","created_at":"2026-05-20T00:05:27.094303+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TL6CZBH","created_at":"2026-05-20T00:05:27.094303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.05698","citing_title":"Adaptive Material Fingerprinting for the fast discovery of polyconvex feature combinations in isotropic and anisotropic hyperelasticity","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TL6CZBHOT2ZARFZH7FWMSRLCT","json":"https://pith.science/pith/5TL6CZBHOT2ZARFZH7FWMSRLCT.json","graph_json":"https://pith.science/api/pith-number/5TL6CZBHOT2ZARFZH7FWMSRLCT/graph.json","events_json":"https://pith.science/api/pith-number/5TL6CZBHOT2ZARFZH7FWMSRLCT/events.json","paper":"https://pith.science/paper/5TL6CZBH"},"agent_actions":{"view_html":"https://pith.science/pith/5TL6CZBHOT2ZARFZH7FWMSRLCT","download_json":"https://pith.science/pith/5TL6CZBHOT2ZARFZH7FWMSRLCT.json","view_paper":"https://pith.science/paper/5TL6CZBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.08534&json=true","fetch_graph":"https://pith.science/api/pith-number/5TL6CZBHOT2ZARFZH7FWMSRLCT/graph.json","fetch_events":"https://pith.science/api/pith-number/5TL6CZBHOT2ZARFZH7FWMSRLCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TL6CZBHOT2ZARFZH7FWMSRLCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TL6CZBHOT2ZARFZH7FWMSRLCT/action/storage_attestation","attest_author":"https://pith.science/pith/5TL6CZBHOT2ZARFZH7FWMSRLCT/action/author_attestation","sign_citation":"https://pith.science/pith/5TL6CZBHOT2ZARFZH7FWMSRLCT/action/citation_signature","submit_replication":"https://pith.science/pith/5TL6CZBHOT2ZARFZH7FWMSRLCT/action/replication_record"}},"created_at":"2026-05-20T00:05:27.094303+00:00","updated_at":"2026-05-20T00:05:27.094303+00:00"}