{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TKWG737QDGDYQG6N6DSKY3YUD2","short_pith_number":"pith:TKWG737Q","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"},"canonical_sha256":"9aac6feff01987881bcdf0e4ac6f141ebe9133729080838c029ee7020d1c67b2","source":{"kind":"arxiv","id":"1504.00832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00832","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00832v1","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00832","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"TKWG737QDGDY","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TKWG737QDGDYQG6N","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TKWG737Q","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TKWG737QDGDYQG6N6DSKY3YUD2","target":"record","payload":{"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"},"canonical_sha256":"9aac6feff01987881bcdf0e4ac6f141ebe9133729080838c029ee7020d1c67b2","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"},"source_kind":"arxiv","source_id":"1504.00832","source_version":1,"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-18T02:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aL1FZIyfoDx/n763dZ3KPLyfSYhPs/wKFQ8JQR1PXW9ixfcDopDwA76WB335G5LVmdwiIboO4DtR3j32tZOcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:16:11.748027Z"},"content_sha256":"6b9a4cc9755a1d314c79caf9561647d5d0eb7ccfa3d2c7400b0412b1a98df97a","schema_version":"1.0","event_id":"sha256:6b9a4cc9755a1d314c79caf9561647d5d0eb7ccfa3d2c7400b0412b1a98df97a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TKWG737QDGDYQG6N6DSKY3YUD2","target":"graph","payload":{"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"},"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-18T02:19:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhSTjJxgYgrJA9r/o1IV+1tydaetZMoxQr+TFap6ps828sID6hP1EVcSEAAMqWg4M+G3+hsbm9IsYoKw6FtwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:16:11.748753Z"},"content_sha256":"91d635996bbf178a84aaee466768e808c7df5834d2a6f41dbf66b6c5dd2ab5fe","schema_version":"1.0","event_id":"sha256:91d635996bbf178a84aaee466768e808c7df5834d2a6f41dbf66b6c5dd2ab5fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2/bundle.json","state_url":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKWG737QDGDYQG6N6DSKY3YUD2/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-05-26T19:16:11Z","links":{"resolver":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2","bundle":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2/bundle.json","state":"https://pith.science/pith/TKWG737QDGDYQG6N6DSKY3YUD2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKWG737QDGDYQG6N6DSKY3YUD2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TKWG737QDGDYQG6N6DSKY3YUD2","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":"e6e1ae714a387968aec9ee89489f4a77f18ada04ec455511c17fa48184c0f731","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-04-03T13:00:47Z","title_canon_sha256":"857531f5aded6d0257e9e41aefb87af1364a2e0904304a2a05650de887b4189c"},"schema_version":"1.0","source":{"id":"1504.00832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00832","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00832v1","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00832","created_at":"2026-05-18T02:19:36Z"},{"alias_kind":"pith_short_12","alias_value":"TKWG737QDGDY","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TKWG737QDGDYQG6N","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TKWG737Q","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:91d635996bbf178a84aaee466768e808c7df5834d2a6f41dbf66b6c5dd2ab5fe","target":"graph","created_at":"2026-05-18T02:19:36Z","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":"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","authors_text":"Chaofan Ma, Meng Zheng, Wei Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-04-03T13:00:47Z","title":"Set Covering-based Approximation Algorithm for Delay Constrained Relay Node Placement in Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00832","kind":"arxiv","version":1},"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:6b9a4cc9755a1d314c79caf9561647d5d0eb7ccfa3d2c7400b0412b1a98df97a","target":"record","created_at":"2026-05-18T02:19:36Z","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":"e6e1ae714a387968aec9ee89489f4a77f18ada04ec455511c17fa48184c0f731","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-04-03T13:00:47Z","title_canon_sha256":"857531f5aded6d0257e9e41aefb87af1364a2e0904304a2a05650de887b4189c"},"schema_version":"1.0","source":{"id":"1504.00832","kind":"arxiv","version":1}},"canonical_sha256":"9aac6feff01987881bcdf0e4ac6f141ebe9133729080838c029ee7020d1c67b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9aac6feff01987881bcdf0e4ac6f141ebe9133729080838c029ee7020d1c67b2","first_computed_at":"2026-05-18T02:19:36.937875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:36.937875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wh1swfW23l17XSiKAXTbtP4+voia3EVRFBsPTPEwQqgo94EuC3J71617qd4TBb6yRTf0kxQWGvUXwgMyH4Y4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:36.938288Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b9a4cc9755a1d314c79caf9561647d5d0eb7ccfa3d2c7400b0412b1a98df97a","sha256:91d635996bbf178a84aaee466768e808c7df5834d2a6f41dbf66b6c5dd2ab5fe"],"state_sha256":"e834428b968b17b3c2993f40ee9e83b6adb53a884d736e12092bb4bdc69ad541"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AcUJc4wkYwL5NM1MtTbPf8/Eln+LuAnaJplrr/7D9SNBw+GwCfVb5X/pBS7mz8CFY6lUxEFXkN24BkifATvBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:16:11.752295Z","bundle_sha256":"da048bb9f61af141ab6f5cf30269a8523715492cb695c24921df860adcd35b4e"}}