{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KQU4UB2FE3MCBNRSVUQP5E3UI4","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":"e306e6cdaa0c326c495d3dff9d7ccc76020b0fd0a2e02094accda71897c549af","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-11T15:46:31Z","title_canon_sha256":"cc08f14052881a6db2f62df6d53ab187df257e831b3f460f6f20bb168d2a2a60"},"schema_version":"1.0","source":{"id":"2507.08693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.08693","created_at":"2026-07-05T11:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"2507.08693v1","created_at":"2026-07-05T11:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08693","created_at":"2026-07-05T11:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"KQU4UB2FE3MC","created_at":"2026-07-05T11:35:45Z"},{"alias_kind":"pith_short_16","alias_value":"KQU4UB2FE3MCBNRS","created_at":"2026-07-05T11:35:45Z"},{"alias_kind":"pith_short_8","alias_value":"KQU4UB2F","created_at":"2026-07-05T11:35:45Z"}],"graph_snapshots":[{"event_id":"sha256:8b64a3d92958c79c894609cb0ec61c6bfbcac27973567b0e4806d504122542c4","target":"graph","created_at":"2026-07-05T11:35:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.08693/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study minimum cost constraint satisfaction problems (MinCostCSP) through the algebraic lens. We show that for any constraint language $\\Gamma$ which has the dual discriminator operation as a polymorphism, there exists a $|D|$-approximation algorithm for MinCostCSP$(\\Gamma)$ where $D$ is the domain. Complementing our algorithmic result, we show that any constraint language $\\Gamma$ where MinCostCSP$(\\Gamma)$ admits a constant-factor approximation must have a \\emph{near-unanimity} (NU) polymorphism unless P = NP, extending a similar result by Dalmau et al. on MinCSPs. These results imply a di","authors_text":"Euiwoong Lee, Ian DeHaan, Neng Huang","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-11T15:46:31Z","title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08693","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:ed0a7b310cb4f42e96500daff6ddedf778a26ff1e3d44826bca6aebce2ff6752","target":"record","created_at":"2026-07-05T11:35:45Z","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":"e306e6cdaa0c326c495d3dff9d7ccc76020b0fd0a2e02094accda71897c549af","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-11T15:46:31Z","title_canon_sha256":"cc08f14052881a6db2f62df6d53ab187df257e831b3f460f6f20bb168d2a2a60"},"schema_version":"1.0","source":{"id":"2507.08693","kind":"arxiv","version":1}},"canonical_sha256":"5429ca074526d820b632ad20fe9374473315b65c01f9bc22becc56f315138afd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5429ca074526d820b632ad20fe9374473315b65c01f9bc22becc56f315138afd","first_computed_at":"2026-07-05T11:35:45.015738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:35:45.015738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D9Pj2FInoRCFSxOaAIFv1aAAM1q+ywH1LSqAz2fbbrAqV/cXpDVVTjOucNTd+ggk75EfqyD9Pb5vR3TjtcOoAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:35:45.016215Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.08693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed0a7b310cb4f42e96500daff6ddedf778a26ff1e3d44826bca6aebce2ff6752","sha256:8b64a3d92958c79c894609cb0ec61c6bfbcac27973567b0e4806d504122542c4"],"state_sha256":"61a6d202556a7fd9cf06221dd771dd0ad122c08f38f940fe77cf70d06c7243ca"}