{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KRV3DAA66674KAQP7QZZKGYCYV","short_pith_number":"pith:KRV3DAA6","schema_version":"1.0","canonical_sha256":"546bb1801ef7bfc5020ffc33951b02c54969e43320ee43c1afe7b4fc2ec47809","source":{"kind":"arxiv","id":"1708.05258","version":1},"attestation_state":"computed","paper":{"title":"Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-Package flacco","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Pascal Kerschke","submitted_at":"2017-08-17T13:27:21Z","abstract_excerpt":"Choosing the best-performing optimizer(s) out of a portfolio of optimization algorithms is usually a difficult and complex task. It gets even worse, if the underlying functions are unknown, i.e., so-called Black-Box problems, and function evaluations are considered to be expensive. In the case of continuous single-objective optimization problems, Exploratory Landscape Analysis (ELA) - a sophisticated and effective approach for characterizing the landscapes of such problems by means of numerical values before actually performing the optimization task itself - is advantageous. Unfortunately, unt"},"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":"1708.05258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-08-17T13:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"0ca7d9e8d5a2ec8beb14915f8228a5c57a878315be02aa9cde5cf071cf6f0586","abstract_canon_sha256":"ee2ead887decfe2334582a469548a6bcb63d09072bf87ccc5957abf89ab66425"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:53.444226Z","signature_b64":"EJd7TZza+P7oYjm++yISEEqRRpWPxeXtfbK8BDzMxZYDd/+eCxEPC+IMH+w8ier5mewRDmiCk6Q/5s5Wj0U2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"546bb1801ef7bfc5020ffc33951b02c54969e43320ee43c1afe7b4fc2ec47809","last_reissued_at":"2026-05-18T00:37:53.443678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:53.443678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-Package flacco","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Pascal Kerschke","submitted_at":"2017-08-17T13:27:21Z","abstract_excerpt":"Choosing the best-performing optimizer(s) out of a portfolio of optimization algorithms is usually a difficult and complex task. It gets even worse, if the underlying functions are unknown, i.e., so-called Black-Box problems, and function evaluations are considered to be expensive. In the case of continuous single-objective optimization problems, Exploratory Landscape Analysis (ELA) - a sophisticated and effective approach for characterizing the landscapes of such problems by means of numerical values before actually performing the optimization task itself - is advantageous. Unfortunately, unt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05258","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.05258","created_at":"2026-05-18T00:37:53.443768+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05258v1","created_at":"2026-05-18T00:37:53.443768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05258","created_at":"2026-05-18T00:37:53.443768+00:00"},{"alias_kind":"pith_short_12","alias_value":"KRV3DAA66674","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"KRV3DAA66674KAQP","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"KRV3DAA6","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.25207","citing_title":"ASAP: Agent-System Co-Design for Wall-Clock-Centered Auto HPO Research for ML Experiments","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KRV3DAA66674KAQP7QZZKGYCYV","json":"https://pith.science/pith/KRV3DAA66674KAQP7QZZKGYCYV.json","graph_json":"https://pith.science/api/pith-number/KRV3DAA66674KAQP7QZZKGYCYV/graph.json","events_json":"https://pith.science/api/pith-number/KRV3DAA66674KAQP7QZZKGYCYV/events.json","paper":"https://pith.science/paper/KRV3DAA6"},"agent_actions":{"view_html":"https://pith.science/pith/KRV3DAA66674KAQP7QZZKGYCYV","download_json":"https://pith.science/pith/KRV3DAA66674KAQP7QZZKGYCYV.json","view_paper":"https://pith.science/paper/KRV3DAA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05258&json=true","fetch_graph":"https://pith.science/api/pith-number/KRV3DAA66674KAQP7QZZKGYCYV/graph.json","fetch_events":"https://pith.science/api/pith-number/KRV3DAA66674KAQP7QZZKGYCYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KRV3DAA66674KAQP7QZZKGYCYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KRV3DAA66674KAQP7QZZKGYCYV/action/storage_attestation","attest_author":"https://pith.science/pith/KRV3DAA66674KAQP7QZZKGYCYV/action/author_attestation","sign_citation":"https://pith.science/pith/KRV3DAA66674KAQP7QZZKGYCYV/action/citation_signature","submit_replication":"https://pith.science/pith/KRV3DAA66674KAQP7QZZKGYCYV/action/replication_record"}},"created_at":"2026-05-18T00:37:53.443768+00:00","updated_at":"2026-05-18T00:37:53.443768+00:00"}