{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4H44R67NHUB7FBOKKYUAOAACSR","short_pith_number":"pith:4H44R67N","canonical_record":{"source":{"id":"1511.02284","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-11-07T02:20:32Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c2b8ec9c02472f084e47350bfd78d85dcc5b35e2d1c636ae3370734f7e4cee14","abstract_canon_sha256":"288dca184b1a7bafabf37ab52e35c4d5b1f5dac7672c92d93808e2f87f14af72"},"schema_version":"1.0"},"canonical_sha256":"e1f9c8fbed3d03f285ca56280700029469b606adff73bca8f61bed19fd282550","source":{"kind":"arxiv","id":"1511.02284","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02284","created_at":"2026-05-18T01:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02284v3","created_at":"2026-05-18T01:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02284","created_at":"2026-05-18T01:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"4H44R67NHUB7","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4H44R67NHUB7FBOK","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4H44R67N","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4H44R67NHUB7FBOKKYUAOAACSR","target":"record","payload":{"canonical_record":{"source":{"id":"1511.02284","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-11-07T02:20:32Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c2b8ec9c02472f084e47350bfd78d85dcc5b35e2d1c636ae3370734f7e4cee14","abstract_canon_sha256":"288dca184b1a7bafabf37ab52e35c4d5b1f5dac7672c92d93808e2f87f14af72"},"schema_version":"1.0"},"canonical_sha256":"e1f9c8fbed3d03f285ca56280700029469b606adff73bca8f61bed19fd282550","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:31.015116Z","signature_b64":"+NM12VcC7vuGMYEqgU0JHsTu23GSWn1n7SO1frQRpwv/8wYSQJgsgPzpHi8M1Mdv+MKfepejPSuDmnD6YDmhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1f9c8fbed3d03f285ca56280700029469b606adff73bca8f61bed19fd282550","last_reissued_at":"2026-05-18T01:03:31.014525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:31.014525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.02284","source_version":3,"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-18T01:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RK6Rs12cBZnRxgbooL7+wgXtZR8FeXtNDhNuv375zF8hK85hMYaLEGAqnwkfw1s9jorgSHhMRoGUO76sh9RUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:19:01.802845Z"},"content_sha256":"853489f889f31cc83f52720b5842d40d740bfb8f55067c38e364693a05c740e1","schema_version":"1.0","event_id":"sha256:853489f889f31cc83f52720b5842d40d740bfb8f55067c38e364693a05c740e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4H44R67NHUB7FBOKKYUAOAACSR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Derivative-Free Trust-Region Algorithm for Reliability-Based Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.CO","authors_text":"Jinglai Li, Tian Gao","submitted_at":"2015-11-07T02:20:32Z","abstract_excerpt":"In this note, we present a derivative-free trust-region (TR) algorithm for reliability based optimization (RBO) problems. The proposed algorithm consists of solving a set of subproblems, in which simple surrogate models of the reliability constraints are constructed and used in solving the subproblems. Taking advantage of the special structure of the RBO problems, we employ a sample reweighting method to evaluate the failure probabilities, which constructs the surrogate for the reliability constraints by performing only a single full reliability evaluation in each iteration. With numerical exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02284","kind":"arxiv","version":3},"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-18T01:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxUa+ioqRJPrXCNikRlLW5U+wZ8gBbvP42eyCEG4QxkFg/DmawPP8zK2UJdSUHlKvDOeL8NFiuVkqw55+zMPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:19:01.803496Z"},"content_sha256":"3428991c35fe062d0af1f5fbb68e2d5a46f1eac25d85e9072b66b0f0933b50f5","schema_version":"1.0","event_id":"sha256:3428991c35fe062d0af1f5fbb68e2d5a46f1eac25d85e9072b66b0f0933b50f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4H44R67NHUB7FBOKKYUAOAACSR/bundle.json","state_url":"https://pith.science/pith/4H44R67NHUB7FBOKKYUAOAACSR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4H44R67NHUB7FBOKKYUAOAACSR/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-05-25T21:19:01Z","links":{"resolver":"https://pith.science/pith/4H44R67NHUB7FBOKKYUAOAACSR","bundle":"https://pith.science/pith/4H44R67NHUB7FBOKKYUAOAACSR/bundle.json","state":"https://pith.science/pith/4H44R67NHUB7FBOKKYUAOAACSR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4H44R67NHUB7FBOKKYUAOAACSR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4H44R67NHUB7FBOKKYUAOAACSR","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":"288dca184b1a7bafabf37ab52e35c4d5b1f5dac7672c92d93808e2f87f14af72","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-11-07T02:20:32Z","title_canon_sha256":"c2b8ec9c02472f084e47350bfd78d85dcc5b35e2d1c636ae3370734f7e4cee14"},"schema_version":"1.0","source":{"id":"1511.02284","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.02284","created_at":"2026-05-18T01:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1511.02284v3","created_at":"2026-05-18T01:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02284","created_at":"2026-05-18T01:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"4H44R67NHUB7","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4H44R67NHUB7FBOK","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4H44R67N","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:3428991c35fe062d0af1f5fbb68e2d5a46f1eac25d85e9072b66b0f0933b50f5","target":"graph","created_at":"2026-05-18T01:03:31Z","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":"In this note, we present a derivative-free trust-region (TR) algorithm for reliability based optimization (RBO) problems. The proposed algorithm consists of solving a set of subproblems, in which simple surrogate models of the reliability constraints are constructed and used in solving the subproblems. Taking advantage of the special structure of the RBO problems, we employ a sample reweighting method to evaluate the failure probabilities, which constructs the surrogate for the reliability constraints by performing only a single full reliability evaluation in each iteration. With numerical exp","authors_text":"Jinglai Li, Tian Gao","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-11-07T02:20:32Z","title":"A Derivative-Free Trust-Region Algorithm for Reliability-Based Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02284","kind":"arxiv","version":3},"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:853489f889f31cc83f52720b5842d40d740bfb8f55067c38e364693a05c740e1","target":"record","created_at":"2026-05-18T01:03:31Z","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":"288dca184b1a7bafabf37ab52e35c4d5b1f5dac7672c92d93808e2f87f14af72","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-11-07T02:20:32Z","title_canon_sha256":"c2b8ec9c02472f084e47350bfd78d85dcc5b35e2d1c636ae3370734f7e4cee14"},"schema_version":"1.0","source":{"id":"1511.02284","kind":"arxiv","version":3}},"canonical_sha256":"e1f9c8fbed3d03f285ca56280700029469b606adff73bca8f61bed19fd282550","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1f9c8fbed3d03f285ca56280700029469b606adff73bca8f61bed19fd282550","first_computed_at":"2026-05-18T01:03:31.014525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:31.014525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+NM12VcC7vuGMYEqgU0JHsTu23GSWn1n7SO1frQRpwv/8wYSQJgsgPzpHi8M1Mdv+MKfepejPSuDmnD6YDmhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:31.015116Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.02284","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:853489f889f31cc83f52720b5842d40d740bfb8f55067c38e364693a05c740e1","sha256:3428991c35fe062d0af1f5fbb68e2d5a46f1eac25d85e9072b66b0f0933b50f5"],"state_sha256":"c192f7bc67a113324a2ac2d9e136f56be8a00c73b19776a83ca6b3fa908c34f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FUfpdeaNlNLiWGnXVsxwFSpVR5h95Gl4r2rAWO8YOLNG5qHyP/+kt9NXfGkEpPozKYLceyfXzSbRNj3U6VitAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:19:01.807091Z","bundle_sha256":"fbfd61b74828cff690487c57898761e70850744cc4d9a93a2403d21c017f662b"}}