{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:NENSUOCYRKN74O6KFMGRT56RO4","short_pith_number":"pith:NENSUOCY","schema_version":"1.0","canonical_sha256":"691b2a38588a9bfe3bca2b0d19f7d17732dd059aaa92d57edc46c3358ddc5efb","source":{"kind":"arxiv","id":"1010.2818","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1010.2818","created_at":"2026-05-18T04:16:32.146941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.2818v3","created_at":"2026-05-18T04:16:32.146941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2818","created_at":"2026-05-18T04:16:32.146941+00:00"},{"alias_kind":"pith_short_12","alias_value":"NENSUOCYRKN7","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"NENSUOCYRKN74O6K","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"NENSUOCY","created_at":"2026-05-18T12:26:10.704358+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/NENSUOCYRKN74O6KFMGRT56RO4","json":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4.json","graph_json":"https://pith.science/api/pith-number/NENSUOCYRKN74O6KFMGRT56RO4/graph.json","events_json":"https://pith.science/api/pith-number/NENSUOCYRKN74O6KFMGRT56RO4/events.json","paper":"https://pith.science/paper/NENSUOCY"},"agent_actions":{"view_html":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4","download_json":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4.json","view_paper":"https://pith.science/paper/NENSUOCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.2818&json=true","fetch_graph":"https://pith.science/api/pith-number/NENSUOCYRKN74O6KFMGRT56RO4/graph.json","fetch_events":"https://pith.science/api/pith-number/NENSUOCYRKN74O6KFMGRT56RO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4/action/storage_attestation","attest_author":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4/action/author_attestation","sign_citation":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4/action/citation_signature","submit_replication":"https://pith.science/pith/NENSUOCYRKN74O6KFMGRT56RO4/action/replication_record"}},"created_at":"2026-05-18T04:16:32.146941+00:00","updated_at":"2026-05-18T04:16:32.146941+00:00"}