{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DVXOTP22WXNZVC4D6WEIVCNBMQ","short_pith_number":"pith:DVXOTP22","schema_version":"1.0","canonical_sha256":"1d6ee9bf5ab5db9a8b83f5888a89a164330bbd33c652990ae78058494ae7cd49","source":{"kind":"arxiv","id":"1202.0463","version":1},"attestation_state":"computed","paper":{"title":"Network Formation Games Among Relay Stations in Next Generation Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Are Hj{\\o}rungnes, M\\'erouane Debbah, Tamer Ba\\c{s}ar, Walid Saad, Zhu Han","submitted_at":"2012-02-02T15:32:46Z","abstract_excerpt":"The introduction of relay station (RS) nodes is a key feature in next generation wireless networks such as 3GPP's long term evolution advanced (LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper presents, using game theory, a novel approach for the formation of the tree architecture that connects the RSs and their serving base station in the \\emph{uplink} of the next generation wireless multi-hop systems. Unlike existing literature which mainly focused on performance analysis, we propose a distributed algorithm for studying the \\emph{structure} and \\emph{dynamics} of the"},"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":"1202.0463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-02T15:32:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"620b0127b4c488ae35f4d8a0e77a51f3ff2c1502d8be64a3beb30b3a8bd81569","abstract_canon_sha256":"83cb8ae932f3d8c7c4e3a94210948753e1d7559944472a8ca010676d79e186e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.081081Z","signature_b64":"Tl3RluWALWmx6xNzFHV3C66f0mLlL9F+49W8I+u6XsCSxAL9I/eMysmYm1XFS6PHgpgU7NnWuUFxIyCxb7X9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d6ee9bf5ab5db9a8b83f5888a89a164330bbd33c652990ae78058494ae7cd49","last_reissued_at":"2026-05-18T00:57:57.080525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.080525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Formation Games Among Relay Stations in Next Generation Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Are Hj{\\o}rungnes, M\\'erouane Debbah, Tamer Ba\\c{s}ar, Walid Saad, Zhu Han","submitted_at":"2012-02-02T15:32:46Z","abstract_excerpt":"The introduction of relay station (RS) nodes is a key feature in next generation wireless networks such as 3GPP's long term evolution advanced (LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper presents, using game theory, a novel approach for the formation of the tree architecture that connects the RSs and their serving base station in the \\emph{uplink} of the next generation wireless multi-hop systems. Unlike existing literature which mainly focused on performance analysis, we propose a distributed algorithm for studying the \\emph{structure} and \\emph{dynamics} of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0463","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":"1202.0463","created_at":"2026-05-18T00:57:57.080619+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0463v1","created_at":"2026-05-18T00:57:57.080619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0463","created_at":"2026-05-18T00:57:57.080619+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVXOTP22WXNZ","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVXOTP22WXNZVC4D","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVXOTP22","created_at":"2026-05-18T12:27:04.183437+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/DVXOTP22WXNZVC4D6WEIVCNBMQ","json":"https://pith.science/pith/DVXOTP22WXNZVC4D6WEIVCNBMQ.json","graph_json":"https://pith.science/api/pith-number/DVXOTP22WXNZVC4D6WEIVCNBMQ/graph.json","events_json":"https://pith.science/api/pith-number/DVXOTP22WXNZVC4D6WEIVCNBMQ/events.json","paper":"https://pith.science/paper/DVXOTP22"},"agent_actions":{"view_html":"https://pith.science/pith/DVXOTP22WXNZVC4D6WEIVCNBMQ","download_json":"https://pith.science/pith/DVXOTP22WXNZVC4D6WEIVCNBMQ.json","view_paper":"https://pith.science/paper/DVXOTP22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0463&json=true","fetch_graph":"https://pith.science/api/pith-number/DVXOTP22WXNZVC4D6WEIVCNBMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DVXOTP22WXNZVC4D6WEIVCNBMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVXOTP22WXNZVC4D6WEIVCNBMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVXOTP22WXNZVC4D6WEIVCNBMQ/action/storage_attestation","attest_author":"https://pith.science/pith/DVXOTP22WXNZVC4D6WEIVCNBMQ/action/author_attestation","sign_citation":"https://pith.science/pith/DVXOTP22WXNZVC4D6WEIVCNBMQ/action/citation_signature","submit_replication":"https://pith.science/pith/DVXOTP22WXNZVC4D6WEIVCNBMQ/action/replication_record"}},"created_at":"2026-05-18T00:57:57.080619+00:00","updated_at":"2026-05-18T00:57:57.080619+00:00"}