{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BJUMPBIJOZAWDHBXY55C3BQJKS","short_pith_number":"pith:BJUMPBIJ","canonical_record":{"source":{"id":"1704.08868","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-28T10:34:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"624e71f65b20921de213ebf6b9560a4718b180db1b2ef9fe4afc563db07727f7","abstract_canon_sha256":"6ac0b3713e161020bdf45dd5adff46e8d22ac7978e1cd2914913bcf2cf024953"},"schema_version":"1.0"},"canonical_sha256":"0a68c785097641619c37c77a2d860954891fb227e49654ea974d7a6a48417a35","source":{"kind":"arxiv","id":"1704.08868","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08868","created_at":"2026-05-18T00:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08868v4","created_at":"2026-05-18T00:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08868","created_at":"2026-05-18T00:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"BJUMPBIJOZAW","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BJUMPBIJOZAWDHBX","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BJUMPBIJ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BJUMPBIJOZAWDHBXY55C3BQJKS","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08868","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-28T10:34:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"624e71f65b20921de213ebf6b9560a4718b180db1b2ef9fe4afc563db07727f7","abstract_canon_sha256":"6ac0b3713e161020bdf45dd5adff46e8d22ac7978e1cd2914913bcf2cf024953"},"schema_version":"1.0"},"canonical_sha256":"0a68c785097641619c37c77a2d860954891fb227e49654ea974d7a6a48417a35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:00.708888Z","signature_b64":"meJUCIkUAYVt48G1/JRxuj4A2iCOLsp5nq6EdH053FR0LVdmzHfh7GZV66FLSyIKSe1K7DzuPW+IYe5w/jUkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a68c785097641619c37c77a2d860954891fb227e49654ea974d7a6a48417a35","last_reissued_at":"2026-05-18T00:01:00.708486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:00.708486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08868","source_version":4,"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-18T00:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0LQcRNfRL32eX1QIetetUYfFh6RYxTNq+1E0D40GSLmy+g3d6ZR/YaqFI/nzNu/xl4wQF2vvOWzbQ0Uyl3HBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:30:46.535172Z"},"content_sha256":"573d393360fa00ae0f75b16f119c1416aca729b49d0994086db4ff300c50a9bb","schema_version":"1.0","event_id":"sha256:573d393360fa00ae0f75b16f119c1416aca729b49d0994086db4ff300c50a9bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BJUMPBIJOZAWDHBXY55C3BQJKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos","submitted_at":"2017-04-28T10:34:16Z","abstract_excerpt":"In $(k,r)$-Center we are given a (possibly edge-weighted) graph and are asked to select at most $k$ vertices (centers), so that all other vertices are at distance at most $r$ from a center. In this paper we provide a number of tight fine-grained bounds on the complexity of this problem with respect to various standard graph parameters. Specifically:\n  - For any $r\\ge 1$, we show an algorithm that solves the problem in $O^*((3r+1)^{\\textrm{cw}})$ time, where $\\textrm{cw}$ is the clique-width of the input graph, as well as a tight SETH lower bound matching this algorithm's performance. As a coro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08868","kind":"arxiv","version":4},"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-18T00:01:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"35KHjzt5zSbK5QLrW8Q36DypjiLuHVYk8MxMjB2RTHaJWh+wYS19vPFqHICL62HMlsxG6OdX0DGwRwQuD8x5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:30:46.535861Z"},"content_sha256":"69859050ec1c44b9c7302a0682e066e82e5006465055de84e2b90ce517bac585","schema_version":"1.0","event_id":"sha256:69859050ec1c44b9c7302a0682e066e82e5006465055de84e2b90ce517bac585"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJUMPBIJOZAWDHBXY55C3BQJKS/bundle.json","state_url":"https://pith.science/pith/BJUMPBIJOZAWDHBXY55C3BQJKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJUMPBIJOZAWDHBXY55C3BQJKS/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-22T04:30:46Z","links":{"resolver":"https://pith.science/pith/BJUMPBIJOZAWDHBXY55C3BQJKS","bundle":"https://pith.science/pith/BJUMPBIJOZAWDHBXY55C3BQJKS/bundle.json","state":"https://pith.science/pith/BJUMPBIJOZAWDHBXY55C3BQJKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJUMPBIJOZAWDHBXY55C3BQJKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BJUMPBIJOZAWDHBXY55C3BQJKS","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":"6ac0b3713e161020bdf45dd5adff46e8d22ac7978e1cd2914913bcf2cf024953","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-28T10:34:16Z","title_canon_sha256":"624e71f65b20921de213ebf6b9560a4718b180db1b2ef9fe4afc563db07727f7"},"schema_version":"1.0","source":{"id":"1704.08868","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08868","created_at":"2026-05-18T00:01:00Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08868v4","created_at":"2026-05-18T00:01:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08868","created_at":"2026-05-18T00:01:00Z"},{"alias_kind":"pith_short_12","alias_value":"BJUMPBIJOZAW","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BJUMPBIJOZAWDHBX","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BJUMPBIJ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:69859050ec1c44b9c7302a0682e066e82e5006465055de84e2b90ce517bac585","target":"graph","created_at":"2026-05-18T00:01:00Z","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":"In $(k,r)$-Center we are given a (possibly edge-weighted) graph and are asked to select at most $k$ vertices (centers), so that all other vertices are at distance at most $r$ from a center. In this paper we provide a number of tight fine-grained bounds on the complexity of this problem with respect to various standard graph parameters. Specifically:\n  - For any $r\\ge 1$, we show an algorithm that solves the problem in $O^*((3r+1)^{\\textrm{cw}})$ time, where $\\textrm{cw}$ is the clique-width of the input graph, as well as a tight SETH lower bound matching this algorithm's performance. As a coro","authors_text":"Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-28T10:34:16Z","title":"Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08868","kind":"arxiv","version":4},"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:573d393360fa00ae0f75b16f119c1416aca729b49d0994086db4ff300c50a9bb","target":"record","created_at":"2026-05-18T00:01:00Z","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":"6ac0b3713e161020bdf45dd5adff46e8d22ac7978e1cd2914913bcf2cf024953","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-04-28T10:34:16Z","title_canon_sha256":"624e71f65b20921de213ebf6b9560a4718b180db1b2ef9fe4afc563db07727f7"},"schema_version":"1.0","source":{"id":"1704.08868","kind":"arxiv","version":4}},"canonical_sha256":"0a68c785097641619c37c77a2d860954891fb227e49654ea974d7a6a48417a35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a68c785097641619c37c77a2d860954891fb227e49654ea974d7a6a48417a35","first_computed_at":"2026-05-18T00:01:00.708486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:00.708486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"meJUCIkUAYVt48G1/JRxuj4A2iCOLsp5nq6EdH053FR0LVdmzHfh7GZV66FLSyIKSe1K7DzuPW+IYe5w/jUkBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:00.708888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08868","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:573d393360fa00ae0f75b16f119c1416aca729b49d0994086db4ff300c50a9bb","sha256:69859050ec1c44b9c7302a0682e066e82e5006465055de84e2b90ce517bac585"],"state_sha256":"6b7a1ca50b4d33360d7a74473f347e4538d253e1690ce727d80933891f60cd96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5fVy5T0AMBqWABd+MMMVmf1MS+S6+ofq+KHrbuPW9NhEDvJ/XrJdEU/+IYqKQ5CbU2NDqv8aaI00a1nXRul8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T04:30:46.539235Z","bundle_sha256":"9aab06b8f4bc2eaa0a151a2bf9e99b893af307ab0d894eaf321003154ca0a73b"}}