{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OLXIVRTFULA3VP2JFGA4N2LZE2","short_pith_number":"pith:OLXIVRTF","schema_version":"1.0","canonical_sha256":"72ee8ac665a2c1babf492981c6e979269181ab177b49c3ea5b6d5fa6bee8ead8","source":{"kind":"arxiv","id":"1204.3920","version":1},"attestation_state":"computed","paper":{"title":"Low-Complexity Energy-Efficient Broadcasting in One-Dimensional Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Amir H. Banihashemi, Mohammad R. Ataei, Thomas Kunz","submitted_at":"2012-04-17T21:22:49Z","abstract_excerpt":"In this paper, we investigate the transmission range assignment for N wireless nodes located on a line (a linear wireless network) for broadcasting data from one specific node to all the nodes in the network with minimum energy. Our goal is to find a solution that has low complexity and yet performs close to optimal. We propose an algorithm for finding the optimal assignment (which results in the minimum energy consumption) with complexity O(N^2). An approximation algorithm with complexity O(N) is also proposed. It is shown that, for networks with uniformly distributed nodes, the linear-time a"},"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":"1204.3920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-04-17T21:22:49Z","cross_cats_sorted":[],"title_canon_sha256":"22472900416672674e7a5f3a0c5124fa0460b610e118825c47ed79c4f72db6aa","abstract_canon_sha256":"f886ca8b1f148752247b64214a66983446b2eb1a8ec8ff5785406cd8639aaddf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:38.311219Z","signature_b64":"/9Y72VcPCVt6kdJUg4XcY1I5vpDWTMyhwGRqy5NBL8LnB4uaiT0cugT9/bYeEzpNyXpp+Qlu7hXeRR56wWdpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72ee8ac665a2c1babf492981c6e979269181ab177b49c3ea5b6d5fa6bee8ead8","last_reissued_at":"2026-05-18T03:57:38.310543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:38.310543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Complexity Energy-Efficient Broadcasting in One-Dimensional Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Amir H. Banihashemi, Mohammad R. Ataei, Thomas Kunz","submitted_at":"2012-04-17T21:22:49Z","abstract_excerpt":"In this paper, we investigate the transmission range assignment for N wireless nodes located on a line (a linear wireless network) for broadcasting data from one specific node to all the nodes in the network with minimum energy. Our goal is to find a solution that has low complexity and yet performs close to optimal. We propose an algorithm for finding the optimal assignment (which results in the minimum energy consumption) with complexity O(N^2). An approximation algorithm with complexity O(N) is also proposed. It is shown that, for networks with uniformly distributed nodes, the linear-time a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3920","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":"1204.3920","created_at":"2026-05-18T03:57:38.310641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.3920v1","created_at":"2026-05-18T03:57:38.310641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3920","created_at":"2026-05-18T03:57:38.310641+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLXIVRTFULA3","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLXIVRTFULA3VP2J","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLXIVRTF","created_at":"2026-05-18T12:27:16.716162+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/OLXIVRTFULA3VP2JFGA4N2LZE2","json":"https://pith.science/pith/OLXIVRTFULA3VP2JFGA4N2LZE2.json","graph_json":"https://pith.science/api/pith-number/OLXIVRTFULA3VP2JFGA4N2LZE2/graph.json","events_json":"https://pith.science/api/pith-number/OLXIVRTFULA3VP2JFGA4N2LZE2/events.json","paper":"https://pith.science/paper/OLXIVRTF"},"agent_actions":{"view_html":"https://pith.science/pith/OLXIVRTFULA3VP2JFGA4N2LZE2","download_json":"https://pith.science/pith/OLXIVRTFULA3VP2JFGA4N2LZE2.json","view_paper":"https://pith.science/paper/OLXIVRTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.3920&json=true","fetch_graph":"https://pith.science/api/pith-number/OLXIVRTFULA3VP2JFGA4N2LZE2/graph.json","fetch_events":"https://pith.science/api/pith-number/OLXIVRTFULA3VP2JFGA4N2LZE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLXIVRTFULA3VP2JFGA4N2LZE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLXIVRTFULA3VP2JFGA4N2LZE2/action/storage_attestation","attest_author":"https://pith.science/pith/OLXIVRTFULA3VP2JFGA4N2LZE2/action/author_attestation","sign_citation":"https://pith.science/pith/OLXIVRTFULA3VP2JFGA4N2LZE2/action/citation_signature","submit_replication":"https://pith.science/pith/OLXIVRTFULA3VP2JFGA4N2LZE2/action/replication_record"}},"created_at":"2026-05-18T03:57:38.310641+00:00","updated_at":"2026-05-18T03:57:38.310641+00:00"}