{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JSYGJ5DCLVCX7U65OQCTEH2GMF","short_pith_number":"pith:JSYGJ5DC","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"},"canonical_sha256":"4cb064f4625d457fd3dd7405321f46617a8b358caf2b327ee84894a6b458ae57","source":{"kind":"arxiv","id":"1204.1079","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1079","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1079v2","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1079","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"pith_short_12","alias_value":"JSYGJ5DCLVCX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JSYGJ5DCLVCX7U65","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JSYGJ5DC","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JSYGJ5DCLVCX7U65OQCTEH2GMF","target":"record","payload":{"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"},"canonical_sha256":"4cb064f4625d457fd3dd7405321f46617a8b358caf2b327ee84894a6b458ae57","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"},"source_kind":"arxiv","source_id":"1204.1079","source_version":2,"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-18T01:26:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w10ntWoYVyj1rlFI6EF6tM2T1YWQ8y3fiVYS2OaZhyhoxixKiWoYHTiddGh04FI70vkQL8ly1+wtJPu8LQL1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:44:13.268358Z"},"content_sha256":"fc5cdace918d004767f7b57662fa9d0fbb5c3b4189f0246ed68d26288cea56d8","schema_version":"1.0","event_id":"sha256:fc5cdace918d004767f7b57662fa9d0fbb5c3b4189f0246ed68d26288cea56d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JSYGJ5DCLVCX7U65OQCTEH2GMF","target":"graph","payload":{"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"},"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-18T01:26:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQiRNP0tflNxLwz6IoG9atKoAsjUhNi1Bbvv25uYk7uVFWjxagZvt+bK2qev30C4HM+INRgIaaEwfs8nKqPQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:44:13.268730Z"},"content_sha256":"e7e8f81d1eee213fc6d337499a76e2e7dc89b140f0926c8fe7fddec6c76a4fa3","schema_version":"1.0","event_id":"sha256:e7e8f81d1eee213fc6d337499a76e2e7dc89b140f0926c8fe7fddec6c76a4fa3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF/bundle.json","state_url":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF/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-27T19:44:13Z","links":{"resolver":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF","bundle":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF/bundle.json","state":"https://pith.science/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSYGJ5DCLVCX7U65OQCTEH2GMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JSYGJ5DCLVCX7U65OQCTEH2GMF","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":"bd73e09891d3507b59e1fcdf9869948edb34a640a12ad97054a519dc8625767c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-04T21:12:26Z","title_canon_sha256":"4bf50436788dde50391169f6737b64c146b327079d101351c78ce0e807e0e70e"},"schema_version":"1.0","source":{"id":"1204.1079","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1079","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1079v2","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1079","created_at":"2026-05-18T01:26:19Z"},{"alias_kind":"pith_short_12","alias_value":"JSYGJ5DCLVCX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JSYGJ5DCLVCX7U65","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JSYGJ5DC","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:e7e8f81d1eee213fc6d337499a76e2e7dc89b140f0926c8fe7fddec6c76a4fa3","target":"graph","created_at":"2026-05-18T01:26:19Z","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":"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. ","authors_text":"Johan Thapper, Stanislav Zivny","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-04T21:12:26Z","title":"The Power of Linear Programming for Valued CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1079","kind":"arxiv","version":2},"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:fc5cdace918d004767f7b57662fa9d0fbb5c3b4189f0246ed68d26288cea56d8","target":"record","created_at":"2026-05-18T01:26:19Z","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":"bd73e09891d3507b59e1fcdf9869948edb34a640a12ad97054a519dc8625767c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-04T21:12:26Z","title_canon_sha256":"4bf50436788dde50391169f6737b64c146b327079d101351c78ce0e807e0e70e"},"schema_version":"1.0","source":{"id":"1204.1079","kind":"arxiv","version":2}},"canonical_sha256":"4cb064f4625d457fd3dd7405321f46617a8b358caf2b327ee84894a6b458ae57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cb064f4625d457fd3dd7405321f46617a8b358caf2b327ee84894a6b458ae57","first_computed_at":"2026-05-18T01:26:19.289231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:19.289231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BbiMmdgpeHiXnJ0OyfEWExLQ3eSi7gtZaKfOgtiUmh+i+37fgCX7SdjdTy4cG3pEywvaevRl9Qk3J8azVuNlBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:19.289691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1079","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc5cdace918d004767f7b57662fa9d0fbb5c3b4189f0246ed68d26288cea56d8","sha256:e7e8f81d1eee213fc6d337499a76e2e7dc89b140f0926c8fe7fddec6c76a4fa3"],"state_sha256":"be40a66c3ac958792786d81cac7d7a8232f206b24a84f48a0f9c98a5480869df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+nJli8/Efj6PNrKfAiM22QDCgO7ksvOVibbmQ2xwARmxi0ufn4XhQJxx5k0MmuORxY5ETOiGhBFH1EqVpKdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:44:13.271093Z","bundle_sha256":"47e35145e29f64bf71885b7a78f604666f3e966edc8910fb3e524c74a8a738ee"}}