{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5P2WFETRA4RBUNVW2U5EIAK237","short_pith_number":"pith:5P2WFETR","schema_version":"1.0","canonical_sha256":"ebf562927107221a36b6d53a44015adfda0580749fe6e2039ccaaf197e97bb7b","source":{"kind":"arxiv","id":"1602.08273","version":1},"attestation_state":"computed","paper":{"title":"Globally Optimal Base Station Clustering in Interference Alignment-Based Multicell Networks","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":"2016-02-26T10:51:24Z","abstract_excerpt":"Coordinated precoding based on interference alignment is a promising technique for improving the throughputs in future wireless multicell networks. In small networks, all base stations can typically jointly coordinate their precoding. In large networks however, base station clustering is necessary due to the otherwise overwhelmingly high channel state information (CSI) acquisition overhead. In this work, we provide a branch and bound algorithm for finding the globally optimal base station clustering. The algorithm is mainly intended for benchmarking existing suboptimal clustering schemes. We p"},"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":"1602.08273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-26T10:51:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b2117d6fdcd316304508e3f349ae0695a570f8546cf1967f91b5066df5c36ec4","abstract_canon_sha256":"ebb1aad49bd229072afec85555b407352716168e91ed7c185667546b51ee3c44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:40.422303Z","signature_b64":"yA17x+Ss3CXreiAvTpRrUejQBU4C59Hpizy3TTe3UPxhXFxghi+POe052c9v+AK0RFkGtnAp1kKHQ187GIuVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebf562927107221a36b6d53a44015adfda0580749fe6e2039ccaaf197e97bb7b","last_reissued_at":"2026-05-18T01:16:40.421598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:40.421598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Globally Optimal Base Station Clustering in Interference Alignment-Based Multicell Networks","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":"2016-02-26T10:51:24Z","abstract_excerpt":"Coordinated precoding based on interference alignment is a promising technique for improving the throughputs in future wireless multicell networks. In small networks, all base stations can typically jointly coordinate their precoding. In large networks however, base station clustering is necessary due to the otherwise overwhelmingly high channel state information (CSI) acquisition overhead. In this work, we provide a branch and bound algorithm for finding the globally optimal base station clustering. The algorithm is mainly intended for benchmarking existing suboptimal clustering schemes. We p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08273","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":"1602.08273","created_at":"2026-05-18T01:16:40.421711+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08273v1","created_at":"2026-05-18T01:16:40.421711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08273","created_at":"2026-05-18T01:16:40.421711+00:00"},{"alias_kind":"pith_short_12","alias_value":"5P2WFETRA4RB","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5P2WFETRA4RBUNVW","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5P2WFETR","created_at":"2026-05-18T12:30:01.593930+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/5P2WFETRA4RBUNVW2U5EIAK237","json":"https://pith.science/pith/5P2WFETRA4RBUNVW2U5EIAK237.json","graph_json":"https://pith.science/api/pith-number/5P2WFETRA4RBUNVW2U5EIAK237/graph.json","events_json":"https://pith.science/api/pith-number/5P2WFETRA4RBUNVW2U5EIAK237/events.json","paper":"https://pith.science/paper/5P2WFETR"},"agent_actions":{"view_html":"https://pith.science/pith/5P2WFETRA4RBUNVW2U5EIAK237","download_json":"https://pith.science/pith/5P2WFETRA4RBUNVW2U5EIAK237.json","view_paper":"https://pith.science/paper/5P2WFETR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08273&json=true","fetch_graph":"https://pith.science/api/pith-number/5P2WFETRA4RBUNVW2U5EIAK237/graph.json","fetch_events":"https://pith.science/api/pith-number/5P2WFETRA4RBUNVW2U5EIAK237/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5P2WFETRA4RBUNVW2U5EIAK237/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5P2WFETRA4RBUNVW2U5EIAK237/action/storage_attestation","attest_author":"https://pith.science/pith/5P2WFETRA4RBUNVW2U5EIAK237/action/author_attestation","sign_citation":"https://pith.science/pith/5P2WFETRA4RBUNVW2U5EIAK237/action/citation_signature","submit_replication":"https://pith.science/pith/5P2WFETRA4RBUNVW2U5EIAK237/action/replication_record"}},"created_at":"2026-05-18T01:16:40.421711+00:00","updated_at":"2026-05-18T01:16:40.421711+00:00"}