{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EO2BYU6CKB4MW3XZSHO4QNO2XG","short_pith_number":"pith:EO2BYU6C","schema_version":"1.0","canonical_sha256":"23b41c53c25078cb6ef991ddc835dab9b9c4dc41555ae8379f6071728fa3084d","source":{"kind":"arxiv","id":"1111.2249","version":1},"attestation_state":"computed","paper":{"title":"SATzilla: Portfolio-based Algorithm Selection for SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown, Lin Xu","submitted_at":"2011-10-31T22:28:59Z","abstract_excerpt":"It has been widely observed that there is no single \"dominant\" SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional approach of choosing the best solver for a given class of instances, we advocate making this decision online on a per-instance basis. Building on previous work, we describe SATzilla, an automated approach for constructing per-instance algorithm portfolios for SAT that use so-called empirical hardness models to choose among their constituent solvers. This approach takes as input a distribution of problem instances and a "},"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":"1111.2249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T22:28:59Z","cross_cats_sorted":[],"title_canon_sha256":"77f02e8cf19df28244e1f6ab6b0079fe6681b61cdcac1a05a2124a7d416ad9a0","abstract_canon_sha256":"e3dd9a1c5a3706fcbda5fd11d76f5470f074954382b797b1cf1804117151c351"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:43.772225Z","signature_b64":"kmeY2faKxBz0SX/P2yq8/sGOoGEb7suAPE+QinBnMqW8pAf24fmc7p2dYOwsaSJ6ZKjKrmnWmxhQByqMJlp4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23b41c53c25078cb6ef991ddc835dab9b9c4dc41555ae8379f6071728fa3084d","last_reissued_at":"2026-05-18T04:08:43.771691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:43.771691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SATzilla: Portfolio-based Algorithm Selection for SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown, Lin Xu","submitted_at":"2011-10-31T22:28:59Z","abstract_excerpt":"It has been widely observed that there is no single \"dominant\" SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional approach of choosing the best solver for a given class of instances, we advocate making this decision online on a per-instance basis. Building on previous work, we describe SATzilla, an automated approach for constructing per-instance algorithm portfolios for SAT that use so-called empirical hardness models to choose among their constituent solvers. This approach takes as input a distribution of problem instances and a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2249","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":"1111.2249","created_at":"2026-05-18T04:08:43.771788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.2249v1","created_at":"2026-05-18T04:08:43.771788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2249","created_at":"2026-05-18T04:08:43.771788+00:00"},{"alias_kind":"pith_short_12","alias_value":"EO2BYU6CKB4M","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EO2BYU6CKB4MW3XZ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EO2BYU6C","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.11205","citing_title":"Concept Learning in the Wild: Towards Algorithmic Understanding of Neural Networks","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EO2BYU6CKB4MW3XZSHO4QNO2XG","json":"https://pith.science/pith/EO2BYU6CKB4MW3XZSHO4QNO2XG.json","graph_json":"https://pith.science/api/pith-number/EO2BYU6CKB4MW3XZSHO4QNO2XG/graph.json","events_json":"https://pith.science/api/pith-number/EO2BYU6CKB4MW3XZSHO4QNO2XG/events.json","paper":"https://pith.science/paper/EO2BYU6C"},"agent_actions":{"view_html":"https://pith.science/pith/EO2BYU6CKB4MW3XZSHO4QNO2XG","download_json":"https://pith.science/pith/EO2BYU6CKB4MW3XZSHO4QNO2XG.json","view_paper":"https://pith.science/paper/EO2BYU6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.2249&json=true","fetch_graph":"https://pith.science/api/pith-number/EO2BYU6CKB4MW3XZSHO4QNO2XG/graph.json","fetch_events":"https://pith.science/api/pith-number/EO2BYU6CKB4MW3XZSHO4QNO2XG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EO2BYU6CKB4MW3XZSHO4QNO2XG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EO2BYU6CKB4MW3XZSHO4QNO2XG/action/storage_attestation","attest_author":"https://pith.science/pith/EO2BYU6CKB4MW3XZSHO4QNO2XG/action/author_attestation","sign_citation":"https://pith.science/pith/EO2BYU6CKB4MW3XZSHO4QNO2XG/action/citation_signature","submit_replication":"https://pith.science/pith/EO2BYU6CKB4MW3XZSHO4QNO2XG/action/replication_record"}},"created_at":"2026-05-18T04:08:43.771788+00:00","updated_at":"2026-05-18T04:08:43.771788+00:00"}