{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5OD4NDHOMYYNJ2XVFI7P6LIXJ4","short_pith_number":"pith:5OD4NDHO","schema_version":"1.0","canonical_sha256":"eb87c68cee6630d4eaf52a3eff2d174f2bbf21a80883b2fcf370f4198921c5c9","source":{"kind":"arxiv","id":"1311.3105","version":1},"attestation_state":"computed","paper":{"title":"k-DAG Based Lifetime Aware Data Collection in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hui Wu, Jingjing Fei, Yongxin Wang","submitted_at":"2013-11-13T12:31:35Z","abstract_excerpt":"Wireless Sensor Networks need to be organized for efficient data collection and lifetime maximization. In this paper, we propose a novel routing structure, namely k-DAG, to balance the load of the base station's neighbours while providing the worst-case latency guarantee for data collection, and a distributed algorithm for construction a k-DAG based on a SPD (Shortest Path DAG). In a k-DAG, the lengths of the longest path and the shortest path of each sensor node to the base station differ by at most k. By adding sibling edges to a SPD, our distributed algorithm allows critical nodes to have m"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1311.3105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-13T12:31:35Z","cross_cats_sorted":[],"title_canon_sha256":"a0899ec60546a438237eaf79406d61380097df7f47df6df2f5e5903d86d8689e","abstract_canon_sha256":"42520f6394c9d4376a442c7b10f52bc9054112daa0cd0ed2433d16214a33dbbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:13.091783Z","signature_b64":"0ejOVr3U4p2qBWy2laTDnofKqZbtqysC5gq/VJr3mnqZE7SBj1AknfE2o8U32oRTMeqGAUroUDbpV5A8M0xqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb87c68cee6630d4eaf52a3eff2d174f2bbf21a80883b2fcf370f4198921c5c9","last_reissued_at":"2026-05-18T03:07:13.091038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:13.091038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-DAG Based Lifetime Aware Data Collection in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hui Wu, Jingjing Fei, Yongxin Wang","submitted_at":"2013-11-13T12:31:35Z","abstract_excerpt":"Wireless Sensor Networks need to be organized for efficient data collection and lifetime maximization. In this paper, we propose a novel routing structure, namely k-DAG, to balance the load of the base station's neighbours while providing the worst-case latency guarantee for data collection, and a distributed algorithm for construction a k-DAG based on a SPD (Shortest Path DAG). In a k-DAG, the lengths of the longest path and the shortest path of each sensor node to the base station differ by at most k. By adding sibling edges to a SPD, our distributed algorithm allows critical nodes to have m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3105","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.3105","created_at":"2026-05-18T03:07:13.091160+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3105v1","created_at":"2026-05-18T03:07:13.091160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3105","created_at":"2026-05-18T03:07:13.091160+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OD4NDHOMYYN","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OD4NDHOMYYNJ2XV","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OD4NDHO","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4","json":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4.json","graph_json":"https://pith.science/api/pith-number/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/graph.json","events_json":"https://pith.science/api/pith-number/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/events.json","paper":"https://pith.science/paper/5OD4NDHO"},"agent_actions":{"view_html":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4","download_json":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4.json","view_paper":"https://pith.science/paper/5OD4NDHO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3105&json=true","fetch_graph":"https://pith.science/api/pith-number/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/action/storage_attestation","attest_author":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/action/author_attestation","sign_citation":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/action/citation_signature","submit_replication":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/action/replication_record"}},"created_at":"2026-05-18T03:07:13.091160+00:00","updated_at":"2026-05-18T03:07:13.091160+00:00"}