{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BWXLHAIM7KUZKIIWVIYPBCVNST","short_pith_number":"pith:BWXLHAIM","schema_version":"1.0","canonical_sha256":"0daeb3810cfaa9952116aa30f08aad94c208e270e1ba98b63067d9376809e63f","source":{"kind":"arxiv","id":"1506.02465","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.02465","created_at":"2026-05-18T01:17:37.477187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02465v3","created_at":"2026-05-18T01:17:37.477187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02465","created_at":"2026-05-18T01:17:37.477187+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWXLHAIM7KUZ","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWXLHAIM7KUZKIIW","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWXLHAIM","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST","json":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST.json","graph_json":"https://pith.science/api/pith-number/BWXLHAIM7KUZKIIWVIYPBCVNST/graph.json","events_json":"https://pith.science/api/pith-number/BWXLHAIM7KUZKIIWVIYPBCVNST/events.json","paper":"https://pith.science/paper/BWXLHAIM"},"agent_actions":{"view_html":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST","download_json":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST.json","view_paper":"https://pith.science/paper/BWXLHAIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02465&json=true","fetch_graph":"https://pith.science/api/pith-number/BWXLHAIM7KUZKIIWVIYPBCVNST/graph.json","fetch_events":"https://pith.science/api/pith-number/BWXLHAIM7KUZKIIWVIYPBCVNST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST/action/storage_attestation","attest_author":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST/action/author_attestation","sign_citation":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST/action/citation_signature","submit_replication":"https://pith.science/pith/BWXLHAIM7KUZKIIWVIYPBCVNST/action/replication_record"}},"created_at":"2026-05-18T01:17:37.477187+00:00","updated_at":"2026-05-18T01:17:37.477187+00:00"}