{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:44H7HB6WEPBBYQOEKAXRMWNVUC","short_pith_number":"pith:44H7HB6W","canonical_record":{"source":{"id":"1805.01157","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-03T08:13:48Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"cfa4440a61a8c2fa3c376092f27bec6683c8507b9fd8f5899e2ba7a4413c9e77","abstract_canon_sha256":"20df22c109ddfa7f40bc1b2391d4993e87ea553501043ab83962212a48a961a9"},"schema_version":"1.0"},"canonical_sha256":"e70ff387d623c21c41c4502f1659b5a0b6ec20c829f32c2d259a34e512a3142f","source":{"kind":"arxiv","id":"1805.01157","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01157","created_at":"2026-05-18T00:01:29Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01157v4","created_at":"2026-05-18T00:01:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01157","created_at":"2026-05-18T00:01:29Z"},{"alias_kind":"pith_short_12","alias_value":"44H7HB6WEPBB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"44H7HB6WEPBBYQOE","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"44H7HB6W","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:44H7HB6WEPBBYQOEKAXRMWNVUC","target":"record","payload":{"canonical_record":{"source":{"id":"1805.01157","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-03T08:13:48Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"cfa4440a61a8c2fa3c376092f27bec6683c8507b9fd8f5899e2ba7a4413c9e77","abstract_canon_sha256":"20df22c109ddfa7f40bc1b2391d4993e87ea553501043ab83962212a48a961a9"},"schema_version":"1.0"},"canonical_sha256":"e70ff387d623c21c41c4502f1659b5a0b6ec20c829f32c2d259a34e512a3142f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:29.748413Z","signature_b64":"cUT49dsRobQ4VZWe4bYyKggzU9xTS78bLq983y3bBGwqqfbWWAAeGNhDz3pPxh0ApvBizNI9SHjGRHA4sroGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e70ff387d623c21c41c4502f1659b5a0b6ec20c829f32c2d259a34e512a3142f","last_reissued_at":"2026-05-18T00:01:29.747800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:29.747800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.01157","source_version":4,"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:01:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V59iCw3+CpC2jZfSVDdVlqThzMrYP3FrnVjbyh4pXJ3l7yQ6yrMau5DFZsdD7uO1YwLWH8APzsMmUx5fRQkiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:30:32.108718Z"},"content_sha256":"f42c15f415e896b3f83edf1e482fd6a42dcca3e4a066aff1d65c4295f71cc8d6","schema_version":"1.0","event_id":"sha256:f42c15f415e896b3f83edf1e482fd6a42dcca3e4a066aff1d65c4295f71cc8d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:44H7HB6WEPBBYQOEKAXRMWNVUC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Bayesian Optimization: Algorithms, Evaluations and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Bo Yang, Jiaxu Cui","submitted_at":"2018-05-03T08:13:48Z","abstract_excerpt":"Network structure optimization is a fundamental task in complex network analysis. However, almost all the research on Bayesian optimization is aimed at optimizing the objective functions with vectorial inputs. In this work, we first present a flexible framework, denoted graph Bayesian optimization, to handle arbitrary graphs in the Bayesian optimization community. By combining the proposed framework with graph kernels, it can take full advantage of implicit graph structural features to supplement explicit features guessed according to the experience, such as tags of nodes and any attributes of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01157","kind":"arxiv","version":4},"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:01:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QHqZwrqhIJPenytQm+y8cBZKmVDYiMKiKSBLzDOXyRb40zJGx1ymmhm1GJbFE8T3bYDbiR/vPoqnuG3fm5/sBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:30:32.109068Z"},"content_sha256":"d081b1febf96923c816546ebca74e77e7b085ece8bf82263639eba4a228de9fb","schema_version":"1.0","event_id":"sha256:d081b1febf96923c816546ebca74e77e7b085ece8bf82263639eba4a228de9fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/44H7HB6WEPBBYQOEKAXRMWNVUC/bundle.json","state_url":"https://pith.science/pith/44H7HB6WEPBBYQOEKAXRMWNVUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/44H7HB6WEPBBYQOEKAXRMWNVUC/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-02T13:30:32Z","links":{"resolver":"https://pith.science/pith/44H7HB6WEPBBYQOEKAXRMWNVUC","bundle":"https://pith.science/pith/44H7HB6WEPBBYQOEKAXRMWNVUC/bundle.json","state":"https://pith.science/pith/44H7HB6WEPBBYQOEKAXRMWNVUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/44H7HB6WEPBBYQOEKAXRMWNVUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:44H7HB6WEPBBYQOEKAXRMWNVUC","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":"20df22c109ddfa7f40bc1b2391d4993e87ea553501043ab83962212a48a961a9","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-03T08:13:48Z","title_canon_sha256":"cfa4440a61a8c2fa3c376092f27bec6683c8507b9fd8f5899e2ba7a4413c9e77"},"schema_version":"1.0","source":{"id":"1805.01157","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01157","created_at":"2026-05-18T00:01:29Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01157v4","created_at":"2026-05-18T00:01:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01157","created_at":"2026-05-18T00:01:29Z"},{"alias_kind":"pith_short_12","alias_value":"44H7HB6WEPBB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"44H7HB6WEPBBYQOE","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"44H7HB6W","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:d081b1febf96923c816546ebca74e77e7b085ece8bf82263639eba4a228de9fb","target":"graph","created_at":"2026-05-18T00:01:29Z","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":"Network structure optimization is a fundamental task in complex network analysis. However, almost all the research on Bayesian optimization is aimed at optimizing the objective functions with vectorial inputs. In this work, we first present a flexible framework, denoted graph Bayesian optimization, to handle arbitrary graphs in the Bayesian optimization community. By combining the proposed framework with graph kernels, it can take full advantage of implicit graph structural features to supplement explicit features guessed according to the experience, such as tags of nodes and any attributes of","authors_text":"Bo Yang, Jiaxu Cui","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-03T08:13:48Z","title":"Graph Bayesian Optimization: Algorithms, Evaluations and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01157","kind":"arxiv","version":4},"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:f42c15f415e896b3f83edf1e482fd6a42dcca3e4a066aff1d65c4295f71cc8d6","target":"record","created_at":"2026-05-18T00:01:29Z","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":"20df22c109ddfa7f40bc1b2391d4993e87ea553501043ab83962212a48a961a9","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-03T08:13:48Z","title_canon_sha256":"cfa4440a61a8c2fa3c376092f27bec6683c8507b9fd8f5899e2ba7a4413c9e77"},"schema_version":"1.0","source":{"id":"1805.01157","kind":"arxiv","version":4}},"canonical_sha256":"e70ff387d623c21c41c4502f1659b5a0b6ec20c829f32c2d259a34e512a3142f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e70ff387d623c21c41c4502f1659b5a0b6ec20c829f32c2d259a34e512a3142f","first_computed_at":"2026-05-18T00:01:29.747800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:29.747800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cUT49dsRobQ4VZWe4bYyKggzU9xTS78bLq983y3bBGwqqfbWWAAeGNhDz3pPxh0ApvBizNI9SHjGRHA4sroGCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:29.748413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01157","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f42c15f415e896b3f83edf1e482fd6a42dcca3e4a066aff1d65c4295f71cc8d6","sha256:d081b1febf96923c816546ebca74e77e7b085ece8bf82263639eba4a228de9fb"],"state_sha256":"ccd569074c3dd92639dd505b955885c6ba46007293be48504d15f9ae8e97d7b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hSaPo2fwQYiO9He7eOlbF7rF3F+iAg4I9WC8yS0CYSsI/ndHCCDKiJRHKypQ0wOdvUGnkXmyL3iIpPaCoYS3DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:30:32.111062Z","bundle_sha256":"154981d0f3439ab7f4b1bc273deefd3840a807d30e07914f96937b98dee3bd8c"}}