{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3QMTJOFZA3APR5BDR3RRH4IIEP","short_pith_number":"pith:3QMTJOFZ","canonical_record":{"source":{"id":"1508.07343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-08-28T20:50:43Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5191f3ce011ccd4dd5ff153fde14ff49f1e8e6a2a7d0470c5d44e7bbed16a165","abstract_canon_sha256":"468e30391e0e9cf1eb3510d4698e8a746382faff367261dd25e5f71879e11dc9"},"schema_version":"1.0"},"canonical_sha256":"dc1934b8b906c0f8f4238ee313f10823d64c59582e549f828339dd3fd7cb0401","source":{"kind":"arxiv","id":"1508.07343","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07343","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07343v1","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07343","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"3QMTJOFZA3AP","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QMTJOFZA3APR5BD","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QMTJOFZ","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3QMTJOFZA3APR5BDR3RRH4IIEP","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-08-28T20:50:43Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5191f3ce011ccd4dd5ff153fde14ff49f1e8e6a2a7d0470c5d44e7bbed16a165","abstract_canon_sha256":"468e30391e0e9cf1eb3510d4698e8a746382faff367261dd25e5f71879e11dc9"},"schema_version":"1.0"},"canonical_sha256":"dc1934b8b906c0f8f4238ee313f10823d64c59582e549f828339dd3fd7cb0401","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:50.421903Z","signature_b64":"SW/L0qDqIs9jM0/slo6LBu85K7QoVZ32E0guSqlZRWvSFfJepXEgT/5MzM0NDvEgdl34YanIpbbop9uE98g5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc1934b8b906c0f8f4238ee313f10823d64c59582e549f828339dd3fd7cb0401","last_reissued_at":"2026-05-18T00:57:50.421280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:50.421280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07343","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-18T00:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gwO1k5B43FzseteIWQaftK97CSsjPxcvuwItoSbxwX3pIO8fEBmfRrMU5HQqAy1ZNpjPa6VRDzfkejT3SehjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:27:35.184357Z"},"content_sha256":"2f048a93375065b2d995e891b94a3aa1c9a5a84152e386ffd2cb722c9e786649","schema_version":"1.0","event_id":"sha256:2f048a93375065b2d995e891b94a3aa1c9a5a84152e386ffd2cb722c9e786649"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3QMTJOFZA3APR5BDR3RRH4IIEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lifetime Maximization of Wireless Sensor Networks with a Mobile Source Node","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NI","authors_text":"Christos G. Cassandras, Sepideh Pourazarm","submitted_at":"2015-08-28T20:50:43Z","abstract_excerpt":"We study the problem of routing in sensor networks where the goal is to maximize the network's lifetime. Previous work has considered this problem for fixed-topology networks. Here, we add mobility to the source node, which requires a new definition of the network lifetime. In particular, we redefine lifetime to be the time until the source node depletes its energy. When the mobile node's trajectory is unknown in advance, we formulate three versions of an optimal control problem aiming at this lifetime maximization. We show that in all cases, the solution can be reduced to a sequence of Non- L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07343","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-18T00:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROY8pujYha7P5HgLtqrfm0aqs1gmJpMhJjwqYnEXHtWEiTw/HylvYrUjBxWgQnkFcCMngimRgJShQadKW7PwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:27:35.184793Z"},"content_sha256":"60e06e8492479bcd15175588f5c89097c655736d0a84d43a719237bf22ba71b2","schema_version":"1.0","event_id":"sha256:60e06e8492479bcd15175588f5c89097c655736d0a84d43a719237bf22ba71b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3QMTJOFZA3APR5BDR3RRH4IIEP/bundle.json","state_url":"https://pith.science/pith/3QMTJOFZA3APR5BDR3RRH4IIEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3QMTJOFZA3APR5BDR3RRH4IIEP/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-06-01T04:27:35Z","links":{"resolver":"https://pith.science/pith/3QMTJOFZA3APR5BDR3RRH4IIEP","bundle":"https://pith.science/pith/3QMTJOFZA3APR5BDR3RRH4IIEP/bundle.json","state":"https://pith.science/pith/3QMTJOFZA3APR5BDR3RRH4IIEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3QMTJOFZA3APR5BDR3RRH4IIEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3QMTJOFZA3APR5BDR3RRH4IIEP","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":"468e30391e0e9cf1eb3510d4698e8a746382faff367261dd25e5f71879e11dc9","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-08-28T20:50:43Z","title_canon_sha256":"5191f3ce011ccd4dd5ff153fde14ff49f1e8e6a2a7d0470c5d44e7bbed16a165"},"schema_version":"1.0","source":{"id":"1508.07343","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07343","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07343v1","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07343","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"3QMTJOFZA3AP","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3QMTJOFZA3APR5BD","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3QMTJOFZ","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:60e06e8492479bcd15175588f5c89097c655736d0a84d43a719237bf22ba71b2","target":"graph","created_at":"2026-05-18T00:57:50Z","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 study the problem of routing in sensor networks where the goal is to maximize the network's lifetime. Previous work has considered this problem for fixed-topology networks. Here, we add mobility to the source node, which requires a new definition of the network lifetime. In particular, we redefine lifetime to be the time until the source node depletes its energy. When the mobile node's trajectory is unknown in advance, we formulate three versions of an optimal control problem aiming at this lifetime maximization. We show that in all cases, the solution can be reduced to a sequence of Non- L","authors_text":"Christos G. Cassandras, Sepideh Pourazarm","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-08-28T20:50:43Z","title":"Lifetime Maximization of Wireless Sensor Networks with a Mobile Source Node"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07343","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:2f048a93375065b2d995e891b94a3aa1c9a5a84152e386ffd2cb722c9e786649","target":"record","created_at":"2026-05-18T00:57:50Z","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":"468e30391e0e9cf1eb3510d4698e8a746382faff367261dd25e5f71879e11dc9","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-08-28T20:50:43Z","title_canon_sha256":"5191f3ce011ccd4dd5ff153fde14ff49f1e8e6a2a7d0470c5d44e7bbed16a165"},"schema_version":"1.0","source":{"id":"1508.07343","kind":"arxiv","version":1}},"canonical_sha256":"dc1934b8b906c0f8f4238ee313f10823d64c59582e549f828339dd3fd7cb0401","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc1934b8b906c0f8f4238ee313f10823d64c59582e549f828339dd3fd7cb0401","first_computed_at":"2026-05-18T00:57:50.421280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:50.421280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SW/L0qDqIs9jM0/slo6LBu85K7QoVZ32E0guSqlZRWvSFfJepXEgT/5MzM0NDvEgdl34YanIpbbop9uE98g5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:50.421903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07343","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f048a93375065b2d995e891b94a3aa1c9a5a84152e386ffd2cb722c9e786649","sha256:60e06e8492479bcd15175588f5c89097c655736d0a84d43a719237bf22ba71b2"],"state_sha256":"61d084fc3a223bb6ac1a05253ddb3c84db2ee57ed978dc6477c15df490783573"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ore1zIM8fZ8LTb3kFdwnkQs2bZh4MCQSsAO79LsqxkQ42HSnXodTiC2DOq6sVf0VTe+I97AQbN96kJCFFguUAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:27:35.187023Z","bundle_sha256":"57b422baf10f23ea2c60de7dd6a0a4517fb192a66ed337107a03955d266cc117"}}