{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:NENSUOCYRKN74O6KFMGRT56RO4","short_pith_number":"pith:NENSUOCY","canonical_record":{"source":{"id":"1010.2818","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-14T03:48:08Z","cross_cats_sorted":[],"title_canon_sha256":"fce3becb2c551d428937ff7534085298b8a09ec1dac699b94ac70a547bc52243","abstract_canon_sha256":"3cb80ed3050d3e2ce51ebff59b43444c0cafaecf5978138b8165d81b74426e87"},"schema_version":"1.0"},"canonical_sha256":"691b2a38588a9bfe3bca2b0d19f7d17732dd059aaa92d57edc46c3358ddc5efb","source":{"kind":"arxiv","id":"1010.2818","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2818","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2818v3","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2818","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"NENSUOCYRKN7","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NENSUOCYRKN74O6K","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NENSUOCY","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:NENSUOCYRKN74O6KFMGRT56RO4","target":"record","payload":{"canonical_record":{"source":{"id":"1010.2818","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-14T03:48:08Z","cross_cats_sorted":[],"title_canon_sha256":"fce3becb2c551d428937ff7534085298b8a09ec1dac699b94ac70a547bc52243","abstract_canon_sha256":"3cb80ed3050d3e2ce51ebff59b43444c0cafaecf5978138b8165d81b74426e87"},"schema_version":"1.0"},"canonical_sha256":"691b2a38588a9bfe3bca2b0d19f7d17732dd059aaa92d57edc46c3358ddc5efb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:32.147257Z","signature_b64":"ozo4DoMYWgoXInJNXG1BvEH/V56AdbT7I6lKPegHdhBe+EESDRd51iT6RkQkheqx9AU8M8DFxO76dpfQWBUWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"691b2a38588a9bfe3bca2b0d19f7d17732dd059aaa92d57edc46c3358ddc5efb","last_reissued_at":"2026-05-18T04:16:32.146879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:32.146879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.2818","source_version":3,"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-18T04:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RIFYrCcLwqqo5mdFGSpGR94oijbh31seMMxhc8Z038S/ayet6SflCaSH68yA4RPlyp7vsSPHYwqnM7zWZw8TBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:48:26.238384Z"},"content_sha256":"4cb31dd4da569032b290bb7d98bfd2c1eb2dbffb7c211d714039fb347c49016f","schema_version":"1.0","event_id":"sha256:4cb31dd4da569032b290bb7d98bfd2c1eb2dbffb7c211d714039fb347c49016f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:NENSUOCYRKN74O6KFMGRT56RO4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Duty-Cycle-Aware Minimum-Energy Multicasting in Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Jun Luo, Kai Han, Yang Liu","submitted_at":"2010-10-14T03:48:08Z","abstract_excerpt":"In duty-cycled wireless sensor networks, the nodes switch between active and dormant states, and each node may determine its active/dormant schedule independently. This complicates the Minimum-Energy Multicasting (MEM) problem, which has been primarily studied in always-active wireless ad-hoc networks. In this paper, we study the duty-cycle-aware MEM problem in wireless sensor networks, and we present a formulation of the Minimum-Energy Multicast Tree Construction and Scheduling (MEMTCS) problem. We prove that the MEMTCS problem is NP-hard, and it is unlikely to have an approximation algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2818","kind":"arxiv","version":3},"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-18T04:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UM6ngUG127b1h6fHE2NZKCs+Ig3LzOkVyNdMtKBZQ+cpZ8kcToFOuK0TpoKDEpYMOfAZD+K5UVI9u3Hg3mwTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:48:26.239083Z"},"content_sha256":"523a0cc82a08b9d85304ca9cb4636359d98481972c41706c8104fcd46c378fc1","schema_version":"1.0","event_id":"sha256:523a0cc82a08b9d85304ca9cb4636359d98481972c41706c8104fcd46c378fc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4/bundle.json","state_url":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NENSUOCYRKN74O6KFMGRT56RO4/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-25T20:48:26Z","links":{"resolver":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4","bundle":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4/bundle.json","state":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NENSUOCYRKN74O6KFMGRT56RO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:NENSUOCYRKN74O6KFMGRT56RO4","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":"3cb80ed3050d3e2ce51ebff59b43444c0cafaecf5978138b8165d81b74426e87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-14T03:48:08Z","title_canon_sha256":"fce3becb2c551d428937ff7534085298b8a09ec1dac699b94ac70a547bc52243"},"schema_version":"1.0","source":{"id":"1010.2818","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2818","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2818v3","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2818","created_at":"2026-05-18T04:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"NENSUOCYRKN7","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NENSUOCYRKN74O6K","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NENSUOCY","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:523a0cc82a08b9d85304ca9cb4636359d98481972c41706c8104fcd46c378fc1","target":"graph","created_at":"2026-05-18T04:16:32Z","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 duty-cycled wireless sensor networks, the nodes switch between active and dormant states, and each node may determine its active/dormant schedule independently. This complicates the Minimum-Energy Multicasting (MEM) problem, which has been primarily studied in always-active wireless ad-hoc networks. In this paper, we study the duty-cycle-aware MEM problem in wireless sensor networks, and we present a formulation of the Minimum-Energy Multicast Tree Construction and Scheduling (MEMTCS) problem. We prove that the MEMTCS problem is NP-hard, and it is unlikely to have an approximation algorithm","authors_text":"Jun Luo, Kai Han, Yang Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-14T03:48:08Z","title":"Duty-Cycle-Aware Minimum-Energy Multicasting in Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2818","kind":"arxiv","version":3},"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:4cb31dd4da569032b290bb7d98bfd2c1eb2dbffb7c211d714039fb347c49016f","target":"record","created_at":"2026-05-18T04:16:32Z","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":"3cb80ed3050d3e2ce51ebff59b43444c0cafaecf5978138b8165d81b74426e87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-14T03:48:08Z","title_canon_sha256":"fce3becb2c551d428937ff7534085298b8a09ec1dac699b94ac70a547bc52243"},"schema_version":"1.0","source":{"id":"1010.2818","kind":"arxiv","version":3}},"canonical_sha256":"691b2a38588a9bfe3bca2b0d19f7d17732dd059aaa92d57edc46c3358ddc5efb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"691b2a38588a9bfe3bca2b0d19f7d17732dd059aaa92d57edc46c3358ddc5efb","first_computed_at":"2026-05-18T04:16:32.146879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:32.146879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ozo4DoMYWgoXInJNXG1BvEH/V56AdbT7I6lKPegHdhBe+EESDRd51iT6RkQkheqx9AU8M8DFxO76dpfQWBUWBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:32.147257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2818","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cb31dd4da569032b290bb7d98bfd2c1eb2dbffb7c211d714039fb347c49016f","sha256:523a0cc82a08b9d85304ca9cb4636359d98481972c41706c8104fcd46c378fc1"],"state_sha256":"60270d037d4d8e947456d98d02e37d1fff71d5846a3b75953431929688630461"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6XTk4DGybN1DbKy7CldAMF8xWo4UfDgQRj1dzjUJo0SclmXKGzBCKkxADtQDTNoCVTaPCbdZIqGByPETURLrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:48:26.243848Z","bundle_sha256":"144204bf1c1cb2ace1b0d715ff641b540a580c94c3918bdd33e1c609ea9f7bcb"}}