{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AOSGX3LRQFAOER3SUB6SXXOSCN","short_pith_number":"pith:AOSGX3LR","canonical_record":{"source":{"id":"1805.01214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-03T10:47:31Z","cross_cats_sorted":[],"title_canon_sha256":"fd26a25aaaeb4704ed30f7edaa83f7ab86e2d51bdba2c143298710578d0d9e57","abstract_canon_sha256":"811927d8a1f32f5b4952cb64bbc170327da2e4fa28256d393784638eba139747"},"schema_version":"1.0"},"canonical_sha256":"03a46bed718140e24772a07d2bddd2134f4a38f7d25ea0d91e06ed3ab052ff82","source":{"kind":"arxiv","id":"1805.01214","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01214","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01214v2","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01214","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"AOSGX3LRQFAO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AOSGX3LRQFAOER3S","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AOSGX3LR","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AOSGX3LRQFAOER3SUB6SXXOSCN","target":"record","payload":{"canonical_record":{"source":{"id":"1805.01214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-03T10:47:31Z","cross_cats_sorted":[],"title_canon_sha256":"fd26a25aaaeb4704ed30f7edaa83f7ab86e2d51bdba2c143298710578d0d9e57","abstract_canon_sha256":"811927d8a1f32f5b4952cb64bbc170327da2e4fa28256d393784638eba139747"},"schema_version":"1.0"},"canonical_sha256":"03a46bed718140e24772a07d2bddd2134f4a38f7d25ea0d91e06ed3ab052ff82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:07.721581Z","signature_b64":"SUiQmTWeeQXimWqXtG/51fnJAjWytrFOyuz4YDBWqt832ZMqSIQ3vRaavr8+C776xI4NJQsD6j3PZTERmlSQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03a46bed718140e24772a07d2bddd2134f4a38f7d25ea0d91e06ed3ab052ff82","last_reissued_at":"2026-05-18T00:04:07.720958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:07.720958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.01214","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:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1TEhupFquMb+rx0ysflzWvDl8T0u9VRFnZelsy2zF9OJdlmkqkkIpRmRSWYDx9vIGHm4h9e5P1cYtTL4OlNNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:13:27.530073Z"},"content_sha256":"acf8bd908dfad17b40a43b8b7f8ce45cc3733305f12418fcb3ee8aade66ad12f","schema_version":"1.0","event_id":"sha256:acf8bd908dfad17b40a43b8b7f8ce45cc3733305f12418fcb3ee8aade66ad12f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AOSGX3LRQFAOER3SUB6SXXOSCN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Algorithm Selection Competitions 2015 and 2017","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jan N. van Rijn, Lars Kotthoff, Marius Lindauer","submitted_at":"2018-05-03T10:47:31Z","abstract_excerpt":"The algorithm selection problem is to choose the most suitable algorithm for solving a given problem instance. It leverages the complementarity between different approaches that is present in many areas of AI. We report on the state of the art in algorithm selection, as defined by the Algorithm Selection competitions in 2015 and 2017. The results of these competitions show how the state of the art improved over the years. We show that although performance in some cases is very good, there is still room for improvement in other cases. Finally, we provide insights into why some scenarios are har"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01214","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:04:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fgph9XVEQcpK26kk23OAekb08753dK3I9KcA2gEX5WeexmFwTdO0Egtj+SFoDOX81oKDrmcpVQBF2IcTQb2EBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:13:27.530494Z"},"content_sha256":"18ad6368bbb7f6ad0e42424bedacfd105f6dbf943998fcf0f2fcc079f042aef7","schema_version":"1.0","event_id":"sha256:18ad6368bbb7f6ad0e42424bedacfd105f6dbf943998fcf0f2fcc079f042aef7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOSGX3LRQFAOER3SUB6SXXOSCN/bundle.json","state_url":"https://pith.science/pith/AOSGX3LRQFAOER3SUB6SXXOSCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOSGX3LRQFAOER3SUB6SXXOSCN/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-29T21:13:27Z","links":{"resolver":"https://pith.science/pith/AOSGX3LRQFAOER3SUB6SXXOSCN","bundle":"https://pith.science/pith/AOSGX3LRQFAOER3SUB6SXXOSCN/bundle.json","state":"https://pith.science/pith/AOSGX3LRQFAOER3SUB6SXXOSCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOSGX3LRQFAOER3SUB6SXXOSCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AOSGX3LRQFAOER3SUB6SXXOSCN","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":"811927d8a1f32f5b4952cb64bbc170327da2e4fa28256d393784638eba139747","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-03T10:47:31Z","title_canon_sha256":"fd26a25aaaeb4704ed30f7edaa83f7ab86e2d51bdba2c143298710578d0d9e57"},"schema_version":"1.0","source":{"id":"1805.01214","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01214","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01214v2","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01214","created_at":"2026-05-18T00:04:07Z"},{"alias_kind":"pith_short_12","alias_value":"AOSGX3LRQFAO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AOSGX3LRQFAOER3S","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AOSGX3LR","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:18ad6368bbb7f6ad0e42424bedacfd105f6dbf943998fcf0f2fcc079f042aef7","target":"graph","created_at":"2026-05-18T00:04:07Z","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 algorithm selection problem is to choose the most suitable algorithm for solving a given problem instance. It leverages the complementarity between different approaches that is present in many areas of AI. We report on the state of the art in algorithm selection, as defined by the Algorithm Selection competitions in 2015 and 2017. The results of these competitions show how the state of the art improved over the years. We show that although performance in some cases is very good, there is still room for improvement in other cases. Finally, we provide insights into why some scenarios are har","authors_text":"Jan N. van Rijn, Lars Kotthoff, Marius Lindauer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-03T10:47:31Z","title":"The Algorithm Selection Competitions 2015 and 2017"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01214","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:acf8bd908dfad17b40a43b8b7f8ce45cc3733305f12418fcb3ee8aade66ad12f","target":"record","created_at":"2026-05-18T00:04:07Z","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":"811927d8a1f32f5b4952cb64bbc170327da2e4fa28256d393784638eba139747","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-03T10:47:31Z","title_canon_sha256":"fd26a25aaaeb4704ed30f7edaa83f7ab86e2d51bdba2c143298710578d0d9e57"},"schema_version":"1.0","source":{"id":"1805.01214","kind":"arxiv","version":2}},"canonical_sha256":"03a46bed718140e24772a07d2bddd2134f4a38f7d25ea0d91e06ed3ab052ff82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03a46bed718140e24772a07d2bddd2134f4a38f7d25ea0d91e06ed3ab052ff82","first_computed_at":"2026-05-18T00:04:07.720958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:07.720958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SUiQmTWeeQXimWqXtG/51fnJAjWytrFOyuz4YDBWqt832ZMqSIQ3vRaavr8+C776xI4NJQsD6j3PZTERmlSQDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:07.721581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01214","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acf8bd908dfad17b40a43b8b7f8ce45cc3733305f12418fcb3ee8aade66ad12f","sha256:18ad6368bbb7f6ad0e42424bedacfd105f6dbf943998fcf0f2fcc079f042aef7"],"state_sha256":"b3bd87ffeb8e44a8ec1ccf20fecc69fdce1c8e33a579f47fee827421fe0e412f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrOEob/9oGeBBP65ZnnUtwcqlmTBM3q+L7K4NgctD/C3YeLx+y4J5S1G7GWJgKDlqWe7JapsuNSnk0D0EcC6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:13:27.533863Z","bundle_sha256":"ab31eda6d31040fa7c9aa816c7492192005b3dcfd6b3d477d64dedb273ba772f"}}