{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EUXIABMGWCDPS5I3UMJHYU6AKV","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":"703893357ed6a594677f38eda7f5cf9a29ea1403ac9f53bee8593140f1c58079","cross_cats_sorted":["cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-04-13T03:38:37Z","title_canon_sha256":"86e1cd47ef9b002d414c6016e4ccf2a5368a54674ed808af470aa9ead6be8398"},"schema_version":"1.0","source":{"id":"2004.05756","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.05756","created_at":"2026-07-05T02:11:46Z"},{"alias_kind":"arxiv_version","alias_value":"2004.05756v2","created_at":"2026-07-05T02:11:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.05756","created_at":"2026-07-05T02:11:46Z"},{"alias_kind":"pith_short_12","alias_value":"EUXIABMGWCDP","created_at":"2026-07-05T02:11:46Z"},{"alias_kind":"pith_short_16","alias_value":"EUXIABMGWCDPS5I3","created_at":"2026-07-05T02:11:46Z"},{"alias_kind":"pith_short_8","alias_value":"EUXIABMG","created_at":"2026-07-05T02:11:46Z"}],"graph_snapshots":[{"event_id":"sha256:fefc48b87cc43e3de7d7794919a1cc7ff32552d071d8ed5a5122d18864b2700e","target":"graph","created_at":"2026-07-05T02:11:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.05756/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a globally convergent method to accelerate density-based topology optimization using projection-based reduced-order models (ROMs) and trust-region methods. To accelerate topology optimization, we replace the large-scale finite element simulation, which dominates the computational cost, with ROMs that reduce the cost of objective function and gradient evaluations by orders of magnitude. To guarantee convergence, we first introduce a trust-region method that employs generalized trust-region constraints and prove it is globally convergent. We then devise a class of globally convergent ","authors_text":"Masayuki Yano, Matthew J. Zahr, Tianci Huang","cross_cats":["cs.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-04-13T03:38:37Z","title":"A globally convergent method to accelerate topology optimization using on-the-fly model reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.05756","kind":"arxiv","version":2},"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:0021759f67d060339f6f7ac541436e4bafd2130d8463c5d08615c9c016313f37","target":"record","created_at":"2026-07-05T02:11:46Z","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":"703893357ed6a594677f38eda7f5cf9a29ea1403ac9f53bee8593140f1c58079","cross_cats_sorted":["cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-04-13T03:38:37Z","title_canon_sha256":"86e1cd47ef9b002d414c6016e4ccf2a5368a54674ed808af470aa9ead6be8398"},"schema_version":"1.0","source":{"id":"2004.05756","kind":"arxiv","version":2}},"canonical_sha256":"252e800586b086f9751ba3127c53c0554430811bbc133c610ae5f5303bdf1860","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"252e800586b086f9751ba3127c53c0554430811bbc133c610ae5f5303bdf1860","first_computed_at":"2026-07-05T02:11:46.534916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:11:46.534916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q6aD6k8t0Nw1xcYydM7MxoCiPYRUDUTmjk1oS54n136VBnMSsGmNQ1scMrTnW6253obF1Yn4Mxow7qVr7U6aAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:11:46.535359Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.05756","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0021759f67d060339f6f7ac541436e4bafd2130d8463c5d08615c9c016313f37","sha256:fefc48b87cc43e3de7d7794919a1cc7ff32552d071d8ed5a5122d18864b2700e"],"state_sha256":"f302e5dce89513cefa62d7276205f10b9b83a735a5525d088f3b0ea19bed9213"}