{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:F27XF5GQHNQX7BLBYOMPLRBPWZ","short_pith_number":"pith:F27XF5GQ","schema_version":"1.0","canonical_sha256":"2ebf72f4d03b617f8561c398f5c42fb640e5729d8be7ea1168d4e5972623d9de","source":{"kind":"arxiv","id":"2302.05405","version":2},"attestation_state":"computed","paper":{"title":"ACE, a generic constraint solver","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christophe Lecoutre","submitted_at":"2023-01-06T12:15:18Z","abstract_excerpt":"Constraint Programming (CP) is a useful technology for modeling and solving combinatorial constrained problems. On the one hand, on can use a library like PyCSP3 for easily modeling problems arising in various application fields (e.g., scheduling, planning, data-mining, cryptography, bio-informatics, organic chemistry, etc.). Problem instances can then be directly generated from specific models and data. On the other hand, for solving instances (notably, represented in XCSP3 format), one can use a constraint solver like ACE, which is presented in this paper. ACE is an open-source constraint 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":"2302.05405","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2023-01-06T12:15:18Z","cross_cats_sorted":[],"title_canon_sha256":"6c9630d37c8468e17faf6791b26fe2a91b27f54077d8e0b8239aca94f219a0dd","abstract_canon_sha256":"6c1fe6540976d0e22b7098dac66b4985d17354efb1ec88f294765aa5f66a47c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:01:23.528966Z","signature_b64":"vzXuPFDyHpgXNlAaFJAA5HD2qFyJ+c/YbMI7ucOw14FhGIh7TFyT0v8ZAgEIKII637CglD9j76caQpohdkT/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ebf72f4d03b617f8561c398f5c42fb640e5729d8be7ea1168d4e5972623d9de","last_reissued_at":"2026-07-05T09:01:23.528453Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:01:23.528453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ACE, a generic constraint solver","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christophe Lecoutre","submitted_at":"2023-01-06T12:15:18Z","abstract_excerpt":"Constraint Programming (CP) is a useful technology for modeling and solving combinatorial constrained problems. On the one hand, on can use a library like PyCSP3 for easily modeling problems arising in various application fields (e.g., scheduling, planning, data-mining, cryptography, bio-informatics, organic chemistry, etc.). Problem instances can then be directly generated from specific models and data. On the other hand, for solving instances (notably, represented in XCSP3 format), one can use a constraint solver like ACE, which is presented in this paper. ACE is an open-source constraint so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05405","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/2302.05405/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":"2302.05405","created_at":"2026-07-05T09:01:23.528513+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.05405v2","created_at":"2026-07-05T09:01:23.528513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05405","created_at":"2026-07-05T09:01:23.528513+00:00"},{"alias_kind":"pith_short_12","alias_value":"F27XF5GQHNQX","created_at":"2026-07-05T09:01:23.528513+00:00"},{"alias_kind":"pith_short_16","alias_value":"F27XF5GQHNQX7BLB","created_at":"2026-07-05T09:01:23.528513+00:00"},{"alias_kind":"pith_short_8","alias_value":"F27XF5GQ","created_at":"2026-07-05T09:01:23.528513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14559","citing_title":"PyCSP3-Scheduling: A Scheduling Extension for PyCSP3","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F27XF5GQHNQX7BLBYOMPLRBPWZ","json":"https://pith.science/pith/F27XF5GQHNQX7BLBYOMPLRBPWZ.json","graph_json":"https://pith.science/api/pith-number/F27XF5GQHNQX7BLBYOMPLRBPWZ/graph.json","events_json":"https://pith.science/api/pith-number/F27XF5GQHNQX7BLBYOMPLRBPWZ/events.json","paper":"https://pith.science/paper/F27XF5GQ"},"agent_actions":{"view_html":"https://pith.science/pith/F27XF5GQHNQX7BLBYOMPLRBPWZ","download_json":"https://pith.science/pith/F27XF5GQHNQX7BLBYOMPLRBPWZ.json","view_paper":"https://pith.science/paper/F27XF5GQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.05405&json=true","fetch_graph":"https://pith.science/api/pith-number/F27XF5GQHNQX7BLBYOMPLRBPWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/F27XF5GQHNQX7BLBYOMPLRBPWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F27XF5GQHNQX7BLBYOMPLRBPWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F27XF5GQHNQX7BLBYOMPLRBPWZ/action/storage_attestation","attest_author":"https://pith.science/pith/F27XF5GQHNQX7BLBYOMPLRBPWZ/action/author_attestation","sign_citation":"https://pith.science/pith/F27XF5GQHNQX7BLBYOMPLRBPWZ/action/citation_signature","submit_replication":"https://pith.science/pith/F27XF5GQHNQX7BLBYOMPLRBPWZ/action/replication_record"}},"created_at":"2026-07-05T09:01:23.528513+00:00","updated_at":"2026-07-05T09:01:23.528513+00:00"}