{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OFYF6LR5PYC5ACV74NHQHXTYTK","short_pith_number":"pith:OFYF6LR5","canonical_record":{"source":{"id":"1612.00383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-01T19:08:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"49c9f8334cc66930603e1457a753647d927751513160d17731bb0398048fc5c7","abstract_canon_sha256":"f170a89d3e900829668fa30d5bab7bc73d6b00d88e290437407ee6b04e62d526"},"schema_version":"1.0"},"canonical_sha256":"71705f2e3d7e05d00abfe34f03de789ab8eb068994957ee5358ab2926469d606","source":{"kind":"arxiv","id":"1612.00383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00383","created_at":"2026-05-18T00:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00383v1","created_at":"2026-05-18T00:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00383","created_at":"2026-05-18T00:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"OFYF6LR5PYC5","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OFYF6LR5PYC5ACV7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OFYF6LR5","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OFYF6LR5PYC5ACV74NHQHXTYTK","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-01T19:08:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"49c9f8334cc66930603e1457a753647d927751513160d17731bb0398048fc5c7","abstract_canon_sha256":"f170a89d3e900829668fa30d5bab7bc73d6b00d88e290437407ee6b04e62d526"},"schema_version":"1.0"},"canonical_sha256":"71705f2e3d7e05d00abfe34f03de789ab8eb068994957ee5358ab2926469d606","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:04.973908Z","signature_b64":"9RfM+JGSDky4tEe5JNO3AFa0bSnM/Ehpwzvv+NxHG3hAA9dWj+S2Q+Pbt8f1OXr0Q5JvjUq/fAlsHHsU6bQ2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71705f2e3d7e05d00abfe34f03de789ab8eb068994957ee5358ab2926469d606","last_reissued_at":"2026-05-18T00:56:04.973429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:04.973429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00383","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-18T00:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LDgKDFSB8V71MT36Yu3OR/xIOiPX1HjNcD6csRpkXmxe8G6oPsuId4J9iH/XBFxgwPWJCR2G6Vckc4RxMvOCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:20:36.924077Z"},"content_sha256":"b804af1d175107034dc6b72dcb5786c3d567b6cbaa2b209ddf23819ef69f456a","schema_version":"1.0","event_id":"sha256:b804af1d175107034dc6b72dcb5786c3d567b6cbaa2b209ddf23819ef69f456a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OFYF6LR5PYC5ACV74NHQHXTYTK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tuning the Scheduling of Distributed Stochastic Gradient Descent with Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Eiko Yoneki, Michael Schaarschmidt, Valentin Dalibard","submitted_at":"2016-12-01T19:08:12Z","abstract_excerpt":"We present an optimizer which uses Bayesian optimization to tune the system parameters of distributed stochastic gradient descent (SGD). Given a specific context, our goal is to quickly find efficient configurations which appropriately balance the load between the available machines to minimize the average SGD iteration time. Our experiments consider setups with over thirty parameters. Traditional Bayesian optimization, which uses a Gaussian process as its model, is not well suited to such high dimensional domains. To reduce convergence time, we exploit the available structure. We design a pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00383","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-18T00:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6e8Sa2jM5Skee3NAa9EqEczyixisgMfGhE813DcjemkUB2mDK++p6f5Lo5QdMXAd629uxjHNe5G8IwLO3ncCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:20:36.924868Z"},"content_sha256":"a075ef1a1dc5ad728f405a2375568ce738ce5d574715e29272647ddd499b3ed9","schema_version":"1.0","event_id":"sha256:a075ef1a1dc5ad728f405a2375568ce738ce5d574715e29272647ddd499b3ed9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFYF6LR5PYC5ACV74NHQHXTYTK/bundle.json","state_url":"https://pith.science/pith/OFYF6LR5PYC5ACV74NHQHXTYTK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFYF6LR5PYC5ACV74NHQHXTYTK/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-05-31T21:20:36Z","links":{"resolver":"https://pith.science/pith/OFYF6LR5PYC5ACV74NHQHXTYTK","bundle":"https://pith.science/pith/OFYF6LR5PYC5ACV74NHQHXTYTK/bundle.json","state":"https://pith.science/pith/OFYF6LR5PYC5ACV74NHQHXTYTK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFYF6LR5PYC5ACV74NHQHXTYTK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OFYF6LR5PYC5ACV74NHQHXTYTK","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":"f170a89d3e900829668fa30d5bab7bc73d6b00d88e290437407ee6b04e62d526","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-01T19:08:12Z","title_canon_sha256":"49c9f8334cc66930603e1457a753647d927751513160d17731bb0398048fc5c7"},"schema_version":"1.0","source":{"id":"1612.00383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00383","created_at":"2026-05-18T00:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00383v1","created_at":"2026-05-18T00:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00383","created_at":"2026-05-18T00:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"OFYF6LR5PYC5","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OFYF6LR5PYC5ACV7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OFYF6LR5","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:a075ef1a1dc5ad728f405a2375568ce738ce5d574715e29272647ddd499b3ed9","target":"graph","created_at":"2026-05-18T00:56:04Z","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":"We present an optimizer which uses Bayesian optimization to tune the system parameters of distributed stochastic gradient descent (SGD). Given a specific context, our goal is to quickly find efficient configurations which appropriately balance the load between the available machines to minimize the average SGD iteration time. Our experiments consider setups with over thirty parameters. Traditional Bayesian optimization, which uses a Gaussian process as its model, is not well suited to such high dimensional domains. To reduce convergence time, we exploit the available structure. We design a pro","authors_text":"Eiko Yoneki, Michael Schaarschmidt, Valentin Dalibard","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-01T19:08:12Z","title":"Tuning the Scheduling of Distributed Stochastic Gradient Descent with Bayesian Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00383","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:b804af1d175107034dc6b72dcb5786c3d567b6cbaa2b209ddf23819ef69f456a","target":"record","created_at":"2026-05-18T00:56:04Z","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":"f170a89d3e900829668fa30d5bab7bc73d6b00d88e290437407ee6b04e62d526","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-01T19:08:12Z","title_canon_sha256":"49c9f8334cc66930603e1457a753647d927751513160d17731bb0398048fc5c7"},"schema_version":"1.0","source":{"id":"1612.00383","kind":"arxiv","version":1}},"canonical_sha256":"71705f2e3d7e05d00abfe34f03de789ab8eb068994957ee5358ab2926469d606","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71705f2e3d7e05d00abfe34f03de789ab8eb068994957ee5358ab2926469d606","first_computed_at":"2026-05-18T00:56:04.973429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:04.973429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9RfM+JGSDky4tEe5JNO3AFa0bSnM/Ehpwzvv+NxHG3hAA9dWj+S2Q+Pbt8f1OXr0Q5JvjUq/fAlsHHsU6bQ2AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:04.973908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b804af1d175107034dc6b72dcb5786c3d567b6cbaa2b209ddf23819ef69f456a","sha256:a075ef1a1dc5ad728f405a2375568ce738ce5d574715e29272647ddd499b3ed9"],"state_sha256":"80be7a1d7ae1d265dcaf2977cbc3258010bda9692c3e4c8f3dc4ca6500a6878b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7fWCq7VwDlcTbbx8/5eM3dgoRQEm7ZhLTZ8FQW+m3XIDQD7CZ2gSnJVUS8D5TAw8nk94l6yvTbEfdYFiHbqjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:20:36.928661Z","bundle_sha256":"656ffae956413627bbadacf6c5609ac027ae4224f11c844475b3185ec4fdb334"}}