{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:G5TQVO4VL4GOEASU67HLQ3JPNT","short_pith_number":"pith:G5TQVO4V","schema_version":"1.0","canonical_sha256":"37670abb955f0ce20254f7ceb86d2f6cf05cab12d8814fcf151c9a3e4418f32d","source":{"kind":"arxiv","id":"1303.5427","version":1},"attestation_state":"computed","paper":{"title":"Possibilistic Constraint Satisfaction Problems or \"How to handle soft constraints?\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Thomas Schiex","submitted_at":"2013-03-13T12:54:58Z","abstract_excerpt":"Many AI synthesis problems such as planning or scheduling may be modelized as constraint satisfaction problems (CSP).  A CSP is typically defined as the problem of finding any consistent labeling for a fixed set of variables satisfying all given constraints between these variables.  However, for many real tasks such as job-shop scheduling, time-table scheduling, design?, all these constraints have not the same significance and have not to be necessarily satisfied.  A first distinction can be made between hard constraints, which every solution should satisfy and soft constraints, whose satisfac"},"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":"1303.5427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-13T12:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"bdf7fdc13f321a79286179e0fb16167ced84e5767c8d0cc4db545b406f9b112e","abstract_canon_sha256":"ce22be32936e3a4f0df6ea6561839b14eedd1bc6aa60867a1c825b40e494d7a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:04.251895Z","signature_b64":"64k94i7Ggkz8joLWM+J2U54NnMfC9hV9uodwoMtfquRbFYjrhE8dxNRMlL56Mk+Jf9qlSF1DpMOmucAo5eM6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37670abb955f0ce20254f7ceb86d2f6cf05cab12d8814fcf151c9a3e4418f32d","last_reissued_at":"2026-05-18T03:30:04.251310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:04.251310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Possibilistic Constraint Satisfaction Problems or \"How to handle soft constraints?\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Thomas Schiex","submitted_at":"2013-03-13T12:54:58Z","abstract_excerpt":"Many AI synthesis problems such as planning or scheduling may be modelized as constraint satisfaction problems (CSP).  A CSP is typically defined as the problem of finding any consistent labeling for a fixed set of variables satisfying all given constraints between these variables.  However, for many real tasks such as job-shop scheduling, time-table scheduling, design?, all these constraints have not the same significance and have not to be necessarily satisfied.  A first distinction can be made between hard constraints, which every solution should satisfy and soft constraints, whose satisfac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5427","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":"1303.5427","created_at":"2026-05-18T03:30:04.251416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.5427v1","created_at":"2026-05-18T03:30:04.251416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5427","created_at":"2026-05-18T03:30:04.251416+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5TQVO4VL4GO","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5TQVO4VL4GOEASU","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5TQVO4V","created_at":"2026-05-18T12:27:45.050594+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/G5TQVO4VL4GOEASU67HLQ3JPNT","json":"https://pith.science/pith/G5TQVO4VL4GOEASU67HLQ3JPNT.json","graph_json":"https://pith.science/api/pith-number/G5TQVO4VL4GOEASU67HLQ3JPNT/graph.json","events_json":"https://pith.science/api/pith-number/G5TQVO4VL4GOEASU67HLQ3JPNT/events.json","paper":"https://pith.science/paper/G5TQVO4V"},"agent_actions":{"view_html":"https://pith.science/pith/G5TQVO4VL4GOEASU67HLQ3JPNT","download_json":"https://pith.science/pith/G5TQVO4VL4GOEASU67HLQ3JPNT.json","view_paper":"https://pith.science/paper/G5TQVO4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.5427&json=true","fetch_graph":"https://pith.science/api/pith-number/G5TQVO4VL4GOEASU67HLQ3JPNT/graph.json","fetch_events":"https://pith.science/api/pith-number/G5TQVO4VL4GOEASU67HLQ3JPNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5TQVO4VL4GOEASU67HLQ3JPNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5TQVO4VL4GOEASU67HLQ3JPNT/action/storage_attestation","attest_author":"https://pith.science/pith/G5TQVO4VL4GOEASU67HLQ3JPNT/action/author_attestation","sign_citation":"https://pith.science/pith/G5TQVO4VL4GOEASU67HLQ3JPNT/action/citation_signature","submit_replication":"https://pith.science/pith/G5TQVO4VL4GOEASU67HLQ3JPNT/action/replication_record"}},"created_at":"2026-05-18T03:30:04.251416+00:00","updated_at":"2026-05-18T03:30:04.251416+00:00"}