{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ATCEUZLLFDHBK4MBFCXATFTDG7","short_pith_number":"pith:ATCEUZLL","canonical_record":{"source":{"id":"1607.06651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-22T12:29:31Z","cross_cats_sorted":[],"title_canon_sha256":"00551b1e3c8f1c4c9364e32345b68ec5aff109b242368691712cfd2504a1b22f","abstract_canon_sha256":"59ae05d9e0379c72aa885ecb6866095acaf772127566c5f00e16fba369265433"},"schema_version":"1.0"},"canonical_sha256":"04c44a656b28ce15718128ae09966337d1be957f9e81cac6a8f3f3f4c3edccfb","source":{"kind":"arxiv","id":"1607.06651","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06651","created_at":"2026-05-18T01:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06651v1","created_at":"2026-05-18T01:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06651","created_at":"2026-05-18T01:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"ATCEUZLLFDHB","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ATCEUZLLFDHBK4MB","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ATCEUZLL","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ATCEUZLLFDHBK4MBFCXATFTDG7","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-22T12:29:31Z","cross_cats_sorted":[],"title_canon_sha256":"00551b1e3c8f1c4c9364e32345b68ec5aff109b242368691712cfd2504a1b22f","abstract_canon_sha256":"59ae05d9e0379c72aa885ecb6866095acaf772127566c5f00e16fba369265433"},"schema_version":"1.0"},"canonical_sha256":"04c44a656b28ce15718128ae09966337d1be957f9e81cac6a8f3f3f4c3edccfb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:39.373964Z","signature_b64":"n2psjlUTVPo4R0g5B/XWPJECpFAERlbH1FF0xvVf1jb8KFHJtxQkaLlZM3DHpbDy3AHBrUXCjHAur5l/nHIiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04c44a656b28ce15718128ae09966337d1be957f9e81cac6a8f3f3f4c3edccfb","last_reissued_at":"2026-05-18T01:10:39.373461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:39.373461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06651","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:10:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0N3KcAv1gUwbUaM1xYr9B+4GgS7inSpH30dS8qVzKFFntjS8oN6gPWkB2XiUJd+iBbVWnLWRXaEviUFCwv0MDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T14:05:38.565098Z"},"content_sha256":"4b562a9bba66727ba4b066177f0937e7d767c6d0609386f41116e6d98fa1fe6e","schema_version":"1.0","event_id":"sha256:4b562a9bba66727ba4b066177f0937e7d767c6d0609386f41116e6d98fa1fe6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ATCEUZLLFDHBK4MBFCXATFTDG7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Different Types of Regret in Continuous Noisy Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"LRI), Marie-Liesse Cauwet (LRI, Olivier Teytaud (TAO, Sandra Astete-Morales (LRI, TAO)","submitted_at":"2016-07-22T12:29:31Z","abstract_excerpt":"The performance measure of an algorithm is a crucial part of its analysis. The performance can be determined by the study on the convergence rate of the algorithm in question. It is necessary to study some (hopefully convergent) sequence that will measure how \"good\" is the approximated optimum compared to the real optimum. The concept of Regret is widely used in the bandit literature for assessing the performance of an algorithm. The same concept is also used in the framework of optimization algorithms, sometimes under other names or without a specific name. And the numerical evaluation of con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06651","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:10:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8NEm8/CcZKQE/99s9Vhoq5WAcEcn/y8X7NQD3tXj5yl3ccHLDa7p4qK0B+CmiNW1YJb+B9CT7+jCd9woK4cCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T14:05:38.565466Z"},"content_sha256":"1248ec1d1dc0c39a5e5404227a371aabce0157c7080e689a5331a043f638fbaa","schema_version":"1.0","event_id":"sha256:1248ec1d1dc0c39a5e5404227a371aabce0157c7080e689a5331a043f638fbaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATCEUZLLFDHBK4MBFCXATFTDG7/bundle.json","state_url":"https://pith.science/pith/ATCEUZLLFDHBK4MBFCXATFTDG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATCEUZLLFDHBK4MBFCXATFTDG7/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-24T14:05:38Z","links":{"resolver":"https://pith.science/pith/ATCEUZLLFDHBK4MBFCXATFTDG7","bundle":"https://pith.science/pith/ATCEUZLLFDHBK4MBFCXATFTDG7/bundle.json","state":"https://pith.science/pith/ATCEUZLLFDHBK4MBFCXATFTDG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATCEUZLLFDHBK4MBFCXATFTDG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ATCEUZLLFDHBK4MBFCXATFTDG7","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":"59ae05d9e0379c72aa885ecb6866095acaf772127566c5f00e16fba369265433","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-22T12:29:31Z","title_canon_sha256":"00551b1e3c8f1c4c9364e32345b68ec5aff109b242368691712cfd2504a1b22f"},"schema_version":"1.0","source":{"id":"1607.06651","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06651","created_at":"2026-05-18T01:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06651v1","created_at":"2026-05-18T01:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06651","created_at":"2026-05-18T01:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"ATCEUZLLFDHB","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ATCEUZLLFDHBK4MB","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ATCEUZLL","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:1248ec1d1dc0c39a5e5404227a371aabce0157c7080e689a5331a043f638fbaa","target":"graph","created_at":"2026-05-18T01:10:39Z","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":"The performance measure of an algorithm is a crucial part of its analysis. The performance can be determined by the study on the convergence rate of the algorithm in question. It is necessary to study some (hopefully convergent) sequence that will measure how \"good\" is the approximated optimum compared to the real optimum. The concept of Regret is widely used in the bandit literature for assessing the performance of an algorithm. The same concept is also used in the framework of optimization algorithms, sometimes under other names or without a specific name. And the numerical evaluation of con","authors_text":"LRI), Marie-Liesse Cauwet (LRI, Olivier Teytaud (TAO, Sandra Astete-Morales (LRI, TAO)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-22T12:29:31Z","title":"Analysis of Different Types of Regret in Continuous Noisy Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06651","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:4b562a9bba66727ba4b066177f0937e7d767c6d0609386f41116e6d98fa1fe6e","target":"record","created_at":"2026-05-18T01:10:39Z","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":"59ae05d9e0379c72aa885ecb6866095acaf772127566c5f00e16fba369265433","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-22T12:29:31Z","title_canon_sha256":"00551b1e3c8f1c4c9364e32345b68ec5aff109b242368691712cfd2504a1b22f"},"schema_version":"1.0","source":{"id":"1607.06651","kind":"arxiv","version":1}},"canonical_sha256":"04c44a656b28ce15718128ae09966337d1be957f9e81cac6a8f3f3f4c3edccfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04c44a656b28ce15718128ae09966337d1be957f9e81cac6a8f3f3f4c3edccfb","first_computed_at":"2026-05-18T01:10:39.373461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:39.373461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n2psjlUTVPo4R0g5B/XWPJECpFAERlbH1FF0xvVf1jb8KFHJtxQkaLlZM3DHpbDy3AHBrUXCjHAur5l/nHIiDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:39.373964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06651","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b562a9bba66727ba4b066177f0937e7d767c6d0609386f41116e6d98fa1fe6e","sha256:1248ec1d1dc0c39a5e5404227a371aabce0157c7080e689a5331a043f638fbaa"],"state_sha256":"bf635c6e9cec69c59b38febcd994daf1ba4ded3e4249965f1d4531e631d3e32a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FPB1tJFiGrWNB/23C0IRBnYxK7hltE5UuUnVketIb0+CDBrPIDKH/i+3gVSrM4kt3NPXCdA4XqZr2waaJDNlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T14:05:38.567454Z","bundle_sha256":"a98624a62e438355c527cdba5c2da3ff63eb38ac4f8b91110e57de9957e59d12"}}