{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OSMUA4CQBSBRB6ELWXAMPVCULO","short_pith_number":"pith:OSMUA4CQ","schema_version":"1.0","canonical_sha256":"74994070500c8310f88bb5c0c7d4545baaf60343d3f5f4125ce3e8fd19d01a78","source":{"kind":"arxiv","id":"1803.03736","version":1},"attestation_state":"computed","paper":{"title":"Joint Optimization of Scheduling and Routing in Multicast Wireless Ad-Hoc Network Using Soft Graph Coloring and Non-linear Cubic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"eess.SP","authors_text":"Ebrahim Karami, Savo Glisic","submitted_at":"2018-03-10T02:02:31Z","abstract_excerpt":"In this paper we present matrix game-theoretic models for joint routing, network coding, and scheduling problem. First routing and network coding are modeled by using a new approach based on compressed topology matrix that takes into account the inherent multicast gain of the network. The scheduling is optimized by a new approach called network graph soft coloring. Soft graph coloring is designed by switching between different components of a wireless network graph, which we refer to as graph fractals, with appropriate usage rates. The network components, represented by graph fractals, are a n"},"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.03736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-10T02:02:31Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"bab7c79147004c656b0b091f12030ffabbff33e246236611a925900829b840b8","abstract_canon_sha256":"aeb932bb7dabc4a75e924b4c24097cfb3d5f4ce3e4d47021cbafe921eb2cc878"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:19.307050Z","signature_b64":"FuSfO66W967GLgsbaf1BgKpJFEg65a6RSNPpqZqF/pmBt1GD5rTwE0aP4tZkPgJ+Q7rVMRkAh++pRfvhau5/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74994070500c8310f88bb5c0c7d4545baaf60343d3f5f4125ce3e8fd19d01a78","last_reissued_at":"2026-05-18T00:21:19.306650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:19.306650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Optimization of Scheduling and Routing in Multicast Wireless Ad-Hoc Network Using Soft Graph Coloring and Non-linear Cubic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"eess.SP","authors_text":"Ebrahim Karami, Savo Glisic","submitted_at":"2018-03-10T02:02:31Z","abstract_excerpt":"In this paper we present matrix game-theoretic models for joint routing, network coding, and scheduling problem. First routing and network coding are modeled by using a new approach based on compressed topology matrix that takes into account the inherent multicast gain of the network. The scheduling is optimized by a new approach called network graph soft coloring. Soft graph coloring is designed by switching between different components of a wireless network graph, which we refer to as graph fractals, with appropriate usage rates. The network components, represented by graph fractals, are a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03736","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.03736","created_at":"2026-05-18T00:21:19.306706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03736v1","created_at":"2026-05-18T00:21:19.306706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03736","created_at":"2026-05-18T00:21:19.306706+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSMUA4CQBSBR","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSMUA4CQBSBRB6EL","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSMUA4CQ","created_at":"2026-05-18T12:32:43.782077+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/OSMUA4CQBSBRB6ELWXAMPVCULO","json":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO.json","graph_json":"https://pith.science/api/pith-number/OSMUA4CQBSBRB6ELWXAMPVCULO/graph.json","events_json":"https://pith.science/api/pith-number/OSMUA4CQBSBRB6ELWXAMPVCULO/events.json","paper":"https://pith.science/paper/OSMUA4CQ"},"agent_actions":{"view_html":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO","download_json":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO.json","view_paper":"https://pith.science/paper/OSMUA4CQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03736&json=true","fetch_graph":"https://pith.science/api/pith-number/OSMUA4CQBSBRB6ELWXAMPVCULO/graph.json","fetch_events":"https://pith.science/api/pith-number/OSMUA4CQBSBRB6ELWXAMPVCULO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO/action/storage_attestation","attest_author":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO/action/author_attestation","sign_citation":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO/action/citation_signature","submit_replication":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO/action/replication_record"}},"created_at":"2026-05-18T00:21:19.306706+00:00","updated_at":"2026-05-18T00:21:19.306706+00:00"}