{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4GYRDQ54QNZMFVJ3OGMNU775BM","short_pith_number":"pith:4GYRDQ54","schema_version":"1.0","canonical_sha256":"e1b111c3bc8372c2d53b7198da7ffd0b29f9bc2b43c9dca078f02449b7e2acfb","source":{"kind":"arxiv","id":"1807.00936","version":1},"attestation_state":"computed","paper":{"title":"A Note on Degree vs Gap of Min-Rep Label Cover and Improved Inapproximability for Connectivity Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Pasin Manurangsi","submitted_at":"2018-07-03T00:38:03Z","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"},"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":"1807.00936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-03T00:38:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"32f3c551cdeb1d52a038ff157ead54fc452d62384a65c271228fd59bced7fea1","abstract_canon_sha256":"bca2f50f2e933561681b1f149afa365ea721180c58cfb9dceec7ea7959c6f26d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:46.003231Z","signature_b64":"MWbA/nGpXBVX5/55q7AZIznCdbBSuo4PMEJ+hbF0hDfqYjVDt0GTs1EE7bu4skAc3BpdaG4AgSuKb2Up5vckAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1b111c3bc8372c2d53b7198da7ffd0b29f9bc2b43c9dca078f02449b7e2acfb","last_reissued_at":"2026-05-18T00:11:46.002654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:46.002654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Degree vs Gap of Min-Rep Label Cover and Improved Inapproximability for Connectivity Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Pasin Manurangsi","submitted_at":"2018-07-03T00:38:03Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00936","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":"1807.00936","created_at":"2026-05-18T00:11:46.002734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00936v1","created_at":"2026-05-18T00:11:46.002734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00936","created_at":"2026-05-18T00:11:46.002734+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GYRDQ54QNZM","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GYRDQ54QNZMFVJ3","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GYRDQ54","created_at":"2026-05-18T12:32:05.422762+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/4GYRDQ54QNZMFVJ3OGMNU775BM","json":"https://pith.science/pith/4GYRDQ54QNZMFVJ3OGMNU775BM.json","graph_json":"https://pith.science/api/pith-number/4GYRDQ54QNZMFVJ3OGMNU775BM/graph.json","events_json":"https://pith.science/api/pith-number/4GYRDQ54QNZMFVJ3OGMNU775BM/events.json","paper":"https://pith.science/paper/4GYRDQ54"},"agent_actions":{"view_html":"https://pith.science/pith/4GYRDQ54QNZMFVJ3OGMNU775BM","download_json":"https://pith.science/pith/4GYRDQ54QNZMFVJ3OGMNU775BM.json","view_paper":"https://pith.science/paper/4GYRDQ54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00936&json=true","fetch_graph":"https://pith.science/api/pith-number/4GYRDQ54QNZMFVJ3OGMNU775BM/graph.json","fetch_events":"https://pith.science/api/pith-number/4GYRDQ54QNZMFVJ3OGMNU775BM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GYRDQ54QNZMFVJ3OGMNU775BM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GYRDQ54QNZMFVJ3OGMNU775BM/action/storage_attestation","attest_author":"https://pith.science/pith/4GYRDQ54QNZMFVJ3OGMNU775BM/action/author_attestation","sign_citation":"https://pith.science/pith/4GYRDQ54QNZMFVJ3OGMNU775BM/action/citation_signature","submit_replication":"https://pith.science/pith/4GYRDQ54QNZMFVJ3OGMNU775BM/action/replication_record"}},"created_at":"2026-05-18T00:11:46.002734+00:00","updated_at":"2026-05-18T00:11:46.002734+00:00"}