{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TKWG737QDGDYQG6N6DSKY3YUD2","short_pith_number":"pith:TKWG737Q","schema_version":"1.0","canonical_sha256":"9aac6feff01987881bcdf0e4ac6f141ebe9133729080838c029ee7020d1c67b2","source":{"kind":"arxiv","id":"1504.00832","version":1},"attestation_state":"computed","paper":{"title":"Set Covering-based Approximation Algorithm for Delay Constrained Relay Node Placement in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chaofan Ma, Meng Zheng, Wei Liang","submitted_at":"2015-04-03T13:00:47Z","abstract_excerpt":"The Delay Constrained Relay Node Placement (DCRNP) problem in Wireless Sensor Networks (WSNs) aims to deploy minimum relay nodes such that for each sensor node there is a path connecting this sensor node to the sink without violating delay constraint. As WSNs are gradually employed in time-critical applications, the importance of the DCRNP problem becomes noticeable. For the NP-hard nature of DCRNP problem, an approximation algorithm-Set-Covering-based Relay Node Placement (SCA) is proposed to solve the DCRNP problem in this paper. The proposed SCA algorithm deploys relay nodes iteratively fro"},"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":"1504.00832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-04-03T13:00:47Z","cross_cats_sorted":[],"title_canon_sha256":"857531f5aded6d0257e9e41aefb87af1364a2e0904304a2a05650de887b4189c","abstract_canon_sha256":"e6e1ae714a387968aec9ee89489f4a77f18ada04ec455511c17fa48184c0f731"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:36.938288Z","signature_b64":"wh1swfW23l17XSiKAXTbtP4+voia3EVRFBsPTPEwQqgo94EuC3J71617qd4TBb6yRTf0kxQWGvUXwgMyH4Y4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9aac6feff01987881bcdf0e4ac6f141ebe9133729080838c029ee7020d1c67b2","last_reissued_at":"2026-05-18T02:19:36.937875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:36.937875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set Covering-based Approximation Algorithm for Delay Constrained Relay Node Placement in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chaofan Ma, Meng Zheng, Wei Liang","submitted_at":"2015-04-03T13:00:47Z","abstract_excerpt":"The Delay Constrained Relay Node Placement (DCRNP) problem in Wireless Sensor Networks (WSNs) aims to deploy minimum relay nodes such that for each sensor node there is a path connecting this sensor node to the sink without violating delay constraint. As WSNs are gradually employed in time-critical applications, the importance of the DCRNP problem becomes noticeable. For the NP-hard nature of DCRNP problem, an approximation algorithm-Set-Covering-based Relay Node Placement (SCA) is proposed to solve the DCRNP problem in this paper. The proposed SCA algorithm deploys relay nodes iteratively fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00832","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":"1504.00832","created_at":"2026-05-18T02:19:36.937944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00832v1","created_at":"2026-05-18T02:19:36.937944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00832","created_at":"2026-05-18T02:19:36.937944+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKWG737QDGDY","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKWG737QDGDYQG6N","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKWG737Q","created_at":"2026-05-18T12:29:42.218222+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/TKWG737QDGDYQG6N6DSKY3YUD2","json":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2.json","graph_json":"https://pith.science/api/pith-number/TKWG737QDGDYQG6N6DSKY3YUD2/graph.json","events_json":"https://pith.science/api/pith-number/TKWG737QDGDYQG6N6DSKY3YUD2/events.json","paper":"https://pith.science/paper/TKWG737Q"},"agent_actions":{"view_html":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2","download_json":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2.json","view_paper":"https://pith.science/paper/TKWG737Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00832&json=true","fetch_graph":"https://pith.science/api/pith-number/TKWG737QDGDYQG6N6DSKY3YUD2/graph.json","fetch_events":"https://pith.science/api/pith-number/TKWG737QDGDYQG6N6DSKY3YUD2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2/action/storage_attestation","attest_author":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2/action/author_attestation","sign_citation":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2/action/citation_signature","submit_replication":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2/action/replication_record"}},"created_at":"2026-05-18T02:19:36.937944+00:00","updated_at":"2026-05-18T02:19:36.937944+00:00"}