{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ICNFNIPZLLAGKDV5QLOB3S627H","short_pith_number":"pith:ICNFNIPZ","schema_version":"1.0","canonical_sha256":"409a56a1f95ac0650ebd82dc1dcbdaf9f58b708ec4e06b455fdd70f1584dde75","source":{"kind":"arxiv","id":"1401.1671","version":2},"attestation_state":"computed","paper":{"title":"Distributed Energy Efficient Channel Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Amir Leshem, Eduard Jorswieck, Oshri Naparstek, S. M. Zafaruddin","submitted_at":"2014-01-08T11:38:48Z","abstract_excerpt":"Design of energy efficient protocols for modern wireless systems has become an important area of research. In this paper, we propose a distributed optimization algorithm for the channel assignment problem for multiple interfering transceiver pairs that cannot communicate with each other. We first modify the auction algorithm for maximal energy efficiency and show that the problem can be solved without explicit message passing using the carrier sense multiple access (CSMA) protocols. We then develop a novel scheme by converting the channel assignment problem into perfect matchings on bipartite "},"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":"1401.1671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-01-08T11:38:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"af039c39fe979ce3ff3a65274cdbb54d8eb6766db23f992fa5bf317804b2a882","abstract_canon_sha256":"8a3fba24a2cf56b53f92834fb67dda7f9b70e4782ff2e3844aa82a1061c71805"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:19.673341Z","signature_b64":"8KTw4I20+bZa7LSENQPqICf1Zj/kn8AU41kDGieCbVuh7e/jmufvDigmF9D/Y0d7zbTdTHknLFXb0wu7Ib9iAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"409a56a1f95ac0650ebd82dc1dcbdaf9f58b708ec4e06b455fdd70f1584dde75","last_reissued_at":"2026-05-18T00:23:19.672581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:19.672581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Energy Efficient Channel Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Amir Leshem, Eduard Jorswieck, Oshri Naparstek, S. M. Zafaruddin","submitted_at":"2014-01-08T11:38:48Z","abstract_excerpt":"Design of energy efficient protocols for modern wireless systems has become an important area of research. In this paper, we propose a distributed optimization algorithm for the channel assignment problem for multiple interfering transceiver pairs that cannot communicate with each other. We first modify the auction algorithm for maximal energy efficiency and show that the problem can be solved without explicit message passing using the carrier sense multiple access (CSMA) protocols. We then develop a novel scheme by converting the channel assignment problem into perfect matchings on bipartite "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1671","kind":"arxiv","version":2},"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":"1401.1671","created_at":"2026-05-18T00:23:19.672687+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.1671v2","created_at":"2026-05-18T00:23:19.672687+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1671","created_at":"2026-05-18T00:23:19.672687+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICNFNIPZLLAG","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICNFNIPZLLAGKDV5","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICNFNIPZ","created_at":"2026-05-18T12:28:33.132498+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/ICNFNIPZLLAGKDV5QLOB3S627H","json":"https://pith.science/pith/ICNFNIPZLLAGKDV5QLOB3S627H.json","graph_json":"https://pith.science/api/pith-number/ICNFNIPZLLAGKDV5QLOB3S627H/graph.json","events_json":"https://pith.science/api/pith-number/ICNFNIPZLLAGKDV5QLOB3S627H/events.json","paper":"https://pith.science/paper/ICNFNIPZ"},"agent_actions":{"view_html":"https://pith.science/pith/ICNFNIPZLLAGKDV5QLOB3S627H","download_json":"https://pith.science/pith/ICNFNIPZLLAGKDV5QLOB3S627H.json","view_paper":"https://pith.science/paper/ICNFNIPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.1671&json=true","fetch_graph":"https://pith.science/api/pith-number/ICNFNIPZLLAGKDV5QLOB3S627H/graph.json","fetch_events":"https://pith.science/api/pith-number/ICNFNIPZLLAGKDV5QLOB3S627H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICNFNIPZLLAGKDV5QLOB3S627H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICNFNIPZLLAGKDV5QLOB3S627H/action/storage_attestation","attest_author":"https://pith.science/pith/ICNFNIPZLLAGKDV5QLOB3S627H/action/author_attestation","sign_citation":"https://pith.science/pith/ICNFNIPZLLAGKDV5QLOB3S627H/action/citation_signature","submit_replication":"https://pith.science/pith/ICNFNIPZLLAGKDV5QLOB3S627H/action/replication_record"}},"created_at":"2026-05-18T00:23:19.672687+00:00","updated_at":"2026-05-18T00:23:19.672687+00:00"}