{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KHMB7TMFLXGYM2B2H2W75E7KSN","short_pith_number":"pith:KHMB7TMF","schema_version":"1.0","canonical_sha256":"51d81fcd855dcd86683a3eadfe93ea93587d44bcb256cea9f1fc6d0d1532c162","source":{"kind":"arxiv","id":"1203.0224","version":2},"attestation_state":"computed","paper":{"title":"Label Cover instances with large girth and the hardness of approximating basic k-spanner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Michael Dinitz, Ran Raz","submitted_at":"2012-03-01T15:58:01Z","abstract_excerpt":"We study the well-known Label Cover problem under the additional requirement that problem instances have large girth. We show that if the girth is some $k$, the problem is roughly $2^{\\log^{1-\\epsilon} n/k}$ hard to approximate for all constant $\\epsilon > 0$. A similar theorem was claimed by Elkin and Peleg [ICALP 2000], but their proof was later found to have a fundamental error. We use the new proof to show inapproximability for the basic $k$-spanner problem, which is both the simplest problem in graph spanners and one of the few for which super-logarithmic hardness was not known. Assuming "},"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":"1203.0224","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-01T15:58:01Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f822fdb0f06610dd154d74e8e05e31987e4c070b642838d8687ea78797987215","abstract_canon_sha256":"aea612e8ef2582367430eff2bb651fb46b664bdb6e71612bbf7e8fd1778de24f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:51.270641Z","signature_b64":"+LliCGvuzlvD25VsVD4QYpUdcUGLScVoiaJaDqwJ/8WLlRnqCTOx/3+V67SRFsY/IddaUctitY63TAyvQwMRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51d81fcd855dcd86683a3eadfe93ea93587d44bcb256cea9f1fc6d0d1532c162","last_reissued_at":"2026-05-18T04:00:51.270045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:51.270045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Label Cover instances with large girth and the hardness of approximating basic k-spanner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Guy Kortsarz, Michael Dinitz, Ran Raz","submitted_at":"2012-03-01T15:58:01Z","abstract_excerpt":"We study the well-known Label Cover problem under the additional requirement that problem instances have large girth. We show that if the girth is some $k$, the problem is roughly $2^{\\log^{1-\\epsilon} n/k}$ hard to approximate for all constant $\\epsilon > 0$. A similar theorem was claimed by Elkin and Peleg [ICALP 2000], but their proof was later found to have a fundamental error. We use the new proof to show inapproximability for the basic $k$-spanner problem, which is both the simplest problem in graph spanners and one of the few for which super-logarithmic hardness was not known. Assuming "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0224","kind":"arxiv","version":2},"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":"1203.0224","created_at":"2026-05-18T04:00:51.270137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.0224v2","created_at":"2026-05-18T04:00:51.270137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0224","created_at":"2026-05-18T04:00:51.270137+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHMB7TMFLXGY","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHMB7TMFLXGYM2B2","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHMB7TMF","created_at":"2026-05-18T12:27:11.947152+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/KHMB7TMFLXGYM2B2H2W75E7KSN","json":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN.json","graph_json":"https://pith.science/api/pith-number/KHMB7TMFLXGYM2B2H2W75E7KSN/graph.json","events_json":"https://pith.science/api/pith-number/KHMB7TMFLXGYM2B2H2W75E7KSN/events.json","paper":"https://pith.science/paper/KHMB7TMF"},"agent_actions":{"view_html":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN","download_json":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN.json","view_paper":"https://pith.science/paper/KHMB7TMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.0224&json=true","fetch_graph":"https://pith.science/api/pith-number/KHMB7TMFLXGYM2B2H2W75E7KSN/graph.json","fetch_events":"https://pith.science/api/pith-number/KHMB7TMFLXGYM2B2H2W75E7KSN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN/action/storage_attestation","attest_author":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN/action/author_attestation","sign_citation":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN/action/citation_signature","submit_replication":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN/action/replication_record"}},"created_at":"2026-05-18T04:00:51.270137+00:00","updated_at":"2026-05-18T04:00:51.270137+00:00"}