{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:V55IXEKAIHRSTEXNZBN3PXVQ2H","short_pith_number":"pith:V55IXEKA","schema_version":"1.0","canonical_sha256":"af7a8b914041e32992edc85bb7deb0d1e31d824deddc76f4ef8b67571574bb98","source":{"kind":"arxiv","id":"0904.2921","version":1},"attestation_state":"computed","paper":{"title":"Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir-Hamed Mohsenian-Rad, Jianwei Huang, Robert Schober, Sidharth Jaggi, Vincent W.S. Wong","submitted_at":"2009-04-19T14:47:09Z","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"},"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":"0904.2921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-04-19T14:47:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59b99da66b456deb0637c24a708de4266fbd68dd4827d2bc08d596ae725b6ab2","abstract_canon_sha256":"48198eb3c338c33c3c407984b7fee2e6af1d9de809576806ab9fd2534b39b4e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.144872Z","signature_b64":"drKASU8nuQ5IWgy+DS38d3TDADG8rymGAGqSUUIkn3ljkj3SjVnLUBiprDQO16x5stmlTLiLh89yK9cSu+9kDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af7a8b914041e32992edc85bb7deb0d1e31d824deddc76f4ef8b67571574bb98","last_reissued_at":"2026-05-18T00:58:48.144262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.144262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amir-Hamed Mohsenian-Rad, Jianwei Huang, Robert Schober, Sidharth Jaggi, Vincent W.S. Wong","submitted_at":"2009-04-19T14:47:09Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2921","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":"0904.2921","created_at":"2026-05-18T00:58:48.144370+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.2921v1","created_at":"2026-05-18T00:58:48.144370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2921","created_at":"2026-05-18T00:58:48.144370+00:00"},{"alias_kind":"pith_short_12","alias_value":"V55IXEKAIHRS","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"V55IXEKAIHRSTEXN","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"V55IXEKA","created_at":"2026-05-18T12:26:02.257875+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/V55IXEKAIHRSTEXNZBN3PXVQ2H","json":"https://pith.science/pith/V55IXEKAIHRSTEXNZBN3PXVQ2H.json","graph_json":"https://pith.science/api/pith-number/V55IXEKAIHRSTEXNZBN3PXVQ2H/graph.json","events_json":"https://pith.science/api/pith-number/V55IXEKAIHRSTEXNZBN3PXVQ2H/events.json","paper":"https://pith.science/paper/V55IXEKA"},"agent_actions":{"view_html":"https://pith.science/pith/V55IXEKAIHRSTEXNZBN3PXVQ2H","download_json":"https://pith.science/pith/V55IXEKAIHRSTEXNZBN3PXVQ2H.json","view_paper":"https://pith.science/paper/V55IXEKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.2921&json=true","fetch_graph":"https://pith.science/api/pith-number/V55IXEKAIHRSTEXNZBN3PXVQ2H/graph.json","fetch_events":"https://pith.science/api/pith-number/V55IXEKAIHRSTEXNZBN3PXVQ2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V55IXEKAIHRSTEXNZBN3PXVQ2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V55IXEKAIHRSTEXNZBN3PXVQ2H/action/storage_attestation","attest_author":"https://pith.science/pith/V55IXEKAIHRSTEXNZBN3PXVQ2H/action/author_attestation","sign_citation":"https://pith.science/pith/V55IXEKAIHRSTEXNZBN3PXVQ2H/action/citation_signature","submit_replication":"https://pith.science/pith/V55IXEKAIHRSTEXNZBN3PXVQ2H/action/replication_record"}},"created_at":"2026-05-18T00:58:48.144370+00:00","updated_at":"2026-05-18T00:58:48.144370+00:00"}