{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WYN4D2ZYQQOHGBUW7TLTV54G33","short_pith_number":"pith:WYN4D2ZY","canonical_record":{"source":{"id":"1407.7618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-29T02:36:41Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"73970514aa200e01daf9fae134f4055e8b835dbcdb3eb8316a46ea0750786259","abstract_canon_sha256":"35d8ff15b06094dd093064abc6b67277faa0b1d6c509ccf0ad4006173c1d9265"},"schema_version":"1.0"},"canonical_sha256":"b61bc1eb38841c730696fcd73af786dee54ba51b34751c823708a7732b4411c7","source":{"kind":"arxiv","id":"1407.7618","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7618","created_at":"2026-05-18T02:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7618v1","created_at":"2026-05-18T02:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7618","created_at":"2026-05-18T02:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"WYN4D2ZYQQOH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WYN4D2ZYQQOHGBUW","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WYN4D2ZY","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WYN4D2ZYQQOHGBUW7TLTV54G33","target":"record","payload":{"canonical_record":{"source":{"id":"1407.7618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-29T02:36:41Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"73970514aa200e01daf9fae134f4055e8b835dbcdb3eb8316a46ea0750786259","abstract_canon_sha256":"35d8ff15b06094dd093064abc6b67277faa0b1d6c509ccf0ad4006173c1d9265"},"schema_version":"1.0"},"canonical_sha256":"b61bc1eb38841c730696fcd73af786dee54ba51b34751c823708a7732b4411c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:22.196117Z","signature_b64":"z3DeCNKlAqfqG6Ow+EKqShSeBb9SToASYLaWnEn4kidizeEUBw6MecV56RYJnjYiYK/7fTwyNcgrloUi2cGOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b61bc1eb38841c730696fcd73af786dee54ba51b34751c823708a7732b4411c7","last_reissued_at":"2026-05-18T02:46:22.195531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:22.195531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.7618","source_version":1,"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-05-18T02:46:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6IXG5Ub/PUYC2On9BTO07v6vKRoBTCRBGrTvjTFNdqZxzEEbzQAijxFwLhR8UtZTPV15RNb4q1fsNMhw4gOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:47:29.851148Z"},"content_sha256":"913d787045c5f9f2947272976e6df61aa371d8fc1e79eed6cf62ccbc39fbb39f","schema_version":"1.0","event_id":"sha256:913d787045c5f9f2947272976e6df61aa371d8fc1e79eed6cf62ccbc39fbb39f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WYN4D2ZYQQOHGBUW7TLTV54G33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Progressive construction of a parametric reduced-order model for PDE-constrained optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Charbel Farhat, Matthew J. Zahr","submitted_at":"2014-07-29T02:36:41Z","abstract_excerpt":"An adaptive approach to using reduced-order models as surrogates in PDE-constrained optimization is introduced that breaks the traditional offline-online framework of model order reduction. A sequence of optimization problems constrained by a given Reduced-Order Model (ROM) is defined with the goal of converging to the solution of a given PDE-constrained optimization problem. For each reduced optimization problem, the constraining ROM is trained from sampling the High-Dimensional Model (HDM) at the solution of some of the previous problems in the sequence. The reduced optimization problems are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7618","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":""},"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-05-18T02:46:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQ64r74AFTE6iv/RALgo8ojJENjuHDxV9ZKXs6b2VQuTFe5HzD4fJetl0YGlk02zaTXZEWXhVxXC8Lv6RTtbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:47:29.851889Z"},"content_sha256":"71ff57947257d5b498a9bdbb019fcb1f14ae82a9b48b2917f2fc5eac60426937","schema_version":"1.0","event_id":"sha256:71ff57947257d5b498a9bdbb019fcb1f14ae82a9b48b2917f2fc5eac60426937"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WYN4D2ZYQQOHGBUW7TLTV54G33/bundle.json","state_url":"https://pith.science/pith/WYN4D2ZYQQOHGBUW7TLTV54G33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WYN4D2ZYQQOHGBUW7TLTV54G33/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-06-08T18:47:29Z","links":{"resolver":"https://pith.science/pith/WYN4D2ZYQQOHGBUW7TLTV54G33","bundle":"https://pith.science/pith/WYN4D2ZYQQOHGBUW7TLTV54G33/bundle.json","state":"https://pith.science/pith/WYN4D2ZYQQOHGBUW7TLTV54G33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WYN4D2ZYQQOHGBUW7TLTV54G33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WYN4D2ZYQQOHGBUW7TLTV54G33","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":"35d8ff15b06094dd093064abc6b67277faa0b1d6c509ccf0ad4006173c1d9265","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-29T02:36:41Z","title_canon_sha256":"73970514aa200e01daf9fae134f4055e8b835dbcdb3eb8316a46ea0750786259"},"schema_version":"1.0","source":{"id":"1407.7618","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7618","created_at":"2026-05-18T02:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7618v1","created_at":"2026-05-18T02:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7618","created_at":"2026-05-18T02:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"WYN4D2ZYQQOH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WYN4D2ZYQQOHGBUW","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WYN4D2ZY","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:71ff57947257d5b498a9bdbb019fcb1f14ae82a9b48b2917f2fc5eac60426937","target":"graph","created_at":"2026-05-18T02:46: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"},"paper":{"abstract_excerpt":"An adaptive approach to using reduced-order models as surrogates in PDE-constrained optimization is introduced that breaks the traditional offline-online framework of model order reduction. A sequence of optimization problems constrained by a given Reduced-Order Model (ROM) is defined with the goal of converging to the solution of a given PDE-constrained optimization problem. For each reduced optimization problem, the constraining ROM is trained from sampling the High-Dimensional Model (HDM) at the solution of some of the previous problems in the sequence. The reduced optimization problems are","authors_text":"Charbel Farhat, Matthew J. Zahr","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-29T02:36:41Z","title":"Progressive construction of a parametric reduced-order model for PDE-constrained optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7618","kind":"arxiv","version":1},"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:913d787045c5f9f2947272976e6df61aa371d8fc1e79eed6cf62ccbc39fbb39f","target":"record","created_at":"2026-05-18T02:46: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":"35d8ff15b06094dd093064abc6b67277faa0b1d6c509ccf0ad4006173c1d9265","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-29T02:36:41Z","title_canon_sha256":"73970514aa200e01daf9fae134f4055e8b835dbcdb3eb8316a46ea0750786259"},"schema_version":"1.0","source":{"id":"1407.7618","kind":"arxiv","version":1}},"canonical_sha256":"b61bc1eb38841c730696fcd73af786dee54ba51b34751c823708a7732b4411c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b61bc1eb38841c730696fcd73af786dee54ba51b34751c823708a7732b4411c7","first_computed_at":"2026-05-18T02:46:22.195531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:22.195531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z3DeCNKlAqfqG6Ow+EKqShSeBb9SToASYLaWnEn4kidizeEUBw6MecV56RYJnjYiYK/7fTwyNcgrloUi2cGOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:22.196117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7618","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:913d787045c5f9f2947272976e6df61aa371d8fc1e79eed6cf62ccbc39fbb39f","sha256:71ff57947257d5b498a9bdbb019fcb1f14ae82a9b48b2917f2fc5eac60426937"],"state_sha256":"826e8bc3cc0a40869a557e44f3ae31a2220dc5c82782303717d2da8fbd04adce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E9mhYZt+cQuP6djgCwZbemyIPBUpVR0kjd7zbrspmS2EMihazznJc7hRn75sx8OyqtqJcsoP30QNhKZkDrl7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:47:29.855665Z","bundle_sha256":"a57ff7a441b471b3a70fe94457d09b0ef73bb6085aca28bc24b8b380491d83f5"}}