{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:YT3GPX4UYWZNZEIK6RIXSXAAY6","short_pith_number":"pith:YT3GPX4U","canonical_record":{"source":{"id":"2107.10661","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-19T20:40:51Z","cross_cats_sorted":[],"title_canon_sha256":"d2206b82b0c01a5058fbd7a8db2672236410630856a87e1e99ebab04513ab875","abstract_canon_sha256":"43ac018d9a2666141fd245acc05bd4519dfe115882e5f717dcfce02dea7900b6"},"schema_version":"1.0"},"canonical_sha256":"c4f667df94c5b2dc910af451795c00c7a6678160d5860f5ae96d20aa65194aec","source":{"kind":"arxiv","id":"2107.10661","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.10661","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"arxiv_version","alias_value":"2107.10661v2","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.10661","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"pith_short_12","alias_value":"YT3GPX4UYWZN","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"pith_short_16","alias_value":"YT3GPX4UYWZNZEIK","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"pith_short_8","alias_value":"YT3GPX4U","created_at":"2026-07-05T08:57:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:YT3GPX4UYWZNZEIK6RIXSXAAY6","target":"record","payload":{"canonical_record":{"source":{"id":"2107.10661","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-19T20:40:51Z","cross_cats_sorted":[],"title_canon_sha256":"d2206b82b0c01a5058fbd7a8db2672236410630856a87e1e99ebab04513ab875","abstract_canon_sha256":"43ac018d9a2666141fd245acc05bd4519dfe115882e5f717dcfce02dea7900b6"},"schema_version":"1.0"},"canonical_sha256":"c4f667df94c5b2dc910af451795c00c7a6678160d5860f5ae96d20aa65194aec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:57:22.070881Z","signature_b64":"BzyiU3g711+VCEInrhC/lw1Gq6vhRmn1601+ZOUTd2x4Xq3uA2Bov7+F1Df14kJNE6q48jkDe3YGFNxSTvhHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4f667df94c5b2dc910af451795c00c7a6678160d5860f5ae96d20aa65194aec","last_reissued_at":"2026-07-05T08:57:22.070480Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:57:22.070480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.10661","source_version":2,"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-07-05T08:57:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nNlexl/ztRR+p5M3jqIJVhSM9oxDlHfqZYvxNS0Qdjn7UkKQ55Z1+bgV13GKU8cNyzvKtdsrxezyJgiqtKNRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:38:07.091970Z"},"content_sha256":"f66f30f1177957bc4bb7b762db1d5b5cbcce013417ee381e380f2eba1ac4593b","schema_version":"1.0","event_id":"sha256:f66f30f1177957bc4bb7b762db1d5b5cbcce013417ee381e380f2eba1ac4593b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:YT3GPX4UYWZNZEIK6RIXSXAAY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Topology Optimization Using Multi-Fidelity Variational Autoencoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hadi Meidani, Mohammad Amin Nabian, Rini Jasmine Gladstone, Vahid Keshavarzzadeh","submitted_at":"2021-07-19T20:40:51Z","abstract_excerpt":"Robust topology optimization (RTO), as a class of topology optimization problems, identifies a design with the best average performance while reducing the response sensitivity to input uncertainties, e.g. load uncertainty. Solving RTO is computationally challenging as it requires repetitive finite element solutions for different candidate designs and different samples of random inputs. To address this challenge, a neural network method is proposed that offers computational efficiency because (1) it builds and explores a low dimensional search space which is parameterized using deterministicall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.10661","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.10661/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"},"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-07-05T08:57:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RlYveHm75W0A4d4+gpW5KW8Q3dlZFLwHhYD/P5M8yzSwkH4ygHyvqUihyMROqLxjuMaTVlqr2kmcS1F2Uoa+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:38:07.092955Z"},"content_sha256":"12b7a4df858bcf0159ab52062343f85a81d20ea7acd185374d2e932a82e9d4f8","schema_version":"1.0","event_id":"sha256:12b7a4df858bcf0159ab52062343f85a81d20ea7acd185374d2e932a82e9d4f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YT3GPX4UYWZNZEIK6RIXSXAAY6/bundle.json","state_url":"https://pith.science/pith/YT3GPX4UYWZNZEIK6RIXSXAAY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YT3GPX4UYWZNZEIK6RIXSXAAY6/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-08-16T20:38:07Z","links":{"resolver":"https://pith.science/pith/YT3GPX4UYWZNZEIK6RIXSXAAY6","bundle":"https://pith.science/pith/YT3GPX4UYWZNZEIK6RIXSXAAY6/bundle.json","state":"https://pith.science/pith/YT3GPX4UYWZNZEIK6RIXSXAAY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YT3GPX4UYWZNZEIK6RIXSXAAY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:YT3GPX4UYWZNZEIK6RIXSXAAY6","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":"43ac018d9a2666141fd245acc05bd4519dfe115882e5f717dcfce02dea7900b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-19T20:40:51Z","title_canon_sha256":"d2206b82b0c01a5058fbd7a8db2672236410630856a87e1e99ebab04513ab875"},"schema_version":"1.0","source":{"id":"2107.10661","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.10661","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"arxiv_version","alias_value":"2107.10661v2","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.10661","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"pith_short_12","alias_value":"YT3GPX4UYWZN","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"pith_short_16","alias_value":"YT3GPX4UYWZNZEIK","created_at":"2026-07-05T08:57:22Z"},{"alias_kind":"pith_short_8","alias_value":"YT3GPX4U","created_at":"2026-07-05T08:57:22Z"}],"graph_snapshots":[{"event_id":"sha256:12b7a4df858bcf0159ab52062343f85a81d20ea7acd185374d2e932a82e9d4f8","target":"graph","created_at":"2026-07-05T08:57:22Z","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/2107.10661/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Robust topology optimization (RTO), as a class of topology optimization problems, identifies a design with the best average performance while reducing the response sensitivity to input uncertainties, e.g. load uncertainty. Solving RTO is computationally challenging as it requires repetitive finite element solutions for different candidate designs and different samples of random inputs. To address this challenge, a neural network method is proposed that offers computational efficiency because (1) it builds and explores a low dimensional search space which is parameterized using deterministicall","authors_text":"Hadi Meidani, Mohammad Amin Nabian, Rini Jasmine Gladstone, Vahid Keshavarzzadeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-19T20:40:51Z","title":"Robust Topology Optimization Using Multi-Fidelity Variational Autoencoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.10661","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:f66f30f1177957bc4bb7b762db1d5b5cbcce013417ee381e380f2eba1ac4593b","target":"record","created_at":"2026-07-05T08:57:22Z","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":"43ac018d9a2666141fd245acc05bd4519dfe115882e5f717dcfce02dea7900b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-07-19T20:40:51Z","title_canon_sha256":"d2206b82b0c01a5058fbd7a8db2672236410630856a87e1e99ebab04513ab875"},"schema_version":"1.0","source":{"id":"2107.10661","kind":"arxiv","version":2}},"canonical_sha256":"c4f667df94c5b2dc910af451795c00c7a6678160d5860f5ae96d20aa65194aec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4f667df94c5b2dc910af451795c00c7a6678160d5860f5ae96d20aa65194aec","first_computed_at":"2026-07-05T08:57:22.070480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:57:22.070480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BzyiU3g711+VCEInrhC/lw1Gq6vhRmn1601+ZOUTd2x4Xq3uA2Bov7+F1Df14kJNE6q48jkDe3YGFNxSTvhHAA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:57:22.070881Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.10661","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f66f30f1177957bc4bb7b762db1d5b5cbcce013417ee381e380f2eba1ac4593b","sha256:12b7a4df858bcf0159ab52062343f85a81d20ea7acd185374d2e932a82e9d4f8"],"state_sha256":"6a75d5aae136b77ea6e4758d824a3791594da353eac14a91f0ba4aa71e8a407c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eb4dGxjJciVCjWsY4v1DLErmvZxGkxt3eEyOPqpyCK9OhTwepzDjlhIY1uEjqDGj1VhhfbdjPF+U59hScVekAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T20:38:07.099346Z","bundle_sha256":"3b6e718c8ecc9dbc18e58ab7a116fea034a93e2a99f6f1145e487c749457946c"}}