{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OSMUA4CQBSBRB6ELWXAMPVCULO","short_pith_number":"pith:OSMUA4CQ","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"},"canonical_sha256":"74994070500c8310f88bb5c0c7d4545baaf60343d3f5f4125ce3e8fd19d01a78","source":{"kind":"arxiv","id":"1803.03736","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03736","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03736v1","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03736","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"OSMUA4CQBSBR","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OSMUA4CQBSBRB6EL","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OSMUA4CQ","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OSMUA4CQBSBRB6ELWXAMPVCULO","target":"record","payload":{"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"},"canonical_sha256":"74994070500c8310f88bb5c0c7d4545baaf60343d3f5f4125ce3e8fd19d01a78","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"},"source_kind":"arxiv","source_id":"1803.03736","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/gbtpZV6bCsy1Qqqd0Acdn0qAIOD3ILElgrCJ5J7GbNjtICpAO9Qh5qvCWo4voaGz4ePO+81Jf1X+92U/7/OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:17:38.648964Z"},"content_sha256":"1576406ccf8bf86b3163ed39122f55599053e93e6122121902b17e11e1ea5dcb","schema_version":"1.0","event_id":"sha256:1576406ccf8bf86b3163ed39122f55599053e93e6122121902b17e11e1ea5dcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OSMUA4CQBSBRB6ELWXAMPVCULO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tIkuknLVCAZmc5BzH4lIJ8tf2iq9VieeKFkNOhOEwXxN1Ia5gDptWgofWo9eVug4QfUEnFuVfVm94n17vL6AAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T11:17:38.649325Z"},"content_sha256":"3af2239b4e773886bc47c3038c160bf2062dd97d17bc67a470bc5cb014e6b540","schema_version":"1.0","event_id":"sha256:3af2239b4e773886bc47c3038c160bf2062dd97d17bc67a470bc5cb014e6b540"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO/bundle.json","state_url":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSMUA4CQBSBRB6ELWXAMPVCULO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T11:17:38Z","links":{"resolver":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO","bundle":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO/bundle.json","state":"https://pith.science/pith/OSMUA4CQBSBRB6ELWXAMPVCULO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSMUA4CQBSBRB6ELWXAMPVCULO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OSMUA4CQBSBRB6ELWXAMPVCULO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aeb932bb7dabc4a75e924b4c24097cfb3d5f4ce3e4d47021cbafe921eb2cc878","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-10T02:02:31Z","title_canon_sha256":"bab7c79147004c656b0b091f12030ffabbff33e246236611a925900829b840b8"},"schema_version":"1.0","source":{"id":"1803.03736","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03736","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03736v1","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03736","created_at":"2026-05-18T00:21:19Z"},{"alias_kind":"pith_short_12","alias_value":"OSMUA4CQBSBR","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OSMUA4CQBSBRB6EL","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OSMUA4CQ","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:3af2239b4e773886bc47c3038c160bf2062dd97d17bc67a470bc5cb014e6b540","target":"graph","created_at":"2026-05-18T00:21:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ebrahim Karami, Savo Glisic","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-10T02:02:31Z","title":"Joint Optimization of Scheduling and Routing in Multicast Wireless Ad-Hoc Network Using Soft Graph Coloring and Non-linear Cubic Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03736","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1576406ccf8bf86b3163ed39122f55599053e93e6122121902b17e11e1ea5dcb","target":"record","created_at":"2026-05-18T00:21:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aeb932bb7dabc4a75e924b4c24097cfb3d5f4ce3e4d47021cbafe921eb2cc878","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-10T02:02:31Z","title_canon_sha256":"bab7c79147004c656b0b091f12030ffabbff33e246236611a925900829b840b8"},"schema_version":"1.0","source":{"id":"1803.03736","kind":"arxiv","version":1}},"canonical_sha256":"74994070500c8310f88bb5c0c7d4545baaf60343d3f5f4125ce3e8fd19d01a78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74994070500c8310f88bb5c0c7d4545baaf60343d3f5f4125ce3e8fd19d01a78","first_computed_at":"2026-05-18T00:21:19.306650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:19.306650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FuSfO66W967GLgsbaf1BgKpJFEg65a6RSNPpqZqF/pmBt1GD5rTwE0aP4tZkPgJ+Q7rVMRkAh++pRfvhau5/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:19.307050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03736","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1576406ccf8bf86b3163ed39122f55599053e93e6122121902b17e11e1ea5dcb","sha256:3af2239b4e773886bc47c3038c160bf2062dd97d17bc67a470bc5cb014e6b540"],"state_sha256":"6b305c70cb1ac2f4ffc4f745773f77e1bf656d9170d8e6f75c5e07505452d576"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3uX8r8JyucL91kg2AlYK1JxgIS73xh2RMt0KudXPsSkdHYvWweFrdhHzJBSJiMC+zzqj4jxkw+1S4YEAPnxRCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T11:17:38.651160Z","bundle_sha256":"445855ae18dd6a039609d8058b2df89c0f493b237cd10721f1b0fd87bab5602e"}}