{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NQSJHXT27I2DGFDIRROOMOL3BF","short_pith_number":"pith:NQSJHXT2","schema_version":"1.0","canonical_sha256":"6c2493de7afa343314688c5ce6397b09690c722713f5835f163a3d79311a94b7","source":{"kind":"arxiv","id":"1107.0268","version":2},"attestation_state":"computed","paper":{"title":"Simple Algorithm Portfolio for SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Filip Maric, Mladen Nikolic, Predrag Janicic","submitted_at":"2011-07-01T16:20:44Z","abstract_excerpt":"The importance of algorithm portfolio techniques for SAT has long been noted, and a number of very successful systems have been devised, including the most successful one --- SATzilla. However, all these systems are quite complex (to understand, reimplement, or modify). In this paper we propose a new algorithm portfolio for SAT that is extremely simple, but in the same time so efficient that it outperforms SATzilla. For a new SAT instance to be solved, our portfolio finds its k-nearest neighbors from the training set and invokes a solver that performs the best at those instances. The main dist"},"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":"1107.0268","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-07-01T16:20:44Z","cross_cats_sorted":[],"title_canon_sha256":"0ade556380ec2583465a20bcdac6adf7124182517a2410dce46ef9a069167fd5","abstract_canon_sha256":"56d0376d22c78234e3118caf33b7f998aa3bdb94b2229a1ca35662c80f8576a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:33.096306Z","signature_b64":"JD32DPffAy++l/N1WSDngH08/gOJbNn/U8lPlJKPt2MR0zpaQmiPGBuc4SRFIJxvv8lsqBmDjTrX83CoxNftBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c2493de7afa343314688c5ce6397b09690c722713f5835f163a3d79311a94b7","last_reissued_at":"2026-05-18T04:06:33.095592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:33.095592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Algorithm Portfolio for SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Filip Maric, Mladen Nikolic, Predrag Janicic","submitted_at":"2011-07-01T16:20:44Z","abstract_excerpt":"The importance of algorithm portfolio techniques for SAT has long been noted, and a number of very successful systems have been devised, including the most successful one --- SATzilla. However, all these systems are quite complex (to understand, reimplement, or modify). In this paper we propose a new algorithm portfolio for SAT that is extremely simple, but in the same time so efficient that it outperforms SATzilla. For a new SAT instance to be solved, our portfolio finds its k-nearest neighbors from the training set and invokes a solver that performs the best at those instances. The main dist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0268","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":""},"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":"1107.0268","created_at":"2026-05-18T04:06:33.095713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.0268v2","created_at":"2026-05-18T04:06:33.095713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0268","created_at":"2026-05-18T04:06:33.095713+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQSJHXT27I2D","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQSJHXT27I2DGFDI","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQSJHXT2","created_at":"2026-05-18T12:26:37.096874+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/NQSJHXT27I2DGFDIRROOMOL3BF","json":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF.json","graph_json":"https://pith.science/api/pith-number/NQSJHXT27I2DGFDIRROOMOL3BF/graph.json","events_json":"https://pith.science/api/pith-number/NQSJHXT27I2DGFDIRROOMOL3BF/events.json","paper":"https://pith.science/paper/NQSJHXT2"},"agent_actions":{"view_html":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF","download_json":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF.json","view_paper":"https://pith.science/paper/NQSJHXT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.0268&json=true","fetch_graph":"https://pith.science/api/pith-number/NQSJHXT27I2DGFDIRROOMOL3BF/graph.json","fetch_events":"https://pith.science/api/pith-number/NQSJHXT27I2DGFDIRROOMOL3BF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF/action/storage_attestation","attest_author":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF/action/author_attestation","sign_citation":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF/action/citation_signature","submit_replication":"https://pith.science/pith/NQSJHXT27I2DGFDIRROOMOL3BF/action/replication_record"}},"created_at":"2026-05-18T04:06:33.095713+00:00","updated_at":"2026-05-18T04:06:33.095713+00:00"}