{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:36N7A2VHRBEGC5P7PRKD6WMOPA","short_pith_number":"pith:36N7A2VH","canonical_record":{"source":{"id":"1711.10680","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T04:56:43Z","cross_cats_sorted":[],"title_canon_sha256":"520732859782b0c498861421465353fee68d9fa2623a50c75f57ca7524def7f4","abstract_canon_sha256":"97488e8118ee951f7a3b770165f4617698c8c6880b6482610213d26dc7215efb"},"schema_version":"1.0"},"canonical_sha256":"df9bf06aa788486175ff7c543f598e78145d8b3b6abcd4f6afb1501fd843b177","source":{"kind":"arxiv","id":"1711.10680","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10680","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10680v4","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10680","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"36N7A2VHRBEG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"36N7A2VHRBEGC5P7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"36N7A2VH","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:36N7A2VHRBEGC5P7PRKD6WMOPA","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10680","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T04:56:43Z","cross_cats_sorted":[],"title_canon_sha256":"520732859782b0c498861421465353fee68d9fa2623a50c75f57ca7524def7f4","abstract_canon_sha256":"97488e8118ee951f7a3b770165f4617698c8c6880b6482610213d26dc7215efb"},"schema_version":"1.0"},"canonical_sha256":"df9bf06aa788486175ff7c543f598e78145d8b3b6abcd4f6afb1501fd843b177","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:08.106175Z","signature_b64":"Gv4gDSqLtRdHW+nVbnyhbomKr8528EmBI8H5/cFcLJCKQrTLi1sR4mPJwLcScr6gtDyxurixNBB4kslIpDbbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df9bf06aa788486175ff7c543f598e78145d8b3b6abcd4f6afb1501fd843b177","last_reissued_at":"2026-05-18T00:23:08.105524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:08.105524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10680","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:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnzmQ4/Z8a4W+qZQCEwo1cLdvm2ICRDtYjrByLQtHpXEKHz0QFNakK3vT9vcz0wGBtdbb+Ehk7oj38DD5dfkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T10:09:44.362180Z"},"content_sha256":"5fab49612d74040a5f32895f297f240d887db705b0841f752be1eb0dafb2160f","schema_version":"1.0","event_id":"sha256:5fab49612d74040a5f32895f297f240d887db705b0841f752be1eb0dafb2160f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:36N7A2VHRBEGC5P7PRKD6WMOPA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tung-Wei Kuo","submitted_at":"2017-11-29T04:56:43Z","abstract_excerpt":"In the problem of minimum connected dominating set with routing cost constraint, we are given a graph $G=(V,E)$, and the goal is to find the smallest connected dominating set $D$ of $G$ such that, for any two non-adjacent vertices $u$ and $v$ in $G$, the number of internal nodes on the shortest path between $u$ and $v$ in the subgraph of $G$ induced by $D \\cup \\{u,v\\}$ is at most $\\alpha$ times that in $G$. For general graphs, the only known previous approximability result is an $O(\\log n)$-approximation algorithm ($n=|V|$) for $\\alpha = 1$ by Ding et al. For any constant $\\alpha > 1$, we give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10680","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:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2AN9oRm/yiTe+1VbIgAI3PH7hSjPEW6Mj6oV9nUHpnejRyQyLHy9IouXq/JyWGPA5dydI7EfejE9kWDKmbGpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T10:09:44.362548Z"},"content_sha256":"abeaa85fb7ed705227517f2de3b959917411c21e9defc3d7c3601494e5dd2076","schema_version":"1.0","event_id":"sha256:abeaa85fb7ed705227517f2de3b959917411c21e9defc3d7c3601494e5dd2076"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36N7A2VHRBEGC5P7PRKD6WMOPA/bundle.json","state_url":"https://pith.science/pith/36N7A2VHRBEGC5P7PRKD6WMOPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36N7A2VHRBEGC5P7PRKD6WMOPA/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-24T10:09:44Z","links":{"resolver":"https://pith.science/pith/36N7A2VHRBEGC5P7PRKD6WMOPA","bundle":"https://pith.science/pith/36N7A2VHRBEGC5P7PRKD6WMOPA/bundle.json","state":"https://pith.science/pith/36N7A2VHRBEGC5P7PRKD6WMOPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36N7A2VHRBEGC5P7PRKD6WMOPA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:36N7A2VHRBEGC5P7PRKD6WMOPA","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":"97488e8118ee951f7a3b770165f4617698c8c6880b6482610213d26dc7215efb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T04:56:43Z","title_canon_sha256":"520732859782b0c498861421465353fee68d9fa2623a50c75f57ca7524def7f4"},"schema_version":"1.0","source":{"id":"1711.10680","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10680","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10680v4","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10680","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"36N7A2VHRBEG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"36N7A2VHRBEGC5P7","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"36N7A2VH","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:abeaa85fb7ed705227517f2de3b959917411c21e9defc3d7c3601494e5dd2076","target":"graph","created_at":"2026-05-18T00:23:08Z","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 the problem of minimum connected dominating set with routing cost constraint, we are given a graph $G=(V,E)$, and the goal is to find the smallest connected dominating set $D$ of $G$ such that, for any two non-adjacent vertices $u$ and $v$ in $G$, the number of internal nodes on the shortest path between $u$ and $v$ in the subgraph of $G$ induced by $D \\cup \\{u,v\\}$ is at most $\\alpha$ times that in $G$. For general graphs, the only known previous approximability result is an $O(\\log n)$-approximation algorithm ($n=|V|$) for $\\alpha = 1$ by Ding et al. For any constant $\\alpha > 1$, we give","authors_text":"Tung-Wei Kuo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T04:56:43Z","title":"On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10680","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:5fab49612d74040a5f32895f297f240d887db705b0841f752be1eb0dafb2160f","target":"record","created_at":"2026-05-18T00:23:08Z","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":"97488e8118ee951f7a3b770165f4617698c8c6880b6482610213d26dc7215efb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T04:56:43Z","title_canon_sha256":"520732859782b0c498861421465353fee68d9fa2623a50c75f57ca7524def7f4"},"schema_version":"1.0","source":{"id":"1711.10680","kind":"arxiv","version":4}},"canonical_sha256":"df9bf06aa788486175ff7c543f598e78145d8b3b6abcd4f6afb1501fd843b177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df9bf06aa788486175ff7c543f598e78145d8b3b6abcd4f6afb1501fd843b177","first_computed_at":"2026-05-18T00:23:08.105524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:08.105524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gv4gDSqLtRdHW+nVbnyhbomKr8528EmBI8H5/cFcLJCKQrTLi1sR4mPJwLcScr6gtDyxurixNBB4kslIpDbbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:08.106175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10680","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5fab49612d74040a5f32895f297f240d887db705b0841f752be1eb0dafb2160f","sha256:abeaa85fb7ed705227517f2de3b959917411c21e9defc3d7c3601494e5dd2076"],"state_sha256":"759443fae38d1e63fed51ed199472a65263394e09dfcc7c2b680bda2441b4d25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3CLlRMzmNZ+dj5koziwSW8gr6SFml88SQtCJUq1hwLEiKsvgBYPhxe/3IlrT08pqx/FAnaXfEBHDeDY4CImFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T10:09:44.364450Z","bundle_sha256":"ec6b520173e69dd264003b04c6a9fa1a6173da8f1c77fd2841d0edeb3d557f34"}}