{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KQU4UB2FE3MCBNRSVUQP5E3UI4","short_pith_number":"pith:KQU4UB2F","schema_version":"1.0","canonical_sha256":"5429ca074526d820b632ad20fe9374473315b65c01f9bc22becc56f315138afd","source":{"kind":"arxiv","id":"2507.08693","version":1},"attestation_state":"computed","paper":{"title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Euiwoong Lee, Ian DeHaan, Neng Huang","submitted_at":"2025-07-11T15:46:31Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2507.08693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-11T15:46:31Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"cc08f14052881a6db2f62df6d53ab187df257e831b3f460f6f20bb168d2a2a60","abstract_canon_sha256":"e306e6cdaa0c326c495d3dff9d7ccc76020b0fd0a2e02094accda71897c549af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:45.016215Z","signature_b64":"D9Pj2FInoRCFSxOaAIFv1aAAM1q+ywH1LSqAz2fbbrAqV/cXpDVVTjOucNTd+ggk75EfqyD9Pb5vR3TjtcOoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5429ca074526d820b632ad20fe9374473315b65c01f9bc22becc56f315138afd","last_reissued_at":"2026-07-05T11:35:45.015738Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:45.015738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Euiwoong Lee, Ian DeHaan, Neng Huang","submitted_at":"2025-07-11T15:46:31Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08693","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.08693/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.08693","created_at":"2026-07-05T11:35:45.015799+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.08693v1","created_at":"2026-07-05T11:35:45.015799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08693","created_at":"2026-07-05T11:35:45.015799+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQU4UB2FE3MC","created_at":"2026-07-05T11:35:45.015799+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQU4UB2FE3MCBNRS","created_at":"2026-07-05T11:35:45.015799+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQU4UB2F","created_at":"2026-07-05T11:35:45.015799+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KQU4UB2FE3MCBNRSVUQP5E3UI4","json":"https://pith.science/pith/KQU4UB2FE3MCBNRSVUQP5E3UI4.json","graph_json":"https://pith.science/api/pith-number/KQU4UB2FE3MCBNRSVUQP5E3UI4/graph.json","events_json":"https://pith.science/api/pith-number/KQU4UB2FE3MCBNRSVUQP5E3UI4/events.json","paper":"https://pith.science/paper/KQU4UB2F"},"agent_actions":{"view_html":"https://pith.science/pith/KQU4UB2FE3MCBNRSVUQP5E3UI4","download_json":"https://pith.science/pith/KQU4UB2FE3MCBNRSVUQP5E3UI4.json","view_paper":"https://pith.science/paper/KQU4UB2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.08693&json=true","fetch_graph":"https://pith.science/api/pith-number/KQU4UB2FE3MCBNRSVUQP5E3UI4/graph.json","fetch_events":"https://pith.science/api/pith-number/KQU4UB2FE3MCBNRSVUQP5E3UI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQU4UB2FE3MCBNRSVUQP5E3UI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQU4UB2FE3MCBNRSVUQP5E3UI4/action/storage_attestation","attest_author":"https://pith.science/pith/KQU4UB2FE3MCBNRSVUQP5E3UI4/action/author_attestation","sign_citation":"https://pith.science/pith/KQU4UB2FE3MCBNRSVUQP5E3UI4/action/citation_signature","submit_replication":"https://pith.science/pith/KQU4UB2FE3MCBNRSVUQP5E3UI4/action/replication_record"}},"created_at":"2026-07-05T11:35:45.015799+00:00","updated_at":"2026-07-05T11:35:45.015799+00:00"}