{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5ESWUCOSFFNSZ2WKVYIXMG65BX","short_pith_number":"pith:5ESWUCOS","schema_version":"1.0","canonical_sha256":"e9256a09d2295b2ceacaae11761bdd0dde0b1e1e3a13ee6eadc4977b2802395a","source":{"kind":"arxiv","id":"2206.03130","version":2},"attestation_state":"computed","paper":{"title":"Towards Meta-learned Algorithm Selection using Implicit Fidelity Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aditya Mohan, Marius Lindauer, Tim Ruhkopf","submitted_at":"2022-06-07T09:14:24Z","abstract_excerpt":"Automatically selecting the best performing algorithm for a given dataset or ranking multiple algorithms by their expected performance supports users in developing new machine learning applications. Most approaches for this problem rely on pre-computed dataset meta-features and landmarking performances to capture the salient topology of the datasets and those topologies that the algorithms attend to. Landmarking usually exploits cheap algorithms not necessarily in the pool of candidate algorithms to get inexpensive approximations of the topology. While somewhat indicative, hand-crafted dataset"},"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":"2206.03130","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-07T09:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"780d46ffa3e0ec4e80989d5428603b482fe7287f7d77054a2d6af3b7e92a4abc","abstract_canon_sha256":"662cac5cf4ed8ee6391a7a2ae65c1f63e17f04d292c62767eed5d71be3a0f5fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:39:50.391975Z","signature_b64":"pDwvHc5RbNhA1bgvDpw49PTHhyv3FJIIVtWUKcahc3s1b6PCArQPJw4HT33kZ+bzm1aEgA1jqgLN4Teaiz7VDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9256a09d2295b2ceacaae11761bdd0dde0b1e1e3a13ee6eadc4977b2802395a","last_reissued_at":"2026-07-05T04:39:50.391623Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:39:50.391623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Meta-learned Algorithm Selection using Implicit Fidelity Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aditya Mohan, Marius Lindauer, Tim Ruhkopf","submitted_at":"2022-06-07T09:14:24Z","abstract_excerpt":"Automatically selecting the best performing algorithm for a given dataset or ranking multiple algorithms by their expected performance supports users in developing new machine learning applications. Most approaches for this problem rely on pre-computed dataset meta-features and landmarking performances to capture the salient topology of the datasets and those topologies that the algorithms attend to. Landmarking usually exploits cheap algorithms not necessarily in the pool of candidate algorithms to get inexpensive approximations of the topology. While somewhat indicative, hand-crafted dataset"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.03130","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.03130/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":"2206.03130","created_at":"2026-07-05T04:39:50.391678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.03130v2","created_at":"2026-07-05T04:39:50.391678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.03130","created_at":"2026-07-05T04:39:50.391678+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ESWUCOSFFNS","created_at":"2026-07-05T04:39:50.391678+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ESWUCOSFFNSZ2WK","created_at":"2026-07-05T04:39:50.391678+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ESWUCOS","created_at":"2026-07-05T04:39:50.391678+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/5ESWUCOSFFNSZ2WKVYIXMG65BX","json":"https://pith.science/pith/5ESWUCOSFFNSZ2WKVYIXMG65BX.json","graph_json":"https://pith.science/api/pith-number/5ESWUCOSFFNSZ2WKVYIXMG65BX/graph.json","events_json":"https://pith.science/api/pith-number/5ESWUCOSFFNSZ2WKVYIXMG65BX/events.json","paper":"https://pith.science/paper/5ESWUCOS"},"agent_actions":{"view_html":"https://pith.science/pith/5ESWUCOSFFNSZ2WKVYIXMG65BX","download_json":"https://pith.science/pith/5ESWUCOSFFNSZ2WKVYIXMG65BX.json","view_paper":"https://pith.science/paper/5ESWUCOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.03130&json=true","fetch_graph":"https://pith.science/api/pith-number/5ESWUCOSFFNSZ2WKVYIXMG65BX/graph.json","fetch_events":"https://pith.science/api/pith-number/5ESWUCOSFFNSZ2WKVYIXMG65BX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ESWUCOSFFNSZ2WKVYIXMG65BX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ESWUCOSFFNSZ2WKVYIXMG65BX/action/storage_attestation","attest_author":"https://pith.science/pith/5ESWUCOSFFNSZ2WKVYIXMG65BX/action/author_attestation","sign_citation":"https://pith.science/pith/5ESWUCOSFFNSZ2WKVYIXMG65BX/action/citation_signature","submit_replication":"https://pith.science/pith/5ESWUCOSFFNSZ2WKVYIXMG65BX/action/replication_record"}},"created_at":"2026-07-05T04:39:50.391678+00:00","updated_at":"2026-07-05T04:39:50.391678+00:00"}