{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QYHMVRSKYBQWFHHKZS5Q5J6XRO","short_pith_number":"pith:QYHMVRSK","canonical_record":{"source":{"id":"1706.07475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-22T19:56:51Z","cross_cats_sorted":[],"title_canon_sha256":"03a22e32e76b12480a6bb9a63bb356f3c0835a3517df765ef6b003c45d31ddef","abstract_canon_sha256":"618e6597d64b69bef3191b1ed72e5097e02ae65359309ea97de58279ab56f2b6"},"schema_version":"1.0"},"canonical_sha256":"860ecac64ac061629ceaccbb0ea7d78ba67ca67eb326c1b1c757408a710df590","source":{"kind":"arxiv","id":"1706.07475","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07475","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07475v1","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07475","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"QYHMVRSKYBQW","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QYHMVRSKYBQWFHHK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QYHMVRSK","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QYHMVRSKYBQWFHHKZS5Q5J6XRO","target":"record","payload":{"canonical_record":{"source":{"id":"1706.07475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-22T19:56:51Z","cross_cats_sorted":[],"title_canon_sha256":"03a22e32e76b12480a6bb9a63bb356f3c0835a3517df765ef6b003c45d31ddef","abstract_canon_sha256":"618e6597d64b69bef3191b1ed72e5097e02ae65359309ea97de58279ab56f2b6"},"schema_version":"1.0"},"canonical_sha256":"860ecac64ac061629ceaccbb0ea7d78ba67ca67eb326c1b1c757408a710df590","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:48.996063Z","signature_b64":"WT81nySJRiChl1i1R0GYYKL4cVlJQQN6tI8Ur+jKqIA2PJOQr60priFHXVwfSwsHLT4rhNmfeI8AKIcn3BQRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"860ecac64ac061629ceaccbb0ea7d78ba67ca67eb326c1b1c757408a710df590","last_reissued_at":"2026-05-18T00:41:48.995346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:48.995346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.07475","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-05-18T00:41:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVtQZ/otW5/xKSSP/SNrN3l+LbzIkRzoxM3fmhTHOBcW0h39OUXVQGlHhH1UzA91UDIZwGig82yt8OSFcFTiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:22:49.997231Z"},"content_sha256":"53d5091c7d8717779a6e3e8d86754ae95b73b03d2d0072015ba15758f209da1a","schema_version":"1.0","event_id":"sha256:53d5091c7d8717779a6e3e8d86754ae95b73b03d2d0072015ba15758f209da1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QYHMVRSKYBQWFHHKZS5Q5J6XRO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Approximation Algorithms for some Location Problems in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arne Leitert, Feodor F. Dragan","submitted_at":"2017-06-22T19:56:51Z","abstract_excerpt":"We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) $r$-Domination problem and the (Connected) $p$-Center problem for unweighted and undirected graphs. Given a graph $G$, we show how to construct a (connected) $\\big(r + \\mathcal{O}(\\mu) \\big)$-dominating set $D$ with $|D| \\leq |D^*|$ efficiently. Here, $D^*$ is a minimum (connected) $r$-dominating set of $G$ and $\\mu$ is our graph parameter, which is the tree-breadth or the cluster diameter in a layering partition of $G$. Additionally, we show that a $+ \\mathcal{O}(\\mu)$-approximation for the ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07475","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":""},"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:41:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRDo9Y35KUQt0IMJnDOF06/WcCw14Yoe9hprgCVhx0F8tBPuwfASycwuNgDcqgDnMl5nllqzRHzjRPrVc9mrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:22:49.997603Z"},"content_sha256":"df249533e7523e16e9c7ad0815b42b8697f545515fe241d48a5915f8c4c16806","schema_version":"1.0","event_id":"sha256:df249533e7523e16e9c7ad0815b42b8697f545515fe241d48a5915f8c4c16806"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO/bundle.json","state_url":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO/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-05T12:22:49Z","links":{"resolver":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO","bundle":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO/bundle.json","state":"https://pith.science/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYHMVRSKYBQWFHHKZS5Q5J6XRO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QYHMVRSKYBQWFHHKZS5Q5J6XRO","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":"618e6597d64b69bef3191b1ed72e5097e02ae65359309ea97de58279ab56f2b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-22T19:56:51Z","title_canon_sha256":"03a22e32e76b12480a6bb9a63bb356f3c0835a3517df765ef6b003c45d31ddef"},"schema_version":"1.0","source":{"id":"1706.07475","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.07475","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"arxiv_version","alias_value":"1706.07475v1","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.07475","created_at":"2026-05-18T00:41:48Z"},{"alias_kind":"pith_short_12","alias_value":"QYHMVRSKYBQW","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QYHMVRSKYBQWFHHK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QYHMVRSK","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:df249533e7523e16e9c7ad0815b42b8697f545515fe241d48a5915f8c4c16806","target":"graph","created_at":"2026-05-18T00:41:48Z","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 develop efficient parameterized, with additive error, approximation algorithms for the (Connected) $r$-Domination problem and the (Connected) $p$-Center problem for unweighted and undirected graphs. Given a graph $G$, we show how to construct a (connected) $\\big(r + \\mathcal{O}(\\mu) \\big)$-dominating set $D$ with $|D| \\leq |D^*|$ efficiently. Here, $D^*$ is a minimum (connected) $r$-dominating set of $G$ and $\\mu$ is our graph parameter, which is the tree-breadth or the cluster diameter in a layering partition of $G$. Additionally, we show that a $+ \\mathcal{O}(\\mu)$-approximation for the (","authors_text":"Arne Leitert, Feodor F. Dragan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-22T19:56:51Z","title":"Parameterized Approximation Algorithms for some Location Problems in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.07475","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:53d5091c7d8717779a6e3e8d86754ae95b73b03d2d0072015ba15758f209da1a","target":"record","created_at":"2026-05-18T00:41:48Z","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":"618e6597d64b69bef3191b1ed72e5097e02ae65359309ea97de58279ab56f2b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-22T19:56:51Z","title_canon_sha256":"03a22e32e76b12480a6bb9a63bb356f3c0835a3517df765ef6b003c45d31ddef"},"schema_version":"1.0","source":{"id":"1706.07475","kind":"arxiv","version":1}},"canonical_sha256":"860ecac64ac061629ceaccbb0ea7d78ba67ca67eb326c1b1c757408a710df590","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"860ecac64ac061629ceaccbb0ea7d78ba67ca67eb326c1b1c757408a710df590","first_computed_at":"2026-05-18T00:41:48.995346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:48.995346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WT81nySJRiChl1i1R0GYYKL4cVlJQQN6tI8Ur+jKqIA2PJOQr60priFHXVwfSwsHLT4rhNmfeI8AKIcn3BQRBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:48.996063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.07475","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53d5091c7d8717779a6e3e8d86754ae95b73b03d2d0072015ba15758f209da1a","sha256:df249533e7523e16e9c7ad0815b42b8697f545515fe241d48a5915f8c4c16806"],"state_sha256":"c901cd7700ff25dcffc45ae3404bf42131b61f93b6a01e6013fa4c1ac148108c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+llsDzXbwp35io/HzIdkOBgqgGKFXIJG+5WNSUT+6uejNwywFcsnKmaFycpuZwPNUkE3Nyv8MYaAsXE7o6F7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:22:49.999547Z","bundle_sha256":"c881911cf21b282bc56abaa5bc687edcf5b0bdfe575b8ad45eda0c397471867d"}}