{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XQTAO6VM2L26MYIW2YFIHVHRUI","short_pith_number":"pith:XQTAO6VM","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"},"canonical_sha256":"bc26077aacd2f5e66116d60a83d4f1a23cbf9b4bef57813c7c7fa00812ec99fb","source":{"kind":"arxiv","id":"1604.06181","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06181","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06181v2","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06181","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"pith_short_12","alias_value":"XQTAO6VM2L26","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XQTAO6VM2L26MYIW","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XQTAO6VM","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XQTAO6VM2L26MYIW2YFIHVHRUI","target":"record","payload":{"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"},"canonical_sha256":"bc26077aacd2f5e66116d60a83d4f1a23cbf9b4bef57813c7c7fa00812ec99fb","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"},"source_kind":"arxiv","source_id":"1604.06181","source_version":2,"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:27:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4+zwEIx4Unao6Dc/PPunusVUQUiOC1//SoaXE10u7tql0Y6rEVMk9YSp3YRQy6BWrW1eibhyJUbcpI34aXtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:28:26.495872Z"},"content_sha256":"ed38be772d6e7c5fa11abd3630150b63e1ed081c10ba02586b421ddace365a1b","schema_version":"1.0","event_id":"sha256:ed38be772d6e7c5fa11abd3630150b63e1ed081c10ba02586b421ddace365a1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XQTAO6VM2L26MYIW2YFIHVHRUI","target":"graph","payload":{"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"},"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:27:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K/0UAY91lW7ZFsqrIaieJJJ2QXByzaXt5AntmRJtRrJ8SC9C8jDUDsDd66Iw/yyfz9CQmidyvqn0nYriBE6+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:28:26.496551Z"},"content_sha256":"227aa95a528606403532974bac0ab869826118e280ae71ff322afc0f04949576","schema_version":"1.0","event_id":"sha256:227aa95a528606403532974bac0ab869826118e280ae71ff322afc0f04949576"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI/bundle.json","state_url":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQTAO6VM2L26MYIW2YFIHVHRUI/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-11T08:28:26Z","links":{"resolver":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI","bundle":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI/bundle.json","state":"https://pith.science/pith/XQTAO6VM2L26MYIW2YFIHVHRUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQTAO6VM2L26MYIW2YFIHVHRUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XQTAO6VM2L26MYIW2YFIHVHRUI","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":"681d44ead7b1bbc199a7b7adaedb77c0bf915cb2e9fef856efe639a6e4023ac5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-21T05:07:40Z","title_canon_sha256":"f180474bb55b18260289f72cce9f10e5c0e5774dfdd055dfff64de50a621a39a"},"schema_version":"1.0","source":{"id":"1604.06181","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06181","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06181v2","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06181","created_at":"2026-05-18T00:27:22Z"},{"alias_kind":"pith_short_12","alias_value":"XQTAO6VM2L26","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XQTAO6VM2L26MYIW","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XQTAO6VM","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:227aa95a528606403532974bac0ab869826118e280ae71ff322afc0f04949576","target":"graph","created_at":"2026-05-18T00:27:22Z","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":"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","authors_text":"Ding-Zhu Du, Jiao Zhou, Xiaohui Huang, Zhao Zhang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-21T05:07:40Z","title":"Approximation Algorithm for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06181","kind":"arxiv","version":2},"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:ed38be772d6e7c5fa11abd3630150b63e1ed081c10ba02586b421ddace365a1b","target":"record","created_at":"2026-05-18T00:27:22Z","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":"681d44ead7b1bbc199a7b7adaedb77c0bf915cb2e9fef856efe639a6e4023ac5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-21T05:07:40Z","title_canon_sha256":"f180474bb55b18260289f72cce9f10e5c0e5774dfdd055dfff64de50a621a39a"},"schema_version":"1.0","source":{"id":"1604.06181","kind":"arxiv","version":2}},"canonical_sha256":"bc26077aacd2f5e66116d60a83d4f1a23cbf9b4bef57813c7c7fa00812ec99fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc26077aacd2f5e66116d60a83d4f1a23cbf9b4bef57813c7c7fa00812ec99fb","first_computed_at":"2026-05-18T00:27:22.304408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:22.304408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UuWmDzWuSJvHMG71rag27unX1n4VuZ5M6BMnuW64g+1tc6sh4TkdR7pYkkDyi1AXy58iBInB00Nyl+3wa9WkCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:22.305014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06181","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed38be772d6e7c5fa11abd3630150b63e1ed081c10ba02586b421ddace365a1b","sha256:227aa95a528606403532974bac0ab869826118e280ae71ff322afc0f04949576"],"state_sha256":"7a82ac2874ab830e4a65dbebf16cbb543aea00f85fbe3ce98027d9a5f4e8f8a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hiTpdKdGZJHjUwtQWWVxH1a1PQ5sQXvgi7M/O36Z+HO9tkB5++h4vkz5jqA2o6gKLhwJbrw+omAHkpCShbnfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:28:26.500786Z","bundle_sha256":"f777d3ac09ef6225e5c3631c75319919d078c5c63d1754712cde88f3dfee02bc"}}