{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MYP45ALP27QJBWAM5BHWWTCYFP","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":"272a202a7346e6e10503443df4799b9f12b50235394a3cd3b0b068e8ef75ec50","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-19T14:29:59Z","title_canon_sha256":"188aca19843c17dd126892c8a66de569b85e46ae5f925dc3901e54a3831bc3b4"},"schema_version":"1.0","source":{"id":"1307.5230","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5230","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5230v2","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5230","created_at":"2026-05-18T02:48:46Z"},{"alias_kind":"pith_short_12","alias_value":"MYP45ALP27QJ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MYP45ALP27QJBWAM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MYP45ALP","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:4b524add5351fa8edfa836a34e36b8aedeb50799e341c1d4e71672ed909e8ee6","target":"graph","created_at":"2026-05-18T02:48:46Z","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":"We consider the problem of maximizing the lifetime of coverage (MLCP) of targets in a wireless sensor network with battery-limited sensors. We first show that the MLCP cannot be approximated within a factor less than $\\ln n$ by any polynomial time algorithm, where $n$ is the number of targets. This provides closure to the long-standing open problem of showing optimality of previously known $\\ln n$ approximation algorithms. We also derive a new $\\ln n$ approximation to the MLCP by showing a $\\ln n$ approximation to the maximum disjoint set cover problem (DSCP), which has many advantages over pr","authors_text":"Ashwin Pananjady, Rahul Vaze, Vivek Kumar Bagaria","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-19T14:29:59Z","title":"Optimally Approximating the Coverage Lifetime of Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5230","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:9a463457b3a3b1987a4d15a53e9da3e9981810bb342b774e914a31a6a81364d8","target":"record","created_at":"2026-05-18T02:48:46Z","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":"272a202a7346e6e10503443df4799b9f12b50235394a3cd3b0b068e8ef75ec50","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-19T14:29:59Z","title_canon_sha256":"188aca19843c17dd126892c8a66de569b85e46ae5f925dc3901e54a3831bc3b4"},"schema_version":"1.0","source":{"id":"1307.5230","kind":"arxiv","version":2}},"canonical_sha256":"661fce816fd7e090d80ce84f6b4c582bf15275375b33e431611bf364e0f78b0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"661fce816fd7e090d80ce84f6b4c582bf15275375b33e431611bf364e0f78b0c","first_computed_at":"2026-05-18T02:48:46.894079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:46.894079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3gnqMt86S8vGoAXOJO52pVaAqSJTma2FpN64pGIJaIdvbqW7bUnvbjz7UxNaNfTpnhLT+YpA4s+D69GxYd31Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:46.894765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5230","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a463457b3a3b1987a4d15a53e9da3e9981810bb342b774e914a31a6a81364d8","sha256:4b524add5351fa8edfa836a34e36b8aedeb50799e341c1d4e71672ed909e8ee6"],"state_sha256":"24d3c7a46f3010376da57f265ebb55450ccb2a79e7a3ca94f81fbb070c8ca878"}