{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5OD4NDHOMYYNJ2XVFI7P6LIXJ4","short_pith_number":"pith:5OD4NDHO","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"},"canonical_sha256":"eb87c68cee6630d4eaf52a3eff2d174f2bbf21a80883b2fcf370f4198921c5c9","source":{"kind":"arxiv","id":"1311.3105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3105","created_at":"2026-05-18T03:07:13Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3105v1","created_at":"2026-05-18T03:07:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3105","created_at":"2026-05-18T03:07:13Z"},{"alias_kind":"pith_short_12","alias_value":"5OD4NDHOMYYN","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5OD4NDHOMYYNJ2XV","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5OD4NDHO","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5OD4NDHOMYYNJ2XVFI7P6LIXJ4","target":"record","payload":{"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"},"canonical_sha256":"eb87c68cee6630d4eaf52a3eff2d174f2bbf21a80883b2fcf370f4198921c5c9","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"},"source_kind":"arxiv","source_id":"1311.3105","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-18T03:07:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2KzQjjS16yTFDQXcJEYiB4uSFvvNCwi04AlKYgCsj0TscCfO/iPiWoNvnoMcHD2hyWjOcet1TmayDNqFRlKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:49:31.322684Z"},"content_sha256":"db39fe7896a02bd57dd4768213b4ec8f55ef874f3a6aa7ab9c0901789b0c4ce6","schema_version":"1.0","event_id":"sha256:db39fe7896a02bd57dd4768213b4ec8f55ef874f3a6aa7ab9c0901789b0c4ce6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5OD4NDHOMYYNJ2XVFI7P6LIXJ4","target":"graph","payload":{"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"},"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-18T03:07:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akrKKJi73qVQ8gML/N/7c9ARYcNP6fIOVXYqfBZ8JVBKC0SdB//X1x97iyrAfL/pkg/lPkgwHkcXMEHifkJ5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:49:31.323263Z"},"content_sha256":"5043c2dc3455fc175184bb4f2f13b3919397b4f2ae287ee560569842a8c5c493","schema_version":"1.0","event_id":"sha256:5043c2dc3455fc175184bb4f2f13b3919397b4f2ae287ee560569842a8c5c493"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/bundle.json","state_url":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/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-27T19:49:31Z","links":{"resolver":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4","bundle":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/bundle.json","state":"https://pith.science/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5OD4NDHOMYYNJ2XVFI7P6LIXJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5OD4NDHOMYYNJ2XVFI7P6LIXJ4","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":"42520f6394c9d4376a442c7b10f52bc9054112daa0cd0ed2433d16214a33dbbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-13T12:31:35Z","title_canon_sha256":"a0899ec60546a438237eaf79406d61380097df7f47df6df2f5e5903d86d8689e"},"schema_version":"1.0","source":{"id":"1311.3105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3105","created_at":"2026-05-18T03:07:13Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3105v1","created_at":"2026-05-18T03:07:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3105","created_at":"2026-05-18T03:07:13Z"},{"alias_kind":"pith_short_12","alias_value":"5OD4NDHOMYYN","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5OD4NDHOMYYNJ2XV","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5OD4NDHO","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:5043c2dc3455fc175184bb4f2f13b3919397b4f2ae287ee560569842a8c5c493","target":"graph","created_at":"2026-05-18T03:07:13Z","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":"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","authors_text":"Hui Wu, Jingjing Fei, Yongxin Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-13T12:31:35Z","title":"k-DAG Based Lifetime Aware Data Collection in Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3105","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:db39fe7896a02bd57dd4768213b4ec8f55ef874f3a6aa7ab9c0901789b0c4ce6","target":"record","created_at":"2026-05-18T03:07:13Z","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":"42520f6394c9d4376a442c7b10f52bc9054112daa0cd0ed2433d16214a33dbbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-13T12:31:35Z","title_canon_sha256":"a0899ec60546a438237eaf79406d61380097df7f47df6df2f5e5903d86d8689e"},"schema_version":"1.0","source":{"id":"1311.3105","kind":"arxiv","version":1}},"canonical_sha256":"eb87c68cee6630d4eaf52a3eff2d174f2bbf21a80883b2fcf370f4198921c5c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb87c68cee6630d4eaf52a3eff2d174f2bbf21a80883b2fcf370f4198921c5c9","first_computed_at":"2026-05-18T03:07:13.091038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:13.091038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ejOVr3U4p2qBWy2laTDnofKqZbtqysC5gq/VJr3mnqZE7SBj1AknfE2o8U32oRTMeqGAUroUDbpV5A8M0xqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:13.091783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db39fe7896a02bd57dd4768213b4ec8f55ef874f3a6aa7ab9c0901789b0c4ce6","sha256:5043c2dc3455fc175184bb4f2f13b3919397b4f2ae287ee560569842a8c5c493"],"state_sha256":"543884709e5f03a2832713112dfe443d8e6ea8ab670455ad115a764cc365c0bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J/PEoDG37Bu0hOUagsuFkEdwCJlYsggYOvag7/mqbd/FsDdgx0bx2AhXrhXoe+9ohTSFFAwIAgGJKUL9+XQ0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:49:31.326589Z","bundle_sha256":"7425f5768bb5d4028cd36f6b039e253b4403d6fcff941da921af40e92fb9c13d"}}