{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZJYFMVLFOQ6SJXQWAITWAAWPWS","short_pith_number":"pith:ZJYFMVLF","canonical_record":{"source":{"id":"1507.02048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-08T07:14:56Z","cross_cats_sorted":[],"title_canon_sha256":"9a42bc89da350a73c8f89cc178fe7f28a60a191104e05983c0ff7f6fcda90fac","abstract_canon_sha256":"67437a637e3efd5944baf45090479cf849f1476be84c386abcbf930782e8a76f"},"schema_version":"1.0"},"canonical_sha256":"ca70565565743d24de1602276002cfb4aced340b311e63580b2aa5e93573e98a","source":{"kind":"arxiv","id":"1507.02048","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02048","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02048v2","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02048","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZJYFMVLFOQ6S","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZJYFMVLFOQ6SJXQW","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZJYFMVLF","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZJYFMVLFOQ6SJXQWAITWAAWPWS","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-08T07:14:56Z","cross_cats_sorted":[],"title_canon_sha256":"9a42bc89da350a73c8f89cc178fe7f28a60a191104e05983c0ff7f6fcda90fac","abstract_canon_sha256":"67437a637e3efd5944baf45090479cf849f1476be84c386abcbf930782e8a76f"},"schema_version":"1.0"},"canonical_sha256":"ca70565565743d24de1602276002cfb4aced340b311e63580b2aa5e93573e98a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:07.103604Z","signature_b64":"38kbeXIUbWOOu5XTngAJavcM5cRhPpoakFZU++NuERJlO7arhikwxGrFlep543jVb84msZgqeS9XMOE/UP5/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca70565565743d24de1602276002cfb4aced340b311e63580b2aa5e93573e98a","last_reissued_at":"2026-05-18T01:37:07.103147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:07.103147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02048","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-18T01:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kig6W7Svlu25jm45hjmVCSzCQoZZhkaal4D2VQmhDUBR1ZvJbaamaQGGahuaXWyZ8GcQXTQZsN7lyN5uAUmBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:45:11.199499Z"},"content_sha256":"8992b87c1f59851923491d3e6a18b57bdb3917d88b91d020e69bbed3f78b294e","schema_version":"1.0","event_id":"sha256:8992b87c1f59851923491d3e6a18b57bdb3917d88b91d020e69bbed3f78b294e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZJYFMVLFOQ6SJXQWAITWAAWPWS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Connectivity-Aware Approximation Algorithm for 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-07-08T07:14:56Z","abstract_excerpt":"In two-tiered Wireless Sensor Networks (WSNs) relay node placement is one of the key factors impacting the network energy consumption and the system overhead. In this paper, a novel connectivity-aware approximation algorithm for relay node placement in WSNs is proposed to offer a major step forward in saving system overhead. Specifically, a unique Local Search Approximation Algorithm (LSAA) is introduced to solve the Relay Node Single Cover (RNSC) problem. In this proposed LSAA approach, the sensor nodes are allocated into groups and then a local Set Cover (SC) for each group is achieved by a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02048","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-18T01:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6b3zTcnxHCzVIazRbD6LpvEu8QV+41MdMY0cmzo4zZIuNJ+hoi36nCc9d/n1HESOYPWq2tBSJ2DWeoxxGA0WBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:45:11.199882Z"},"content_sha256":"229364b92f37f4832b0e738b097413892d18f1fc4af85d91d5331d5b86f1449a","schema_version":"1.0","event_id":"sha256:229364b92f37f4832b0e738b097413892d18f1fc4af85d91d5331d5b86f1449a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJYFMVLFOQ6SJXQWAITWAAWPWS/bundle.json","state_url":"https://pith.science/pith/ZJYFMVLFOQ6SJXQWAITWAAWPWS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJYFMVLFOQ6SJXQWAITWAAWPWS/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-26T09:45:11Z","links":{"resolver":"https://pith.science/pith/ZJYFMVLFOQ6SJXQWAITWAAWPWS","bundle":"https://pith.science/pith/ZJYFMVLFOQ6SJXQWAITWAAWPWS/bundle.json","state":"https://pith.science/pith/ZJYFMVLFOQ6SJXQWAITWAAWPWS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJYFMVLFOQ6SJXQWAITWAAWPWS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZJYFMVLFOQ6SJXQWAITWAAWPWS","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":"67437a637e3efd5944baf45090479cf849f1476be84c386abcbf930782e8a76f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-08T07:14:56Z","title_canon_sha256":"9a42bc89da350a73c8f89cc178fe7f28a60a191104e05983c0ff7f6fcda90fac"},"schema_version":"1.0","source":{"id":"1507.02048","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02048","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02048v2","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02048","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZJYFMVLFOQ6S","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZJYFMVLFOQ6SJXQW","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZJYFMVLF","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:229364b92f37f4832b0e738b097413892d18f1fc4af85d91d5331d5b86f1449a","target":"graph","created_at":"2026-05-18T01:37:07Z","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":"In two-tiered Wireless Sensor Networks (WSNs) relay node placement is one of the key factors impacting the network energy consumption and the system overhead. In this paper, a novel connectivity-aware approximation algorithm for relay node placement in WSNs is proposed to offer a major step forward in saving system overhead. Specifically, a unique Local Search Approximation Algorithm (LSAA) is introduced to solve the Relay Node Single Cover (RNSC) problem. In this proposed LSAA approach, the sensor nodes are allocated into groups and then a local Set Cover (SC) for each group is achieved by a ","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-07-08T07:14:56Z","title":"A Connectivity-Aware Approximation Algorithm for Relay Node Placement in Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02048","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:8992b87c1f59851923491d3e6a18b57bdb3917d88b91d020e69bbed3f78b294e","target":"record","created_at":"2026-05-18T01:37:07Z","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":"67437a637e3efd5944baf45090479cf849f1476be84c386abcbf930782e8a76f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-07-08T07:14:56Z","title_canon_sha256":"9a42bc89da350a73c8f89cc178fe7f28a60a191104e05983c0ff7f6fcda90fac"},"schema_version":"1.0","source":{"id":"1507.02048","kind":"arxiv","version":2}},"canonical_sha256":"ca70565565743d24de1602276002cfb4aced340b311e63580b2aa5e93573e98a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca70565565743d24de1602276002cfb4aced340b311e63580b2aa5e93573e98a","first_computed_at":"2026-05-18T01:37:07.103147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:07.103147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"38kbeXIUbWOOu5XTngAJavcM5cRhPpoakFZU++NuERJlO7arhikwxGrFlep543jVb84msZgqeS9XMOE/UP5/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:07.103604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02048","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8992b87c1f59851923491d3e6a18b57bdb3917d88b91d020e69bbed3f78b294e","sha256:229364b92f37f4832b0e738b097413892d18f1fc4af85d91d5331d5b86f1449a"],"state_sha256":"7088972bb833128d375681ecd73f979259f9ac37233850c93f1a69288ef30b94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FonbM1rAAXOJdaG4ksYG3Nl7FyXVyqtI4SWzo5lJQBy/AxwU2F742BJuS2GMcr1ysyzNPlNW8kNJL2tnNJ0ZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:45:11.202635Z","bundle_sha256":"f4696ba4c9af0d7bedcc3e5d1223a9ca9262ae115479773b7b3ee4b15a72c0d4"}}