{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LFW4Y6AUSBMAM2FLLZCKJS7WFU","short_pith_number":"pith:LFW4Y6AU","schema_version":"1.0","canonical_sha256":"596dcc781490580668ab5e44a4cbf62d22040deb963d26c57eba90da938c33ca","source":{"kind":"arxiv","id":"1805.03867","version":1},"attestation_state":"computed","paper":{"title":"ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Irit Dinur, Pasin Manurangsi","submitted_at":"2018-05-10T07:46:07Z","abstract_excerpt":"We study the 2-ary constraint satisfaction problems (2-CSPs), which can be stated as follows: given a constraint graph $G=(V,E)$, an alphabet set $\\Sigma$ and, for each $\\{u, v\\}\\in E$, a constraint $C_{uv} \\subseteq \\Sigma\\times\\Sigma$, the goal is to find an assignment $\\sigma: V \\to \\Sigma$ that satisfies as many constraints as possible, where a constraint $C_{uv}$ is satisfied if $(\\sigma(u),\\sigma(v))\\in C_{uv}$.\n  While the approximability of 2-CSPs is quite well understood when $|\\Sigma|$ is constant, many problems are still open when $|\\Sigma|$ becomes super constant. One such problem "},"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":"1805.03867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-10T07:46:07Z","cross_cats_sorted":[],"title_canon_sha256":"83040f440e8d905e64c579c4616e75e7a51864fe7747092b523a258e7ba24e09","abstract_canon_sha256":"dceefa9bb4813e9bb021c74a1954b02c0faa17067370eb089559cefadbb79c3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:16.530017Z","signature_b64":"hTR/T8bE/38nrhw44tNWN2qqOm/Q74hfsH8jAAREmtpl2lkNt4m9WQVhGwpTWqgBrxKltb/Ls/oub+ddr9hcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"596dcc781490580668ab5e44a4cbf62d22040deb963d26c57eba90da938c33ca","last_reissued_at":"2026-05-18T00:16:16.529301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:16.529301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Irit Dinur, Pasin Manurangsi","submitted_at":"2018-05-10T07:46:07Z","abstract_excerpt":"We study the 2-ary constraint satisfaction problems (2-CSPs), which can be stated as follows: given a constraint graph $G=(V,E)$, an alphabet set $\\Sigma$ and, for each $\\{u, v\\}\\in E$, a constraint $C_{uv} \\subseteq \\Sigma\\times\\Sigma$, the goal is to find an assignment $\\sigma: V \\to \\Sigma$ that satisfies as many constraints as possible, where a constraint $C_{uv}$ is satisfied if $(\\sigma(u),\\sigma(v))\\in C_{uv}$.\n  While the approximability of 2-CSPs is quite well understood when $|\\Sigma|$ is constant, many problems are still open when $|\\Sigma|$ becomes super constant. One such problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03867","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":"1805.03867","created_at":"2026-05-18T00:16:16.529424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03867v1","created_at":"2026-05-18T00:16:16.529424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03867","created_at":"2026-05-18T00:16:16.529424+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFW4Y6AUSBMA","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFW4Y6AUSBMAM2FL","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFW4Y6AU","created_at":"2026-05-18T12:32:37.024351+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/LFW4Y6AUSBMAM2FLLZCKJS7WFU","json":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU.json","graph_json":"https://pith.science/api/pith-number/LFW4Y6AUSBMAM2FLLZCKJS7WFU/graph.json","events_json":"https://pith.science/api/pith-number/LFW4Y6AUSBMAM2FLLZCKJS7WFU/events.json","paper":"https://pith.science/paper/LFW4Y6AU"},"agent_actions":{"view_html":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU","download_json":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU.json","view_paper":"https://pith.science/paper/LFW4Y6AU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03867&json=true","fetch_graph":"https://pith.science/api/pith-number/LFW4Y6AUSBMAM2FLLZCKJS7WFU/graph.json","fetch_events":"https://pith.science/api/pith-number/LFW4Y6AUSBMAM2FLLZCKJS7WFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU/action/storage_attestation","attest_author":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU/action/author_attestation","sign_citation":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU/action/citation_signature","submit_replication":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU/action/replication_record"}},"created_at":"2026-05-18T00:16:16.529424+00:00","updated_at":"2026-05-18T00:16:16.529424+00:00"}