{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4IRGP22TWFBG63JVSZXMOS7L3K","short_pith_number":"pith:4IRGP22T","canonical_record":{"source":{"id":"1611.02053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-07T13:55:00Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"3850142aa86ced4836ccd5860e83cf1a7384f3cc5a7c14659414f3bdfb16d709","abstract_canon_sha256":"0a89e54efe7ea1b72f3d121b85f6bbabbf06133b51b4e3495df882fb679081ae"},"schema_version":"1.0"},"canonical_sha256":"e22267eb53b1426f6d35966ec74bebdaae3c759fd94bc8495fdd8a3c58914f55","source":{"kind":"arxiv","id":"1611.02053","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02053","created_at":"2026-05-18T01:00:03Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02053v1","created_at":"2026-05-18T01:00:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02053","created_at":"2026-05-18T01:00:03Z"},{"alias_kind":"pith_short_12","alias_value":"4IRGP22TWFBG","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4IRGP22TWFBG63JV","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4IRGP22T","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4IRGP22TWFBG63JVSZXMOS7L3K","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-07T13:55:00Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"3850142aa86ced4836ccd5860e83cf1a7384f3cc5a7c14659414f3bdfb16d709","abstract_canon_sha256":"0a89e54efe7ea1b72f3d121b85f6bbabbf06133b51b4e3495df882fb679081ae"},"schema_version":"1.0"},"canonical_sha256":"e22267eb53b1426f6d35966ec74bebdaae3c759fd94bc8495fdd8a3c58914f55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:03.802663Z","signature_b64":"mjx8juhxXyU+5FoxkOWWGotzBs4Qzx0jbzzi1ZHMbdkCo2dgIhNXKuHB/hF/NpLo/weov8ReyfroMBGbzaryAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e22267eb53b1426f6d35966ec74bebdaae3c759fd94bc8495fdd8a3c58914f55","last_reissued_at":"2026-05-18T01:00:03.801899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:03.801899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02053","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-18T01:00:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zrh0hMc6Avb4ypv3EjvuEbNHJ+xp7Z4+D4c0D+3ERzgcEIqCwKyyzeGFvCzH0wD5W+60DBQg5qu93HPECiNXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:12:50.701119Z"},"content_sha256":"3dae77a22b887972880702ed894f559ff707eccd06d6a0748b6a3211922c3c71","schema_version":"1.0","event_id":"sha256:3dae77a22b887972880702ed894f559ff707eccd06d6a0748b6a3211922c3c71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4IRGP22TWFBG63JVSZXMOS7L3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reinforcement-based Simultaneous Algorithm and its Hyperparameters Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anatoly Shalyto, Andrey Filchenkov, Valeria Efimova","submitted_at":"2016-11-07T13:55:00Z","abstract_excerpt":"Many algorithms for data analysis exist, especially for classification problems. To solve a data analysis problem, a proper algorithm should be chosen, and also its hyperparameters should be selected. In this paper, we present a new method for the simultaneous selection of an algorithm and its hyperparameters. In order to do so, we reduced this problem to the multi-armed bandit problem. We consider an algorithm as an arm and algorithm hyperparameters search during a fixed time as the corresponding arm play. We also suggest a problem-specific reward function. We performed the experiments on 10 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02053","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-18T01:00:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIQ4iCcZnxSM0hC+R+3U76HMn9fCj9+++99vSJwt1dA273N40Rb3/IHttrY6C8/Y2Ezt9aZOy16rkx9JXkrpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:12:50.701476Z"},"content_sha256":"971b6134270fc8c0e3e52a5495945819e68a2122801277afad134d1f44ebcc99","schema_version":"1.0","event_id":"sha256:971b6134270fc8c0e3e52a5495945819e68a2122801277afad134d1f44ebcc99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IRGP22TWFBG63JVSZXMOS7L3K/bundle.json","state_url":"https://pith.science/pith/4IRGP22TWFBG63JVSZXMOS7L3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IRGP22TWFBG63JVSZXMOS7L3K/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-28T17:12:50Z","links":{"resolver":"https://pith.science/pith/4IRGP22TWFBG63JVSZXMOS7L3K","bundle":"https://pith.science/pith/4IRGP22TWFBG63JVSZXMOS7L3K/bundle.json","state":"https://pith.science/pith/4IRGP22TWFBG63JVSZXMOS7L3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IRGP22TWFBG63JVSZXMOS7L3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4IRGP22TWFBG63JVSZXMOS7L3K","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":"0a89e54efe7ea1b72f3d121b85f6bbabbf06133b51b4e3495df882fb679081ae","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-07T13:55:00Z","title_canon_sha256":"3850142aa86ced4836ccd5860e83cf1a7384f3cc5a7c14659414f3bdfb16d709"},"schema_version":"1.0","source":{"id":"1611.02053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02053","created_at":"2026-05-18T01:00:03Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02053v1","created_at":"2026-05-18T01:00:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02053","created_at":"2026-05-18T01:00:03Z"},{"alias_kind":"pith_short_12","alias_value":"4IRGP22TWFBG","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4IRGP22TWFBG63JV","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4IRGP22T","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:971b6134270fc8c0e3e52a5495945819e68a2122801277afad134d1f44ebcc99","target":"graph","created_at":"2026-05-18T01:00:03Z","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":"Many algorithms for data analysis exist, especially for classification problems. To solve a data analysis problem, a proper algorithm should be chosen, and also its hyperparameters should be selected. In this paper, we present a new method for the simultaneous selection of an algorithm and its hyperparameters. In order to do so, we reduced this problem to the multi-armed bandit problem. We consider an algorithm as an arm and algorithm hyperparameters search during a fixed time as the corresponding arm play. We also suggest a problem-specific reward function. We performed the experiments on 10 ","authors_text":"Anatoly Shalyto, Andrey Filchenkov, Valeria Efimova","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-07T13:55:00Z","title":"Reinforcement-based Simultaneous Algorithm and its Hyperparameters Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02053","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:3dae77a22b887972880702ed894f559ff707eccd06d6a0748b6a3211922c3c71","target":"record","created_at":"2026-05-18T01:00:03Z","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":"0a89e54efe7ea1b72f3d121b85f6bbabbf06133b51b4e3495df882fb679081ae","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-07T13:55:00Z","title_canon_sha256":"3850142aa86ced4836ccd5860e83cf1a7384f3cc5a7c14659414f3bdfb16d709"},"schema_version":"1.0","source":{"id":"1611.02053","kind":"arxiv","version":1}},"canonical_sha256":"e22267eb53b1426f6d35966ec74bebdaae3c759fd94bc8495fdd8a3c58914f55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e22267eb53b1426f6d35966ec74bebdaae3c759fd94bc8495fdd8a3c58914f55","first_computed_at":"2026-05-18T01:00:03.801899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:03.801899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mjx8juhxXyU+5FoxkOWWGotzBs4Qzx0jbzzi1ZHMbdkCo2dgIhNXKuHB/hF/NpLo/weov8ReyfroMBGbzaryAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:03.802663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3dae77a22b887972880702ed894f559ff707eccd06d6a0748b6a3211922c3c71","sha256:971b6134270fc8c0e3e52a5495945819e68a2122801277afad134d1f44ebcc99"],"state_sha256":"5f46eec1266c59002aad5e7af14630baa243337d266bf52143bf856398ac7c39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zolgvDMqPwxb3cr3/ujrcXyYNlrK1d0aqNMLMnrITnFZE6YnQMyJzSGy8kw8UVL44aqRobiG7QBA9dihrgYBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:12:50.703338Z","bundle_sha256":"cf0f99b06c03b45be3772af32b82078bc218649c68c5d2f9d6461f77d07cfd17"}}