{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XUO5GMBXSSLRKBVNSMDJWFRBDO","short_pith_number":"pith:XUO5GMBX","schema_version":"1.0","canonical_sha256":"bd1dd3303794971506ad93069b16211b955883cf7fb9000c9fc0eb68567273a2","source":{"kind":"arxiv","id":"1008.4071","version":1},"attestation_state":"computed","paper":{"title":"Hybrid tractability of soft constraint problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Martin C. Cooper, Stanislav Zivny","submitted_at":"2010-08-24T15:42:21Z","abstract_excerpt":"The constraint satisfaction problem (CSP) is a central generic problem in computer science and artificial intelligence: it provides a common framework for many theoretical problems as well as for many real-life applications. Soft constraint problems are a generalisation of the CSP which allow the user to model optimisation problems. Considerable effort has been made in identifying properties which ensure tractability in such problems. In this work, we initiate the study of hybrid tractability of soft constraint problems; that is, properties which guarantee tractability of the given soft constr"},"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":"1008.4071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-08-24T15:42:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c6a99af37687d8f49613b9e37598252e00bf1e41ca3ca91f590208f1ca743a36","abstract_canon_sha256":"71d97c30e45a4c7ffbb7defcc88ac5b3f7737892411eeec5f3e9eafd4ca05c66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:35.114660Z","signature_b64":"2TeYVwQjUY85mfYGsKqykDfjnOpzNLe/JGpqhQ96lwGb7v21Sgr/M3yDcAPn1+WARZzY2OAYuFp7ezK6Xq9bAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd1dd3303794971506ad93069b16211b955883cf7fb9000c9fc0eb68567273a2","last_reissued_at":"2026-05-18T04:23:35.113925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:35.113925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid tractability of soft constraint problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Martin C. Cooper, Stanislav Zivny","submitted_at":"2010-08-24T15:42:21Z","abstract_excerpt":"The constraint satisfaction problem (CSP) is a central generic problem in computer science and artificial intelligence: it provides a common framework for many theoretical problems as well as for many real-life applications. Soft constraint problems are a generalisation of the CSP which allow the user to model optimisation problems. Considerable effort has been made in identifying properties which ensure tractability in such problems. In this work, we initiate the study of hybrid tractability of soft constraint problems; that is, properties which guarantee tractability of the given soft constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4071","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":"1008.4071","created_at":"2026-05-18T04:23:35.114032+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4071v1","created_at":"2026-05-18T04:23:35.114032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4071","created_at":"2026-05-18T04:23:35.114032+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUO5GMBXSSLR","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUO5GMBXSSLRKBVN","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUO5GMBX","created_at":"2026-05-18T12:26:17.028572+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/XUO5GMBXSSLRKBVNSMDJWFRBDO","json":"https://pith.science/pith/XUO5GMBXSSLRKBVNSMDJWFRBDO.json","graph_json":"https://pith.science/api/pith-number/XUO5GMBXSSLRKBVNSMDJWFRBDO/graph.json","events_json":"https://pith.science/api/pith-number/XUO5GMBXSSLRKBVNSMDJWFRBDO/events.json","paper":"https://pith.science/paper/XUO5GMBX"},"agent_actions":{"view_html":"https://pith.science/pith/XUO5GMBXSSLRKBVNSMDJWFRBDO","download_json":"https://pith.science/pith/XUO5GMBXSSLRKBVNSMDJWFRBDO.json","view_paper":"https://pith.science/paper/XUO5GMBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4071&json=true","fetch_graph":"https://pith.science/api/pith-number/XUO5GMBXSSLRKBVNSMDJWFRBDO/graph.json","fetch_events":"https://pith.science/api/pith-number/XUO5GMBXSSLRKBVNSMDJWFRBDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUO5GMBXSSLRKBVNSMDJWFRBDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUO5GMBXSSLRKBVNSMDJWFRBDO/action/storage_attestation","attest_author":"https://pith.science/pith/XUO5GMBXSSLRKBVNSMDJWFRBDO/action/author_attestation","sign_citation":"https://pith.science/pith/XUO5GMBXSSLRKBVNSMDJWFRBDO/action/citation_signature","submit_replication":"https://pith.science/pith/XUO5GMBXSSLRKBVNSMDJWFRBDO/action/replication_record"}},"created_at":"2026-05-18T04:23:35.114032+00:00","updated_at":"2026-05-18T04:23:35.114032+00:00"}