{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LFW4Y6AUSBMAM2FLLZCKJS7WFU","short_pith_number":"pith:LFW4Y6AU","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"},"canonical_sha256":"596dcc781490580668ab5e44a4cbf62d22040deb963d26c57eba90da938c33ca","source":{"kind":"arxiv","id":"1805.03867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03867","created_at":"2026-05-18T00:16:16Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03867v1","created_at":"2026-05-18T00:16:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03867","created_at":"2026-05-18T00:16:16Z"},{"alias_kind":"pith_short_12","alias_value":"LFW4Y6AUSBMA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LFW4Y6AUSBMAM2FL","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LFW4Y6AU","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LFW4Y6AUSBMAM2FLLZCKJS7WFU","target":"record","payload":{"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"},"canonical_sha256":"596dcc781490580668ab5e44a4cbf62d22040deb963d26c57eba90da938c33ca","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"},"source_kind":"arxiv","source_id":"1805.03867","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-05-18T00:16:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qELYSmVgMiT9UWYhlLNWbpbb5zqgiuoCh7AzMpehCUg0EZDPfYgdl47TxveybWSJYqgTKLrwNsudAE0AZAENAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:20:32.914543Z"},"content_sha256":"32c3efd27f05d5c326b60110e46c28cc2e8e15ec8ec39bb7099afe64259ce959","schema_version":"1.0","event_id":"sha256:32c3efd27f05d5c326b60110e46c28cc2e8e15ec8ec39bb7099afe64259ce959"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LFW4Y6AUSBMAM2FLLZCKJS7WFU","target":"graph","payload":{"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"},"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:16:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NoRne2vhVB9Rv+moFh7CkEAojxUHEBMOmVu+yFNWwK7t5xG8YqzT+mkOWwyxBLzbNmH1r6TGoT3nn5v4HqarBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:20:32.914895Z"},"content_sha256":"1419a1b8af00df233ba2e62de25c4c1402a150d7453c18c5476ecca7986a1188","schema_version":"1.0","event_id":"sha256:1419a1b8af00df233ba2e62de25c4c1402a150d7453c18c5476ecca7986a1188"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU/bundle.json","state_url":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU/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-02T04:20:32Z","links":{"resolver":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU","bundle":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU/bundle.json","state":"https://pith.science/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFW4Y6AUSBMAM2FLLZCKJS7WFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LFW4Y6AUSBMAM2FLLZCKJS7WFU","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":"dceefa9bb4813e9bb021c74a1954b02c0faa17067370eb089559cefadbb79c3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-10T07:46:07Z","title_canon_sha256":"83040f440e8d905e64c579c4616e75e7a51864fe7747092b523a258e7ba24e09"},"schema_version":"1.0","source":{"id":"1805.03867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03867","created_at":"2026-05-18T00:16:16Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03867v1","created_at":"2026-05-18T00:16:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03867","created_at":"2026-05-18T00:16:16Z"},{"alias_kind":"pith_short_12","alias_value":"LFW4Y6AUSBMA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LFW4Y6AUSBMAM2FL","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LFW4Y6AU","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:1419a1b8af00df233ba2e62de25c4c1402a150d7453c18c5476ecca7986a1188","target":"graph","created_at":"2026-05-18T00:16:16Z","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 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 ","authors_text":"Irit Dinur, Pasin Manurangsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-10T07:46:07Z","title":"ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03867","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:32c3efd27f05d5c326b60110e46c28cc2e8e15ec8ec39bb7099afe64259ce959","target":"record","created_at":"2026-05-18T00:16:16Z","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":"dceefa9bb4813e9bb021c74a1954b02c0faa17067370eb089559cefadbb79c3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-10T07:46:07Z","title_canon_sha256":"83040f440e8d905e64c579c4616e75e7a51864fe7747092b523a258e7ba24e09"},"schema_version":"1.0","source":{"id":"1805.03867","kind":"arxiv","version":1}},"canonical_sha256":"596dcc781490580668ab5e44a4cbf62d22040deb963d26c57eba90da938c33ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"596dcc781490580668ab5e44a4cbf62d22040deb963d26c57eba90da938c33ca","first_computed_at":"2026-05-18T00:16:16.529301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:16.529301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hTR/T8bE/38nrhw44tNWN2qqOm/Q74hfsH8jAAREmtpl2lkNt4m9WQVhGwpTWqgBrxKltb/Ls/oub+ddr9hcDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:16.530017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32c3efd27f05d5c326b60110e46c28cc2e8e15ec8ec39bb7099afe64259ce959","sha256:1419a1b8af00df233ba2e62de25c4c1402a150d7453c18c5476ecca7986a1188"],"state_sha256":"f5c7e4be29bc2857d67e62365934b50537ef16f4a464147a529edd0cc99c9ffa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JmmbWM1z+8k9DuFMol1CG+IetcKKHyUOuU07C1Mm3FY9XHpuD/0AGPzdmh25I15WoW1DgDOyfcH0SOk3OQO6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:20:32.916911Z","bundle_sha256":"3937a0cf938bdc7cba1353b23c5b11ae671428264052525a0d0e12b2b2491e24"}}