{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UZHETQN4W3ZHY3JHI7BHBGYCVN","short_pith_number":"pith:UZHETQN4","schema_version":"1.0","canonical_sha256":"a64e49c1bcb6f27c6d2747c2709b02ab641597914902726df34befe0b2b0f30e","source":{"kind":"arxiv","id":"1511.04126","version":1},"attestation_state":"computed","paper":{"title":"Interference Alignment-Aided Base Station Clustering using Coalition Formation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mats Bengtsson, Rami Mochaourab, Rasmus Brandt","submitted_at":"2015-11-12T23:41:57Z","abstract_excerpt":"Base station clustering is necessary in large interference networks, where the channel state information (CSI) acquisition overhead otherwise would be overwhelming. In this paper, we propose a novel long-term throughput model for the clustered users which addresses the balance between interference mitigation capability and CSI acquisition overhead. The model only depends on statistical CSI, thus enabling long-term clustering. Based on notions from coalitional game theory, we propose a low-complexity distributed clustering method. The algorithm converges in a couple of iterations, and only requ"},"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":"1511.04126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-12T23:41:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c35c713a4bf5ca2dc20e4a9ed82f1dec7f4e1328a5c4eac7287defe7fb627e28","abstract_canon_sha256":"c2cd7ab6e60983a2a2bf93d70384b6f3843e6fbdae0bbbee6196a87150fb6ceb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:45.567335Z","signature_b64":"l6NM6DLfPS6zbsRIx7yWobJDr0REjDx8tfN6hFbfg9JHX709i5RO6s2hACnkniqEbqPRSN6wJOBGHsrlbybIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a64e49c1bcb6f27c6d2747c2709b02ab641597914902726df34befe0b2b0f30e","last_reissued_at":"2026-05-18T01:16:45.566515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:45.566515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interference Alignment-Aided Base Station Clustering using Coalition Formation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mats Bengtsson, Rami Mochaourab, Rasmus Brandt","submitted_at":"2015-11-12T23:41:57Z","abstract_excerpt":"Base station clustering is necessary in large interference networks, where the channel state information (CSI) acquisition overhead otherwise would be overwhelming. In this paper, we propose a novel long-term throughput model for the clustered users which addresses the balance between interference mitigation capability and CSI acquisition overhead. The model only depends on statistical CSI, thus enabling long-term clustering. Based on notions from coalitional game theory, we propose a low-complexity distributed clustering method. The algorithm converges in a couple of iterations, and only requ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04126","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":"1511.04126","created_at":"2026-05-18T01:16:45.566664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04126v1","created_at":"2026-05-18T01:16:45.566664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04126","created_at":"2026-05-18T01:16:45.566664+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZHETQN4W3ZH","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZHETQN4W3ZHY3JH","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZHETQN4","created_at":"2026-05-18T12:29:44.643036+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/UZHETQN4W3ZHY3JHI7BHBGYCVN","json":"https://pith.science/pith/UZHETQN4W3ZHY3JHI7BHBGYCVN.json","graph_json":"https://pith.science/api/pith-number/UZHETQN4W3ZHY3JHI7BHBGYCVN/graph.json","events_json":"https://pith.science/api/pith-number/UZHETQN4W3ZHY3JHI7BHBGYCVN/events.json","paper":"https://pith.science/paper/UZHETQN4"},"agent_actions":{"view_html":"https://pith.science/pith/UZHETQN4W3ZHY3JHI7BHBGYCVN","download_json":"https://pith.science/pith/UZHETQN4W3ZHY3JHI7BHBGYCVN.json","view_paper":"https://pith.science/paper/UZHETQN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04126&json=true","fetch_graph":"https://pith.science/api/pith-number/UZHETQN4W3ZHY3JHI7BHBGYCVN/graph.json","fetch_events":"https://pith.science/api/pith-number/UZHETQN4W3ZHY3JHI7BHBGYCVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZHETQN4W3ZHY3JHI7BHBGYCVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZHETQN4W3ZHY3JHI7BHBGYCVN/action/storage_attestation","attest_author":"https://pith.science/pith/UZHETQN4W3ZHY3JHI7BHBGYCVN/action/author_attestation","sign_citation":"https://pith.science/pith/UZHETQN4W3ZHY3JHI7BHBGYCVN/action/citation_signature","submit_replication":"https://pith.science/pith/UZHETQN4W3ZHY3JHI7BHBGYCVN/action/replication_record"}},"created_at":"2026-05-18T01:16:45.566664+00:00","updated_at":"2026-05-18T01:16:45.566664+00:00"}