{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:K5AFDTMMWAZWREC3ZF4VWLFOUW","short_pith_number":"pith:K5AFDTMM","schema_version":"1.0","canonical_sha256":"574051cd8cb03368905bc9795b2caea5a62d2986e6b9d06a32bd6b49cafec1c1","source":{"kind":"arxiv","id":"1605.09194","version":1},"attestation_state":"computed","paper":{"title":"Network Resource Sharing Games with Instantaneous Reciprocity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.OC"],"primary_cat":"cs.GT","authors_text":"Alexis A. Dowhuszko, Olav Tirkkonen, Ragnar Freij-Hollanti, Sofonias Hailu","submitted_at":"2016-05-30T12:22:48Z","abstract_excerpt":"We propose a generic strategic network resource sharing game between a set of players representing operators. The players negotiate which sets of players share given resources, serving users with varying sensitivity to interference. We prove that the proposed game has a Nash equilibrium, to which a greedily played game converges. Furthermore, simulation results show that, when applied to inter-operator spectrum sharing in small-cell indoor office environment, the convergence is fast and there is a significant performance improvement for the operators when compared to the default resource usage"},"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":"1605.09194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-30T12:22:48Z","cross_cats_sorted":["cs.NI","math.OC"],"title_canon_sha256":"6e26372198927b02bace2015fb19279a4b52742bb58d25d957885906f8d66b60","abstract_canon_sha256":"af7eef152ed7dd682e2dcaf45d4f6bab3dacb3b31e04cfe9096f3c212bded1ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:21.802845Z","signature_b64":"ABuSqxbUaIjSOITCdre3OIoQV1w6bDLEHjDvPY7Zc6TOVsUw4F5txuVS5Sz9HpLuNj1W/DTqC0BIS3fAJDjTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"574051cd8cb03368905bc9795b2caea5a62d2986e6b9d06a32bd6b49cafec1c1","last_reissued_at":"2026-05-18T01:13:21.802289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:21.802289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Resource Sharing Games with Instantaneous Reciprocity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.OC"],"primary_cat":"cs.GT","authors_text":"Alexis A. Dowhuszko, Olav Tirkkonen, Ragnar Freij-Hollanti, Sofonias Hailu","submitted_at":"2016-05-30T12:22:48Z","abstract_excerpt":"We propose a generic strategic network resource sharing game between a set of players representing operators. The players negotiate which sets of players share given resources, serving users with varying sensitivity to interference. We prove that the proposed game has a Nash equilibrium, to which a greedily played game converges. Furthermore, simulation results show that, when applied to inter-operator spectrum sharing in small-cell indoor office environment, the convergence is fast and there is a significant performance improvement for the operators when compared to the default resource usage"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09194","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":"1605.09194","created_at":"2026-05-18T01:13:21.802379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.09194v1","created_at":"2026-05-18T01:13:21.802379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09194","created_at":"2026-05-18T01:13:21.802379+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5AFDTMMWAZW","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5AFDTMMWAZWREC3","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5AFDTMM","created_at":"2026-05-18T12:30:25.849896+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/K5AFDTMMWAZWREC3ZF4VWLFOUW","json":"https://pith.science/pith/K5AFDTMMWAZWREC3ZF4VWLFOUW.json","graph_json":"https://pith.science/api/pith-number/K5AFDTMMWAZWREC3ZF4VWLFOUW/graph.json","events_json":"https://pith.science/api/pith-number/K5AFDTMMWAZWREC3ZF4VWLFOUW/events.json","paper":"https://pith.science/paper/K5AFDTMM"},"agent_actions":{"view_html":"https://pith.science/pith/K5AFDTMMWAZWREC3ZF4VWLFOUW","download_json":"https://pith.science/pith/K5AFDTMMWAZWREC3ZF4VWLFOUW.json","view_paper":"https://pith.science/paper/K5AFDTMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.09194&json=true","fetch_graph":"https://pith.science/api/pith-number/K5AFDTMMWAZWREC3ZF4VWLFOUW/graph.json","fetch_events":"https://pith.science/api/pith-number/K5AFDTMMWAZWREC3ZF4VWLFOUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5AFDTMMWAZWREC3ZF4VWLFOUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5AFDTMMWAZWREC3ZF4VWLFOUW/action/storage_attestation","attest_author":"https://pith.science/pith/K5AFDTMMWAZWREC3ZF4VWLFOUW/action/author_attestation","sign_citation":"https://pith.science/pith/K5AFDTMMWAZWREC3ZF4VWLFOUW/action/citation_signature","submit_replication":"https://pith.science/pith/K5AFDTMMWAZWREC3ZF4VWLFOUW/action/replication_record"}},"created_at":"2026-05-18T01:13:21.802379+00:00","updated_at":"2026-05-18T01:13:21.802379+00:00"}