{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QH4ZJ3MJAYCCK6WKZT4GXA5TIC","short_pith_number":"pith:QH4ZJ3MJ","canonical_record":{"source":{"id":"1805.10255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-25T17:12:38Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"ac211d75fa7243ff37dcd237df17600e8c0401e809928f897294a71ab4ca586f","abstract_canon_sha256":"178087341efb941d54db346824ce657ff5d4f018202c391af5c018c12c03163d"},"schema_version":"1.0"},"canonical_sha256":"81f994ed890604257acaccf86b83b34084243966f0ba05cd2ae8ec244b643516","source":{"kind":"arxiv","id":"1805.10255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10255","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10255v1","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10255","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"pith_short_12","alias_value":"QH4ZJ3MJAYCC","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QH4ZJ3MJAYCCK6WK","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QH4ZJ3MJ","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QH4ZJ3MJAYCCK6WKZT4GXA5TIC","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-25T17:12:38Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"ac211d75fa7243ff37dcd237df17600e8c0401e809928f897294a71ab4ca586f","abstract_canon_sha256":"178087341efb941d54db346824ce657ff5d4f018202c391af5c018c12c03163d"},"schema_version":"1.0"},"canonical_sha256":"81f994ed890604257acaccf86b83b34084243966f0ba05cd2ae8ec244b643516","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:43.748608Z","signature_b64":"SsaG/jc0oijPdrV/QKX0n2frLxqBs2R6+1DbbMP6H3gr/iHYL+4XNk5oB+7qnmNDwr5wY64YiVVT29ZtlASHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81f994ed890604257acaccf86b83b34084243966f0ba05cd2ae8ec244b643516","last_reissued_at":"2026-05-18T00:14:43.747986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:43.747986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10255","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:14:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MW+AZhwlME2Go25sgSNSBoUMf2v2tTj1bQjCWTIX1ZR8ZEEzJ3wi/bBqnGPvqBFNl/QjY05HbJXslFakZFY/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:06:36.394277Z"},"content_sha256":"5bf5a454d17f3881abcf70b126476dd251b2c5aaaf3d513a452402703cbb42da","schema_version":"1.0","event_id":"sha256:5bf5a454d17f3881abcf70b126476dd251b2c5aaaf3d513a452402703cbb42da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QH4ZJ3MJAYCCK6WKZT4GXA5TIC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Architecture and Hyperparameter Search via Successive Halving and Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"George E. Dahl, Manoj Kumar, Mohammad Norouzi, Vijay Vasudevan","submitted_at":"2018-05-25T17:12:38Z","abstract_excerpt":"We present a simple and powerful algorithm for parallel black box optimization called Successive Halving and Classification (SHAC). The algorithm operates in $K$ stages of parallel function evaluations and trains a cascade of binary classifiers to iteratively cull the undesirable regions of the search space. SHAC is easy to implement, requires no tuning of its own configuration parameters, is invariant to the scale of the objective function and can be built using any choice of binary classifier. We adopt tree-based classifiers within SHAC and achieve competitive performance against several str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10255","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:14:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkWgfeVrePsocmMljNpskaeUqtdOHQVuRbE1hOwD6ZSnvK3XVq5qvXH7MorxSAWp7OAlekqDuj8Z5DhfzNpbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:06:36.394666Z"},"content_sha256":"b1f3989defb69068bdbf3b9d151763a85fa22406bfb9efcc305dc61e66b8b687","schema_version":"1.0","event_id":"sha256:b1f3989defb69068bdbf3b9d151763a85fa22406bfb9efcc305dc61e66b8b687"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QH4ZJ3MJAYCCK6WKZT4GXA5TIC/bundle.json","state_url":"https://pith.science/pith/QH4ZJ3MJAYCCK6WKZT4GXA5TIC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QH4ZJ3MJAYCCK6WKZT4GXA5TIC/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-03T04:06:36Z","links":{"resolver":"https://pith.science/pith/QH4ZJ3MJAYCCK6WKZT4GXA5TIC","bundle":"https://pith.science/pith/QH4ZJ3MJAYCCK6WKZT4GXA5TIC/bundle.json","state":"https://pith.science/pith/QH4ZJ3MJAYCCK6WKZT4GXA5TIC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QH4ZJ3MJAYCCK6WKZT4GXA5TIC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QH4ZJ3MJAYCCK6WKZT4GXA5TIC","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":"178087341efb941d54db346824ce657ff5d4f018202c391af5c018c12c03163d","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-25T17:12:38Z","title_canon_sha256":"ac211d75fa7243ff37dcd237df17600e8c0401e809928f897294a71ab4ca586f"},"schema_version":"1.0","source":{"id":"1805.10255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10255","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10255v1","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10255","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"pith_short_12","alias_value":"QH4ZJ3MJAYCC","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QH4ZJ3MJAYCCK6WK","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QH4ZJ3MJ","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:b1f3989defb69068bdbf3b9d151763a85fa22406bfb9efcc305dc61e66b8b687","target":"graph","created_at":"2026-05-18T00:14:43Z","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 a simple and powerful algorithm for parallel black box optimization called Successive Halving and Classification (SHAC). The algorithm operates in $K$ stages of parallel function evaluations and trains a cascade of binary classifiers to iteratively cull the undesirable regions of the search space. SHAC is easy to implement, requires no tuning of its own configuration parameters, is invariant to the scale of the objective function and can be built using any choice of binary classifier. We adopt tree-based classifiers within SHAC and achieve competitive performance against several str","authors_text":"George E. Dahl, Manoj Kumar, Mohammad Norouzi, Vijay Vasudevan","cross_cats":["cs.AI","cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-25T17:12:38Z","title":"Parallel Architecture and Hyperparameter Search via Successive Halving and Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10255","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:5bf5a454d17f3881abcf70b126476dd251b2c5aaaf3d513a452402703cbb42da","target":"record","created_at":"2026-05-18T00:14:43Z","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":"178087341efb941d54db346824ce657ff5d4f018202c391af5c018c12c03163d","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-25T17:12:38Z","title_canon_sha256":"ac211d75fa7243ff37dcd237df17600e8c0401e809928f897294a71ab4ca586f"},"schema_version":"1.0","source":{"id":"1805.10255","kind":"arxiv","version":1}},"canonical_sha256":"81f994ed890604257acaccf86b83b34084243966f0ba05cd2ae8ec244b643516","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81f994ed890604257acaccf86b83b34084243966f0ba05cd2ae8ec244b643516","first_computed_at":"2026-05-18T00:14:43.747986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:43.747986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SsaG/jc0oijPdrV/QKX0n2frLxqBs2R6+1DbbMP6H3gr/iHYL+4XNk5oB+7qnmNDwr5wY64YiVVT29ZtlASHCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:43.748608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bf5a454d17f3881abcf70b126476dd251b2c5aaaf3d513a452402703cbb42da","sha256:b1f3989defb69068bdbf3b9d151763a85fa22406bfb9efcc305dc61e66b8b687"],"state_sha256":"5a9c4f21a73db23fed1db3100f46d33ca969961680e13faf73a0381a895c92cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KimOT95lPEjgk0Pel/0O1iSKU5LLSv8ne5hw8PvibCMYT1TZuSJT+O1mSLxH39F8grjV2PKt+SbjGfS0+djGCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:06:36.396627Z","bundle_sha256":"8f70fdec754d063ce4d466d349a6b2f177468f375783a31150060ab30938f596"}}