{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:CRVQ3XHIWUP276T7KPOZBI26HV","short_pith_number":"pith:CRVQ3XHI","canonical_record":{"source":{"id":"2201.12909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-01-30T20:42:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0a8c7e1a39099f11b1bf6d6dc688abe984d5f08292041f4f251484d5ec9d8946","abstract_canon_sha256":"46651130cf0c23d5739410d068523502e1384e1e0913119cedb1db8ca5974ddf"},"schema_version":"1.0"},"canonical_sha256":"146b0ddce8b51faffa7f53dd90a35e3d7f474ba37ff986a790673949334c7fec","source":{"kind":"arxiv","id":"2201.12909","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12909","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12909v1","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12909","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"CRVQ3XHIWUP2","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_16","alias_value":"CRVQ3XHIWUP276T7","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_8","alias_value":"CRVQ3XHI","created_at":"2026-07-05T03:52:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:CRVQ3XHIWUP276T7KPOZBI26HV","target":"record","payload":{"canonical_record":{"source":{"id":"2201.12909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-01-30T20:42:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0a8c7e1a39099f11b1bf6d6dc688abe984d5f08292041f4f251484d5ec9d8946","abstract_canon_sha256":"46651130cf0c23d5739410d068523502e1384e1e0913119cedb1db8ca5974ddf"},"schema_version":"1.0"},"canonical_sha256":"146b0ddce8b51faffa7f53dd90a35e3d7f474ba37ff986a790673949334c7fec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:40.986844Z","signature_b64":"glZ3SoL1ym5OORrvc8t87zBDQXfwRAZ9M5L2MDZL8whlAURQowQRSkTqliTFyGWSmuPDxTRWuFo4gO2WUDn4DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"146b0ddce8b51faffa7f53dd90a35e3d7f474ba37ff986a790673949334c7fec","last_reissued_at":"2026-07-05T03:52:40.986372Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:40.986372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.12909","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-05T03:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J5L95ix+jdNOmK5ZpHUAg3JWQ89hqg8dYqq2EQZb5eYBWzZ3NcUerEmtyWtVxccewXk4sYXjFuXmDtFCapUyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T05:48:16.283624Z"},"content_sha256":"c278655b83cb901849ab8afb0ee13b0808493fa8cf09b90ec7b35bc070b9ca98","schema_version":"1.0","event_id":"sha256:c278655b83cb901849ab8afb0ee13b0808493fa8cf09b90ec7b35bc070b9ca98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:CRVQ3XHIWUP276T7KPOZBI26HV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Gaussian Process Optimization by Evaluating a Few Unique Candidates Multiple Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alessandro Lazaric, Daniele Calandriello, Lorenzo Rosasco, Luigi Carratino, Michal Valko","submitted_at":"2022-01-30T20:42:14Z","abstract_excerpt":"Computing a Gaussian process (GP) posterior has a computational cost cubical in the number of historical points. A reformulation of the same GP posterior highlights that this complexity mainly depends on how many \\emph{unique} historical points are considered. This can have important implication in active learning settings, where the set of historical points is constructed sequentially by the learner. We show that sequential black-box optimization based on GPs (GP-Opt) can be made efficient by sticking to a candidate solution for multiple evaluation steps and switch only when necessary. Limiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12909","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/2201.12909/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-05T03:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGx/RJns7+qhADdkEofWJh8U4+Kf09lR2RDCyiCL/DA9IjbeQFlvvW9w5+kvzqF0FYGwwcGzefzUfI9AXpexDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T05:48:16.284002Z"},"content_sha256":"4494967206caa642a88c173cffc8dcb63c2428cc42c819233ee91dfb2b5e7016","schema_version":"1.0","event_id":"sha256:4494967206caa642a88c173cffc8dcb63c2428cc42c819233ee91dfb2b5e7016"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV/bundle.json","state_url":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRVQ3XHIWUP276T7KPOZBI26HV/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-07-08T05:48:16Z","links":{"resolver":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV","bundle":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV/bundle.json","state":"https://pith.science/pith/CRVQ3XHIWUP276T7KPOZBI26HV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRVQ3XHIWUP276T7KPOZBI26HV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:CRVQ3XHIWUP276T7KPOZBI26HV","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":"46651130cf0c23d5739410d068523502e1384e1e0913119cedb1db8ca5974ddf","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-01-30T20:42:14Z","title_canon_sha256":"0a8c7e1a39099f11b1bf6d6dc688abe984d5f08292041f4f251484d5ec9d8946"},"schema_version":"1.0","source":{"id":"2201.12909","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12909","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12909v1","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12909","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"CRVQ3XHIWUP2","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_16","alias_value":"CRVQ3XHIWUP276T7","created_at":"2026-07-05T03:52:40Z"},{"alias_kind":"pith_short_8","alias_value":"CRVQ3XHI","created_at":"2026-07-05T03:52:40Z"}],"graph_snapshots":[{"event_id":"sha256:4494967206caa642a88c173cffc8dcb63c2428cc42c819233ee91dfb2b5e7016","target":"graph","created_at":"2026-07-05T03:52:40Z","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/2201.12909/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Computing a Gaussian process (GP) posterior has a computational cost cubical in the number of historical points. A reformulation of the same GP posterior highlights that this complexity mainly depends on how many \\emph{unique} historical points are considered. This can have important implication in active learning settings, where the set of historical points is constructed sequentially by the learner. We show that sequential black-box optimization based on GPs (GP-Opt) can be made efficient by sticking to a candidate solution for multiple evaluation steps and switch only when necessary. Limiti","authors_text":"Alessandro Lazaric, Daniele Calandriello, Lorenzo Rosasco, Luigi Carratino, Michal Valko","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-01-30T20:42:14Z","title":"Scaling Gaussian Process Optimization by Evaluating a Few Unique Candidates Multiple Times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12909","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:c278655b83cb901849ab8afb0ee13b0808493fa8cf09b90ec7b35bc070b9ca98","target":"record","created_at":"2026-07-05T03:52:40Z","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":"46651130cf0c23d5739410d068523502e1384e1e0913119cedb1db8ca5974ddf","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-01-30T20:42:14Z","title_canon_sha256":"0a8c7e1a39099f11b1bf6d6dc688abe984d5f08292041f4f251484d5ec9d8946"},"schema_version":"1.0","source":{"id":"2201.12909","kind":"arxiv","version":1}},"canonical_sha256":"146b0ddce8b51faffa7f53dd90a35e3d7f474ba37ff986a790673949334c7fec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"146b0ddce8b51faffa7f53dd90a35e3d7f474ba37ff986a790673949334c7fec","first_computed_at":"2026-07-05T03:52:40.986372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:52:40.986372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"glZ3SoL1ym5OORrvc8t87zBDQXfwRAZ9M5L2MDZL8whlAURQowQRSkTqliTFyGWSmuPDxTRWuFo4gO2WUDn4DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:52:40.986844Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.12909","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c278655b83cb901849ab8afb0ee13b0808493fa8cf09b90ec7b35bc070b9ca98","sha256:4494967206caa642a88c173cffc8dcb63c2428cc42c819233ee91dfb2b5e7016"],"state_sha256":"ca2d4b81aa893df8bef202eef05e456dbe8eddaebf2f685ded524db7409d992c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rHMS9U0GCFxpMvPiuz0VbnYViiUHBOLZB3ppar8ocHuXRu15gH/eX7SSx5qvLepNsqVbGyRHQAqvKX8m0kcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T05:48:16.286219Z","bundle_sha256":"d2dc1fe58a5494a518297adb610b53ccbb37fbee8e6714fd2b9a46d77738f4da"}}