{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4GYRDQ54QNZMFVJ3OGMNU775BM","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":"bca2f50f2e933561681b1f149afa365ea721180c58cfb9dceec7ea7959c6f26d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-03T00:38:03Z","title_canon_sha256":"32f3c551cdeb1d52a038ff157ead54fc452d62384a65c271228fd59bced7fea1"},"schema_version":"1.0","source":{"id":"1807.00936","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00936","created_at":"2026-05-18T00:11:46Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00936v1","created_at":"2026-05-18T00:11:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00936","created_at":"2026-05-18T00:11:46Z"},{"alias_kind":"pith_short_12","alias_value":"4GYRDQ54QNZM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4GYRDQ54QNZMFVJ3","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4GYRDQ54","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:278f6df169c4aa622034521def43278b3e4d23406a5a82a37ab5c2432d410ecf","target":"graph","created_at":"2026-05-18T00:11:46Z","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":"This note concerns the trade-off between the degree of the constraint graph and the gap in hardness of approximating the Min-Rep variant of Label Cover (aka Projection Game). We make a very simple observation that, for NP-hardness with gap $g$, the degree can be made as small as $O(g \\log g)$, which improves upon the previous $\\tilde{O}(g^{1/2})$ bound from a work of Laekhanukit (SODA'14). Note that our bound is optimal up to a logarithmic factor since there is a trivial $\\Delta$-approximation for Min-Rep where $\\Delta$ is the maximum degree of the constraint graph.\n  Thanks to known reduction","authors_text":"Pasin Manurangsi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-03T00:38:03Z","title":"A Note on Degree vs Gap of Min-Rep Label Cover and Improved Inapproximability for Connectivity Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00936","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:3fb70115a080c97684fec2ed245585122eea0cfe3528380d7233ae6725017e06","target":"record","created_at":"2026-05-18T00:11:46Z","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":"bca2f50f2e933561681b1f149afa365ea721180c58cfb9dceec7ea7959c6f26d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-03T00:38:03Z","title_canon_sha256":"32f3c551cdeb1d52a038ff157ead54fc452d62384a65c271228fd59bced7fea1"},"schema_version":"1.0","source":{"id":"1807.00936","kind":"arxiv","version":1}},"canonical_sha256":"e1b111c3bc8372c2d53b7198da7ffd0b29f9bc2b43c9dca078f02449b7e2acfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1b111c3bc8372c2d53b7198da7ffd0b29f9bc2b43c9dca078f02449b7e2acfb","first_computed_at":"2026-05-18T00:11:46.002654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:46.002654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MWbA/nGpXBVX5/55q7AZIznCdbBSuo4PMEJ+hbF0hDfqYjVDt0GTs1EE7bu4skAc3BpdaG4AgSuKb2Up5vckAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:46.003231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00936","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fb70115a080c97684fec2ed245585122eea0cfe3528380d7233ae6725017e06","sha256:278f6df169c4aa622034521def43278b3e4d23406a5a82a37ab5c2432d410ecf"],"state_sha256":"4375547b4cdf32e51b4af8e026f8aeef9fc41cbaf3100de749625468bfe01960"}