{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PWRVU3CP3I5THUQFNZAFIUFSMW","short_pith_number":"pith:PWRVU3CP","canonical_record":{"source":{"id":"1511.01277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-04T10:44:11Z","cross_cats_sorted":[],"title_canon_sha256":"d2d5f7864a10865d05c2b71967c612a29be97eaa352f58f01e1be819ee08833a","abstract_canon_sha256":"36254891b1fcd721fdf210b3f389d9349db8f0b10b287e0a1e0e295973edfa48"},"schema_version":"1.0"},"canonical_sha256":"7da35a6c4fda3b33d2056e405450b2658c9eebf0d8b3ec70da7cd2fceae6f481","source":{"kind":"arxiv","id":"1511.01277","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01277","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01277v1","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01277","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"PWRVU3CP3I5T","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PWRVU3CP3I5THUQF","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PWRVU3CP","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PWRVU3CP3I5THUQFNZAFIUFSMW","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-04T10:44:11Z","cross_cats_sorted":[],"title_canon_sha256":"d2d5f7864a10865d05c2b71967c612a29be97eaa352f58f01e1be819ee08833a","abstract_canon_sha256":"36254891b1fcd721fdf210b3f389d9349db8f0b10b287e0a1e0e295973edfa48"},"schema_version":"1.0"},"canonical_sha256":"7da35a6c4fda3b33d2056e405450b2658c9eebf0d8b3ec70da7cd2fceae6f481","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:47.620361Z","signature_b64":"HEldpx12IeKKbBT3LK1JZlf0QAbF/E90GpG6Lka1y92Hx3lrKCEJliJkmj3rWpqYqtmc/rxEydbBpsRAiS/RCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7da35a6c4fda3b33d2056e405450b2658c9eebf0d8b3ec70da7cd2fceae6f481","last_reissued_at":"2026-05-18T01:27:47.619583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:47.619583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01277","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-18T01:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wvN8djGVdG79cXvfM2Z+hX/yF2h6qOAJ1AIQpJOE/+64jI7XSz0ZaUrEG6NxLYeciE173gwPOMuDJSYhxdTBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:36:40.113948Z"},"content_sha256":"4790b50d02247938059247c6e39bef5d1d878bb20be44788db76daf9837175f6","schema_version":"1.0","event_id":"sha256:4790b50d02247938059247c6e39bef5d1d878bb20be44788db76daf9837175f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PWRVU3CP3I5THUQFNZAFIUFSMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithm Portfolios for Noisy Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jialin Liu (TAO, LRI), Marie-Liesse Cauwet (TAO, Olivier Teytaud (TAO, Rozi\\`ere Baptiste (TAO","submitted_at":"2015-11-04T10:44:11Z","abstract_excerpt":"Noisy optimization is the optimization of objective functions corrupted by noise. A portfolio of solvers is a set of solvers equipped with an algorithm selection tool for distributing the computational power among them. Portfolios are widely and successfully used in combinatorial optimization. In this work, we study portfolios of noisy optimization solvers. We obtain mathematically proved performance (in the sense that the portfolio performs nearly as well as the best of its solvers) by an ad hoc portfolio algorithm dedicated to noisy optimization. A somehow surprising result is that it is bet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01277","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-18T01:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TyPa4zyXLScYEe1J3HP9UOJWXB+5/RO9d655QoaYjoGzZha+8zOEAwNqZRKsKHcFuJER7ioPyowQYjn4eZDYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:36:40.114288Z"},"content_sha256":"1fdbfc6b2c79b1276febf2724a6e2066aea9cb4149fde11744ecf4b2b2bc93d9","schema_version":"1.0","event_id":"sha256:1fdbfc6b2c79b1276febf2724a6e2066aea9cb4149fde11744ecf4b2b2bc93d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWRVU3CP3I5THUQFNZAFIUFSMW/bundle.json","state_url":"https://pith.science/pith/PWRVU3CP3I5THUQFNZAFIUFSMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWRVU3CP3I5THUQFNZAFIUFSMW/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-24T22:36:40Z","links":{"resolver":"https://pith.science/pith/PWRVU3CP3I5THUQFNZAFIUFSMW","bundle":"https://pith.science/pith/PWRVU3CP3I5THUQFNZAFIUFSMW/bundle.json","state":"https://pith.science/pith/PWRVU3CP3I5THUQFNZAFIUFSMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWRVU3CP3I5THUQFNZAFIUFSMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PWRVU3CP3I5THUQFNZAFIUFSMW","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":"36254891b1fcd721fdf210b3f389d9349db8f0b10b287e0a1e0e295973edfa48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-04T10:44:11Z","title_canon_sha256":"d2d5f7864a10865d05c2b71967c612a29be97eaa352f58f01e1be819ee08833a"},"schema_version":"1.0","source":{"id":"1511.01277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01277","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01277v1","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01277","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"PWRVU3CP3I5T","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PWRVU3CP3I5THUQF","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PWRVU3CP","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:1fdbfc6b2c79b1276febf2724a6e2066aea9cb4149fde11744ecf4b2b2bc93d9","target":"graph","created_at":"2026-05-18T01:27:47Z","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":"Noisy optimization is the optimization of objective functions corrupted by noise. A portfolio of solvers is a set of solvers equipped with an algorithm selection tool for distributing the computational power among them. Portfolios are widely and successfully used in combinatorial optimization. In this work, we study portfolios of noisy optimization solvers. We obtain mathematically proved performance (in the sense that the portfolio performs nearly as well as the best of its solvers) by an ad hoc portfolio algorithm dedicated to noisy optimization. A somehow surprising result is that it is bet","authors_text":"Jialin Liu (TAO, LRI), Marie-Liesse Cauwet (TAO, Olivier Teytaud (TAO, Rozi\\`ere Baptiste (TAO","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-04T10:44:11Z","title":"Algorithm Portfolios for Noisy Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01277","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:4790b50d02247938059247c6e39bef5d1d878bb20be44788db76daf9837175f6","target":"record","created_at":"2026-05-18T01:27:47Z","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":"36254891b1fcd721fdf210b3f389d9349db8f0b10b287e0a1e0e295973edfa48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-04T10:44:11Z","title_canon_sha256":"d2d5f7864a10865d05c2b71967c612a29be97eaa352f58f01e1be819ee08833a"},"schema_version":"1.0","source":{"id":"1511.01277","kind":"arxiv","version":1}},"canonical_sha256":"7da35a6c4fda3b33d2056e405450b2658c9eebf0d8b3ec70da7cd2fceae6f481","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7da35a6c4fda3b33d2056e405450b2658c9eebf0d8b3ec70da7cd2fceae6f481","first_computed_at":"2026-05-18T01:27:47.619583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:47.619583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HEldpx12IeKKbBT3LK1JZlf0QAbF/E90GpG6Lka1y92Hx3lrKCEJliJkmj3rWpqYqtmc/rxEydbBpsRAiS/RCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:47.620361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4790b50d02247938059247c6e39bef5d1d878bb20be44788db76daf9837175f6","sha256:1fdbfc6b2c79b1276febf2724a6e2066aea9cb4149fde11744ecf4b2b2bc93d9"],"state_sha256":"53514bff8645d908ef39d42f0a0c9f9ac25b95f15b205ea8ad9596729e9cb7b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tECfcTXd96KP9FEmQo7RudP4MtiEu/frL9zzVBAwGXG6kC7YepaoFAQIPAiFWxpscFblNx6AYh/9NgRAnnsmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:36:40.116172Z","bundle_sha256":"5cee96bd6560e14b8a1ba325b9fbea448ccd2eb0bfec6a18df470dfe49d1dc38"}}