{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CRM7VSY6R654EOM2JFV2CRDE6P","short_pith_number":"pith:CRM7VSY6","schema_version":"1.0","canonical_sha256":"1459facb1e8fbbc2399a496ba14464f3d138a28725cf82d46fa2a9ee72e9200a","source":{"kind":"arxiv","id":"1803.05290","version":1},"attestation_state":"computed","paper":{"title":"Optimization of Scheduling in Wireless Ad-Hoc Networks Using Matrix Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","eess.SP"],"primary_cat":"cs.NI","authors_text":"Ebrahim Karami, Savo Glisic","submitted_at":"2018-03-10T02:29:54Z","abstract_excerpt":"In this paper, we present a novel application of matrix game theory for optimization of link scheduling in wireless ad-hoc networks. Optimum scheduling is achieved by soft coloring of network graphs. Conventional coloring schemes are based on assignment of one color to each region or equivalently each link is member of just one partial topology. These algorithms based on coloring are not optimal when links are not activated with the same rate. Soft coloring, introduced in this paper, solves this problem and provide optimal solution for any requested link usage rate. To define the game model fo"},"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":"1803.05290","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-03-10T02:29:54Z","cross_cats_sorted":["cs.GT","eess.SP"],"title_canon_sha256":"ee6e62a39d663d62bc7e764002b2a3968c9ef4e68a7ea6ded5213bdd47d4337e","abstract_canon_sha256":"78dcb257222901724ce2934b092f81af301f0dbd95f8792bccaec662048e8da0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:01.696919Z","signature_b64":"oGgHTgdRluRblsx9RfnOnHrChAOtCy+g3gg38ZMZ2g/sosRWC7ZBOF1eYytXDXrCssz7bnYVj2nsCBLcOdTEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1459facb1e8fbbc2399a496ba14464f3d138a28725cf82d46fa2a9ee72e9200a","last_reissued_at":"2026-05-18T00:21:01.696390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:01.696390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of Scheduling in Wireless Ad-Hoc Networks Using Matrix Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","eess.SP"],"primary_cat":"cs.NI","authors_text":"Ebrahim Karami, Savo Glisic","submitted_at":"2018-03-10T02:29:54Z","abstract_excerpt":"In this paper, we present a novel application of matrix game theory for optimization of link scheduling in wireless ad-hoc networks. Optimum scheduling is achieved by soft coloring of network graphs. Conventional coloring schemes are based on assignment of one color to each region or equivalently each link is member of just one partial topology. These algorithms based on coloring are not optimal when links are not activated with the same rate. Soft coloring, introduced in this paper, solves this problem and provide optimal solution for any requested link usage rate. To define the game model fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05290","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":"1803.05290","created_at":"2026-05-18T00:21:01.696483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05290v1","created_at":"2026-05-18T00:21:01.696483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05290","created_at":"2026-05-18T00:21:01.696483+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRM7VSY6R654","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRM7VSY6R654EOM2","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRM7VSY6","created_at":"2026-05-18T12:32:19.392346+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/CRM7VSY6R654EOM2JFV2CRDE6P","json":"https://pith.science/pith/CRM7VSY6R654EOM2JFV2CRDE6P.json","graph_json":"https://pith.science/api/pith-number/CRM7VSY6R654EOM2JFV2CRDE6P/graph.json","events_json":"https://pith.science/api/pith-number/CRM7VSY6R654EOM2JFV2CRDE6P/events.json","paper":"https://pith.science/paper/CRM7VSY6"},"agent_actions":{"view_html":"https://pith.science/pith/CRM7VSY6R654EOM2JFV2CRDE6P","download_json":"https://pith.science/pith/CRM7VSY6R654EOM2JFV2CRDE6P.json","view_paper":"https://pith.science/paper/CRM7VSY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05290&json=true","fetch_graph":"https://pith.science/api/pith-number/CRM7VSY6R654EOM2JFV2CRDE6P/graph.json","fetch_events":"https://pith.science/api/pith-number/CRM7VSY6R654EOM2JFV2CRDE6P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRM7VSY6R654EOM2JFV2CRDE6P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRM7VSY6R654EOM2JFV2CRDE6P/action/storage_attestation","attest_author":"https://pith.science/pith/CRM7VSY6R654EOM2JFV2CRDE6P/action/author_attestation","sign_citation":"https://pith.science/pith/CRM7VSY6R654EOM2JFV2CRDE6P/action/citation_signature","submit_replication":"https://pith.science/pith/CRM7VSY6R654EOM2JFV2CRDE6P/action/replication_record"}},"created_at":"2026-05-18T00:21:01.696483+00:00","updated_at":"2026-05-18T00:21:01.696483+00:00"}