{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TLV5RQNW4G7BXSWBFORBSLUYKQ","short_pith_number":"pith:TLV5RQNW","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"},"canonical_sha256":"9aebd8c1b6e1be1bcac12ba2192e9854164d143d55b1df0b2d7208c5a7ead830","source":{"kind":"arxiv","id":"1008.1555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1555","created_at":"2026-05-18T04:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1555v1","created_at":"2026-05-18T04:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1555","created_at":"2026-05-18T04:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"TLV5RQNW4G7B","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TLV5RQNW4G7BXSWB","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TLV5RQNW","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TLV5RQNW4G7BXSWBFORBSLUYKQ","target":"record","payload":{"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"},"canonical_sha256":"9aebd8c1b6e1be1bcac12ba2192e9854164d143d55b1df0b2d7208c5a7ead830","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"},"source_kind":"arxiv","source_id":"1008.1555","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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fcqoqc69Jx4/Flz0k9caDaLbA/Jo5iuWjf88Zx50b7aHtll3mQtvsbQ6LJcWnVP8N1wqW/9p16cyjFK5sUbUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:50:08.060105Z"},"content_sha256":"11bd62e65cc16745d6df6822ac73fdb4e7345503149b3f709c66e7e9c2c5eba0","schema_version":"1.0","event_id":"sha256:11bd62e65cc16745d6df6822ac73fdb4e7345503149b3f709c66e7e9c2c5eba0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TLV5RQNW4G7BXSWBFORBSLUYKQ","target":"graph","payload":{"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"},"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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e6Y9pqLVS5PQ63sjlF2S0hspAKSFAv7NJkyiJy+deVZEOSgYEWXBYyjBxQbMld5kqtvJiymSyoQdirO76xNsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:50:08.060482Z"},"content_sha256":"967deab484dc94753f7db3d676d3fc2608986eaf960de7339511906aa5416336","schema_version":"1.0","event_id":"sha256:967deab484dc94753f7db3d676d3fc2608986eaf960de7339511906aa5416336"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ/bundle.json","state_url":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ/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-02T21:50:08Z","links":{"resolver":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ","bundle":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ/bundle.json","state":"https://pith.science/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLV5RQNW4G7BXSWBFORBSLUYKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TLV5RQNW4G7BXSWBFORBSLUYKQ","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":"12f2e1fa32395d3ab6dcf84a23628c1c2a0509172deb629661767dcef03b0731","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-08-09T17:47:20Z","title_canon_sha256":"1d837289150b1bb3d3819334d4c362376e14645bb9bb1b0fa584415dce6ebfed"},"schema_version":"1.0","source":{"id":"1008.1555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1555","created_at":"2026-05-18T04:42:24Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1555v1","created_at":"2026-05-18T04:42:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1555","created_at":"2026-05-18T04:42:24Z"},{"alias_kind":"pith_short_12","alias_value":"TLV5RQNW4G7B","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TLV5RQNW4G7BXSWB","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TLV5RQNW","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:967deab484dc94753f7db3d676d3fc2608986eaf960de7339511906aa5416336","target":"graph","created_at":"2026-05-18T04:42:24Z","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 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.","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-09T17:47:20Z","title":"The complexity of conservative finite-valued CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1555","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:11bd62e65cc16745d6df6822ac73fdb4e7345503149b3f709c66e7e9c2c5eba0","target":"record","created_at":"2026-05-18T04:42:24Z","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":"12f2e1fa32395d3ab6dcf84a23628c1c2a0509172deb629661767dcef03b0731","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-08-09T17:47:20Z","title_canon_sha256":"1d837289150b1bb3d3819334d4c362376e14645bb9bb1b0fa584415dce6ebfed"},"schema_version":"1.0","source":{"id":"1008.1555","kind":"arxiv","version":1}},"canonical_sha256":"9aebd8c1b6e1be1bcac12ba2192e9854164d143d55b1df0b2d7208c5a7ead830","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9aebd8c1b6e1be1bcac12ba2192e9854164d143d55b1df0b2d7208c5a7ead830","first_computed_at":"2026-05-18T04:42:24.050578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:24.050578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fgxZR6Yc91kuHDvfnHY2ea67VsElnmzd1jzFz8CKPVecUUmUrdzwkOOdfhzG8q5COpCDPX6lsPIgfJ8JjNfTDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:24.050983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.1555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11bd62e65cc16745d6df6822ac73fdb4e7345503149b3f709c66e7e9c2c5eba0","sha256:967deab484dc94753f7db3d676d3fc2608986eaf960de7339511906aa5416336"],"state_sha256":"11378468a4d1339cdcbc1d77f546c28c77aee6a918dd233f2f6448e985e234fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCZkmgu7n8Lso6LQiaxrG9hf9cp90VD1IRKX0DeV6GeGpstZt5ZUXDTXNXNaqe5MvmP5zOMlZOn9tBSutzPaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:50:08.062476Z","bundle_sha256":"69c977e566a1683ba30b3dcadc2ca2de6f0a1b6c4124132de70bc30b8aa7b4cb"}}