{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BWXLHAIM7KUZKIIWVIYPBCVNST","short_pith_number":"pith:BWXLHAIM","canonical_record":{"source":{"id":"1506.02465","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-08T12:35:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5e8cbf5f1b026500524948e98c5ce044c8964e553f5a7ce42272cabd2eaa7818","abstract_canon_sha256":"433ef8666c870143f58bd936e2be841d0d22e6bdf300352302c409c8ef15944d"},"schema_version":"1.0"},"canonical_sha256":"0daeb3810cfaa9952116aa30f08aad94c208e270e1ba98b63067d9376809e63f","source":{"kind":"arxiv","id":"1506.02465","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02465","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02465v3","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02465","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"BWXLHAIM7KUZ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BWXLHAIM7KUZKIIW","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BWXLHAIM","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BWXLHAIM7KUZKIIWVIYPBCVNST","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02465","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-08T12:35:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5e8cbf5f1b026500524948e98c5ce044c8964e553f5a7ce42272cabd2eaa7818","abstract_canon_sha256":"433ef8666c870143f58bd936e2be841d0d22e6bdf300352302c409c8ef15944d"},"schema_version":"1.0"},"canonical_sha256":"0daeb3810cfaa9952116aa30f08aad94c208e270e1ba98b63067d9376809e63f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:37.477669Z","signature_b64":"XcqZS6FGedv8poILcD70K7LqX/kchs4YstLsBZ7ag3gQ6d1L/8ZxB2AFeKYiarhcbKIQaGIbbQrxViiOArSsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0daeb3810cfaa9952116aa30f08aad94c208e270e1ba98b63067d9376809e63f","last_reissued_at":"2026-05-18T01:17:37.477096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:37.477096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02465","source_version":3,"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:17:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLQ89uARMjI/ionLBTZW+dOn+5pmIgAup5amzYiZKogmUVJdoOcfmAntU7pNz4Nb2nyDMGfcEjijc3CFVEPMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:01:02.888674Z"},"content_sha256":"16263bf91376f7cfff4749873b99830b2dcea57c58e37fa36756da3db6b7eb2f","schema_version":"1.0","event_id":"sha256:16263bf91376f7cfff4749873b99830b2dcea57c58e37fa36756da3db6b7eb2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BWXLHAIM7KUZKIIWVIYPBCVNST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ASlib: A Benchmark Library for Algorithm Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Alexandre Frechette, Bernd Bischl, Frank Hutter, Holger Hoos, Joaquin Vanschoren, Kevin Leyton-Brown, Kevin Tierney, Lars Kotthoff, Marius Lindauer, Pascal Kerschke, Yuri Malitsky","submitted_at":"2015-06-08T12:35:04Z","abstract_excerpt":"The task of algorithm selection involves choosing an algorithm from a set of algorithms on a per-instance basis in order to exploit the varying performance of algorithms over a set of instances. The algorithm selection problem is attracting increasing attention from researchers and practitioners in AI. Years of fruitful applications in a number of domains have resulted in a large amount of data, but the community lacks a standard format or repository for this data. This situation makes it difficult to share and compare different approaches effectively, as is done in other, more established fie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02465","kind":"arxiv","version":3},"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:17:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oqxXe+mvrLNdQeJpxXgmv1iCTfsr0citMd29IuKvJN5QE5sH1ARDr9GDr/zd+HiexyTB91LRNX6oJ9/uWN9NCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:01:02.889163Z"},"content_sha256":"b6e853d9072ac90a17fd03f2b09d10a8a29631fa0f6fbb045c6a0a1970873c64","schema_version":"1.0","event_id":"sha256:b6e853d9072ac90a17fd03f2b09d10a8a29631fa0f6fbb045c6a0a1970873c64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST/bundle.json","state_url":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWXLHAIM7KUZKIIWVIYPBCVNST/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-25T14:01:02Z","links":{"resolver":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST","bundle":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST/bundle.json","state":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWXLHAIM7KUZKIIWVIYPBCVNST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BWXLHAIM7KUZKIIWVIYPBCVNST","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":"433ef8666c870143f58bd936e2be841d0d22e6bdf300352302c409c8ef15944d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-08T12:35:04Z","title_canon_sha256":"5e8cbf5f1b026500524948e98c5ce044c8964e553f5a7ce42272cabd2eaa7818"},"schema_version":"1.0","source":{"id":"1506.02465","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02465","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02465v3","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02465","created_at":"2026-05-18T01:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"BWXLHAIM7KUZ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BWXLHAIM7KUZKIIW","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BWXLHAIM","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:b6e853d9072ac90a17fd03f2b09d10a8a29631fa0f6fbb045c6a0a1970873c64","target":"graph","created_at":"2026-05-18T01:17:37Z","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 task of algorithm selection involves choosing an algorithm from a set of algorithms on a per-instance basis in order to exploit the varying performance of algorithms over a set of instances. The algorithm selection problem is attracting increasing attention from researchers and practitioners in AI. Years of fruitful applications in a number of domains have resulted in a large amount of data, but the community lacks a standard format or repository for this data. This situation makes it difficult to share and compare different approaches effectively, as is done in other, more established fie","authors_text":"Alexandre Frechette, Bernd Bischl, Frank Hutter, Holger Hoos, Joaquin Vanschoren, Kevin Leyton-Brown, Kevin Tierney, Lars Kotthoff, Marius Lindauer, Pascal Kerschke, Yuri Malitsky","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-08T12:35:04Z","title":"ASlib: A Benchmark Library for Algorithm Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02465","kind":"arxiv","version":3},"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:16263bf91376f7cfff4749873b99830b2dcea57c58e37fa36756da3db6b7eb2f","target":"record","created_at":"2026-05-18T01:17:37Z","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":"433ef8666c870143f58bd936e2be841d0d22e6bdf300352302c409c8ef15944d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-06-08T12:35:04Z","title_canon_sha256":"5e8cbf5f1b026500524948e98c5ce044c8964e553f5a7ce42272cabd2eaa7818"},"schema_version":"1.0","source":{"id":"1506.02465","kind":"arxiv","version":3}},"canonical_sha256":"0daeb3810cfaa9952116aa30f08aad94c208e270e1ba98b63067d9376809e63f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0daeb3810cfaa9952116aa30f08aad94c208e270e1ba98b63067d9376809e63f","first_computed_at":"2026-05-18T01:17:37.477096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:37.477096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XcqZS6FGedv8poILcD70K7LqX/kchs4YstLsBZ7ag3gQ6d1L/8ZxB2AFeKYiarhcbKIQaGIbbQrxViiOArSsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:37.477669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02465","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16263bf91376f7cfff4749873b99830b2dcea57c58e37fa36756da3db6b7eb2f","sha256:b6e853d9072ac90a17fd03f2b09d10a8a29631fa0f6fbb045c6a0a1970873c64"],"state_sha256":"d822771bb552abf4adb0cd94e33b84c66c205d3d651a5ce2298268c96eb8d1a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oduFGpReHRdI0Dw0FJpXx6AGJV56qyT/D5TH7EUXedgEMRG0ShyHRU/m27yKUfGH+xfDM1sa8ZbalnI6Z8oyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:01:02.892742Z","bundle_sha256":"c03ed3b42d499a9fa371ef80f828e6088e01a3a59df5bb59f478df620a36e349"}}