{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JQAUUGHHHN4AYGNHKI7BSC3RPQ","short_pith_number":"pith:JQAUUGHH","canonical_record":{"source":{"id":"1102.2880","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-14T20:41:09Z","cross_cats_sorted":[],"title_canon_sha256":"5ecd2bdd69b6fd2d95280664a40c5f0ff59b03b880255992352a292caf75234f","abstract_canon_sha256":"432bf4d58f69439d944d4df52556e71b0a8ab679c7f17fc12d1cb964da8ba431"},"schema_version":"1.0"},"canonical_sha256":"4c014a18e73b780c19a7523e190b717c37883568ebf2a8f7e7cb415a6412cb69","source":{"kind":"arxiv","id":"1102.2880","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2880","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2880v2","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2880","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"JQAUUGHHHN4A","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JQAUUGHHHN4AYGNH","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JQAUUGHH","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JQAUUGHHHN4AYGNHKI7BSC3RPQ","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2880","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-14T20:41:09Z","cross_cats_sorted":[],"title_canon_sha256":"5ecd2bdd69b6fd2d95280664a40c5f0ff59b03b880255992352a292caf75234f","abstract_canon_sha256":"432bf4d58f69439d944d4df52556e71b0a8ab679c7f17fc12d1cb964da8ba431"},"schema_version":"1.0"},"canonical_sha256":"4c014a18e73b780c19a7523e190b717c37883568ebf2a8f7e7cb415a6412cb69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:22.017954Z","signature_b64":"ZmMxUsAeS3Z6v9MBingfs7qOXNfRjmdqyPln9/UqUkcQ0UhWgsxGeCD5/OY4AfnrCPaG2lBTT/pi+tWqFoOaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c014a18e73b780c19a7523e190b717c37883568ebf2a8f7e7cb415a6412cb69","last_reissued_at":"2026-05-18T04:23:22.017272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:22.017272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2880","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-18T04:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bMkSxZN+PGJif2QBu/3FfSVKdsbldveZBlNsn/PD6q8xZq9BQRFRPd1uQ2yo0STmUj94Vfqdx0Ml4CEJtD5PDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:28:27.097148Z"},"content_sha256":"ca0c9d4fadaa9655a4e753dc75bdae2d6146669dded166de05f6d23eb1b42bfd","schema_version":"1.0","event_id":"sha256:ca0c9d4fadaa9655a4e753dc75bdae2d6146669dded166de05f6d23eb1b42bfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JQAUUGHHHN4AYGNHKI7BSC3RPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Min CSP on Four Elements: Moving Beyond Submodularity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Fredrik Kuivinen, Johan Thapper, Peter Jonsson","submitted_at":"2011-02-14T20:41:09Z","abstract_excerpt":"We report new results on the complexity of the valued constraint satisfaction problem (VCSP). Under the unique games conjecture, the approximability of finite-valued VCSP is fairly well-understood. However, there is yet no characterisation of VCSPs that can be solved exactly in polynomial time. This is unsatisfactory, since such results are interesting from a combinatorial optimisation perspective; there are deep connections with, for instance, submodular and bisubmodular minimisation. We consider the Min and Max CSP problems (i.e. where the cost functions only attain values in {0,1}) over fou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2880","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-18T04:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pmr/++PxxNQKfRZialaFZ6BtN9qPGaNvfBgtLveael9DotroX9QSO+pB4Id7KLBdJPTElxZiK9UDHWvLJYZJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:28:27.097763Z"},"content_sha256":"821d2b4111583643624648f1dad04e9851df5ddf38b10424e5e35787457f2d88","schema_version":"1.0","event_id":"sha256:821d2b4111583643624648f1dad04e9851df5ddf38b10424e5e35787457f2d88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQAUUGHHHN4AYGNHKI7BSC3RPQ/bundle.json","state_url":"https://pith.science/pith/JQAUUGHHHN4AYGNHKI7BSC3RPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQAUUGHHHN4AYGNHKI7BSC3RPQ/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-04T05:28:27Z","links":{"resolver":"https://pith.science/pith/JQAUUGHHHN4AYGNHKI7BSC3RPQ","bundle":"https://pith.science/pith/JQAUUGHHHN4AYGNHKI7BSC3RPQ/bundle.json","state":"https://pith.science/pith/JQAUUGHHHN4AYGNHKI7BSC3RPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQAUUGHHHN4AYGNHKI7BSC3RPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JQAUUGHHHN4AYGNHKI7BSC3RPQ","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":"432bf4d58f69439d944d4df52556e71b0a8ab679c7f17fc12d1cb964da8ba431","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-14T20:41:09Z","title_canon_sha256":"5ecd2bdd69b6fd2d95280664a40c5f0ff59b03b880255992352a292caf75234f"},"schema_version":"1.0","source":{"id":"1102.2880","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2880","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2880v2","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2880","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"JQAUUGHHHN4A","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JQAUUGHHHN4AYGNH","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JQAUUGHH","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:821d2b4111583643624648f1dad04e9851df5ddf38b10424e5e35787457f2d88","target":"graph","created_at":"2026-05-18T04:23:22Z","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 report new results on the complexity of the valued constraint satisfaction problem (VCSP). Under the unique games conjecture, the approximability of finite-valued VCSP is fairly well-understood. However, there is yet no characterisation of VCSPs that can be solved exactly in polynomial time. This is unsatisfactory, since such results are interesting from a combinatorial optimisation perspective; there are deep connections with, for instance, submodular and bisubmodular minimisation. We consider the Min and Max CSP problems (i.e. where the cost functions only attain values in {0,1}) over fou","authors_text":"Fredrik Kuivinen, Johan Thapper, Peter Jonsson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-14T20:41:09Z","title":"Min CSP on Four Elements: Moving Beyond Submodularity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2880","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:ca0c9d4fadaa9655a4e753dc75bdae2d6146669dded166de05f6d23eb1b42bfd","target":"record","created_at":"2026-05-18T04:23:22Z","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":"432bf4d58f69439d944d4df52556e71b0a8ab679c7f17fc12d1cb964da8ba431","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-14T20:41:09Z","title_canon_sha256":"5ecd2bdd69b6fd2d95280664a40c5f0ff59b03b880255992352a292caf75234f"},"schema_version":"1.0","source":{"id":"1102.2880","kind":"arxiv","version":2}},"canonical_sha256":"4c014a18e73b780c19a7523e190b717c37883568ebf2a8f7e7cb415a6412cb69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c014a18e73b780c19a7523e190b717c37883568ebf2a8f7e7cb415a6412cb69","first_computed_at":"2026-05-18T04:23:22.017272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:22.017272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZmMxUsAeS3Z6v9MBingfs7qOXNfRjmdqyPln9/UqUkcQ0UhWgsxGeCD5/OY4AfnrCPaG2lBTT/pi+tWqFoOaBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:22.017954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2880","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca0c9d4fadaa9655a4e753dc75bdae2d6146669dded166de05f6d23eb1b42bfd","sha256:821d2b4111583643624648f1dad04e9851df5ddf38b10424e5e35787457f2d88"],"state_sha256":"c870a094dfb4bc4b5338b09fd6941e0af22a2392e788ef868b808c859ae3b291"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TCsx87BTCYUC0bx3XsoZ22+QGjx++Nbsix1ruAqalXk+Cg4E8702kyGutBTGn7QVSC8/NblN2xmw7KanGcE/Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:28:27.100694Z","bundle_sha256":"f4069422943c937bb621cae92a688ebd7a388a44979f31ee1b7f662a962d5303"}}