{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NA7PXLB6UXSZOHLA3MCJW3NKUK","short_pith_number":"pith:NA7PXLB6","schema_version":"1.0","canonical_sha256":"683efbac3ea5e5971d60db049b6daaa29b8ccc6bdc8cb6a3f82f4c7034b5909c","source":{"kind":"arxiv","id":"1212.0692","version":2},"attestation_state":"computed","paper":{"title":"An Empirical Evaluation of Portfolios Approaches for solving CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Jacopo Mauro, Maurizio Gabbrielli, Roberto Amadini","submitted_at":"2012-12-04T12:00:54Z","abstract_excerpt":"Recent research in areas such as SAT solving and Integer Linear Programming has shown that the performances of a single arbitrarily efficient solver can be significantly outperformed by a portfolio of possibly slower on-average solvers. We report an empirical evaluation and comparison of portfolio approaches applied to Constraint Satisfaction Problems (CSPs). We compared models developed on top of off-the-shelf machine learning algorithms with respect to approaches used in the SAT field and adapted for CSPs, considering different portfolio sizes and using as evaluation metrics the number of so"},"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":"1212.0692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-04T12:00:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8bb0a31643cfcc97c08f309bf62df94ed6fe654b46a0021cb1e05105d74f9084","abstract_canon_sha256":"074d104f92015481026cf41735751d7090105d64b26fc53c34e5a6c438fff4d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:21.192092Z","signature_b64":"V1bg9YSuQeSUWJlu8DsdzaMVNOpjLMtAcZ3/on1yltVPcTLEK+pz0B9yxO7VCsaj8WAUYoE+KD99vJ9oRNSHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"683efbac3ea5e5971d60db049b6daaa29b8ccc6bdc8cb6a3f82f4c7034b5909c","last_reissued_at":"2026-05-18T03:03:21.191518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:21.191518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Empirical Evaluation of Portfolios Approaches for solving CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Jacopo Mauro, Maurizio Gabbrielli, Roberto Amadini","submitted_at":"2012-12-04T12:00:54Z","abstract_excerpt":"Recent research in areas such as SAT solving and Integer Linear Programming has shown that the performances of a single arbitrarily efficient solver can be significantly outperformed by a portfolio of possibly slower on-average solvers. We report an empirical evaluation and comparison of portfolio approaches applied to Constraint Satisfaction Problems (CSPs). We compared models developed on top of off-the-shelf machine learning algorithms with respect to approaches used in the SAT field and adapted for CSPs, considering different portfolio sizes and using as evaluation metrics the number of so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0692","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":"1212.0692","created_at":"2026-05-18T03:03:21.191601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0692v2","created_at":"2026-05-18T03:03:21.191601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0692","created_at":"2026-05-18T03:03:21.191601+00:00"},{"alias_kind":"pith_short_12","alias_value":"NA7PXLB6UXSZ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NA7PXLB6UXSZOHLA","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NA7PXLB6","created_at":"2026-05-18T12:27:16.716162+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/NA7PXLB6UXSZOHLA3MCJW3NKUK","json":"https://pith.science/pith/NA7PXLB6UXSZOHLA3MCJW3NKUK.json","graph_json":"https://pith.science/api/pith-number/NA7PXLB6UXSZOHLA3MCJW3NKUK/graph.json","events_json":"https://pith.science/api/pith-number/NA7PXLB6UXSZOHLA3MCJW3NKUK/events.json","paper":"https://pith.science/paper/NA7PXLB6"},"agent_actions":{"view_html":"https://pith.science/pith/NA7PXLB6UXSZOHLA3MCJW3NKUK","download_json":"https://pith.science/pith/NA7PXLB6UXSZOHLA3MCJW3NKUK.json","view_paper":"https://pith.science/paper/NA7PXLB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0692&json=true","fetch_graph":"https://pith.science/api/pith-number/NA7PXLB6UXSZOHLA3MCJW3NKUK/graph.json","fetch_events":"https://pith.science/api/pith-number/NA7PXLB6UXSZOHLA3MCJW3NKUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NA7PXLB6UXSZOHLA3MCJW3NKUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NA7PXLB6UXSZOHLA3MCJW3NKUK/action/storage_attestation","attest_author":"https://pith.science/pith/NA7PXLB6UXSZOHLA3MCJW3NKUK/action/author_attestation","sign_citation":"https://pith.science/pith/NA7PXLB6UXSZOHLA3MCJW3NKUK/action/citation_signature","submit_replication":"https://pith.science/pith/NA7PXLB6UXSZOHLA3MCJW3NKUK/action/replication_record"}},"created_at":"2026-05-18T03:03:21.191601+00:00","updated_at":"2026-05-18T03:03:21.191601+00:00"}