{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:C5SKX74KHDFJ4KA4XVVTL3ZZUU","short_pith_number":"pith:C5SKX74K","schema_version":"1.0","canonical_sha256":"1764abff8a38ca9e281cbd6b35ef39a51cf1fbe0da9190234331f8a47e436a0b","source":{"kind":"arxiv","id":"2203.13392","version":1},"attestation_state":"computed","paper":{"title":"Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.LG","authors_text":"Emma Hart, Kevin Sim, Mohamad Alissa","submitted_at":"2022-03-24T23:59:50Z","abstract_excerpt":"We propose a novel technique for algorithm-selection, applicable to optimisation domains in which there is implicit sequential information encapsulated in the data, e.g., in online bin-packing. Specifically we train two types of recurrent neural networks to predict a packing heuristic in online bin-packing, selecting from four well-known heuristics. As input, the RNN methods only use the sequence of item-sizes. This contrasts to typical approaches to algorithm-selection which require a model to be trained using domain-specific instance features that need to be first derived from the input data"},"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":"2203.13392","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-03-24T23:59:50Z","cross_cats_sorted":["cs.AI","cs.NE"],"title_canon_sha256":"5b71a9a54e1c56c02ef763b01f1964994f973faf849a8aad2526c6d43f81b9b0","abstract_canon_sha256":"64c3c7cba1eca72cbb226247be52ae1287c956930aeb8b4ca285b7556e2cedc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:08:31.381504Z","signature_b64":"0SzsK9KsDEpEaBW8fkOymamPnpcIwWHfBDoQJaOIaIwji+RrjWomCDI7x0AEYftuOJTMgs8aqf7/YGZyoVuDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1764abff8a38ca9e281cbd6b35ef39a51cf1fbe0da9190234331f8a47e436a0b","last_reissued_at":"2026-07-05T04:08:31.381143Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:08:31.381143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NE"],"primary_cat":"cs.LG","authors_text":"Emma Hart, Kevin Sim, Mohamad Alissa","submitted_at":"2022-03-24T23:59:50Z","abstract_excerpt":"We propose a novel technique for algorithm-selection, applicable to optimisation domains in which there is implicit sequential information encapsulated in the data, e.g., in online bin-packing. Specifically we train two types of recurrent neural networks to predict a packing heuristic in online bin-packing, selecting from four well-known heuristics. As input, the RNN methods only use the sequence of item-sizes. This contrasts to typical approaches to algorithm-selection which require a model to be trained using domain-specific instance features that need to be first derived from the input data"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.13392","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/2203.13392/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":"2203.13392","created_at":"2026-07-05T04:08:31.381201+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.13392v1","created_at":"2026-07-05T04:08:31.381201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.13392","created_at":"2026-07-05T04:08:31.381201+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5SKX74KHDFJ","created_at":"2026-07-05T04:08:31.381201+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5SKX74KHDFJ4KA4","created_at":"2026-07-05T04:08:31.381201+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5SKX74K","created_at":"2026-07-05T04:08:31.381201+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/C5SKX74KHDFJ4KA4XVVTL3ZZUU","json":"https://pith.science/pith/C5SKX74KHDFJ4KA4XVVTL3ZZUU.json","graph_json":"https://pith.science/api/pith-number/C5SKX74KHDFJ4KA4XVVTL3ZZUU/graph.json","events_json":"https://pith.science/api/pith-number/C5SKX74KHDFJ4KA4XVVTL3ZZUU/events.json","paper":"https://pith.science/paper/C5SKX74K"},"agent_actions":{"view_html":"https://pith.science/pith/C5SKX74KHDFJ4KA4XVVTL3ZZUU","download_json":"https://pith.science/pith/C5SKX74KHDFJ4KA4XVVTL3ZZUU.json","view_paper":"https://pith.science/paper/C5SKX74K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.13392&json=true","fetch_graph":"https://pith.science/api/pith-number/C5SKX74KHDFJ4KA4XVVTL3ZZUU/graph.json","fetch_events":"https://pith.science/api/pith-number/C5SKX74KHDFJ4KA4XVVTL3ZZUU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5SKX74KHDFJ4KA4XVVTL3ZZUU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5SKX74KHDFJ4KA4XVVTL3ZZUU/action/storage_attestation","attest_author":"https://pith.science/pith/C5SKX74KHDFJ4KA4XVVTL3ZZUU/action/author_attestation","sign_citation":"https://pith.science/pith/C5SKX74KHDFJ4KA4XVVTL3ZZUU/action/citation_signature","submit_replication":"https://pith.science/pith/C5SKX74KHDFJ4KA4XVVTL3ZZUU/action/replication_record"}},"created_at":"2026-07-05T04:08:31.381201+00:00","updated_at":"2026-07-05T04:08:31.381201+00:00"}