{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3UDVE4W6ZCNIXAZ2YSSGFVNSXK","short_pith_number":"pith:3UDVE4W6","schema_version":"1.0","canonical_sha256":"dd075272dec89a8b833ac4a462d5b2ba801774990214fc1d125b1e04c5aa676f","source":{"kind":"arxiv","id":"1403.2360","version":1},"attestation_state":"computed","paper":{"title":"Matching theory for priority-based cell association in the downlink of wireless small cell networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.IT"],"primary_cat":"cs.IT","authors_text":"Behrouz Maham, Mehdi Bennis, Omid Semiari, Stefan Valentin, Walid Saad","submitted_at":"2014-03-10T19:36:40Z","abstract_excerpt":"The deployment of small cells, overlaid on existing cellular infrastructure, is seen as a key feature in next-generation cellular systems. In this paper, the problem of user association in the downlink of small cell networks (SCNs) is considered. The problem is formulated as a many-to-one matching game in which the users and SCBSs rank one another based on utility functions that account for both the achievable performance, in terms of rate and fairness to cell edge users, as captured by newly proposed priorities. To solve this game, a novel distributed algorithm that can reach a stable matchin"},"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":"1403.2360","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-10T19:36:40Z","cross_cats_sorted":["cs.GT","math.IT"],"title_canon_sha256":"4e2b1b8a88de70aac8de25cf429e0e97c38bb679f4646c544843b07a02d2f879","abstract_canon_sha256":"71c4ed8c16314840f27b39b1728f82e9c9185c02cd60198706ccd7eb3d5a5dc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:44.700794Z","signature_b64":"C8C7Hr+ltGTXF0y3pxXESJEWyupu1NU91YohUpQfRkR+cuy2S1jP/Xzer0L54muyUQawd/hOsgjvNnO0lvtlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd075272dec89a8b833ac4a462d5b2ba801774990214fc1d125b1e04c5aa676f","last_reissued_at":"2026-05-18T02:56:44.700339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:44.700339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching theory for priority-based cell association in the downlink of wireless small cell networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.IT"],"primary_cat":"cs.IT","authors_text":"Behrouz Maham, Mehdi Bennis, Omid Semiari, Stefan Valentin, Walid Saad","submitted_at":"2014-03-10T19:36:40Z","abstract_excerpt":"The deployment of small cells, overlaid on existing cellular infrastructure, is seen as a key feature in next-generation cellular systems. In this paper, the problem of user association in the downlink of small cell networks (SCNs) is considered. The problem is formulated as a many-to-one matching game in which the users and SCBSs rank one another based on utility functions that account for both the achievable performance, in terms of rate and fairness to cell edge users, as captured by newly proposed priorities. To solve this game, a novel distributed algorithm that can reach a stable matchin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2360","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":"1403.2360","created_at":"2026-05-18T02:56:44.700416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2360v1","created_at":"2026-05-18T02:56:44.700416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2360","created_at":"2026-05-18T02:56:44.700416+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UDVE4W6ZCNI","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UDVE4W6ZCNIXAZ2","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UDVE4W6","created_at":"2026-05-18T12:28:11.866339+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/3UDVE4W6ZCNIXAZ2YSSGFVNSXK","json":"https://pith.science/pith/3UDVE4W6ZCNIXAZ2YSSGFVNSXK.json","graph_json":"https://pith.science/api/pith-number/3UDVE4W6ZCNIXAZ2YSSGFVNSXK/graph.json","events_json":"https://pith.science/api/pith-number/3UDVE4W6ZCNIXAZ2YSSGFVNSXK/events.json","paper":"https://pith.science/paper/3UDVE4W6"},"agent_actions":{"view_html":"https://pith.science/pith/3UDVE4W6ZCNIXAZ2YSSGFVNSXK","download_json":"https://pith.science/pith/3UDVE4W6ZCNIXAZ2YSSGFVNSXK.json","view_paper":"https://pith.science/paper/3UDVE4W6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2360&json=true","fetch_graph":"https://pith.science/api/pith-number/3UDVE4W6ZCNIXAZ2YSSGFVNSXK/graph.json","fetch_events":"https://pith.science/api/pith-number/3UDVE4W6ZCNIXAZ2YSSGFVNSXK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UDVE4W6ZCNIXAZ2YSSGFVNSXK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UDVE4W6ZCNIXAZ2YSSGFVNSXK/action/storage_attestation","attest_author":"https://pith.science/pith/3UDVE4W6ZCNIXAZ2YSSGFVNSXK/action/author_attestation","sign_citation":"https://pith.science/pith/3UDVE4W6ZCNIXAZ2YSSGFVNSXK/action/citation_signature","submit_replication":"https://pith.science/pith/3UDVE4W6ZCNIXAZ2YSSGFVNSXK/action/replication_record"}},"created_at":"2026-05-18T02:56:44.700416+00:00","updated_at":"2026-05-18T02:56:44.700416+00:00"}