{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KIH4LRYBSDE3VLE6OLLFVS5ZTP","short_pith_number":"pith:KIH4LRYB","schema_version":"1.0","canonical_sha256":"520fc5c70190c9baac9e72d65acbb99bd287ec0b4069d8810762ddb2dcca5e67","source":{"kind":"arxiv","id":"1404.3945","version":1},"attestation_state":"computed","paper":{"title":"A Game Theoretic Approach to Minimize the Completion Time of Network Coded Cooperative Data Exchange","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Douik, Hamidou Tembine, Mohamed-Slim Alouini, Sameh Sorour, Tareq Y. Al-Naffouri","submitted_at":"2014-04-14T09:08:25Z","abstract_excerpt":"In this paper, we introduce a game theoretic framework for studying the problem of minimizing the completion time of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this configuration, clients cooperate with each other to recover the erased packets without a central controller. Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. We model the session by self-interested players in a non-cooperative potential game. T"},"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":"1404.3945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-14T09:08:25Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"e2ad0a38949941a9efabc15133a20d93a5663ac3dd1dd064fc60003f4686f59e","abstract_canon_sha256":"93b52e8fe451840ec6a6fbc7dbafff1b772c0b52dd6b830e99d7c5f742ed8b2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:13.306093Z","signature_b64":"fnQwMD6NZvLZnaJ7KzS5qomhEOYE1yrZkP+5BQsn7feqmIy42kP5xbVu3O15GQJRsPnYvhyVEJBWKxdnqeGyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"520fc5c70190c9baac9e72d65acbb99bd287ec0b4069d8810762ddb2dcca5e67","last_reissued_at":"2026-05-18T02:54:13.305470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:13.305470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Game Theoretic Approach to Minimize the Completion Time of Network Coded Cooperative Data Exchange","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Douik, Hamidou Tembine, Mohamed-Slim Alouini, Sameh Sorour, Tareq Y. Al-Naffouri","submitted_at":"2014-04-14T09:08:25Z","abstract_excerpt":"In this paper, we introduce a game theoretic framework for studying the problem of minimizing the completion time of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this configuration, clients cooperate with each other to recover the erased packets without a central controller. Game theory is employed herein as a tool for improving the distributed solution by overcoming the need for a central controller or additional signaling in the system. We model the session by self-interested players in a non-cooperative potential game. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3945","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":"1404.3945","created_at":"2026-05-18T02:54:13.305572+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3945v1","created_at":"2026-05-18T02:54:13.305572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3945","created_at":"2026-05-18T02:54:13.305572+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIH4LRYBSDE3","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIH4LRYBSDE3VLE6","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIH4LRYB","created_at":"2026-05-18T12:28:35.611951+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/KIH4LRYBSDE3VLE6OLLFVS5ZTP","json":"https://pith.science/pith/KIH4LRYBSDE3VLE6OLLFVS5ZTP.json","graph_json":"https://pith.science/api/pith-number/KIH4LRYBSDE3VLE6OLLFVS5ZTP/graph.json","events_json":"https://pith.science/api/pith-number/KIH4LRYBSDE3VLE6OLLFVS5ZTP/events.json","paper":"https://pith.science/paper/KIH4LRYB"},"agent_actions":{"view_html":"https://pith.science/pith/KIH4LRYBSDE3VLE6OLLFVS5ZTP","download_json":"https://pith.science/pith/KIH4LRYBSDE3VLE6OLLFVS5ZTP.json","view_paper":"https://pith.science/paper/KIH4LRYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3945&json=true","fetch_graph":"https://pith.science/api/pith-number/KIH4LRYBSDE3VLE6OLLFVS5ZTP/graph.json","fetch_events":"https://pith.science/api/pith-number/KIH4LRYBSDE3VLE6OLLFVS5ZTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIH4LRYBSDE3VLE6OLLFVS5ZTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIH4LRYBSDE3VLE6OLLFVS5ZTP/action/storage_attestation","attest_author":"https://pith.science/pith/KIH4LRYBSDE3VLE6OLLFVS5ZTP/action/author_attestation","sign_citation":"https://pith.science/pith/KIH4LRYBSDE3VLE6OLLFVS5ZTP/action/citation_signature","submit_replication":"https://pith.science/pith/KIH4LRYBSDE3VLE6OLLFVS5ZTP/action/replication_record"}},"created_at":"2026-05-18T02:54:13.305572+00:00","updated_at":"2026-05-18T02:54:13.305572+00:00"}