{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QUHLETE6MUF62G5GYWYH425FDQ","short_pith_number":"pith:QUHLETE6","canonical_record":{"source":{"id":"1511.05546","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-11-17T20:51:47Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"47352b75535d189008466037c588d9167a35b279a7edd2cd7ca275fdf37df019","abstract_canon_sha256":"a5a67196dfa169a89c4e639bb6956ac8f50388c0957257eaabc939146b749fb8"},"schema_version":"1.0"},"canonical_sha256":"850eb24c9e650bed1ba6c5b07e6ba51c07224d6c47a559e4d9ed1fbd77228f2a","source":{"kind":"arxiv","id":"1511.05546","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05546","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05546v2","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05546","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"QUHLETE6MUF6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUHLETE6MUF62G5G","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUHLETE6","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QUHLETE6MUF62G5GYWYH425FDQ","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05546","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-11-17T20:51:47Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"47352b75535d189008466037c588d9167a35b279a7edd2cd7ca275fdf37df019","abstract_canon_sha256":"a5a67196dfa169a89c4e639bb6956ac8f50388c0957257eaabc939146b749fb8"},"schema_version":"1.0"},"canonical_sha256":"850eb24c9e650bed1ba6c5b07e6ba51c07224d6c47a559e4d9ed1fbd77228f2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:55.472994Z","signature_b64":"FTUJQuqj2hozAVsZYI3KltCA9mcHVyzJvyc16XAwTmTNlPwtjX40M5LgF/r7021kZbJG9cqV+si7xoJ/ihH+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"850eb24c9e650bed1ba6c5b07e6ba51c07224d6c47a559e4d9ed1fbd77228f2a","last_reissued_at":"2026-05-18T00:17:55.472303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:55.472303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05546","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:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DsmDRESfplUIhK7NJ9KgpxHfhvtaK2fKMgUkOPYHA6ghsSwa5heahYngk3Fh4X3aNIBZy5wzKmJbSofrsbHbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:56:57.551269Z"},"content_sha256":"b909a9eec5a3aa4f6eb7eac29b36defda280704647fd0f012c7d4eef4ee5c736","schema_version":"1.0","event_id":"sha256:b909a9eec5a3aa4f6eb7eac29b36defda280704647fd0f012c7d4eef4ee5c736"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QUHLETE6MUF62G5GYWYH425FDQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity and Approximability of Parameterized MAX-CSPs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Eun Jung Kim, Holger Dell, Michael Lampis, Tobias M\\\"omke, Valia Mitsou","submitted_at":"2015-11-17T20:51:47Z","abstract_excerpt":"We study the optimization version of constraint satisfaction problems (Max-CSPs) in the framework of parameterized complexity; the goal is to compute the maximum fraction of constraints that can be satisfied simultaneously. In standard CSPs, we want to decide whether this fraction equals one. The parameters we investigate are structural measures, such as the treewidth or the clique-width of the variable-constraint incidence graph of the CSP instance.\n  We consider Max-CSPs with the constraint types AND, OR, PARITY, and MAJORITY, and with various parameters k, and we attempt to fully classify t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05546","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:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5wEfb3PzImnT/QttXVeS8MiokEOqF3dTSpZjpAEk9WlxfYwPE8gxu1pc0K1CmzdUMEtCuQKXMijA1cVBbctAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:56:57.551643Z"},"content_sha256":"cc57a17572b904dd76c52c6c2206d26c7dc9368ed0cd3ae7bfb52baa61555421","schema_version":"1.0","event_id":"sha256:cc57a17572b904dd76c52c6c2206d26c7dc9368ed0cd3ae7bfb52baa61555421"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUHLETE6MUF62G5GYWYH425FDQ/bundle.json","state_url":"https://pith.science/pith/QUHLETE6MUF62G5GYWYH425FDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUHLETE6MUF62G5GYWYH425FDQ/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-01T14:56:57Z","links":{"resolver":"https://pith.science/pith/QUHLETE6MUF62G5GYWYH425FDQ","bundle":"https://pith.science/pith/QUHLETE6MUF62G5GYWYH425FDQ/bundle.json","state":"https://pith.science/pith/QUHLETE6MUF62G5GYWYH425FDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUHLETE6MUF62G5GYWYH425FDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QUHLETE6MUF62G5GYWYH425FDQ","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":"a5a67196dfa169a89c4e639bb6956ac8f50388c0957257eaabc939146b749fb8","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-11-17T20:51:47Z","title_canon_sha256":"47352b75535d189008466037c588d9167a35b279a7edd2cd7ca275fdf37df019"},"schema_version":"1.0","source":{"id":"1511.05546","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05546","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05546v2","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05546","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"QUHLETE6MUF6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QUHLETE6MUF62G5G","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QUHLETE6","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:cc57a17572b904dd76c52c6c2206d26c7dc9368ed0cd3ae7bfb52baa61555421","target":"graph","created_at":"2026-05-18T00:17:55Z","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 study the optimization version of constraint satisfaction problems (Max-CSPs) in the framework of parameterized complexity; the goal is to compute the maximum fraction of constraints that can be satisfied simultaneously. In standard CSPs, we want to decide whether this fraction equals one. The parameters we investigate are structural measures, such as the treewidth or the clique-width of the variable-constraint incidence graph of the CSP instance.\n  We consider Max-CSPs with the constraint types AND, OR, PARITY, and MAJORITY, and with various parameters k, and we attempt to fully classify t","authors_text":"Eun Jung Kim, Holger Dell, Michael Lampis, Tobias M\\\"omke, Valia Mitsou","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-11-17T20:51:47Z","title":"Complexity and Approximability of Parameterized MAX-CSPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05546","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:b909a9eec5a3aa4f6eb7eac29b36defda280704647fd0f012c7d4eef4ee5c736","target":"record","created_at":"2026-05-18T00:17:55Z","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":"a5a67196dfa169a89c4e639bb6956ac8f50388c0957257eaabc939146b749fb8","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-11-17T20:51:47Z","title_canon_sha256":"47352b75535d189008466037c588d9167a35b279a7edd2cd7ca275fdf37df019"},"schema_version":"1.0","source":{"id":"1511.05546","kind":"arxiv","version":2}},"canonical_sha256":"850eb24c9e650bed1ba6c5b07e6ba51c07224d6c47a559e4d9ed1fbd77228f2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"850eb24c9e650bed1ba6c5b07e6ba51c07224d6c47a559e4d9ed1fbd77228f2a","first_computed_at":"2026-05-18T00:17:55.472303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:55.472303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FTUJQuqj2hozAVsZYI3KltCA9mcHVyzJvyc16XAwTmTNlPwtjX40M5LgF/r7021kZbJG9cqV+si7xoJ/ihH+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:55.472994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05546","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b909a9eec5a3aa4f6eb7eac29b36defda280704647fd0f012c7d4eef4ee5c736","sha256:cc57a17572b904dd76c52c6c2206d26c7dc9368ed0cd3ae7bfb52baa61555421"],"state_sha256":"7620a28fe2d15c386949fa5aba6a8bf009cae46801d3d02c958981287937dcef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BMzXb1z3J0a+Q/PBlGaptyudHA8oJ/RDf+HCw0YTrPMzmT0/4/fV5Fo2soxshFPcCco3VtnicuLvGYk4Fg8FAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:56:57.553713Z","bundle_sha256":"3d4f8d9333be27dff0b4463f6b27812e220e2a1dce3779f00d14df456c09228c"}}