{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:XFVU7KJXPTNL62IWXLRF7VRY65","short_pith_number":"pith:XFVU7KJX","canonical_record":{"source":{"id":"cs/0602075","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2006-02-21T14:13:37Z","cross_cats_sorted":[],"title_canon_sha256":"5b87522a173a39c7d65a7e18d9742fa73d065d5242ede33d15640d9501b88fd6","abstract_canon_sha256":"b577098325d81494a58a67152bbec8dc0d74278a7a33831f245d8623a427ddb9"},"schema_version":"1.0"},"canonical_sha256":"b96b4fa9377cdabf6916bae25fd638f757b0103a3a2a829d49870030ae88283a","source":{"kind":"arxiv","id":"cs/0602075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0602075","created_at":"2026-07-04T14:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0602075v1","created_at":"2026-07-04T14:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602075","created_at":"2026-07-04T14:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"XFVU7KJXPTNL","created_at":"2026-07-04T14:53:18Z"},{"alias_kind":"pith_short_16","alias_value":"XFVU7KJXPTNL62IW","created_at":"2026-07-04T14:53:18Z"},{"alias_kind":"pith_short_8","alias_value":"XFVU7KJX","created_at":"2026-07-04T14:53:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:XFVU7KJXPTNL62IWXLRF7VRY65","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0602075","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CC","submitted_at":"2006-02-21T14:13:37Z","cross_cats_sorted":[],"title_canon_sha256":"5b87522a173a39c7d65a7e18d9742fa73d065d5242ede33d15640d9501b88fd6","abstract_canon_sha256":"b577098325d81494a58a67152bbec8dc0d74278a7a33831f245d8623a427ddb9"},"schema_version":"1.0"},"canonical_sha256":"b96b4fa9377cdabf6916bae25fd638f757b0103a3a2a829d49870030ae88283a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:53:18.964922Z","signature_b64":"yjKZUtqBj/Gi2odGTMX7TWghlYPH0Vq/2pG9QsI1R3bA4EX1hCNvdc6K86BDFgDiPPRZXcjTq4N9MPKNTWyQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b96b4fa9377cdabf6916bae25fd638f757b0103a3a2a829d49870030ae88283a","last_reissued_at":"2026-07-04T14:53:18.963489Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:53:18.963489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0602075","source_version":1,"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-07-04T14:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w59kQw54wDA7BMOaCjnV0hElOlhgoA0gZ//VIA+kcN/yiInmsGaMYC2ybO5VZHeILPTTF6PhycNJ5Zd0xH8BBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:18:22.616535Z"},"content_sha256":"f06e0576114d280e2c471a4451eaa8d455ce55fdd3bdd74679edfefe2977a4c7","schema_version":"1.0","event_id":"sha256:f06e0576114d280e2c471a4451eaa8d455ce55fdd3bdd74679edfefe2977a4c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:XFVU7KJXPTNL62IWXLRF7VRY65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The approximability of MAX CSP with fixed-value constraints","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrei Krokhin, Mikael Klasson, Peter Jonsson, Vladimir Deineko","submitted_at":"2006-02-21T14:13:37Z","abstract_excerpt":"In the maximum constraint satisfaction problem (MAX CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied constraints. This problem is NP-hard in general, and, therefore, it is natural to study how restricting the allowed types of constraints affects the approximability of the problem. In this paper, we show that any MAX CSP problem with a finite set of allowed constraint types, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0602075","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/cs/0602075/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"},"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-07-04T14:53:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01Wk0vbXDNhdVwjeOjf69fgSwRFDf1SugYAKoKGsEdP6M35hr74fZRD5Hv3bhW17WUnNXTGUQ4xEEkwO2Dw/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:18:22.616915Z"},"content_sha256":"2875433badc109c337c6b14ca6fee06e64eb60227545f36e9e4730d01b79c932","schema_version":"1.0","event_id":"sha256:2875433badc109c337c6b14ca6fee06e64eb60227545f36e9e4730d01b79c932"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFVU7KJXPTNL62IWXLRF7VRY65/bundle.json","state_url":"https://pith.science/pith/XFVU7KJXPTNL62IWXLRF7VRY65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFVU7KJXPTNL62IWXLRF7VRY65/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-07-04T18:18:22Z","links":{"resolver":"https://pith.science/pith/XFVU7KJXPTNL62IWXLRF7VRY65","bundle":"https://pith.science/pith/XFVU7KJXPTNL62IWXLRF7VRY65/bundle.json","state":"https://pith.science/pith/XFVU7KJXPTNL62IWXLRF7VRY65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFVU7KJXPTNL62IWXLRF7VRY65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:XFVU7KJXPTNL62IWXLRF7VRY65","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":"b577098325d81494a58a67152bbec8dc0d74278a7a33831f245d8623a427ddb9","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2006-02-21T14:13:37Z","title_canon_sha256":"5b87522a173a39c7d65a7e18d9742fa73d065d5242ede33d15640d9501b88fd6"},"schema_version":"1.0","source":{"id":"cs/0602075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0602075","created_at":"2026-07-04T14:53:18Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0602075v1","created_at":"2026-07-04T14:53:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602075","created_at":"2026-07-04T14:53:18Z"},{"alias_kind":"pith_short_12","alias_value":"XFVU7KJXPTNL","created_at":"2026-07-04T14:53:18Z"},{"alias_kind":"pith_short_16","alias_value":"XFVU7KJXPTNL62IW","created_at":"2026-07-04T14:53:18Z"},{"alias_kind":"pith_short_8","alias_value":"XFVU7KJX","created_at":"2026-07-04T14:53:18Z"}],"graph_snapshots":[{"event_id":"sha256:2875433badc109c337c6b14ca6fee06e64eb60227545f36e9e4730d01b79c932","target":"graph","created_at":"2026-07-04T14:53:18Z","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/cs/0602075/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the maximum constraint satisfaction problem (MAX CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied constraints. This problem is NP-hard in general, and, therefore, it is natural to study how restricting the allowed types of constraints affects the approximability of the problem. In this paper, we show that any MAX CSP problem with a finite set of allowed constraint types, ","authors_text":"Andrei Krokhin, Mikael Klasson, Peter Jonsson, Vladimir Deineko","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"2006-02-21T14:13:37Z","title":"The approximability of MAX CSP with fixed-value constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0602075","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:f06e0576114d280e2c471a4451eaa8d455ce55fdd3bdd74679edfefe2977a4c7","target":"record","created_at":"2026-07-04T14:53:18Z","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":"b577098325d81494a58a67152bbec8dc0d74278a7a33831f245d8623a427ddb9","cross_cats_sorted":[],"license":"","primary_cat":"cs.CC","submitted_at":"2006-02-21T14:13:37Z","title_canon_sha256":"5b87522a173a39c7d65a7e18d9742fa73d065d5242ede33d15640d9501b88fd6"},"schema_version":"1.0","source":{"id":"cs/0602075","kind":"arxiv","version":1}},"canonical_sha256":"b96b4fa9377cdabf6916bae25fd638f757b0103a3a2a829d49870030ae88283a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b96b4fa9377cdabf6916bae25fd638f757b0103a3a2a829d49870030ae88283a","first_computed_at":"2026-07-04T14:53:18.963489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:53:18.963489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yjKZUtqBj/Gi2odGTMX7TWghlYPH0Vq/2pG9QsI1R3bA4EX1hCNvdc6K86BDFgDiPPRZXcjTq4N9MPKNTWyQDg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:53:18.964922Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0602075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f06e0576114d280e2c471a4451eaa8d455ce55fdd3bdd74679edfefe2977a4c7","sha256:2875433badc109c337c6b14ca6fee06e64eb60227545f36e9e4730d01b79c932"],"state_sha256":"85eed9dccc13f501d5e8fe4aa7776b03e416e42c54a855b3c1d9bba9b9de929e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OB0SCHI/2pH/HcpFJAsQxBWKxxtWhU5jrWcvdw1RXLISXI7pK+wNaqt/Xe8ufPKDO5p3y+8K6VLie3CR+Q0MCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T18:18:22.619116Z","bundle_sha256":"bd1f61344b3cff4966c2aceea45223bd215a463494379be81537c891f587a39b"}}