{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PR5YJH6AT2OMTJHSGFDNHD35ZF","short_pith_number":"pith:PR5YJH6A","canonical_record":{"source":{"id":"1605.02530","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-09T11:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"c660daf4bfec35ec0c3437a80969573d7ba01fe68d384ce152bdc9e3652cd8e2","abstract_canon_sha256":"7e9322163b46e7abaa615111c719a69099171f5b435416301d6d5b25c5fb03b2"},"schema_version":"1.0"},"canonical_sha256":"7c7b849fc09e9cc9a4f23146d38f7dc967b8ea1e4fe84c4dca12526ab407264f","source":{"kind":"arxiv","id":"1605.02530","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02530","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02530v3","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02530","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"PR5YJH6AT2OM","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PR5YJH6AT2OMTJHS","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PR5YJH6A","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PR5YJH6AT2OMTJHSGFDNHD35ZF","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02530","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-09T11:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"c660daf4bfec35ec0c3437a80969573d7ba01fe68d384ce152bdc9e3652cd8e2","abstract_canon_sha256":"7e9322163b46e7abaa615111c719a69099171f5b435416301d6d5b25c5fb03b2"},"schema_version":"1.0"},"canonical_sha256":"7c7b849fc09e9cc9a4f23146d38f7dc967b8ea1e4fe84c4dca12526ab407264f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:44.629520Z","signature_b64":"V5Y4cKTRtt92eTxw7jKBjtnrl6aJcd4sWauk2wt6EWKsAk4u6E/bPvmsLHGMFCZXq5QRdyzg4RrXW+vqtxu8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c7b849fc09e9cc9a4f23146d38f7dc967b8ea1e4fe84c4dca12526ab407264f","last_reissued_at":"2026-05-17T23:47:44.628921Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:44.628921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02530","source_version":3,"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-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h8UxfrX0iz34houSXqLQzf6ovPPOZuqbXl7Xf6k0+M7XqMHLgb3Bjzf8RwHyKgaN3AqlbSJyqYTnAy6d5iO0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:27:58.329282Z"},"content_sha256":"97bffa645f20a1a91674018b48b0ff0e24d0b6ba2f1f3c8b4e7a0855f4988082","schema_version":"1.0","event_id":"sha256:97bffa645f20a1a91674018b48b0ff0e24d0b6ba2f1f3c8b4e7a0855f4988082"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PR5YJH6AT2OMTJHSGFDNHD35ZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Emil Feldmann","submitted_at":"2016-05-09T11:24:00Z","abstract_excerpt":"We consider the $k$-Center problem and some generalizations. For $k$-Center a set of $k$ center vertices needs to be found in a graph $G$ with edge lengths, such that the distance from any vertex of $G$ to its nearest center is minimized. This problem naturally occurs in transportation networks, and therefore we model the inputs as graphs with bounded highway dimension, as proposed by Abraham et al. [SODA 2010].\n  We show both approximation and fixed-parameter hardness results, and how to overcome them using fixed-parameter approximations, where the two paradigms are combined. In particular, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02530","kind":"arxiv","version":3},"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-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xuvkf0KpHYBiPqn4BGGc2aDNFXUyqY0LKCGcTVvawyuK3qLUoNDmCQqKh1baGx61MrHR3SEo3nPZreSZtH5yCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:27:58.329671Z"},"content_sha256":"dc8dce36c8cda262e614682606840b38b456d0ef5b6d72d85adc0a5723c8c096","schema_version":"1.0","event_id":"sha256:dc8dce36c8cda262e614682606840b38b456d0ef5b6d72d85adc0a5723c8c096"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF/bundle.json","state_url":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF/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-06-01T04:27:58Z","links":{"resolver":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF","bundle":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF/bundle.json","state":"https://pith.science/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PR5YJH6AT2OMTJHSGFDNHD35ZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PR5YJH6AT2OMTJHSGFDNHD35ZF","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":"7e9322163b46e7abaa615111c719a69099171f5b435416301d6d5b25c5fb03b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-09T11:24:00Z","title_canon_sha256":"c660daf4bfec35ec0c3437a80969573d7ba01fe68d384ce152bdc9e3652cd8e2"},"schema_version":"1.0","source":{"id":"1605.02530","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02530","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02530v3","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02530","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"PR5YJH6AT2OM","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PR5YJH6AT2OMTJHS","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PR5YJH6A","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:dc8dce36c8cda262e614682606840b38b456d0ef5b6d72d85adc0a5723c8c096","target":"graph","created_at":"2026-05-17T23:47:44Z","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 consider the $k$-Center problem and some generalizations. For $k$-Center a set of $k$ center vertices needs to be found in a graph $G$ with edge lengths, such that the distance from any vertex of $G$ to its nearest center is minimized. This problem naturally occurs in transportation networks, and therefore we model the inputs as graphs with bounded highway dimension, as proposed by Abraham et al. [SODA 2010].\n  We show both approximation and fixed-parameter hardness results, and how to overcome them using fixed-parameter approximations, where the two paradigms are combined. In particular, w","authors_text":"Andreas Emil Feldmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-09T11:24:00Z","title":"Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02530","kind":"arxiv","version":3},"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:97bffa645f20a1a91674018b48b0ff0e24d0b6ba2f1f3c8b4e7a0855f4988082","target":"record","created_at":"2026-05-17T23:47:44Z","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":"7e9322163b46e7abaa615111c719a69099171f5b435416301d6d5b25c5fb03b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-09T11:24:00Z","title_canon_sha256":"c660daf4bfec35ec0c3437a80969573d7ba01fe68d384ce152bdc9e3652cd8e2"},"schema_version":"1.0","source":{"id":"1605.02530","kind":"arxiv","version":3}},"canonical_sha256":"7c7b849fc09e9cc9a4f23146d38f7dc967b8ea1e4fe84c4dca12526ab407264f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c7b849fc09e9cc9a4f23146d38f7dc967b8ea1e4fe84c4dca12526ab407264f","first_computed_at":"2026-05-17T23:47:44.628921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:44.628921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V5Y4cKTRtt92eTxw7jKBjtnrl6aJcd4sWauk2wt6EWKsAk4u6E/bPvmsLHGMFCZXq5QRdyzg4RrXW+vqtxu8CQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:44.629520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02530","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97bffa645f20a1a91674018b48b0ff0e24d0b6ba2f1f3c8b4e7a0855f4988082","sha256:dc8dce36c8cda262e614682606840b38b456d0ef5b6d72d85adc0a5723c8c096"],"state_sha256":"96d96b5bcb3c669dc60205c4538e3ab6589c5672f0cb130cad397739c236df67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5puwQeN9f3CBc+y2lihFmQ3ylPd5pHGQEpwO2btXkubqOZDgfdDiMX2pKpni3DN6xHDwzICNXDTu+fWp2MJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:27:58.331740Z","bundle_sha256":"1524d2d010d6407bf09cd80090667e80f45ff3ed8c80115e21924e7f0d7518f1"}}