{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:L3F3SKWYUHUNB3UDRCNTACRJBI","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":"57a3459371e61c3a93779691ea0da7ea7089d7577a5ab83ff69752dae8c26417","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T22:44:12Z","title_canon_sha256":"0275b9c459bd5d229349a09268a8f24b27781e77e3e60c6cd4b4907a7849280d"},"schema_version":"1.0","source":{"id":"1611.06605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06605","created_at":"2026-05-18T00:57:36Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06605v1","created_at":"2026-05-18T00:57:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06605","created_at":"2026-05-18T00:57:36Z"},{"alias_kind":"pith_short_12","alias_value":"L3F3SKWYUHUN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L3F3SKWYUHUNB3UD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L3F3SKWY","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:cb7e1c11e9bedb9075eff4ea0b43785e61e78e723435dfb90d2f83bf266993e1","target":"graph","created_at":"2026-05-18T00:57:36Z","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":"There has been significant success in designing highly efficient algorithms for distance and shortest-path queries in recent years; many of the state-of-the-art algorithms use the hub labeling framework. In this paper, we study the approximability of the Hub Labeling problem. We prove a hardness of $\\Omega(\\log n)$ for Hub Labeling, matching known approximation guarantees. The hardness result applies to graphs that have multiple shortest paths between some pairs of vertices. No hardness of approximation results were known previously.\n  Then, we focus on graphs that have a unique shortest path ","authors_text":"Haris Angelidakis, Vsevolod Oparin, Yury Makarychev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T22:44:12Z","title":"Algorithmic and Hardness Results for the Hub Labeling Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06605","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:a8ffdb07f83c4c81f34da7880c3310fc2afbf437ab066e095d5e03df42c207ff","target":"record","created_at":"2026-05-18T00:57:36Z","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":"57a3459371e61c3a93779691ea0da7ea7089d7577a5ab83ff69752dae8c26417","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T22:44:12Z","title_canon_sha256":"0275b9c459bd5d229349a09268a8f24b27781e77e3e60c6cd4b4907a7849280d"},"schema_version":"1.0","source":{"id":"1611.06605","kind":"arxiv","version":1}},"canonical_sha256":"5ecbb92ad8a1e8d0ee83889b300a290a0d3a886a4032a8ec5fd30efc6e0496f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ecbb92ad8a1e8d0ee83889b300a290a0d3a886a4032a8ec5fd30efc6e0496f1","first_computed_at":"2026-05-18T00:57:36.334914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:36.334914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mt5yV74sdUUhqW2cfsIVTtGSPWeUIGjj+ost46StJD89cqwsQ3xt4hTLpZ1Vnhsm7wH/fmqNBgFtcMTGeyoJBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:36.335525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8ffdb07f83c4c81f34da7880c3310fc2afbf437ab066e095d5e03df42c207ff","sha256:cb7e1c11e9bedb9075eff4ea0b43785e61e78e723435dfb90d2f83bf266993e1"],"state_sha256":"f0714a5e102fced5bc013c53136cab9dc73ac18006baee611eec779f3237c096"}