{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:L5BMMDPRJXRZUYQDR355K2BBYK","short_pith_number":"pith:L5BMMDPR","schema_version":"1.0","canonical_sha256":"5f42c60df14de39a62038efbd56821c299dbb29edf1baf0ffccfd19a91ede6d5","source":{"kind":"arxiv","id":"1403.4637","version":2},"attestation_state":"computed","paper":{"title":"A Maximal Concurrency and Low Latency Distributed Scheduling Protocol for Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hongwei Zhang, Xiaohui Liu","submitted_at":"2014-03-18T22:41:49Z","abstract_excerpt":"Existing work that schedules concurrent transmissions collision-free suffers from low channel utilization. We propose the Optimal Node Activation Multiple Access (ONAMA) protocol to achieve maximal channel spatial reuse through a distributed maximal independent set (DMIS) algorithm. To overcome DMIS's excessive delay in finding a maximal independent set, we devise a novel technique called pipelined precomputation that decouples DMIS from data transmission. We implement ONAMA on resource-constrained TelosB motes using TinyOS. Extensive measurements on two testbeds independently attest to ONAMA'"},"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":"1403.4637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-03-18T22:41:49Z","cross_cats_sorted":[],"title_canon_sha256":"034dcad3d236405442532c68b86bb747061ff6795274b4a2382204d456ee4b3c","abstract_canon_sha256":"51997fdf1fec35c6c2b8da9e6c445bfc699c83c017423ce32f4a74a40c838851"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:05.396991Z","signature_b64":"AIA2zwKm261aCSiv34Z6ioa55Pm/IXkFF8UYi8Bop1KCiggr56OflndS2y8mvYsQQembbBojYRXx97WsyUDeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f42c60df14de39a62038efbd56821c299dbb29edf1baf0ffccfd19a91ede6d5","last_reissued_at":"2026-05-18T02:55:05.396512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:05.396512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Maximal Concurrency and Low Latency Distributed Scheduling Protocol for Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hongwei Zhang, Xiaohui Liu","submitted_at":"2014-03-18T22:41:49Z","abstract_excerpt":"Existing work that schedules concurrent transmissions collision-free suffers from low channel utilization. We propose the Optimal Node Activation Multiple Access (ONAMA) protocol to achieve maximal channel spatial reuse through a distributed maximal independent set (DMIS) algorithm. To overcome DMIS's excessive delay in finding a maximal independent set, we devise a novel technique called pipelined precomputation that decouples DMIS from data transmission. We implement ONAMA on resource-constrained TelosB motes using TinyOS. Extensive measurements on two testbeds independently attest to ONAMA'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4637","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":"1403.4637","created_at":"2026-05-18T02:55:05.396582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.4637v2","created_at":"2026-05-18T02:55:05.396582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4637","created_at":"2026-05-18T02:55:05.396582+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5BMMDPRJXRZ","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5BMMDPRJXRZUYQD","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5BMMDPR","created_at":"2026-05-18T12:28:35.611951+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/L5BMMDPRJXRZUYQDR355K2BBYK","json":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK.json","graph_json":"https://pith.science/api/pith-number/L5BMMDPRJXRZUYQDR355K2BBYK/graph.json","events_json":"https://pith.science/api/pith-number/L5BMMDPRJXRZUYQDR355K2BBYK/events.json","paper":"https://pith.science/paper/L5BMMDPR"},"agent_actions":{"view_html":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK","download_json":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK.json","view_paper":"https://pith.science/paper/L5BMMDPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.4637&json=true","fetch_graph":"https://pith.science/api/pith-number/L5BMMDPRJXRZUYQDR355K2BBYK/graph.json","fetch_events":"https://pith.science/api/pith-number/L5BMMDPRJXRZUYQDR355K2BBYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK/action/storage_attestation","attest_author":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK/action/author_attestation","sign_citation":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK/action/citation_signature","submit_replication":"https://pith.science/pith/L5BMMDPRJXRZUYQDR355K2BBYK/action/replication_record"}},"created_at":"2026-05-18T02:55:05.396582+00:00","updated_at":"2026-05-18T02:55:05.396582+00:00"}