{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WBVKGNZRCG247FMSGT2S6RFBLO","short_pith_number":"pith:WBVKGNZR","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"},"canonical_sha256":"b06aa3373111b5cf959234f52f44a15b951a4bc4ad5901f01f974e1d4f0e1aed","source":{"kind":"arxiv","id":"1601.04935","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04935","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04935v2","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04935","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"WBVKGNZRCG24","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WBVKGNZRCG247FMS","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WBVKGNZR","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WBVKGNZRCG247FMSGT2S6RFBLO","target":"record","payload":{"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"},"canonical_sha256":"b06aa3373111b5cf959234f52f44a15b951a4bc4ad5901f01f974e1d4f0e1aed","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"},"source_kind":"arxiv","source_id":"1601.04935","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-18T00:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PtXTRr43g4DxmV3hQlJQuNu4J5OOSBbTtG+W0WZvzJWiUqvZuUqIeBNtMWOwbRRomxYlO4lRy0DML82BJ/B2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:40:06.694758Z"},"content_sha256":"e04b349cfeaeb089d5ee40a2c001bf8d977d61606a04e924ba6c949677e58e82","schema_version":"1.0","event_id":"sha256:e04b349cfeaeb089d5ee40a2c001bf8d977d61606a04e924ba6c949677e58e82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WBVKGNZRCG247FMSGT2S6RFBLO","target":"graph","payload":{"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"},"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-18T00:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Mg+eZ7grn/OQ3PYHbPf75URRTK4S+mpXPhl0eRuhueYa8NJaXv06HEsE1sUmYLyd0JBIfwKNCZTJ+yz0SqmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:40:06.695113Z"},"content_sha256":"c6f38aa0b1c3c232822680d42fadca2efb661ac4481de933b33a0f9e31b5832d","schema_version":"1.0","event_id":"sha256:c6f38aa0b1c3c232822680d42fadca2efb661ac4481de933b33a0f9e31b5832d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO/bundle.json","state_url":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBVKGNZRCG247FMSGT2S6RFBLO/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-31T03:40:06Z","links":{"resolver":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO","bundle":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO/bundle.json","state":"https://pith.science/pith/WBVKGNZRCG247FMSGT2S6RFBLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBVKGNZRCG247FMSGT2S6RFBLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WBVKGNZRCG247FMSGT2S6RFBLO","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":"4e138e6c7df50562ad66a440b47d0ab69eaa80ff7a4700fe46827e3d5cd9c55a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-19T14:28:37Z","title_canon_sha256":"12740c470f2977d27678caedc8bb3ae874d7b4deb15bd187c21e1918a25207fe"},"schema_version":"1.0","source":{"id":"1601.04935","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04935","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04935v2","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04935","created_at":"2026-05-18T00:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"WBVKGNZRCG24","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WBVKGNZRCG247FMS","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WBVKGNZR","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:c6f38aa0b1c3c232822680d42fadca2efb661ac4481de933b33a0f9e31b5832d","target":"graph","created_at":"2026-05-18T00:16:39Z","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":"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","authors_text":"Bingkai Lin, D\\'aniel Marx, \\'Edouard Bonnet, L\\'aszl\\'o Egri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-19T14:28:37Z","title":"Fixed-parameter Approximability of Boolean MinCSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04935","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:e04b349cfeaeb089d5ee40a2c001bf8d977d61606a04e924ba6c949677e58e82","target":"record","created_at":"2026-05-18T00:16:39Z","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":"4e138e6c7df50562ad66a440b47d0ab69eaa80ff7a4700fe46827e3d5cd9c55a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-19T14:28:37Z","title_canon_sha256":"12740c470f2977d27678caedc8bb3ae874d7b4deb15bd187c21e1918a25207fe"},"schema_version":"1.0","source":{"id":"1601.04935","kind":"arxiv","version":2}},"canonical_sha256":"b06aa3373111b5cf959234f52f44a15b951a4bc4ad5901f01f974e1d4f0e1aed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b06aa3373111b5cf959234f52f44a15b951a4bc4ad5901f01f974e1d4f0e1aed","first_computed_at":"2026-05-18T00:16:39.205717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:39.205717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NmMokd9G3YvraGcFAx6gUKT5RIBxxINEe5rCb20NCE4Z6cd0Xzy+oFJmQuC4O57Mnt8kEltTqwuvgk1XO8DVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:39.206253Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04935","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e04b349cfeaeb089d5ee40a2c001bf8d977d61606a04e924ba6c949677e58e82","sha256:c6f38aa0b1c3c232822680d42fadca2efb661ac4481de933b33a0f9e31b5832d"],"state_sha256":"657d21b65c2eb6210abc07c89a8b17356841f8392e2c2ee49b39f976a3bdb5a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g94IfiR2v36/+arjLwCidDuaTw742q9XBl/y1QvyYe4F8piUWeQTAIkkWVnxP2BwqHcJAjIBy8e7TzapN61QCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:40:06.697079Z","bundle_sha256":"3112b144830525f14b198029bce8a3ca8c9aeea8074215c7fccbc56364f5e9a3"}}