{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VIE2VAMFHK2FUYSE3YLWEWAC4V","short_pith_number":"pith:VIE2VAMF","schema_version":"1.0","canonical_sha256":"aa09aa81853ab45a6244de17625802e5463e100e61def5abcdce2004aa1e4c84","source":{"kind":"arxiv","id":"1301.2731","version":1},"attestation_state":"computed","paper":{"title":"A Characterization of Approximation Resistance for Even $k$-Partite CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Per Austrin, Subhash Khot","submitted_at":"2013-01-12T23:04:32Z","abstract_excerpt":"A constraint satisfaction problem (CSP) is said to be \\emph{approximation resistant} if it is hard to approximate better than the trivial algorithm which picks a uniformly random assignment. Assuming the Unique Games Conjecture, we give a characterization of approximation resistance for $k$-partite CSPs defined by an even predicate."},"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":"1301.2731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-12T23:04:32Z","cross_cats_sorted":[],"title_canon_sha256":"207d45513a668281c85c4e0c681191a865f6caf799cf96480b73fab973ed7e08","abstract_canon_sha256":"8a7b910fd1fabd2eda5873056db0bdab03bd98df7f7dcd3b99a7eb357eb4f6f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:35.413653Z","signature_b64":"TXc5Cu5Bx+3CmqIFvhtX5JdayQBmXzCrMiL2pDxxTNi+R52Nuko4wDfvIhtZChOfAW3NR3+DLLEy0dYv6hP9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa09aa81853ab45a6244de17625802e5463e100e61def5abcdce2004aa1e4c84","last_reissued_at":"2026-05-18T03:36:35.412861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:35.412861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Characterization of Approximation Resistance for Even $k$-Partite CSPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Per Austrin, Subhash Khot","submitted_at":"2013-01-12T23:04:32Z","abstract_excerpt":"A constraint satisfaction problem (CSP) is said to be \\emph{approximation resistant} if it is hard to approximate better than the trivial algorithm which picks a uniformly random assignment. Assuming the Unique Games Conjecture, we give a characterization of approximation resistance for $k$-partite CSPs defined by an even predicate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2731","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":"1301.2731","created_at":"2026-05-18T03:36:35.412986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.2731v1","created_at":"2026-05-18T03:36:35.412986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2731","created_at":"2026-05-18T03:36:35.412986+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIE2VAMFHK2F","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIE2VAMFHK2FUYSE","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIE2VAMF","created_at":"2026-05-18T12:28:04.890932+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/VIE2VAMFHK2FUYSE3YLWEWAC4V","json":"https://pith.science/pith/VIE2VAMFHK2FUYSE3YLWEWAC4V.json","graph_json":"https://pith.science/api/pith-number/VIE2VAMFHK2FUYSE3YLWEWAC4V/graph.json","events_json":"https://pith.science/api/pith-number/VIE2VAMFHK2FUYSE3YLWEWAC4V/events.json","paper":"https://pith.science/paper/VIE2VAMF"},"agent_actions":{"view_html":"https://pith.science/pith/VIE2VAMFHK2FUYSE3YLWEWAC4V","download_json":"https://pith.science/pith/VIE2VAMFHK2FUYSE3YLWEWAC4V.json","view_paper":"https://pith.science/paper/VIE2VAMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.2731&json=true","fetch_graph":"https://pith.science/api/pith-number/VIE2VAMFHK2FUYSE3YLWEWAC4V/graph.json","fetch_events":"https://pith.science/api/pith-number/VIE2VAMFHK2FUYSE3YLWEWAC4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIE2VAMFHK2FUYSE3YLWEWAC4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIE2VAMFHK2FUYSE3YLWEWAC4V/action/storage_attestation","attest_author":"https://pith.science/pith/VIE2VAMFHK2FUYSE3YLWEWAC4V/action/author_attestation","sign_citation":"https://pith.science/pith/VIE2VAMFHK2FUYSE3YLWEWAC4V/action/citation_signature","submit_replication":"https://pith.science/pith/VIE2VAMFHK2FUYSE3YLWEWAC4V/action/replication_record"}},"created_at":"2026-05-18T03:36:35.412986+00:00","updated_at":"2026-05-18T03:36:35.412986+00:00"}