{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LSW5WAK4CHOGCF3GJAGAKXJ2TY","short_pith_number":"pith:LSW5WAK4","canonical_record":{"source":{"id":"1608.01628","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-04T17:55:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e4e7aa4bc7745a63759fce27e92a76626116880131acb3669eb42fa91f7936e7","abstract_canon_sha256":"247b21699f22e6c8b47f0cc6072d48f0c828b7bd7e08962f30f8b1c863fa4efa"},"schema_version":"1.0"},"canonical_sha256":"5caddb015c11dc611766480c055d3a9e04a24988352558d3b48db0ea16bb40c7","source":{"kind":"arxiv","id":"1608.01628","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01628","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01628v3","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01628","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"LSW5WAK4CHOG","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSW5WAK4CHOGCF3G","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSW5WAK4","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LSW5WAK4CHOGCF3GJAGAKXJ2TY","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01628","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-04T17:55:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e4e7aa4bc7745a63759fce27e92a76626116880131acb3669eb42fa91f7936e7","abstract_canon_sha256":"247b21699f22e6c8b47f0cc6072d48f0c828b7bd7e08962f30f8b1c863fa4efa"},"schema_version":"1.0"},"canonical_sha256":"5caddb015c11dc611766480c055d3a9e04a24988352558d3b48db0ea16bb40c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:51.973074Z","signature_b64":"dL9B4O+lXFLxVvmEmtriwJVXcyiEDcMYKmsHopnmRvS7uUccZA8LpvcJXqHJFwio4J836RChNTRdms021iQBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5caddb015c11dc611766480c055d3a9e04a24988352558d3b48db0ea16bb40c7","last_reissued_at":"2026-05-18T00:31:51.972449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:51.972449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01628","source_version":3,"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-18T00:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgAM5vz+g/NtHS9MnwkDb0euC+ECGYUv8cwTTDcuhWBYGmXKBjz2XRTjS8+v4/EYubZw5GPL0Nw1hN71YmyNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:51:55.091741Z"},"content_sha256":"9ac81ff392a1c8ed729e6bba8af1f94724c539a665f990b623dc678dc65183d3","schema_version":"1.0","event_id":"sha256:9ac81ff392a1c8ed729e6bba8af1f94724c539a665f990b623dc678dc65183d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LSW5WAK4CHOGCF3GJAGAKXJ2TY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binarisation for Valued Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Andrei Krokhin, David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Robert Powell, Stanislav Zivny","submitted_at":"2016-08-04T17:55:52Z","abstract_excerpt":"We study methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the algebraic properties that capture the computational complexity of VCSPs. Second, we extend the reduction of CSPs to binary CSPs described by Bulin et al. [LMCS'15] to VCSPs. This reduction establishes that VCSPs over a fixed valued constraint language are polynomial-time equivalent to Minimum-Cost Homomorphism Problems over a fixed digraph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01628","kind":"arxiv","version":3},"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-18T00:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0rxRmOUIWBrYGCKWHFwRg71gNQrA69sUzSljWc6OSikyYisB2MvdyIP3Ti+4902v0FngNw7+3HteN40Ehq3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:51:55.092187Z"},"content_sha256":"4e46c75b7f43135189d6803187dcf60adca9d3bd3427b9a6938351a2ed636171","schema_version":"1.0","event_id":"sha256:4e46c75b7f43135189d6803187dcf60adca9d3bd3427b9a6938351a2ed636171"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSW5WAK4CHOGCF3GJAGAKXJ2TY/bundle.json","state_url":"https://pith.science/pith/LSW5WAK4CHOGCF3GJAGAKXJ2TY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSW5WAK4CHOGCF3GJAGAKXJ2TY/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-05-26T07:51:55Z","links":{"resolver":"https://pith.science/pith/LSW5WAK4CHOGCF3GJAGAKXJ2TY","bundle":"https://pith.science/pith/LSW5WAK4CHOGCF3GJAGAKXJ2TY/bundle.json","state":"https://pith.science/pith/LSW5WAK4CHOGCF3GJAGAKXJ2TY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSW5WAK4CHOGCF3GJAGAKXJ2TY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LSW5WAK4CHOGCF3GJAGAKXJ2TY","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":"247b21699f22e6c8b47f0cc6072d48f0c828b7bd7e08962f30f8b1c863fa4efa","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-04T17:55:52Z","title_canon_sha256":"e4e7aa4bc7745a63759fce27e92a76626116880131acb3669eb42fa91f7936e7"},"schema_version":"1.0","source":{"id":"1608.01628","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01628","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01628v3","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01628","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"LSW5WAK4CHOG","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSW5WAK4CHOGCF3G","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSW5WAK4","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:4e46c75b7f43135189d6803187dcf60adca9d3bd3427b9a6938351a2ed636171","target":"graph","created_at":"2026-05-18T00:31:51Z","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 methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the algebraic properties that capture the computational complexity of VCSPs. Second, we extend the reduction of CSPs to binary CSPs described by Bulin et al. [LMCS'15] to VCSPs. This reduction establishes that VCSPs over a fixed valued constraint language are polynomial-time equivalent to Minimum-Cost Homomorphism Problems over a fixed digraph.","authors_text":"Andrei Krokhin, David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Robert Powell, Stanislav Zivny","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-04T17:55:52Z","title":"Binarisation for Valued Constraint Satisfaction Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01628","kind":"arxiv","version":3},"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:9ac81ff392a1c8ed729e6bba8af1f94724c539a665f990b623dc678dc65183d3","target":"record","created_at":"2026-05-18T00:31:51Z","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":"247b21699f22e6c8b47f0cc6072d48f0c828b7bd7e08962f30f8b1c863fa4efa","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-04T17:55:52Z","title_canon_sha256":"e4e7aa4bc7745a63759fce27e92a76626116880131acb3669eb42fa91f7936e7"},"schema_version":"1.0","source":{"id":"1608.01628","kind":"arxiv","version":3}},"canonical_sha256":"5caddb015c11dc611766480c055d3a9e04a24988352558d3b48db0ea16bb40c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5caddb015c11dc611766480c055d3a9e04a24988352558d3b48db0ea16bb40c7","first_computed_at":"2026-05-18T00:31:51.972449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:51.972449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dL9B4O+lXFLxVvmEmtriwJVXcyiEDcMYKmsHopnmRvS7uUccZA8LpvcJXqHJFwio4J836RChNTRdms021iQBDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:51.973074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01628","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ac81ff392a1c8ed729e6bba8af1f94724c539a665f990b623dc678dc65183d3","sha256:4e46c75b7f43135189d6803187dcf60adca9d3bd3427b9a6938351a2ed636171"],"state_sha256":"a162b8057f0ba4e2d27e5cd5068e562386828178774c257b49c9fb096a27a9ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kG2guYUT/z7gdn71YH7SbhEXggnIxMf9bhv/jIw2u1VutW5xDOGj+oAA32YfJnH+vpaSP0D/YJ3qc/cF+0rlBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:51:55.094793Z","bundle_sha256":"4ef269105a4225bb8c55d6e6918becc9c7d760535cee18b74b817077ce42f584"}}