{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6TNAQYZYBB4T75JU3E55F673RN","short_pith_number":"pith:6TNAQYZY","canonical_record":{"source":{"id":"1806.08838","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-22T20:08:53Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"23c3a06a79240454939d2396be46aa3af1013c829cd78934be1735302580cf13","abstract_canon_sha256":"058693fd302121a74dcd842a12439254a0542d59c24392db59d3e9996994a375"},"schema_version":"1.0"},"canonical_sha256":"f4da08633808793ff534d93bd2fbfb8b6e66225aa177c342fd8259ebf8f8452d","source":{"kind":"arxiv","id":"1806.08838","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08838","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08838v2","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08838","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"6TNAQYZYBB4T","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6TNAQYZYBB4T75JU","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6TNAQYZY","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6TNAQYZYBB4T75JU3E55F673RN","target":"record","payload":{"canonical_record":{"source":{"id":"1806.08838","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-22T20:08:53Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"23c3a06a79240454939d2396be46aa3af1013c829cd78934be1735302580cf13","abstract_canon_sha256":"058693fd302121a74dcd842a12439254a0542d59c24392db59d3e9996994a375"},"schema_version":"1.0"},"canonical_sha256":"f4da08633808793ff534d93bd2fbfb8b6e66225aa177c342fd8259ebf8f8452d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:41.209337Z","signature_b64":"IX9/oKyRJlkfMmr7GyriO3DDvcRc6kadHLc/1VfyAl+2Fc7+FXA8PLC666s8zyuM6mS/WVE3z01XSoOGBSUNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4da08633808793ff534d93bd2fbfb8b6e66225aa177c342fd8259ebf8f8452d","last_reissued_at":"2026-05-18T00:03:41.208850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:41.208850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.08838","source_version":2,"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-18T00:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GDemV4FMjzviqBXy6by+sa+SR4zCteV3CvIloa37jX6yK3aKSN9fN+0OGmPoJk1LdY84UWImrp1jkrHnu4IBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:50:16.746020Z"},"content_sha256":"400a354291c3b1bfa877976b8e40a3808999579ffc6a813340ff0176fbc2d826","schema_version":"1.0","event_id":"sha256:400a354291c3b1bfa877976b8e40a3808999579ffc6a813340ff0176fbc2d826"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6TNAQYZYBB4T75JU3E55F673RN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Optimization of Combinatorial Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Matthias Poloczek, Ricardo Baptista","submitted_at":"2018-06-22T20:08:53Z","abstract_excerpt":"The optimization of expensive-to-evaluate black-box functions over combinatorial structures is an ubiquitous task in machine learning, engineering and the natural sciences. The combinatorial explosion of the search space and costly evaluations pose challenges for current techniques in discrete optimization and machine learning, and critically require new algorithmic ideas. This article proposes, to the best of our knowledge, the first algorithm to overcome these challenges, based on an adaptive, scalable model that identifies useful combinatorial structure even when data is scarce. Our acquisi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08838","kind":"arxiv","version":2},"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-18T00:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3TO5hhDtUtGPOkO1yDpKPqy1b3cAB6Gi2T/j1qbO0smKEpiSeWUMwYSFlb9KLzSG6nMOdGiDHdFQ42609LouDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:50:16.748530Z"},"content_sha256":"2b70cc218ecd539906d6243678bf1ab09f3fa6fe1052fb8ad48777150ab12e2a","schema_version":"1.0","event_id":"sha256:2b70cc218ecd539906d6243678bf1ab09f3fa6fe1052fb8ad48777150ab12e2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6TNAQYZYBB4T75JU3E55F673RN/bundle.json","state_url":"https://pith.science/pith/6TNAQYZYBB4T75JU3E55F673RN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6TNAQYZYBB4T75JU3E55F673RN/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-04T05:50:16Z","links":{"resolver":"https://pith.science/pith/6TNAQYZYBB4T75JU3E55F673RN","bundle":"https://pith.science/pith/6TNAQYZYBB4T75JU3E55F673RN/bundle.json","state":"https://pith.science/pith/6TNAQYZYBB4T75JU3E55F673RN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6TNAQYZYBB4T75JU3E55F673RN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6TNAQYZYBB4T75JU3E55F673RN","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":"058693fd302121a74dcd842a12439254a0542d59c24392db59d3e9996994a375","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-22T20:08:53Z","title_canon_sha256":"23c3a06a79240454939d2396be46aa3af1013c829cd78934be1735302580cf13"},"schema_version":"1.0","source":{"id":"1806.08838","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08838","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08838v2","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08838","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"6TNAQYZYBB4T","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6TNAQYZYBB4T75JU","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6TNAQYZY","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:2b70cc218ecd539906d6243678bf1ab09f3fa6fe1052fb8ad48777150ab12e2a","target":"graph","created_at":"2026-05-18T00:03:41Z","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 optimization of expensive-to-evaluate black-box functions over combinatorial structures is an ubiquitous task in machine learning, engineering and the natural sciences. The combinatorial explosion of the search space and costly evaluations pose challenges for current techniques in discrete optimization and machine learning, and critically require new algorithmic ideas. This article proposes, to the best of our knowledge, the first algorithm to overcome these challenges, based on an adaptive, scalable model that identifies useful combinatorial structure even when data is scarce. Our acquisi","authors_text":"Matthias Poloczek, Ricardo Baptista","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-22T20:08:53Z","title":"Bayesian Optimization of Combinatorial Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08838","kind":"arxiv","version":2},"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:400a354291c3b1bfa877976b8e40a3808999579ffc6a813340ff0176fbc2d826","target":"record","created_at":"2026-05-18T00:03:41Z","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":"058693fd302121a74dcd842a12439254a0542d59c24392db59d3e9996994a375","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-22T20:08:53Z","title_canon_sha256":"23c3a06a79240454939d2396be46aa3af1013c829cd78934be1735302580cf13"},"schema_version":"1.0","source":{"id":"1806.08838","kind":"arxiv","version":2}},"canonical_sha256":"f4da08633808793ff534d93bd2fbfb8b6e66225aa177c342fd8259ebf8f8452d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4da08633808793ff534d93bd2fbfb8b6e66225aa177c342fd8259ebf8f8452d","first_computed_at":"2026-05-18T00:03:41.208850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:41.208850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IX9/oKyRJlkfMmr7GyriO3DDvcRc6kadHLc/1VfyAl+2Fc7+FXA8PLC666s8zyuM6mS/WVE3z01XSoOGBSUNBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:41.209337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08838","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:400a354291c3b1bfa877976b8e40a3808999579ffc6a813340ff0176fbc2d826","sha256:2b70cc218ecd539906d6243678bf1ab09f3fa6fe1052fb8ad48777150ab12e2a"],"state_sha256":"2ef5a9b74e88f669925cc42e15648944047d26d6741a8e3063dd0f9dc3e2f520"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BxbQAGBMiafoYpmPxMA+EkbjTIyd3ovp2HjpKuTaM+2mfZ0nN/Cigv094EmKu4qESbOpmX1sM1c478Yvb+MwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:50:16.759851Z","bundle_sha256":"8cfdf88305431c46a52831f5070efabdd9fc7308266b6f1ca73953452b2c3693"}}