{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:762BY2SJSSYVYOOOBVZGU76NDS","short_pith_number":"pith:762BY2SJ","canonical_record":{"source":{"id":"1402.6457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-02-26T09:00:18Z","cross_cats_sorted":[],"title_canon_sha256":"6ebd75a0e07d040ff6d2c70bc6de66f565819a39402e7f502fcfebf1b050db4c","abstract_canon_sha256":"b4553f76fd6121263d15f3701b0fe0c12cf1487ce9d14b96a702c44f13d3043c"},"schema_version":"1.0"},"canonical_sha256":"ffb41c6a4994b15c39ce0d726a7fcd1ca853b0109f9e1b91e08205258b7f1789","source":{"kind":"arxiv","id":"1402.6457","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6457","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6457v1","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6457","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"762BY2SJSSYV","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"762BY2SJSSYVYOOO","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"762BY2SJ","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:762BY2SJSSYVYOOOBVZGU76NDS","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-02-26T09:00:18Z","cross_cats_sorted":[],"title_canon_sha256":"6ebd75a0e07d040ff6d2c70bc6de66f565819a39402e7f502fcfebf1b050db4c","abstract_canon_sha256":"b4553f76fd6121263d15f3701b0fe0c12cf1487ce9d14b96a702c44f13d3043c"},"schema_version":"1.0"},"canonical_sha256":"ffb41c6a4994b15c39ce0d726a7fcd1ca853b0109f9e1b91e08205258b7f1789","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:52.168722Z","signature_b64":"BSwYVAvXrZS3iNDp9srgv4UJfMqoq7G6kcouEjnDkkrc6YiM1hnM7vHviSb68WaQi2HSMkw+43yX/2VWQHjTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffb41c6a4994b15c39ce0d726a7fcd1ca853b0109f9e1b91e08205258b7f1789","last_reissued_at":"2026-05-18T00:57:52.168079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:52.168079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6457","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:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmXXik1Wys//E4kB8AdW9XezlzBBFPtOODDNZZu/xJffcCM6Zb8o0XBLSyHCa7q6gqhdzLHinFRS+FN+QwqrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:29:44.203762Z"},"content_sha256":"d77ef953a845772d7f8b412d0112dc8fda8510c2379e3c363c4f9aa83bec2cf8","schema_version":"1.0","event_id":"sha256:d77ef953a845772d7f8b412d0112dc8fda8510c2379e3c363c4f9aa83bec2cf8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:762BY2SJSSYVYOOOBVZGU76NDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Kate Ching-Ju Lin, Ming-Jer Tsai, Tung-Wei Kuo","submitted_at":"2014-02-26T09:00:18Z","abstract_excerpt":"In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, it is important to collect these data efficiently, that is, to reduce the energy cost of data transmission. Under such applications, a tree is usually adopted as the routing structure to save the computation costs for maintaining the routing tables of sensors. In this paper, we work on the problem of constructing a data aggregation tree that minimizes the total energy cost of data transmission in a wireless sensor networ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6457","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:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggga0g/p7bUZ/4W1x11h+cg0s/5+PsWEdFAY8Aey8nztU7snYKv5yTFQ6ue5YxboFsiDMU2jistDRSlup3ltCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:29:44.204104Z"},"content_sha256":"b8b82fad3b7eb6a91409be2676889390d290e76b5cb839fbb70dfd014d83a619","schema_version":"1.0","event_id":"sha256:b8b82fad3b7eb6a91409be2676889390d290e76b5cb839fbb70dfd014d83a619"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/762BY2SJSSYVYOOOBVZGU76NDS/bundle.json","state_url":"https://pith.science/pith/762BY2SJSSYVYOOOBVZGU76NDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/762BY2SJSSYVYOOOBVZGU76NDS/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-24T04:29:44Z","links":{"resolver":"https://pith.science/pith/762BY2SJSSYVYOOOBVZGU76NDS","bundle":"https://pith.science/pith/762BY2SJSSYVYOOOBVZGU76NDS/bundle.json","state":"https://pith.science/pith/762BY2SJSSYVYOOOBVZGU76NDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/762BY2SJSSYVYOOOBVZGU76NDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:762BY2SJSSYVYOOOBVZGU76NDS","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":"b4553f76fd6121263d15f3701b0fe0c12cf1487ce9d14b96a702c44f13d3043c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-02-26T09:00:18Z","title_canon_sha256":"6ebd75a0e07d040ff6d2c70bc6de66f565819a39402e7f502fcfebf1b050db4c"},"schema_version":"1.0","source":{"id":"1402.6457","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6457","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6457v1","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6457","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"762BY2SJSSYV","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"762BY2SJSSYVYOOO","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"762BY2SJ","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:b8b82fad3b7eb6a91409be2676889390d290e76b5cb839fbb70dfd014d83a619","target":"graph","created_at":"2026-05-18T00:57:52Z","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":"In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, it is important to collect these data efficiently, that is, to reduce the energy cost of data transmission. Under such applications, a tree is usually adopted as the routing structure to save the computation costs for maintaining the routing tables of sensors. In this paper, we work on the problem of constructing a data aggregation tree that minimizes the total energy cost of data transmission in a wireless sensor networ","authors_text":"Kate Ching-Ju Lin, Ming-Jer Tsai, Tung-Wei Kuo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-02-26T09:00:18Z","title":"On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6457","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:d77ef953a845772d7f8b412d0112dc8fda8510c2379e3c363c4f9aa83bec2cf8","target":"record","created_at":"2026-05-18T00:57:52Z","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":"b4553f76fd6121263d15f3701b0fe0c12cf1487ce9d14b96a702c44f13d3043c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-02-26T09:00:18Z","title_canon_sha256":"6ebd75a0e07d040ff6d2c70bc6de66f565819a39402e7f502fcfebf1b050db4c"},"schema_version":"1.0","source":{"id":"1402.6457","kind":"arxiv","version":1}},"canonical_sha256":"ffb41c6a4994b15c39ce0d726a7fcd1ca853b0109f9e1b91e08205258b7f1789","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffb41c6a4994b15c39ce0d726a7fcd1ca853b0109f9e1b91e08205258b7f1789","first_computed_at":"2026-05-18T00:57:52.168079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:52.168079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BSwYVAvXrZS3iNDp9srgv4UJfMqoq7G6kcouEjnDkkrc6YiM1hnM7vHviSb68WaQi2HSMkw+43yX/2VWQHjTDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:52.168722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6457","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d77ef953a845772d7f8b412d0112dc8fda8510c2379e3c363c4f9aa83bec2cf8","sha256:b8b82fad3b7eb6a91409be2676889390d290e76b5cb839fbb70dfd014d83a619"],"state_sha256":"eeec0eab67e05444834a7f316cdb404df8f7953c0009e73525feccf03709d73e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sSVzda0QvZXo1WNHEc4+PBkOvW/cOYmOZHZPqkQf9j1WifQdp4TGPl5z7+JSWXtNv3kCLnv3l+S1TPQ6P5IOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:29:44.206172Z","bundle_sha256":"c3c59e42485560c6233fa1756b406d1dcc80616c3740f5b93de67d7b40f8f3d3"}}