{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NSCG7UBCZBF2SV42RJZKFOR4DB","short_pith_number":"pith:NSCG7UBC","schema_version":"1.0","canonical_sha256":"6c846fd022c84ba9579a8a72a2ba3c1861a4676830d7dd6b311051f2eb2e4789","source":{"kind":"arxiv","id":"1008.3104","version":1},"attestation_state":"computed","paper":{"title":"Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms","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-18T15:15:38Z","abstract_excerpt":"We study optimisation problems that can be formulated as valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \\emph{constraint language}, a fixed set of cost functions taking finite and infinite costs 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 are interested in \\emph{tractable} constraint languages; that is, languages that give rise to VCSP instances solvable in polynomial time. Cohen et al. (AIJ'06) have shown that constraint languages that admit the MJN"},"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.3104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-08-18T15:15:38Z","cross_cats_sorted":[],"title_canon_sha256":"f44cec5acbfdd1edbe02ea54e232cd8c351a1984871fba54dfc73d5d99e42c66","abstract_canon_sha256":"4f3638969ae01785e2b75001898f526fd564d155fc307870cd4d2c5fc03cf244"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:03.600302Z","signature_b64":"gnfYgUTiaOFyceL9cQR0zmydDxxtEjkW7D4HV0FJWYui5kOnY9LIcqtwj3/EEzhcJyHTOrtowVcPHPP8RLOxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c846fd022c84ba9579a8a72a2ba3c1861a4676830d7dd6b311051f2eb2e4789","last_reissued_at":"2026-05-18T04:42:03.599841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:03.599841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms","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-18T15:15:38Z","abstract_excerpt":"We study optimisation problems that can be formulated as valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a \\emph{constraint language}, a fixed set of cost functions taking finite and infinite costs 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 are interested in \\emph{tractable} constraint languages; that is, languages that give rise to VCSP instances solvable in polynomial time. Cohen et al. (AIJ'06) have shown that constraint languages that admit the MJN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3104","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.3104","created_at":"2026-05-18T04:42:03.599925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3104v1","created_at":"2026-05-18T04:42:03.599925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3104","created_at":"2026-05-18T04:42:03.599925+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSCG7UBCZBF2","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSCG7UBCZBF2SV42","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSCG7UBC","created_at":"2026-05-18T12:26:10.704358+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/NSCG7UBCZBF2SV42RJZKFOR4DB","json":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB.json","graph_json":"https://pith.science/api/pith-number/NSCG7UBCZBF2SV42RJZKFOR4DB/graph.json","events_json":"https://pith.science/api/pith-number/NSCG7UBCZBF2SV42RJZKFOR4DB/events.json","paper":"https://pith.science/paper/NSCG7UBC"},"agent_actions":{"view_html":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB","download_json":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB.json","view_paper":"https://pith.science/paper/NSCG7UBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3104&json=true","fetch_graph":"https://pith.science/api/pith-number/NSCG7UBCZBF2SV42RJZKFOR4DB/graph.json","fetch_events":"https://pith.science/api/pith-number/NSCG7UBCZBF2SV42RJZKFOR4DB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB/action/storage_attestation","attest_author":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB/action/author_attestation","sign_citation":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB/action/citation_signature","submit_replication":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB/action/replication_record"}},"created_at":"2026-05-18T04:42:03.599925+00:00","updated_at":"2026-05-18T04:42:03.599925+00:00"}