{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JSYGJ5DCLVCX7U65OQCTEH2GMF","short_pith_number":"pith:JSYGJ5DC","schema_version":"1.0","canonical_sha256":"4cb064f4625d457fd3dd7405321f46617a8b358caf2b327ee84894a6b458ae57","source":{"kind":"arxiv","id":"1204.1079","version":2},"attestation_state":"computed","paper":{"title":"The Power of Linear Programming for Valued CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Johan Thapper, Stanislav Zivny","submitted_at":"2012-04-04T21:12:26Z","abstract_excerpt":"A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum. This framework includes and generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint satisfaction problems (Max-CSPs).\n  Our main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation. "},"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":"1204.1079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-04T21:12:26Z","cross_cats_sorted":[],"title_canon_sha256":"4bf50436788dde50391169f6737b64c146b327079d101351c78ce0e807e0e70e","abstract_canon_sha256":"bd73e09891d3507b59e1fcdf9869948edb34a640a12ad97054a519dc8625767c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:19.289691Z","signature_b64":"BbiMmdgpeHiXnJ0OyfEWExLQ3eSi7gtZaKfOgtiUmh+i+37fgCX7SdjdTy4cG3pEywvaevRl9Qk3J8azVuNlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cb064f4625d457fd3dd7405321f46617a8b358caf2b327ee84894a6b458ae57","last_reissued_at":"2026-05-18T01:26:19.289231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:19.289231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Power of Linear Programming for Valued CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Johan Thapper, Stanislav Zivny","submitted_at":"2012-04-04T21:12:26Z","abstract_excerpt":"A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum. This framework includes and generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint satisfaction problems (Max-CSPs).\n  Our main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1079","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":""},"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":"1204.1079","created_at":"2026-05-18T01:26:19.289300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.1079v2","created_at":"2026-05-18T01:26:19.289300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1079","created_at":"2026-05-18T01:26:19.289300+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSYGJ5DCLVCX","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSYGJ5DCLVCX7U65","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSYGJ5DC","created_at":"2026-05-18T12:27:11.947152+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/JSYGJ5DCLVCX7U65OQCTEH2GMF","json":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF.json","graph_json":"https://pith.science/api/pith-number/JSYGJ5DCLVCX7U65OQCTEH2GMF/graph.json","events_json":"https://pith.science/api/pith-number/JSYGJ5DCLVCX7U65OQCTEH2GMF/events.json","paper":"https://pith.science/paper/JSYGJ5DC"},"agent_actions":{"view_html":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF","download_json":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF.json","view_paper":"https://pith.science/paper/JSYGJ5DC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.1079&json=true","fetch_graph":"https://pith.science/api/pith-number/JSYGJ5DCLVCX7U65OQCTEH2GMF/graph.json","fetch_events":"https://pith.science/api/pith-number/JSYGJ5DCLVCX7U65OQCTEH2GMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF/action/storage_attestation","attest_author":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF/action/author_attestation","sign_citation":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF/action/citation_signature","submit_replication":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF/action/replication_record"}},"created_at":"2026-05-18T01:26:19.289300+00:00","updated_at":"2026-05-18T01:26:19.289300+00:00"}