{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:V55IXEKAIHRSTEXNZBN3PXVQ2H","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":"48198eb3c338c33c3c407984b7fee2e6af1d9de809576806ab9fd2534b39b4e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-19T14:47:09Z","title_canon_sha256":"59b99da66b456deb0637c24a708de4266fbd68dd4827d2bc08d596ae725b6ab2"},"schema_version":"1.0","source":{"id":"0904.2921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.2921","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"arxiv_version","alias_value":"0904.2921v1","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2921","created_at":"2026-05-18T00:58:48Z"},{"alias_kind":"pith_short_12","alias_value":"V55IXEKAIHRS","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"V55IXEKAIHRSTEXN","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"V55IXEKA","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:e28fbb3aa020824e292abcad3a396c7fc8270d456b1593deeb86fa4f133aac37","target":"graph","created_at":"2026-05-18T00:58:48Z","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":"A common assumption in the existing network coding literature is that the users are cooperative and non-selfish. However, this assumption can be violated in practice. In this paper, we analyze inter-session network coding in a wired network using game theory. We assume selfish users acting strategically to maximize their own utility, leading to a resource allocation game among users. In particular, we study the well-known butterfly network topology where a bottleneck link is shared by several network coding and routing flows. We prove the existence of a Nash equilibrium for a wide range of uti","authors_text":"Amir-Hamed Mohsenian-Rad, Jianwei Huang, Robert Schober, Sidharth Jaggi, Vincent W.S. Wong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-19T14:47:09Z","title":"Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2921","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:82e099125950282105e4c6c996fa7c0d8974bb1a2da686b5cf35600eca5a1b2b","target":"record","created_at":"2026-05-18T00:58:48Z","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":"48198eb3c338c33c3c407984b7fee2e6af1d9de809576806ab9fd2534b39b4e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-19T14:47:09Z","title_canon_sha256":"59b99da66b456deb0637c24a708de4266fbd68dd4827d2bc08d596ae725b6ab2"},"schema_version":"1.0","source":{"id":"0904.2921","kind":"arxiv","version":1}},"canonical_sha256":"af7a8b914041e32992edc85bb7deb0d1e31d824deddc76f4ef8b67571574bb98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af7a8b914041e32992edc85bb7deb0d1e31d824deddc76f4ef8b67571574bb98","first_computed_at":"2026-05-18T00:58:48.144262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:48.144262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"drKASU8nuQ5IWgy+DS38d3TDADG8rymGAGqSUUIkn3ljkj3SjVnLUBiprDQO16x5stmlTLiLh89yK9cSu+9kDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:48.144872Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.2921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82e099125950282105e4c6c996fa7c0d8974bb1a2da686b5cf35600eca5a1b2b","sha256:e28fbb3aa020824e292abcad3a396c7fc8270d456b1593deeb86fa4f133aac37"],"state_sha256":"b512e239a1ba11a1ad52770d2da215547f351afc19cdc44da345978ff39f65e2"}