{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K7752IAGYZFJGDL3FOYIP3RNMQ","short_pith_number":"pith:K7752IAG","schema_version":"1.0","canonical_sha256":"57ffdd2006c64a930d7b2bb087ee2d640f57ae46f0c8383d1eaf854c6daae7f9","source":{"kind":"arxiv","id":"1504.05268","version":1},"attestation_state":"computed","paper":{"title":"Energy-Efficient Broadcasting for Cross Wireless Ad-Hoc 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":"2015-04-21T00:48:43Z","abstract_excerpt":"In this paper, we propose solutions for the energy-efficient broadcasting over cross networks, where N nodes are located on two perpendicular lines. Our solutions consist of an algorithm which finds the optimal range assignment in polynomial time (O(N^12)), a near-optimal algorithm with linear complexity (O(N)), and a distributed algorithm with complexity O(1). To the best of our knowledge, this is the first study presenting an optimal solution for the minimum-energy broadcasting problem for a 2-D network (with cross configuration). We compare our algorithms with the broadcast incremental powe"},"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":"1504.05268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-04-21T00:48:43Z","cross_cats_sorted":[],"title_canon_sha256":"f7823381372db921ab4c58689e450941a1de7bf3b83fc37a9da83e00c2b794f1","abstract_canon_sha256":"11b11141d6e030ffa7f2046e1291fcbe846fc659d0de5161bc4bbeb6dad71e1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:14.694790Z","signature_b64":"8ObhcO2jecx7L+XxAZBhP0Fxua4T3CFvHheGr4kGeFDHNcYRAq46PPOUfpd7wXGZ6EUOgiNJcjgJ4nVNKzTMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57ffdd2006c64a930d7b2bb087ee2d640f57ae46f0c8383d1eaf854c6daae7f9","last_reissued_at":"2026-05-18T02:18:14.694253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:14.694253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy-Efficient Broadcasting for Cross Wireless Ad-Hoc 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":"2015-04-21T00:48:43Z","abstract_excerpt":"In this paper, we propose solutions for the energy-efficient broadcasting over cross networks, where N nodes are located on two perpendicular lines. Our solutions consist of an algorithm which finds the optimal range assignment in polynomial time (O(N^12)), a near-optimal algorithm with linear complexity (O(N)), and a distributed algorithm with complexity O(1). To the best of our knowledge, this is the first study presenting an optimal solution for the minimum-energy broadcasting problem for a 2-D network (with cross configuration). We compare our algorithms with the broadcast incremental powe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05268","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":"1504.05268","created_at":"2026-05-18T02:18:14.694343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05268v1","created_at":"2026-05-18T02:18:14.694343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05268","created_at":"2026-05-18T02:18:14.694343+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7752IAGYZFJ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7752IAGYZFJGDL3","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7752IAG","created_at":"2026-05-18T12:29:27.538025+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/K7752IAGYZFJGDL3FOYIP3RNMQ","json":"https://pith.science/pith/K7752IAGYZFJGDL3FOYIP3RNMQ.json","graph_json":"https://pith.science/api/pith-number/K7752IAGYZFJGDL3FOYIP3RNMQ/graph.json","events_json":"https://pith.science/api/pith-number/K7752IAGYZFJGDL3FOYIP3RNMQ/events.json","paper":"https://pith.science/paper/K7752IAG"},"agent_actions":{"view_html":"https://pith.science/pith/K7752IAGYZFJGDL3FOYIP3RNMQ","download_json":"https://pith.science/pith/K7752IAGYZFJGDL3FOYIP3RNMQ.json","view_paper":"https://pith.science/paper/K7752IAG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05268&json=true","fetch_graph":"https://pith.science/api/pith-number/K7752IAGYZFJGDL3FOYIP3RNMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/K7752IAGYZFJGDL3FOYIP3RNMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7752IAGYZFJGDL3FOYIP3RNMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7752IAGYZFJGDL3FOYIP3RNMQ/action/storage_attestation","attest_author":"https://pith.science/pith/K7752IAGYZFJGDL3FOYIP3RNMQ/action/author_attestation","sign_citation":"https://pith.science/pith/K7752IAGYZFJGDL3FOYIP3RNMQ/action/citation_signature","submit_replication":"https://pith.science/pith/K7752IAGYZFJGDL3FOYIP3RNMQ/action/replication_record"}},"created_at":"2026-05-18T02:18:14.694343+00:00","updated_at":"2026-05-18T02:18:14.694343+00:00"}