{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ERASI7J6EN5GIWBEBP3SRWCC3S","short_pith_number":"pith:ERASI7J6","canonical_record":{"source":{"id":"2508.03901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-05T20:39:25Z","cross_cats_sorted":[],"title_canon_sha256":"84480e8a8b774eaceb0cbbf85a35a03f96250feb5330ec017531c2d36bc9f859","abstract_canon_sha256":"70e2cf2fb7812cee2176148673031869c6a31c268e6dd295e5d1a3d5a460a78c"},"schema_version":"1.0"},"canonical_sha256":"2441247d3e237a6458240bf728d842dc966f4dd4bd8e20d5d13c60ab1c58baa6","source":{"kind":"arxiv","id":"2508.03901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.03901","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"arxiv_version","alias_value":"2508.03901v1","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03901","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"pith_short_12","alias_value":"ERASI7J6EN5G","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"pith_short_16","alias_value":"ERASI7J6EN5GIWBE","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"pith_short_8","alias_value":"ERASI7J6","created_at":"2026-07-05T11:49:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ERASI7J6EN5GIWBEBP3SRWCC3S","target":"record","payload":{"canonical_record":{"source":{"id":"2508.03901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-05T20:39:25Z","cross_cats_sorted":[],"title_canon_sha256":"84480e8a8b774eaceb0cbbf85a35a03f96250feb5330ec017531c2d36bc9f859","abstract_canon_sha256":"70e2cf2fb7812cee2176148673031869c6a31c268e6dd295e5d1a3d5a460a78c"},"schema_version":"1.0"},"canonical_sha256":"2441247d3e237a6458240bf728d842dc966f4dd4bd8e20d5d13c60ab1c58baa6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:16.851806Z","signature_b64":"pUXnd+PxF9zcAkLb4e8my+7V3yfqzybIkxi/zLWcNylmrliacWSijRJRIFNHrhD1wTsiQ8CPgrFIV+GFuT7hDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2441247d3e237a6458240bf728d842dc966f4dd4bd8e20d5d13c60ab1c58baa6","last_reissued_at":"2026-07-05T11:49:16.851421Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:16.851421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.03901","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-07-05T11:49:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5cDbZ1nU9VrwXVId/74ynGut7LRfwb/kIC8DCVVQLcQ0R7m/bdvmS0xfHrzI46GegR3qOgaAE3pwbJMUsXKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T08:20:55.879821Z"},"content_sha256":"10a2eb75f3e4f44b111a40b4caa353fded2846ab34982b183052036aaa1f6b64","schema_version":"1.0","event_id":"sha256:10a2eb75f3e4f44b111a40b4caa353fded2846ab34982b183052036aaa1f6b64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ERASI7J6EN5GIWBEBP3SRWCC3S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Fidelity Stochastic Trust Region Method with Adaptive Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Juliane Mueller, Yunsoo Ha","submitted_at":"2025-08-05T20:39:25Z","abstract_excerpt":"Simulation optimization is often hindered by the high cost of running simulations. Multi-fidelity methods offer a promising solution by incorporating cheaper, lower-fidelity simulations to reduce computational time. However, the bias in low-fidelity models can mislead the search, potentially steering solutions away from the high-fidelity optimum. To overcome this, we propose ASTRO-MFDF, an adaptive sampling trust-region method for multi-fidelity simulation optimization. ASTRO-MFDF features two key strategies: (i) it adaptively determines the sample size and selects appropriate sampling strateg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.03901","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/2508.03901/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-05T11:49:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/JdYnlIMaX8240q+bd2JqjoRFgnwUlt9suu59gF+zU+uNmGa/nuEaeJoavBSriDrBrdF7XQ6mlN3MWGlVya3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T08:20:55.880320Z"},"content_sha256":"5aecf2223928f2d375ab4c365e8dc41bb26846769d232010945c1c32408cef83","schema_version":"1.0","event_id":"sha256:5aecf2223928f2d375ab4c365e8dc41bb26846769d232010945c1c32408cef83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERASI7J6EN5GIWBEBP3SRWCC3S/bundle.json","state_url":"https://pith.science/pith/ERASI7J6EN5GIWBEBP3SRWCC3S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERASI7J6EN5GIWBEBP3SRWCC3S/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-07T08:20:55Z","links":{"resolver":"https://pith.science/pith/ERASI7J6EN5GIWBEBP3SRWCC3S","bundle":"https://pith.science/pith/ERASI7J6EN5GIWBEBP3SRWCC3S/bundle.json","state":"https://pith.science/pith/ERASI7J6EN5GIWBEBP3SRWCC3S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERASI7J6EN5GIWBEBP3SRWCC3S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ERASI7J6EN5GIWBEBP3SRWCC3S","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":"70e2cf2fb7812cee2176148673031869c6a31c268e6dd295e5d1a3d5a460a78c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-05T20:39:25Z","title_canon_sha256":"84480e8a8b774eaceb0cbbf85a35a03f96250feb5330ec017531c2d36bc9f859"},"schema_version":"1.0","source":{"id":"2508.03901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.03901","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"arxiv_version","alias_value":"2508.03901v1","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03901","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"pith_short_12","alias_value":"ERASI7J6EN5G","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"pith_short_16","alias_value":"ERASI7J6EN5GIWBE","created_at":"2026-07-05T11:49:16Z"},{"alias_kind":"pith_short_8","alias_value":"ERASI7J6","created_at":"2026-07-05T11:49:16Z"}],"graph_snapshots":[{"event_id":"sha256:5aecf2223928f2d375ab4c365e8dc41bb26846769d232010945c1c32408cef83","target":"graph","created_at":"2026-07-05T11:49:16Z","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/2508.03901/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Simulation optimization is often hindered by the high cost of running simulations. Multi-fidelity methods offer a promising solution by incorporating cheaper, lower-fidelity simulations to reduce computational time. However, the bias in low-fidelity models can mislead the search, potentially steering solutions away from the high-fidelity optimum. To overcome this, we propose ASTRO-MFDF, an adaptive sampling trust-region method for multi-fidelity simulation optimization. ASTRO-MFDF features two key strategies: (i) it adaptively determines the sample size and selects appropriate sampling strateg","authors_text":"Juliane Mueller, Yunsoo Ha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-05T20:39:25Z","title":"Multi-Fidelity Stochastic Trust Region Method with Adaptive Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.03901","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:10a2eb75f3e4f44b111a40b4caa353fded2846ab34982b183052036aaa1f6b64","target":"record","created_at":"2026-07-05T11:49:16Z","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":"70e2cf2fb7812cee2176148673031869c6a31c268e6dd295e5d1a3d5a460a78c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-08-05T20:39:25Z","title_canon_sha256":"84480e8a8b774eaceb0cbbf85a35a03f96250feb5330ec017531c2d36bc9f859"},"schema_version":"1.0","source":{"id":"2508.03901","kind":"arxiv","version":1}},"canonical_sha256":"2441247d3e237a6458240bf728d842dc966f4dd4bd8e20d5d13c60ab1c58baa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2441247d3e237a6458240bf728d842dc966f4dd4bd8e20d5d13c60ab1c58baa6","first_computed_at":"2026-07-05T11:49:16.851421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:49:16.851421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pUXnd+PxF9zcAkLb4e8my+7V3yfqzybIkxi/zLWcNylmrliacWSijRJRIFNHrhD1wTsiQ8CPgrFIV+GFuT7hDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:49:16.851806Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.03901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10a2eb75f3e4f44b111a40b4caa353fded2846ab34982b183052036aaa1f6b64","sha256:5aecf2223928f2d375ab4c365e8dc41bb26846769d232010945c1c32408cef83"],"state_sha256":"4093309ae7fc3cc760b649f3f313250b4da2b4e8c0ebd70c237ae9d2d1db6b09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lYCGm3T+wsuBhLVSLZTwqKySl43p0bHCpW0tFdUwNoA78Dy2cE9xwHcPfJXM7EkB0/EJhlobBivKdzxIEXByAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T08:20:55.884220Z","bundle_sha256":"d4d06f98caa7c707ad2cf63d5c524d8fa25aa336e391104f9c2b6d1d06c48541"}}