{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WBVKGNZRCG247FMSGT2S6RFBLO","short_pith_number":"pith:WBVKGNZR","schema_version":"1.0","canonical_sha256":"b06aa3373111b5cf959234f52f44a15b951a4bc4ad5901f01f974e1d4f0e1aed","source":{"kind":"arxiv","id":"1601.04935","version":2},"attestation_state":"computed","paper":{"title":"Fixed-parameter Approximability of Boolean MinCSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bingkai Lin, D\\'aniel Marx, \\'Edouard Bonnet, L\\'aszl\\'o Egri","submitted_at":"2016-01-19T14:28:37Z","abstract_excerpt":"The minimum unsatisfiability version of a constraint satisfaction problem (MinCSP) asks for an assignment where the number of unsatisfied constraints is minimum possible, or equivalently, asks for a minimum-size set of constraints whose deletion makes the instance satisfiable. For a finite set $\\Gamma$ of constraints, we denote by MinCSP($\\Gamma$) the restriction of the problem where each constraint is from $\\Gamma$. The polynomial-time solvability and the polynomial-time approximability of MinCSP($\\Gamma$) were fully characterized by Khanna et al. [Siam J. Comput. '00]. Here we study the fixe"},"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":"1601.04935","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-19T14:28:37Z","cross_cats_sorted":[],"title_canon_sha256":"12740c470f2977d27678caedc8bb3ae874d7b4deb15bd187c21e1918a25207fe","abstract_canon_sha256":"4e138e6c7df50562ad66a440b47d0ab69eaa80ff7a4700fe46827e3d5cd9c55a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:39.206253Z","signature_b64":"NmMokd9G3YvraGcFAx6gUKT5RIBxxINEe5rCb20NCE4Z6cd0Xzy+oFJmQuC4O57Mnt8kEltTqwuvgk1XO8DVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b06aa3373111b5cf959234f52f44a15b951a4bc4ad5901f01f974e1d4f0e1aed","last_reissued_at":"2026-05-18T00:16:39.205717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:39.205717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-parameter Approximability of Boolean MinCSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bingkai Lin, D\\'aniel Marx, \\'Edouard Bonnet, L\\'aszl\\'o Egri","submitted_at":"2016-01-19T14:28:37Z","abstract_excerpt":"The minimum unsatisfiability version of a constraint satisfaction problem (MinCSP) asks for an assignment where the number of unsatisfied constraints is minimum possible, or equivalently, asks for a minimum-size set of constraints whose deletion makes the instance satisfiable. For a finite set $\\Gamma$ of constraints, we denote by MinCSP($\\Gamma$) the restriction of the problem where each constraint is from $\\Gamma$. The polynomial-time solvability and the polynomial-time approximability of MinCSP($\\Gamma$) were fully characterized by Khanna et al. [Siam J. Comput. '00]. Here we study the fixe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04935","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.04935","created_at":"2026-05-18T00:16:39.205789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04935v2","created_at":"2026-05-18T00:16:39.205789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04935","created_at":"2026-05-18T00:16:39.205789+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.10369","citing_title":"Optimal FPT-Approximability for Modular Linear Equations","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO","json":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO.json","graph_json":"https://pith.science/api/pith-number/WBVKGNZRCG247FMSGT2S6RFBLO/graph.json","events_json":"https://pith.science/api/pith-number/WBVKGNZRCG247FMSGT2S6RFBLO/events.json","paper":"https://pith.science/paper/WBVKGNZR"},"agent_actions":{"view_html":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO","download_json":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO.json","view_paper":"https://pith.science/paper/WBVKGNZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04935&json=true","fetch_graph":"https://pith.science/api/pith-number/WBVKGNZRCG247FMSGT2S6RFBLO/graph.json","fetch_events":"https://pith.science/api/pith-number/WBVKGNZRCG247FMSGT2S6RFBLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO/action/storage_attestation","attest_author":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO/action/author_attestation","sign_citation":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO/action/citation_signature","submit_replication":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO/action/replication_record"}},"created_at":"2026-05-18T00:16:39.205789+00:00","updated_at":"2026-05-18T00:16:39.205789+00:00"}