{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QN2KMAYY6SNJVKZVLGKP2BH6CE","short_pith_number":"pith:QN2KMAYY","canonical_record":{"source":{"id":"2008.07252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-17T12:27:14Z","cross_cats_sorted":[],"title_canon_sha256":"bce9ff5aae51d5ce045eae9c17a4cef4e91b807b940f19293870f7fd599d4a03","abstract_canon_sha256":"0d4dc97a3f456d3eaa0701cf7f2037e9d68070775333fa2db5f0f3950d2057b6"},"schema_version":"1.0"},"canonical_sha256":"8374a60318f49a9aab355994fd04fe111acf049dee8d74f991776c9842f47f65","source":{"kind":"arxiv","id":"2008.07252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.07252","created_at":"2026-07-05T01:27:37Z"},{"alias_kind":"arxiv_version","alias_value":"2008.07252v1","created_at":"2026-07-05T01:27:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.07252","created_at":"2026-07-05T01:27:37Z"},{"alias_kind":"pith_short_12","alias_value":"QN2KMAYY6SNJ","created_at":"2026-07-05T01:27:37Z"},{"alias_kind":"pith_short_16","alias_value":"QN2KMAYY6SNJVKZV","created_at":"2026-07-05T01:27:37Z"},{"alias_kind":"pith_short_8","alias_value":"QN2KMAYY","created_at":"2026-07-05T01:27:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QN2KMAYY6SNJVKZVLGKP2BH6CE","target":"record","payload":{"canonical_record":{"source":{"id":"2008.07252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-17T12:27:14Z","cross_cats_sorted":[],"title_canon_sha256":"bce9ff5aae51d5ce045eae9c17a4cef4e91b807b940f19293870f7fd599d4a03","abstract_canon_sha256":"0d4dc97a3f456d3eaa0701cf7f2037e9d68070775333fa2db5f0f3950d2057b6"},"schema_version":"1.0"},"canonical_sha256":"8374a60318f49a9aab355994fd04fe111acf049dee8d74f991776c9842f47f65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:27:37.913127Z","signature_b64":"gMf5JgjRh6rkBbL1RNL5ZXGtgIBukXMlFdFvg4ARYHBNoEQdOJuzcZ4kUYEISABt94VBuRrM1K6Xn2eZKqqKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8374a60318f49a9aab355994fd04fe111acf049dee8d74f991776c9842f47f65","last_reissued_at":"2026-07-05T01:27:37.912684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:27:37.912684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.07252","source_version":1,"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-07-05T01:27:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KAZ766w9F6oXCftge/kw8tUyU5ZisNrLndJOmqA3+uOggxz6+0AoLo0U3NcIxWFLUOAR3ZyvHX6dER2V/xwEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:22:54.069556Z"},"content_sha256":"f08e1dde0dd002bcaf7979b51bc8c4833bc4cffebf642fd9786fb0c23c722885","schema_version":"1.0","event_id":"sha256:f08e1dde0dd002bcaf7979b51bc8c4833bc4cffebf642fd9786fb0c23c722885"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QN2KMAYY6SNJVKZVLGKP2BH6CE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Johannes Blum","submitted_at":"2020-08-17T12:27:14Z","abstract_excerpt":"In the $k$-Center problem, we are given a graph $G=(V,E)$ with positive edge weights and an integer $k$ and the goal is to select $k$ center vertices $C \\subseteq V$ such that the maximum distance from any vertex to the closest center vertex is minimized. On general graphs, the problem is NP-hard and cannot be approximated within a factor less than $2$.\n  Typical applications of the $k$-Center problem can be found in logistics or urban planning and hence, it is natural to study the problem on transportation networks. Such networks are often characterized as graphs that are (almost) planar or h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.07252","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.07252/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:27:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BUgCacIYnHnkAfK7TUY29BksqV4RlzzaQxHkX5ApGvKBuOYwbraTNhhzx/eQpp3/6yWbSjg6R9JfyFd0GEGLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:22:54.070430Z"},"content_sha256":"b57b803ef830bbb2e4595b5da8f6862562796d8e857688eb01ffd9c86522bc54","schema_version":"1.0","event_id":"sha256:b57b803ef830bbb2e4595b5da8f6862562796d8e857688eb01ffd9c86522bc54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QN2KMAYY6SNJVKZVLGKP2BH6CE/bundle.json","state_url":"https://pith.science/pith/QN2KMAYY6SNJVKZVLGKP2BH6CE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QN2KMAYY6SNJVKZVLGKP2BH6CE/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-08-03T19:22:54Z","links":{"resolver":"https://pith.science/pith/QN2KMAYY6SNJVKZVLGKP2BH6CE","bundle":"https://pith.science/pith/QN2KMAYY6SNJVKZVLGKP2BH6CE/bundle.json","state":"https://pith.science/pith/QN2KMAYY6SNJVKZVLGKP2BH6CE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QN2KMAYY6SNJVKZVLGKP2BH6CE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QN2KMAYY6SNJVKZVLGKP2BH6CE","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":"0d4dc97a3f456d3eaa0701cf7f2037e9d68070775333fa2db5f0f3950d2057b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-17T12:27:14Z","title_canon_sha256":"bce9ff5aae51d5ce045eae9c17a4cef4e91b807b940f19293870f7fd599d4a03"},"schema_version":"1.0","source":{"id":"2008.07252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.07252","created_at":"2026-07-05T01:27:37Z"},{"alias_kind":"arxiv_version","alias_value":"2008.07252v1","created_at":"2026-07-05T01:27:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.07252","created_at":"2026-07-05T01:27:37Z"},{"alias_kind":"pith_short_12","alias_value":"QN2KMAYY6SNJ","created_at":"2026-07-05T01:27:37Z"},{"alias_kind":"pith_short_16","alias_value":"QN2KMAYY6SNJVKZV","created_at":"2026-07-05T01:27:37Z"},{"alias_kind":"pith_short_8","alias_value":"QN2KMAYY","created_at":"2026-07-05T01:27:37Z"}],"graph_snapshots":[{"event_id":"sha256:b57b803ef830bbb2e4595b5da8f6862562796d8e857688eb01ffd9c86522bc54","target":"graph","created_at":"2026-07-05T01:27:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.07252/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the $k$-Center problem, we are given a graph $G=(V,E)$ with positive edge weights and an integer $k$ and the goal is to select $k$ center vertices $C \\subseteq V$ such that the maximum distance from any vertex to the closest center vertex is minimized. On general graphs, the problem is NP-hard and cannot be approximated within a factor less than $2$.\n  Typical applications of the $k$-Center problem can be found in logistics or urban planning and hence, it is natural to study the problem on transportation networks. Such networks are often characterized as graphs that are (almost) planar or h","authors_text":"Johannes Blum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-17T12:27:14Z","title":"W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.07252","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:f08e1dde0dd002bcaf7979b51bc8c4833bc4cffebf642fd9786fb0c23c722885","target":"record","created_at":"2026-07-05T01:27:37Z","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":"0d4dc97a3f456d3eaa0701cf7f2037e9d68070775333fa2db5f0f3950d2057b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-08-17T12:27:14Z","title_canon_sha256":"bce9ff5aae51d5ce045eae9c17a4cef4e91b807b940f19293870f7fd599d4a03"},"schema_version":"1.0","source":{"id":"2008.07252","kind":"arxiv","version":1}},"canonical_sha256":"8374a60318f49a9aab355994fd04fe111acf049dee8d74f991776c9842f47f65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8374a60318f49a9aab355994fd04fe111acf049dee8d74f991776c9842f47f65","first_computed_at":"2026-07-05T01:27:37.912684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:27:37.912684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gMf5JgjRh6rkBbL1RNL5ZXGtgIBukXMlFdFvg4ARYHBNoEQdOJuzcZ4kUYEISABt94VBuRrM1K6Xn2eZKqqKDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:27:37.913127Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.07252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f08e1dde0dd002bcaf7979b51bc8c4833bc4cffebf642fd9786fb0c23c722885","sha256:b57b803ef830bbb2e4595b5da8f6862562796d8e857688eb01ffd9c86522bc54"],"state_sha256":"5d6a6714ec1deae9b91fdd8b2f82d5ebfa242cb36d26b355346f9a40019fe385"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HTP6E6RTJgVioaeV0uT3iFqt9ep5RLyq1MVAtKMwbZYhjYxRLztAVMPDp1RdVR2tg19NFtobOAxXB8FsmtJ2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:22:54.085587Z","bundle_sha256":"552ddd3e85d9eafd4d19e999e09e0f84f889befa790229aef88e7aedfad84987"}}