{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XFHP766WPF6ZZ66OOO52MKHS6X","short_pith_number":"pith:XFHP766W","schema_version":"1.0","canonical_sha256":"b94efffbd6797d9cfbce73bba628f2f5f150c2c876f67dfc4a22d230d8bd1946","source":{"kind":"arxiv","id":"1608.07634","version":1},"attestation_state":"computed","paper":{"title":"Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ding-Zhu Du, Jiao Zhou, Xiaohui Huang, Zhao Zhang","submitted_at":"2016-08-27T00:10:10Z","abstract_excerpt":"To achieve an efficient routing in a wireless sensor network, connected dominating set (CDS) is used as virtual backbone. A fault-tolerant virtual backbone can be modeled as a $(k,m)$-CDS. For a connected graph $G=(V,E)$ and two fixed integers $k$ and $m$, a node set $C\\subseteq V$ is a $(k,m)$-CDS of $G$ if every node in $V\\setminus C$ has at least $m$ neighbors in $C$, and the subgraph of $G$ induced by $C$ is $k$-connected. Previous to this work, approximation algorithms with guaranteed performance ratio in a general graph were know only for $k\\leq 3$. This paper makes a significant progres"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1608.07634","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2016-08-27T00:10:10Z","cross_cats_sorted":[],"title_canon_sha256":"c733a450811ff4055f84613fc45312f60b7b205fdd0e1442d6c9da8a66e8ad92","abstract_canon_sha256":"cdec965f8c6dcb0eb383f71cfdeb908b25ac6fb8db554ee690d015ddc27ef80f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:50.231838Z","signature_b64":"43Gr3S1mm575RnrSj6/YIgyVR2l1/5RmhIUenqzIbI2nQBEe8cyfarl/mTi33ryS9bb1//veNXxTEIsCRJxLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b94efffbd6797d9cfbce73bba628f2f5f150c2c876f67dfc4a22d230d8bd1946","last_reissued_at":"2026-05-18T01:07:50.231240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:50.231240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ding-Zhu Du, Jiao Zhou, Xiaohui Huang, Zhao Zhang","submitted_at":"2016-08-27T00:10:10Z","abstract_excerpt":"To achieve an efficient routing in a wireless sensor network, connected dominating set (CDS) is used as virtual backbone. A fault-tolerant virtual backbone can be modeled as a $(k,m)$-CDS. For a connected graph $G=(V,E)$ and two fixed integers $k$ and $m$, a node set $C\\subseteq V$ is a $(k,m)$-CDS of $G$ if every node in $V\\setminus C$ has at least $m$ neighbors in $C$, and the subgraph of $G$ induced by $C$ is $k$-connected. Previous to this work, approximation algorithms with guaranteed performance ratio in a general graph were know only for $k\\leq 3$. This paper makes a significant progres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07634","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.07634","created_at":"2026-05-18T01:07:50.231331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07634v1","created_at":"2026-05-18T01:07:50.231331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07634","created_at":"2026-05-18T01:07:50.231331+00:00"},{"alias_kind":"pith_short_12","alias_value":"XFHP766WPF6Z","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XFHP766WPF6ZZ66O","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XFHP766W","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XFHP766WPF6ZZ66OOO52MKHS6X","json":"https://pith.science/pith/XFHP766WPF6ZZ66OOO52MKHS6X.json","graph_json":"https://pith.science/api/pith-number/XFHP766WPF6ZZ66OOO52MKHS6X/graph.json","events_json":"https://pith.science/api/pith-number/XFHP766WPF6ZZ66OOO52MKHS6X/events.json","paper":"https://pith.science/paper/XFHP766W"},"agent_actions":{"view_html":"https://pith.science/pith/XFHP766WPF6ZZ66OOO52MKHS6X","download_json":"https://pith.science/pith/XFHP766WPF6ZZ66OOO52MKHS6X.json","view_paper":"https://pith.science/paper/XFHP766W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07634&json=true","fetch_graph":"https://pith.science/api/pith-number/XFHP766WPF6ZZ66OOO52MKHS6X/graph.json","fetch_events":"https://pith.science/api/pith-number/XFHP766WPF6ZZ66OOO52MKHS6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XFHP766WPF6ZZ66OOO52MKHS6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XFHP766WPF6ZZ66OOO52MKHS6X/action/storage_attestation","attest_author":"https://pith.science/pith/XFHP766WPF6ZZ66OOO52MKHS6X/action/author_attestation","sign_citation":"https://pith.science/pith/XFHP766WPF6ZZ66OOO52MKHS6X/action/citation_signature","submit_replication":"https://pith.science/pith/XFHP766WPF6ZZ66OOO52MKHS6X/action/replication_record"}},"created_at":"2026-05-18T01:07:50.231331+00:00","updated_at":"2026-05-18T01:07:50.231331+00:00"}