{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TLV5RQNW4G7BXSWBFORBSLUYKQ","short_pith_number":"pith:TLV5RQNW","schema_version":"1.0","canonical_sha256":"9aebd8c1b6e1be1bcac12ba2192e9854164d143d55b1df0b2d7208c5a7ead830","source":{"kind":"arxiv","id":"1008.1555","version":1},"attestation_state":"computed","paper":{"title":"The complexity of conservative finite-valued CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Stanislav Zivny, Vladimir Kolmogorov","submitted_at":"2010-08-09T17:47:20Z","abstract_excerpt":"We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \\emph{constraint language}, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimise the sum. We consider the case of so-called \\emph{conservative} languages; that is, languages containing all unary cost functions, thus allowing arbitrary restrictions on the domains of the variables. This problem has been studied by Bulatov [LICS'03] for $\\{0,\\infty\\}$-valued languages (i."},"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.1555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-08-09T17:47:20Z","cross_cats_sorted":[],"title_canon_sha256":"1d837289150b1bb3d3819334d4c362376e14645bb9bb1b0fa584415dce6ebfed","abstract_canon_sha256":"12f2e1fa32395d3ab6dcf84a23628c1c2a0509172deb629661767dcef03b0731"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:24.050983Z","signature_b64":"fgxZR6Yc91kuHDvfnHY2ea67VsElnmzd1jzFz8CKPVecUUmUrdzwkOOdfhzG8q5COpCDPX6lsPIgfJ8JjNfTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9aebd8c1b6e1be1bcac12ba2192e9854164d143d55b1df0b2d7208c5a7ead830","last_reissued_at":"2026-05-18T04:42:24.050578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:24.050578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of conservative finite-valued CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Stanislav Zivny, Vladimir Kolmogorov","submitted_at":"2010-08-09T17:47:20Z","abstract_excerpt":"We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \\emph{constraint language}, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimise the sum. We consider the case of so-called \\emph{conservative} languages; that is, languages containing all unary cost functions, thus allowing arbitrary restrictions on the domains of the variables. This problem has been studied by Bulatov [LICS'03] for $\\{0,\\infty\\}$-valued languages (i."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1555","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.1555","created_at":"2026-05-18T04:42:24.050628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1555v1","created_at":"2026-05-18T04:42:24.050628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1555","created_at":"2026-05-18T04:42:24.050628+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLV5RQNW4G7B","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLV5RQNW4G7BXSWB","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLV5RQNW","created_at":"2026-05-18T12:26:13.927090+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/TLV5RQNW4G7BXSWBFORBSLUYKQ","json":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ.json","graph_json":"https://pith.science/api/pith-number/TLV5RQNW4G7BXSWBFORBSLUYKQ/graph.json","events_json":"https://pith.science/api/pith-number/TLV5RQNW4G7BXSWBFORBSLUYKQ/events.json","paper":"https://pith.science/paper/TLV5RQNW"},"agent_actions":{"view_html":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ","download_json":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ.json","view_paper":"https://pith.science/paper/TLV5RQNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1555&json=true","fetch_graph":"https://pith.science/api/pith-number/TLV5RQNW4G7BXSWBFORBSLUYKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/TLV5RQNW4G7BXSWBFORBSLUYKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ/action/storage_attestation","attest_author":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ/action/author_attestation","sign_citation":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ/action/citation_signature","submit_replication":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ/action/replication_record"}},"created_at":"2026-05-18T04:42:24.050628+00:00","updated_at":"2026-05-18T04:42:24.050628+00:00"}