{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HKO2E6V2STADINHWSTMZREKIWY","short_pith_number":"pith:HKO2E6V2","schema_version":"1.0","canonical_sha256":"3a9da27aba94c03434f694d9989148b63046092f1cd5be409f390b801a2028ad","source":{"kind":"arxiv","id":"1110.2953","version":1},"attestation_state":"computed","paper":{"title":"Approximation for Maximum Surjective Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hang Zhou, Walter Bach","submitted_at":"2011-10-13T14:12:41Z","abstract_excerpt":"Maximum surjective constraint satisfaction problems (Max-Sur-CSPs) are computational problems where we are given a set of variables denoting values from a finite domain B and a set of constraints on the variables. A solution to such a problem is a surjective mapping from the set of variables to B such that the number of satisfied constraints is maximized. We study the approximation performance that can be acccchieved by algorithms for these problems, mainly by investigating their relation with Max-CSPs (which are the corresponding problems without the surjectivity requirement). Our work gives "},"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":"1110.2953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-13T14:12:41Z","cross_cats_sorted":[],"title_canon_sha256":"aa9e9e977ed715a7909ff44383b93a39cec1f428bed33fefdc2032c595e5df7c","abstract_canon_sha256":"334b509a6dff2f491825d1a05d237b61231142b78ceef4d293b7ea3f08d894ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:06.577235Z","signature_b64":"oSQ5e+2QQ2XQ/ykK194nZbef070mg8cwP08b4W3hRnk/YyrLqK2ZsSNhV6mwFAE47woUeBcqLwmJEFuPCqBBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a9da27aba94c03434f694d9989148b63046092f1cd5be409f390b801a2028ad","last_reissued_at":"2026-05-18T04:11:06.576676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:06.576676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation for Maximum Surjective Constraint Satisfaction Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hang Zhou, Walter Bach","submitted_at":"2011-10-13T14:12:41Z","abstract_excerpt":"Maximum surjective constraint satisfaction problems (Max-Sur-CSPs) are computational problems where we are given a set of variables denoting values from a finite domain B and a set of constraints on the variables. A solution to such a problem is a surjective mapping from the set of variables to B such that the number of satisfied constraints is maximized. We study the approximation performance that can be acccchieved by algorithms for these problems, mainly by investigating their relation with Max-CSPs (which are the corresponding problems without the surjectivity requirement). Our work gives "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2953","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":""},"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":"1110.2953","created_at":"2026-05-18T04:11:06.576747+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.2953v1","created_at":"2026-05-18T04:11:06.576747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2953","created_at":"2026-05-18T04:11:06.576747+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKO2E6V2STAD","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKO2E6V2STADINHW","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKO2E6V2","created_at":"2026-05-18T12:26:30.835961+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/HKO2E6V2STADINHWSTMZREKIWY","json":"https://pith.science/pith/HKO2E6V2STADINHWSTMZREKIWY.json","graph_json":"https://pith.science/api/pith-number/HKO2E6V2STADINHWSTMZREKIWY/graph.json","events_json":"https://pith.science/api/pith-number/HKO2E6V2STADINHWSTMZREKIWY/events.json","paper":"https://pith.science/paper/HKO2E6V2"},"agent_actions":{"view_html":"https://pith.science/pith/HKO2E6V2STADINHWSTMZREKIWY","download_json":"https://pith.science/pith/HKO2E6V2STADINHWSTMZREKIWY.json","view_paper":"https://pith.science/paper/HKO2E6V2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.2953&json=true","fetch_graph":"https://pith.science/api/pith-number/HKO2E6V2STADINHWSTMZREKIWY/graph.json","fetch_events":"https://pith.science/api/pith-number/HKO2E6V2STADINHWSTMZREKIWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKO2E6V2STADINHWSTMZREKIWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKO2E6V2STADINHWSTMZREKIWY/action/storage_attestation","attest_author":"https://pith.science/pith/HKO2E6V2STADINHWSTMZREKIWY/action/author_attestation","sign_citation":"https://pith.science/pith/HKO2E6V2STADINHWSTMZREKIWY/action/citation_signature","submit_replication":"https://pith.science/pith/HKO2E6V2STADINHWSTMZREKIWY/action/replication_record"}},"created_at":"2026-05-18T04:11:06.576747+00:00","updated_at":"2026-05-18T04:11:06.576747+00:00"}