{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DHASQDOC67YM7MOELIP2BJQNNJ","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6cbcec7cc9c5c0e4342c9e8696004551992b3ebf4de0fc7d9470ea19468faef1","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T18:04:58Z","title_canon_sha256":"35ee75c903b6a874f2278ff6b9b6c5f25996b3607ef506735779b93d9efbed15"},"schema_version":"1.0","source":{"id":"2605.15231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15231","created_at":"2026-05-20T00:00:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15231v1","created_at":"2026-05-20T00:00:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15231","created_at":"2026-05-20T00:00:47Z"},{"alias_kind":"pith_short_12","alias_value":"DHASQDOC67YM","created_at":"2026-05-20T00:00:47Z"},{"alias_kind":"pith_short_16","alias_value":"DHASQDOC67YM7MOE","created_at":"2026-05-20T00:00:47Z"},{"alias_kind":"pith_short_8","alias_value":"DHASQDOC","created_at":"2026-05-20T00:00:47Z"}],"graph_snapshots":[{"event_id":"sha256:8a9a664b2cfdcb69f16936eaf54d9375adcdefe73f288c0e366c4822e1efbe5c","target":"graph","created_at":"2026-05-20T00:00:47Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Coarse-graph morphing via feature-aligned barycentric parameterisation improves test accuracy over a fixed-coarse-graph baseline, while masked supervised pretraining reduces train-test discrepancy and improves data efficiency in cross-component transfer settings."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that feature-aligned barycentric parameterisation will produce sufficiently accurate spatial correspondence between the morphed coarse graph and each new input mesh without introducing systematic interpolation errors that propagate through the hierarchical U-Net layers."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"MMGUNet morphs coarse graph hierarchies with feature-aligned barycentric mapping and uses masked pretraining plus frozen edge layers to improve generalisability of mesh surrogates for crashworthiness prediction under large geometric changes."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Mask-Morph Graph U-Net uses coarse-graph morphing and masked pretraining to generalise hierarchical GNNs to new mesh geometries in crash simulations."}],"snapshot_sha256":"adb9946577325cc50c8b7d271fb52d968168a59125d38e98b9ff103db23fd437"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:01:56.043214Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T17:01:18.471395Z","status":"completed","version":"1.0.0"},{"findings_count":1,"name":"doi_compliance","ran_at":"2026-05-19T16:45:50.378326Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.829476Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15231/integrity.json","findings":[{"audited_at":"2026-05-19T16:45:50.378326Z","detected_arxiv_id":null,"detected_doi":"10.1145/2977606","detector":"doi_compliance","finding_type":"unresolvable_identifier","note":"Identifier '10.1145/2977606' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","ref_index":44,"severity":"critical","verdict_class":"cross_source"}],"snapshot_sha256":"07c2b11044acb83f8d251a688ab9d885c17b0639d4fe7d79b7175dbb19ecfad5","summary":{"advisory":0,"by_detector":{"doi_compliance":{"advisory":0,"critical":1,"informational":0,"total":1}},"critical":1,"informational":0}},"paper":{"abstract_excerpt":"Nonlinear finite element crash simulations are accurate but computationally expensive, limiting their use in iterative design optimisation. Machine-learning surrogate models based on graph neural networks (GNNs) offer a faster alternative. Message-passing GNNs are widely used for mesh simulation, and their shared node and edge update functions are relatively generalisable across varying graph structures. By contrast, non-shareable edge-specific aggregation layers can capture nonlinear relationships more accurately but usually require fixed graph connectivity, which limits generalisability. Thi","authors_text":"Haoran Li, Haosu Zhou, Nan Li, Philipp Stocker, Tobias Lehrer, Tobias Pfaff, Yingxue Zhao","cross_cats":["cs.CV"],"headline":"Mask-Morph Graph U-Net uses coarse-graph morphing and masked pretraining to generalise hierarchical GNNs to new mesh geometries in crash simulations.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T18:04:58Z","title":"Mask-Morph Graph U-Net: A Generalisable Mesh-Based Surrogate for Crashworthiness Field Prediction under Large Geometric Variation"},"references":{"count":55,"internal_anchors":2,"resolved_work":55,"sample":[{"cited_arxiv_id":"","doi":"10.4271/2006-01-0672","is_internal_anchor":false,"ref_index":1,"title":"S. R. Wu, Convergence study on explicit finite element for crashwor- thiness analysis, Tech. Rep. 2006-01-0672, SAE International (2006). doi:10.4271/2006-01-0672","work_id":"13d20550-59ad-4067-a002-f687f3f10592","year":2006},{"cited_arxiv_id":"","doi":"10.4271/2007-01-0982","is_internal_anchor":false,"ref_index":2,"title":"J. Chang, T. Tyan, M. El-Bkaily, J. Cheng, A. Marpu, Q. Zeng, J. Santini, Implicit and explicit finite element methods for crash safety analysis, Tech. Rep. 2007-01-0982, SAE International (2007). doi","work_id":"906c7423-d219-47b9-8a2a-52b8fee88b53","year":2007},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"E. Albak, Optimization design for circular multi-cell thin-walled tubes with discrete and continuous design variables, Mechanics of Advanced Materials and Structures 30 (24) (2023) 5091–5105","work_id":"650860c8-5870-4a30-a825-84b73009c2c6","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"F. Xiong, D. Wang, Z.-D. Ma, L. Yang, Z. Li, B. Song, Multi-objective lightweight and crashworthiness optimization for the side structure of an automobile body, Structural and Multidisciplinary Optimi","work_id":"f4a3d349-b850-4589-a786-aa6f0f8890ec","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A. Ahmadi Dastjerdi, M. Moshref-Javadi, H. Ahmadian, M. Gholam- pour, Crushing analysis and multi-objective optimization of different length bi-thin walled cylindrical structures under axial impact lo","work_id":"b03319da-4261-4250-ab1c-2b092080af3f","year":2019}],"snapshot_sha256":"c5efb8b033b4c3cc5fe5b690cfb5f64d95b1fea270fb49cda63690182c8bf678"},"source":{"id":"2605.15231","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T16:34:58.057667Z","id":"949bd918-d353-4f04-9f77-360818b58b44","model_set":{"reader":"grok-4.3"},"one_line_summary":"MMGUNet morphs coarse graph hierarchies with feature-aligned barycentric mapping and uses masked pretraining plus frozen edge layers to improve generalisability of mesh surrogates for crashworthiness prediction under large geometric changes.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Mask-Morph Graph U-Net uses coarse-graph morphing and masked pretraining to generalise hierarchical GNNs to new mesh geometries in crash simulations.","strongest_claim":"Coarse-graph morphing via feature-aligned barycentric parameterisation improves test accuracy over a fixed-coarse-graph baseline, while masked supervised pretraining reduces train-test discrepancy and improves data efficiency in cross-component transfer settings.","weakest_assumption":"The assumption that feature-aligned barycentric parameterisation will produce sufficiently accurate spatial correspondence between the morphed coarse graph and each new input mesh without introducing systematic interpolation errors that propagate through the hierarchical U-Net layers."}},"verdict_id":"949bd918-d353-4f04-9f77-360818b58b44"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c97c8e1ef0e43aa8a0477fe0ee0c773c7fadb4d9fbe916891c5f47ad2be512ed","target":"record","created_at":"2026-05-20T00:00:47Z","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":"6cbcec7cc9c5c0e4342c9e8696004551992b3ebf4de0fc7d9470ea19468faef1","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T18:04:58Z","title_canon_sha256":"35ee75c903b6a874f2278ff6b9b6c5f25996b3607ef506735779b93d9efbed15"},"schema_version":"1.0","source":{"id":"2605.15231","kind":"arxiv","version":1}},"canonical_sha256":"19c1280dc2f7f0cfb1c45a1fa0a60d6a63d22c22beb19e418087187904e272a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19c1280dc2f7f0cfb1c45a1fa0a60d6a63d22c22beb19e418087187904e272a5","first_computed_at":"2026-05-20T00:00:47.518785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:47.518785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/81dWfZ2jTJuBPm2xNq+R1T1uGsRm90tvFUockygx2qq44jteGAiuCmbrQctPqaL/wVJbjFTpsc8MVN6jgTBAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:47.519887Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:904406f5df75dacb51389398d56ead995ab8a60b6ffc354b07b66fb465a92fc6","sha256:c97c8e1ef0e43aa8a0477fe0ee0c773c7fadb4d9fbe916891c5f47ad2be512ed","sha256:8a9a664b2cfdcb69f16936eaf54d9375adcdefe73f288c0e366c4822e1efbe5c"],"state_sha256":"24fa51bad1e1a8bc170989ccc2e2aa6a080d128d676cd2184a01a6b6bd1aafbe"}