{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:NSCG7UBCZBF2SV42RJZKFOR4DB","short_pith_number":"pith:NSCG7UBC","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"},"canonical_sha256":"6c846fd022c84ba9579a8a72a2ba3c1861a4676830d7dd6b311051f2eb2e4789","source":{"kind":"arxiv","id":"1008.3104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3104","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3104v1","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3104","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"NSCG7UBCZBF2","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NSCG7UBCZBF2SV42","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NSCG7UBC","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:NSCG7UBCZBF2SV42RJZKFOR4DB","target":"record","payload":{"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"},"canonical_sha256":"6c846fd022c84ba9579a8a72a2ba3c1861a4676830d7dd6b311051f2eb2e4789","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"},"source_kind":"arxiv","source_id":"1008.3104","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2o2a9y8SIqsC+n9dW+LD4MOv2PxS9kVph3hcUg76xuYcRfOuRIZ7F9Vc7siwRbYAb/X/CtmrE3dBb8275MwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:24:15.647131Z"},"content_sha256":"5c7538481ed3772fc8f304859a1f30ef7ac75aae995d1ff3d62a8d816d81d2b0","schema_version":"1.0","event_id":"sha256:5c7538481ed3772fc8f304859a1f30ef7ac75aae995d1ff3d62a8d816d81d2b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:NSCG7UBCZBF2SV42RJZKFOR4DB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wYeHkG+N3/XEBKS2stQ2QTQOAVA/mAh+YbaT0IbJdGm+iJmtycxnFS7bL9oy3K17reF3KnI8gaBLByb5D/rxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:24:15.647497Z"},"content_sha256":"e7c71030cdeaf7275f1a89580d91b929bdb3d8877c35a6829c28780c34c23479","schema_version":"1.0","event_id":"sha256:e7c71030cdeaf7275f1a89580d91b929bdb3d8877c35a6829c28780c34c23479"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB/bundle.json","state_url":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSCG7UBCZBF2SV42RJZKFOR4DB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T04:24:15Z","links":{"resolver":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB","bundle":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB/bundle.json","state":"https://pith.science/pith/NSCG7UBCZBF2SV42RJZKFOR4DB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSCG7UBCZBF2SV42RJZKFOR4DB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:NSCG7UBCZBF2SV42RJZKFOR4DB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4f3638969ae01785e2b75001898f526fd564d155fc307870cd4d2c5fc03cf244","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-08-18T15:15:38Z","title_canon_sha256":"f44cec5acbfdd1edbe02ea54e232cd8c351a1984871fba54dfc73d5d99e42c66"},"schema_version":"1.0","source":{"id":"1008.3104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3104","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3104v1","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3104","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"NSCG7UBCZBF2","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NSCG7UBCZBF2SV42","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NSCG7UBC","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:e7c71030cdeaf7275f1a89580d91b929bdb3d8877c35a6829c28780c34c23479","target":"graph","created_at":"2026-05-18T04:42:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Stanislav Zivny, Vladimir Kolmogorov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-08-18T15:15:38Z","title":"Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3104","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5c7538481ed3772fc8f304859a1f30ef7ac75aae995d1ff3d62a8d816d81d2b0","target":"record","created_at":"2026-05-18T04:42:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4f3638969ae01785e2b75001898f526fd564d155fc307870cd4d2c5fc03cf244","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-08-18T15:15:38Z","title_canon_sha256":"f44cec5acbfdd1edbe02ea54e232cd8c351a1984871fba54dfc73d5d99e42c66"},"schema_version":"1.0","source":{"id":"1008.3104","kind":"arxiv","version":1}},"canonical_sha256":"6c846fd022c84ba9579a8a72a2ba3c1861a4676830d7dd6b311051f2eb2e4789","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c846fd022c84ba9579a8a72a2ba3c1861a4676830d7dd6b311051f2eb2e4789","first_computed_at":"2026-05-18T04:42:03.599841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:03.599841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gnfYgUTiaOFyceL9cQR0zmydDxxtEjkW7D4HV0FJWYui5kOnY9LIcqtwj3/EEzhcJyHTOrtowVcPHPP8RLOxCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:03.600302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c7538481ed3772fc8f304859a1f30ef7ac75aae995d1ff3d62a8d816d81d2b0","sha256:e7c71030cdeaf7275f1a89580d91b929bdb3d8877c35a6829c28780c34c23479"],"state_sha256":"e00cb166bb98aad777dfade15acd9e1ffacfb43548b28f9783150505e2f08bbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6dGmVwTuD/GhM/JbaVNcAoJi26or1YcNxcxvQFychFe4j/Nv+ijK8X2fLO8EnaVqlsA31BoSTx+wbtGxykMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:24:15.649435Z","bundle_sha256":"dc87f68e283695203c5bc047210f5a2e7b66d69330878ada49f9502258d93525"}}