{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RC6NJAYGINNJOB4IKIEDXITGEA","short_pith_number":"pith:RC6NJAYG","canonical_record":{"source":{"id":"2506.04554","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-05T02:01:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"27bff2ea304d09845fd7837c70b5268c4cdc49da5fbb8162465bfcbc020de06a","abstract_canon_sha256":"df77ede30c2ee977cfca61b97c031b87e316fb990453ebb4e96b4cef44855590"},"schema_version":"1.0"},"canonical_sha256":"88bcd48306435a97078852083ba266200c3958087cf2773f03be60225f2d7b63","source":{"kind":"arxiv","id":"2506.04554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04554","created_at":"2026-07-05T11:16:16Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04554v1","created_at":"2026-07-05T11:16:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04554","created_at":"2026-07-05T11:16:16Z"},{"alias_kind":"pith_short_12","alias_value":"RC6NJAYGINNJ","created_at":"2026-07-05T11:16:16Z"},{"alias_kind":"pith_short_16","alias_value":"RC6NJAYGINNJOB4I","created_at":"2026-07-05T11:16:16Z"},{"alias_kind":"pith_short_8","alias_value":"RC6NJAYG","created_at":"2026-07-05T11:16:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RC6NJAYGINNJOB4IKIEDXITGEA","target":"record","payload":{"canonical_record":{"source":{"id":"2506.04554","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-05T02:01:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"27bff2ea304d09845fd7837c70b5268c4cdc49da5fbb8162465bfcbc020de06a","abstract_canon_sha256":"df77ede30c2ee977cfca61b97c031b87e316fb990453ebb4e96b4cef44855590"},"schema_version":"1.0"},"canonical_sha256":"88bcd48306435a97078852083ba266200c3958087cf2773f03be60225f2d7b63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:16.575301Z","signature_b64":"5C5BTBWQkpTh+3mv2LDPo6fU/odrIpltEqIQYl5ewXTqct7/EFLVLUWFpset2czRFCbqYRJgTPxTFIVqogsRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88bcd48306435a97078852083ba266200c3958087cf2773f03be60225f2d7b63","last_reissued_at":"2026-07-05T11:16:16.574797Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:16.574797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.04554","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:16:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pIEMQzr+zr0p22nZO+KyBjGaAxz2LS3U7wurrqqPS9e0V3fKUEGjUSEDzHfT2Xp1uKRJzMUYnOumdx+L652FCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:10:52.130106Z"},"content_sha256":"4ebd903acfc027eec769f0911524df360d1854afe6ff14744fb1bb2d1b1e1929","schema_version":"1.0","event_id":"sha256:4ebd903acfc027eec769f0911524df360d1854afe6ff14744fb1bb2d1b1e1929"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RC6NJAYGINNJOB4IKIEDXITGEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-linear Multi-objective Optimization with Probabilistic Branch and Bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Hao Huang, Zelda B. Zabinsky","submitted_at":"2025-06-05T02:01:08Z","abstract_excerpt":"A multiple objective simulation optimization algorithm named Multiple Objective Probabilistic Branch and Bound with Single Observation (MOPBnB(so)) is presented for approximating the Pareto optimal set and the associated efficient frontier for stochastic multi-objective optimization problems. MOPBnB(so) evaluates a noisy function exactly once at any solution and uses neighboring solutions to estimate the objective functions, in contrast to a variant that uses multiple replications at a solution to estimate the objective functions. A finite-time performance analysis for deterministic multi-obje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04554","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/2506.04554/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:16:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibvSTbXfw+NIeudZO5dN2QLNC0aLFAsChPNwq8+UtkJ4fDgZk5uVT0LNsrQCJL343yS69idcW6Mb8qwLugMAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:10:52.130755Z"},"content_sha256":"405e497a9b3aa4cd76c269f87887db62738f9ed6eabb3dc4d807bc26da1b0880","schema_version":"1.0","event_id":"sha256:405e497a9b3aa4cd76c269f87887db62738f9ed6eabb3dc4d807bc26da1b0880"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RC6NJAYGINNJOB4IKIEDXITGEA/bundle.json","state_url":"https://pith.science/pith/RC6NJAYGINNJOB4IKIEDXITGEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RC6NJAYGINNJOB4IKIEDXITGEA/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-08T05:10:52Z","links":{"resolver":"https://pith.science/pith/RC6NJAYGINNJOB4IKIEDXITGEA","bundle":"https://pith.science/pith/RC6NJAYGINNJOB4IKIEDXITGEA/bundle.json","state":"https://pith.science/pith/RC6NJAYGINNJOB4IKIEDXITGEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RC6NJAYGINNJOB4IKIEDXITGEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RC6NJAYGINNJOB4IKIEDXITGEA","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":"df77ede30c2ee977cfca61b97c031b87e316fb990453ebb4e96b4cef44855590","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-05T02:01:08Z","title_canon_sha256":"27bff2ea304d09845fd7837c70b5268c4cdc49da5fbb8162465bfcbc020de06a"},"schema_version":"1.0","source":{"id":"2506.04554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04554","created_at":"2026-07-05T11:16:16Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04554v1","created_at":"2026-07-05T11:16:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04554","created_at":"2026-07-05T11:16:16Z"},{"alias_kind":"pith_short_12","alias_value":"RC6NJAYGINNJ","created_at":"2026-07-05T11:16:16Z"},{"alias_kind":"pith_short_16","alias_value":"RC6NJAYGINNJOB4I","created_at":"2026-07-05T11:16:16Z"},{"alias_kind":"pith_short_8","alias_value":"RC6NJAYG","created_at":"2026-07-05T11:16:16Z"}],"graph_snapshots":[{"event_id":"sha256:405e497a9b3aa4cd76c269f87887db62738f9ed6eabb3dc4d807bc26da1b0880","target":"graph","created_at":"2026-07-05T11:16: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/2506.04554/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A multiple objective simulation optimization algorithm named Multiple Objective Probabilistic Branch and Bound with Single Observation (MOPBnB(so)) is presented for approximating the Pareto optimal set and the associated efficient frontier for stochastic multi-objective optimization problems. MOPBnB(so) evaluates a noisy function exactly once at any solution and uses neighboring solutions to estimate the objective functions, in contrast to a variant that uses multiple replications at a solution to estimate the objective functions. A finite-time performance analysis for deterministic multi-obje","authors_text":"Hao Huang, Zelda B. Zabinsky","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-05T02:01:08Z","title":"Non-linear Multi-objective Optimization with Probabilistic Branch and Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04554","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:4ebd903acfc027eec769f0911524df360d1854afe6ff14744fb1bb2d1b1e1929","target":"record","created_at":"2026-07-05T11:16: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":"df77ede30c2ee977cfca61b97c031b87e316fb990453ebb4e96b4cef44855590","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-05T02:01:08Z","title_canon_sha256":"27bff2ea304d09845fd7837c70b5268c4cdc49da5fbb8162465bfcbc020de06a"},"schema_version":"1.0","source":{"id":"2506.04554","kind":"arxiv","version":1}},"canonical_sha256":"88bcd48306435a97078852083ba266200c3958087cf2773f03be60225f2d7b63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88bcd48306435a97078852083ba266200c3958087cf2773f03be60225f2d7b63","first_computed_at":"2026-07-05T11:16:16.574797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:16.574797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5C5BTBWQkpTh+3mv2LDPo6fU/odrIpltEqIQYl5ewXTqct7/EFLVLUWFpset2czRFCbqYRJgTPxTFIVqogsRCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:16.575301Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.04554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ebd903acfc027eec769f0911524df360d1854afe6ff14744fb1bb2d1b1e1929","sha256:405e497a9b3aa4cd76c269f87887db62738f9ed6eabb3dc4d807bc26da1b0880"],"state_sha256":"046934d6f8c72251d949d078b8afb97e0a0d0906ce75ebf5ec32b7d7d2f9aa77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4WWPHAsz+3yUV0MRRixMbBJxCJuy/c6bw32K1Gry8xg1E7ZkBVw33RIp9A0sCDdzwhlDFepOKTojV8oVYSP5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T05:10:52.135930Z","bundle_sha256":"2dfa35d83774cf38a4eedbee0f2c22fc646d4366b7fd9e88479671ef096c9cc7"}}