{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:YWQ7HIIAMKEILSSOCFHMEOJSFT","short_pith_number":"pith:YWQ7HIIA","schema_version":"1.0","canonical_sha256":"c5a1f3a100628885ca4e114ec239322cd0b1759cc3d9748aeb111af801e58317","source":{"kind":"arxiv","id":"2202.03888","version":1},"attestation_state":"computed","paper":{"title":"Learning MAX-SAT from Contextual Examples for Combinatorial Optimisation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Luc De Raedt, Mohit Kumar, Samuel Kolb, Stefano Teso","submitted_at":"2022-02-08T14:22:38Z","abstract_excerpt":"Combinatorial optimisation problems are ubiquitous in artificial intelligence. Designing the underlying models, however, requires substantial expertise, which is a limiting factor in practice. The models typically consist of hard and soft constraints, or combine hard constraints with an objective function. We introduce a novel setting for learning combinatorial optimisation problems from contextual examples. These positive and negative examples show - in a particular context - whether the solutions are good enough or not. We develop our framework using the MAX-SAT formalism as it is simple yet"},"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":"2202.03888","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2022-02-08T14:22:38Z","cross_cats_sorted":[],"title_canon_sha256":"a9570d54512d50b1e3045572a8c20e36f777efaac44c23523aab176e57034f02","abstract_canon_sha256":"7cfc3627f2382ea935661b76d6ad410fcbd8c401fa79ce8285524d4933c18e4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:55:21.095498Z","signature_b64":"cSL6fBv9Jxkx2rAofRcGXhhMHAktM2WDAxehzlKle7hBF5IiGZT3Ie8piiz9sc9fFIe5g5pyKAHyHyYLUl2nAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5a1f3a100628885ca4e114ec239322cd0b1759cc3d9748aeb111af801e58317","last_reissued_at":"2026-07-05T03:55:21.094997Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:55:21.094997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning MAX-SAT from Contextual Examples for Combinatorial Optimisation","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Luc De Raedt, Mohit Kumar, Samuel Kolb, Stefano Teso","submitted_at":"2022-02-08T14:22:38Z","abstract_excerpt":"Combinatorial optimisation problems are ubiquitous in artificial intelligence. Designing the underlying models, however, requires substantial expertise, which is a limiting factor in practice. The models typically consist of hard and soft constraints, or combine hard constraints with an objective function. We introduce a novel setting for learning combinatorial optimisation problems from contextual examples. These positive and negative examples show - in a particular context - whether the solutions are good enough or not. We develop our framework using the MAX-SAT formalism as it is simple yet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.03888","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/2202.03888/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":"2202.03888","created_at":"2026-07-05T03:55:21.095062+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.03888v1","created_at":"2026-07-05T03:55:21.095062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.03888","created_at":"2026-07-05T03:55:21.095062+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWQ7HIIAMKEI","created_at":"2026-07-05T03:55:21.095062+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWQ7HIIAMKEILSSO","created_at":"2026-07-05T03:55:21.095062+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWQ7HIIA","created_at":"2026-07-05T03:55:21.095062+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/YWQ7HIIAMKEILSSOCFHMEOJSFT","json":"https://pith.science/pith/YWQ7HIIAMKEILSSOCFHMEOJSFT.json","graph_json":"https://pith.science/api/pith-number/YWQ7HIIAMKEILSSOCFHMEOJSFT/graph.json","events_json":"https://pith.science/api/pith-number/YWQ7HIIAMKEILSSOCFHMEOJSFT/events.json","paper":"https://pith.science/paper/YWQ7HIIA"},"agent_actions":{"view_html":"https://pith.science/pith/YWQ7HIIAMKEILSSOCFHMEOJSFT","download_json":"https://pith.science/pith/YWQ7HIIAMKEILSSOCFHMEOJSFT.json","view_paper":"https://pith.science/paper/YWQ7HIIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.03888&json=true","fetch_graph":"https://pith.science/api/pith-number/YWQ7HIIAMKEILSSOCFHMEOJSFT/graph.json","fetch_events":"https://pith.science/api/pith-number/YWQ7HIIAMKEILSSOCFHMEOJSFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWQ7HIIAMKEILSSOCFHMEOJSFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWQ7HIIAMKEILSSOCFHMEOJSFT/action/storage_attestation","attest_author":"https://pith.science/pith/YWQ7HIIAMKEILSSOCFHMEOJSFT/action/author_attestation","sign_citation":"https://pith.science/pith/YWQ7HIIAMKEILSSOCFHMEOJSFT/action/citation_signature","submit_replication":"https://pith.science/pith/YWQ7HIIAMKEILSSOCFHMEOJSFT/action/replication_record"}},"created_at":"2026-07-05T03:55:21.095062+00:00","updated_at":"2026-07-05T03:55:21.095062+00:00"}