{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XQTAO6VM2L26MYIW2YFIHVHRUI","short_pith_number":"pith:XQTAO6VM","schema_version":"1.0","canonical_sha256":"bc26077aacd2f5e66116d60a83d4f1a23cbf9b4bef57813c7c7fa00812ec99fb","source":{"kind":"arxiv","id":"1604.06181","version":2},"attestation_state":"computed","paper":{"title":"Approximation Algorithm for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Ding-Zhu Du, Jiao Zhou, Xiaohui Huang, Zhao Zhang","submitted_at":"2016-04-21T05:07:40Z","abstract_excerpt":"To save energy and alleviate interferences in a wireless sensor network, the usage of virtual backbone was proposed. Because of accidental damages or energy depletion, it is desirable to construct a fault tolerant virtual backbone, which can be modeled as a $k$-connected $m$-fold dominating set (abbreviated as $(k,m)$-CDS) in a graph. A node set $C\\subseteq V(G)$ is a $(k,m)$-CDS of graph $G$ if every node in $V(G)\\backslash C$ is adjacent with at least $m$ nodes in $C$ and the subgraph of $G$ induced by $C$ is $k$-connected. In this paper, we present an approximation algorithm for the minimum"},"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":"1604.06181","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-21T05:07:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f180474bb55b18260289f72cce9f10e5c0e5774dfdd055dfff64de50a621a39a","abstract_canon_sha256":"681d44ead7b1bbc199a7b7adaedb77c0bf915cb2e9fef856efe639a6e4023ac5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:22.305014Z","signature_b64":"UuWmDzWuSJvHMG71rag27unX1n4VuZ5M6BMnuW64g+1tc6sh4TkdR7pYkkDyi1AXy58iBInB00Nyl+3wa9WkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc26077aacd2f5e66116d60a83d4f1a23cbf9b4bef57813c7c7fa00812ec99fb","last_reissued_at":"2026-05-18T00:27:22.304408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:22.304408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithm for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Ding-Zhu Du, Jiao Zhou, Xiaohui Huang, Zhao Zhang","submitted_at":"2016-04-21T05:07:40Z","abstract_excerpt":"To save energy and alleviate interferences in a wireless sensor network, the usage of virtual backbone was proposed. Because of accidental damages or energy depletion, it is desirable to construct a fault tolerant virtual backbone, which can be modeled as a $k$-connected $m$-fold dominating set (abbreviated as $(k,m)$-CDS) in a graph. A node set $C\\subseteq V(G)$ is a $(k,m)$-CDS of graph $G$ if every node in $V(G)\\backslash C$ is adjacent with at least $m$ nodes in $C$ and the subgraph of $G$ induced by $C$ is $k$-connected. In this paper, we present an approximation algorithm for the minimum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06181","kind":"arxiv","version":2},"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":"1604.06181","created_at":"2026-05-18T00:27:22.304494+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06181v2","created_at":"2026-05-18T00:27:22.304494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06181","created_at":"2026-05-18T00:27:22.304494+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQTAO6VM2L26","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQTAO6VM2L26MYIW","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQTAO6VM","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/XQTAO6VM2L26MYIW2YFIHVHRUI","json":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI.json","graph_json":"https://pith.science/api/pith-number/XQTAO6VM2L26MYIW2YFIHVHRUI/graph.json","events_json":"https://pith.science/api/pith-number/XQTAO6VM2L26MYIW2YFIHVHRUI/events.json","paper":"https://pith.science/paper/XQTAO6VM"},"agent_actions":{"view_html":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI","download_json":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI.json","view_paper":"https://pith.science/paper/XQTAO6VM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06181&json=true","fetch_graph":"https://pith.science/api/pith-number/XQTAO6VM2L26MYIW2YFIHVHRUI/graph.json","fetch_events":"https://pith.science/api/pith-number/XQTAO6VM2L26MYIW2YFIHVHRUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI/action/storage_attestation","attest_author":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI/action/author_attestation","sign_citation":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI/action/citation_signature","submit_replication":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI/action/replication_record"}},"created_at":"2026-05-18T00:27:22.304494+00:00","updated_at":"2026-05-18T00:27:22.304494+00:00"}