{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KHMB7TMFLXGYM2B2H2W75E7KSN","short_pith_number":"pith:KHMB7TMF","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"},"canonical_sha256":"51d81fcd855dcd86683a3eadfe93ea93587d44bcb256cea9f1fc6d0d1532c162","source":{"kind":"arxiv","id":"1203.0224","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0224","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0224v2","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0224","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"pith_short_12","alias_value":"KHMB7TMFLXGY","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KHMB7TMFLXGYM2B2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KHMB7TMF","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KHMB7TMFLXGYM2B2H2W75E7KSN","target":"record","payload":{"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"},"canonical_sha256":"51d81fcd855dcd86683a3eadfe93ea93587d44bcb256cea9f1fc6d0d1532c162","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"},"source_kind":"arxiv","source_id":"1203.0224","source_version":2,"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-18T04:00:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnGrUIkgzKrTk+9rEvuFbKegxsxRuagGBMd7X8ho1Z4o4XcGRB54J5+v5w/VNJ5+KpnQdvv92lJUAPC8Gz7KBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:08:50.246098Z"},"content_sha256":"1e31c78598127e4f13602cc32a760f9c2cf34f20900b8565fec70fbed88493c7","schema_version":"1.0","event_id":"sha256:1e31c78598127e4f13602cc32a760f9c2cf34f20900b8565fec70fbed88493c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KHMB7TMFLXGYM2B2H2W75E7KSN","target":"graph","payload":{"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"},"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-18T04:00:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t75ildS0zUZZUofe9IJ7EnGvnxsBXycelncPZWptGHPYHVYCO7LogmivMbU9daPqy36Hc3w9y3CZMqWyoKpbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T18:08:50.246503Z"},"content_sha256":"ac57dac57ef6aac554a7513ffef5c6f02ccd15e9add1ccaf317a9b29d8d29c40","schema_version":"1.0","event_id":"sha256:ac57dac57ef6aac554a7513ffef5c6f02ccd15e9add1ccaf317a9b29d8d29c40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN/bundle.json","state_url":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHMB7TMFLXGYM2B2H2W75E7KSN/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-05-20T18:08:50Z","links":{"resolver":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN","bundle":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN/bundle.json","state":"https://pith.science/pith/KHMB7TMFLXGYM2B2H2W75E7KSN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHMB7TMFLXGYM2B2H2W75E7KSN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KHMB7TMFLXGYM2B2H2W75E7KSN","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":"aea612e8ef2582367430eff2bb651fb46b664bdb6e71612bbf7e8fd1778de24f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-01T15:58:01Z","title_canon_sha256":"f822fdb0f06610dd154d74e8e05e31987e4c070b642838d8687ea78797987215"},"schema_version":"1.0","source":{"id":"1203.0224","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0224","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0224v2","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0224","created_at":"2026-05-18T04:00:51Z"},{"alias_kind":"pith_short_12","alias_value":"KHMB7TMFLXGY","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KHMB7TMFLXGYM2B2","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KHMB7TMF","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:ac57dac57ef6aac554a7513ffef5c6f02ccd15e9add1ccaf317a9b29d8d29c40","target":"graph","created_at":"2026-05-18T04:00:51Z","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 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 ","authors_text":"Guy Kortsarz, Michael Dinitz, Ran Raz","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-01T15:58:01Z","title":"Label Cover instances with large girth and the hardness of approximating basic k-spanner"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0224","kind":"arxiv","version":2},"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:1e31c78598127e4f13602cc32a760f9c2cf34f20900b8565fec70fbed88493c7","target":"record","created_at":"2026-05-18T04:00:51Z","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":"aea612e8ef2582367430eff2bb651fb46b664bdb6e71612bbf7e8fd1778de24f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-01T15:58:01Z","title_canon_sha256":"f822fdb0f06610dd154d74e8e05e31987e4c070b642838d8687ea78797987215"},"schema_version":"1.0","source":{"id":"1203.0224","kind":"arxiv","version":2}},"canonical_sha256":"51d81fcd855dcd86683a3eadfe93ea93587d44bcb256cea9f1fc6d0d1532c162","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51d81fcd855dcd86683a3eadfe93ea93587d44bcb256cea9f1fc6d0d1532c162","first_computed_at":"2026-05-18T04:00:51.270045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:51.270045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+LliCGvuzlvD25VsVD4QYpUdcUGLScVoiaJaDqwJ/8WLlRnqCTOx/3+V67SRFsY/IddaUctitY63TAyvQwMRDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:51.270641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0224","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e31c78598127e4f13602cc32a760f9c2cf34f20900b8565fec70fbed88493c7","sha256:ac57dac57ef6aac554a7513ffef5c6f02ccd15e9add1ccaf317a9b29d8d29c40"],"state_sha256":"a3648e099c67b94aea8024aa0115c9ab83b0ee6283f1a07a8eab3f988a0c376e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6LqKV9eG5YgvaeWD4312S8+G0lxqCn+Kqy1d7Jo5Cuy3kjdOOfKgvPOSkSB9HSVpz2MeN1ErzjmPP1bYwpyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T18:08:50.248802Z","bundle_sha256":"fec7ae2f5aeb3d70799508894bd5c8d07acd024f94883e1e3f3f46e4ac87f43b"}}