{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5YS3IXLXNM5QB7UIS5AOKTVN5X","short_pith_number":"pith:5YS3IXLX","schema_version":"1.0","canonical_sha256":"ee25b45d776b3b00fe889740e54eadedf654ba518bee0a6708ac74bd0e9b16a2","source":{"kind":"arxiv","id":"2310.10685","version":1},"attestation_state":"computed","paper":{"title":"PS-AAS: Portfolio Selection for Automated Algorithm Selection in Black-Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.LG","authors_text":"Ana Kostovska, Ana Nikolikj, Anja Jankovic, Carola Doerr, Diederick Vermetten, Gjorgjina Cenikj, Peter Korosec, Tome Eftimov, Urban Skvorc","submitted_at":"2023-10-14T12:13:41Z","abstract_excerpt":"The performance of automated algorithm selection (AAS) strongly depends on the portfolio of algorithms to choose from. Selecting the portfolio is a non-trivial task that requires balancing the trade-off between the higher flexibility of large portfolios with the increased complexity of the AAS task. In practice, probably the most common way to choose the algorithms for the portfolio is a greedy selection of the algorithms that perform well in some reference tasks of interest.\n  We set out in this work to investigate alternative, data-driven portfolio selection techniques. Our proposed method c"},"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":"2310.10685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-14T12:13:41Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"d5e00486e02598b871712a3fb76835272f15deceacb0e6c19c21fca5ea5d13d5","abstract_canon_sha256":"1c2521eccab472d7c2f60ce18fdfb10379782df71c363cff81c81132e35af98d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:01:26.488086Z","signature_b64":"yBN7vLAdefIrjqGLs0qsAtR8KuSQJJvrMGIWy239Q1FmU3axn5G7+XJaJC0omLXbbsL0lNaPFD/EX5ijixIwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee25b45d776b3b00fe889740e54eadedf654ba518bee0a6708ac74bd0e9b16a2","last_reissued_at":"2026-07-05T07:01:26.487603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:01:26.487603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PS-AAS: Portfolio Selection for Automated Algorithm Selection in Black-Box Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.LG","authors_text":"Ana Kostovska, Ana Nikolikj, Anja Jankovic, Carola Doerr, Diederick Vermetten, Gjorgjina Cenikj, Peter Korosec, Tome Eftimov, Urban Skvorc","submitted_at":"2023-10-14T12:13:41Z","abstract_excerpt":"The performance of automated algorithm selection (AAS) strongly depends on the portfolio of algorithms to choose from. Selecting the portfolio is a non-trivial task that requires balancing the trade-off between the higher flexibility of large portfolios with the increased complexity of the AAS task. In practice, probably the most common way to choose the algorithms for the portfolio is a greedy selection of the algorithms that perform well in some reference tasks of interest.\n  We set out in this work to investigate alternative, data-driven portfolio selection techniques. Our proposed method c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.10685","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.10685/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2310.10685","created_at":"2026-07-05T07:01:26.487665+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.10685v1","created_at":"2026-07-05T07:01:26.487665+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.10685","created_at":"2026-07-05T07:01:26.487665+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YS3IXLXNM5Q","created_at":"2026-07-05T07:01:26.487665+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YS3IXLXNM5QB7UI","created_at":"2026-07-05T07:01:26.487665+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YS3IXLX","created_at":"2026-07-05T07:01:26.487665+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/5YS3IXLXNM5QB7UIS5AOKTVN5X","json":"https://pith.science/pith/5YS3IXLXNM5QB7UIS5AOKTVN5X.json","graph_json":"https://pith.science/api/pith-number/5YS3IXLXNM5QB7UIS5AOKTVN5X/graph.json","events_json":"https://pith.science/api/pith-number/5YS3IXLXNM5QB7UIS5AOKTVN5X/events.json","paper":"https://pith.science/paper/5YS3IXLX"},"agent_actions":{"view_html":"https://pith.science/pith/5YS3IXLXNM5QB7UIS5AOKTVN5X","download_json":"https://pith.science/pith/5YS3IXLXNM5QB7UIS5AOKTVN5X.json","view_paper":"https://pith.science/paper/5YS3IXLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.10685&json=true","fetch_graph":"https://pith.science/api/pith-number/5YS3IXLXNM5QB7UIS5AOKTVN5X/graph.json","fetch_events":"https://pith.science/api/pith-number/5YS3IXLXNM5QB7UIS5AOKTVN5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YS3IXLXNM5QB7UIS5AOKTVN5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YS3IXLXNM5QB7UIS5AOKTVN5X/action/storage_attestation","attest_author":"https://pith.science/pith/5YS3IXLXNM5QB7UIS5AOKTVN5X/action/author_attestation","sign_citation":"https://pith.science/pith/5YS3IXLXNM5QB7UIS5AOKTVN5X/action/citation_signature","submit_replication":"https://pith.science/pith/5YS3IXLXNM5QB7UIS5AOKTVN5X/action/replication_record"}},"created_at":"2026-07-05T07:01:26.487665+00:00","updated_at":"2026-07-05T07:01:26.487665+00:00"}