{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MYP45ALP27QJBWAM5BHWWTCYFP","short_pith_number":"pith:MYP45ALP","canonical_record":{"source":{"id":"1307.5230","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-19T14:29:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"188aca19843c17dd126892c8a66de569b85e46ae5f925dc3901e54a3831bc3b4","abstract_canon_sha256":"272a202a7346e6e10503443df4799b9f12b50235394a3cd3b0b068e8ef75ec50"},"schema_version":"1.0"},"canonical_sha256":"661fce816fd7e090d80ce84f6b4c582bf15275375b33e431611bf364e0f78b0c","source":{"kind":"arxiv","id":"1307.5230","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MYP45ALP27QJBWAM5BHWWTCYFP","target":"record","payload":{"canonical_record":{"source":{"id":"1307.5230","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-07-19T14:29:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"188aca19843c17dd126892c8a66de569b85e46ae5f925dc3901e54a3831bc3b4","abstract_canon_sha256":"272a202a7346e6e10503443df4799b9f12b50235394a3cd3b0b068e8ef75ec50"},"schema_version":"1.0"},"canonical_sha256":"661fce816fd7e090d80ce84f6b4c582bf15275375b33e431611bf364e0f78b0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:46.894765Z","signature_b64":"3gnqMt86S8vGoAXOJO52pVaAqSJTma2FpN64pGIJaIdvbqW7bUnvbjz7UxNaNfTpnhLT+YpA4s+D69GxYd31Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"661fce816fd7e090d80ce84f6b4c582bf15275375b33e431611bf364e0f78b0c","last_reissued_at":"2026-05-18T02:48:46.894079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:46.894079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.5230","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-18T02:48:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZOVLOxvb0GFUndAYzFsrpY6w34l1bsnTRcmpGlDFgWf+zGN8WCk0Fz2AZtKnyLIR1Fi+36u6W96JSv62XuvHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:45:22.553975Z"},"content_sha256":"9a463457b3a3b1987a4d15a53e9da3e9981810bb342b774e914a31a6a81364d8","schema_version":"1.0","event_id":"sha256:9a463457b3a3b1987a4d15a53e9da3e9981810bb342b774e914a31a6a81364d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MYP45ALP27QJBWAM5BHWWTCYFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimally Approximating the Coverage Lifetime of Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Ashwin Pananjady, Rahul Vaze, Vivek Kumar Bagaria","submitted_at":"2013-07-19T14:29:59Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5230","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-18T02:48:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXxQvu6R/VfcRJzYFanYYjjuqTnzwlfpSY5yR9B9HALGSD3tqZXL5KI6PCukctBlIYiy1VqBOXhAP/AycpeWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:45:22.554653Z"},"content_sha256":"4b524add5351fa8edfa836a34e36b8aedeb50799e341c1d4e71672ed909e8ee6","schema_version":"1.0","event_id":"sha256:4b524add5351fa8edfa836a34e36b8aedeb50799e341c1d4e71672ed909e8ee6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYP45ALP27QJBWAM5BHWWTCYFP/bundle.json","state_url":"https://pith.science/pith/MYP45ALP27QJBWAM5BHWWTCYFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYP45ALP27QJBWAM5BHWWTCYFP/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-28T21:45:22Z","links":{"resolver":"https://pith.science/pith/MYP45ALP27QJBWAM5BHWWTCYFP","bundle":"https://pith.science/pith/MYP45ALP27QJBWAM5BHWWTCYFP/bundle.json","state":"https://pith.science/pith/MYP45ALP27QJBWAM5BHWWTCYFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYP45ALP27QJBWAM5BHWWTCYFP/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fj/Vxy8p8DyMCjbymtiQEZcyHgPJFB6vBFYdDO0IxwcG6jKqzAQHhbc1FS9ueD77xPj3x/u+ou9QSjqnHq1qBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:45:22.558034Z","bundle_sha256":"e64ee62cf034cc6f0959a4a5433f8b7ed30b7fb27d4e653e3243812af3a0877c"}}