{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UZHETQN4W3ZHY3JHI7BHBGYCVN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c2cd7ab6e60983a2a2bf93d70384b6f3843e6fbdae0bbbee6196a87150fb6ceb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-12T23:41:57Z","title_canon_sha256":"c35c713a4bf5ca2dc20e4a9ed82f1dec7f4e1328a5c4eac7287defe7fb627e28"},"schema_version":"1.0","source":{"id":"1511.04126","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04126","created_at":"2026-05-18T01:16:45Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04126v1","created_at":"2026-05-18T01:16:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04126","created_at":"2026-05-18T01:16:45Z"},{"alias_kind":"pith_short_12","alias_value":"UZHETQN4W3ZH","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UZHETQN4W3ZHY3JH","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UZHETQN4","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:4d7c1e81e719ba249f8ac67b6e0c1bf32cbc330396744e9dc6b0c4fe398ba1f1","target":"graph","created_at":"2026-05-18T01:16:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Mats Bengtsson, Rami Mochaourab, Rasmus Brandt","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-12T23:41:57Z","title":"Interference Alignment-Aided Base Station Clustering using Coalition Formation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04126","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:06c5183161e556df7eff69de9aad66e93beca51b10abadf50ffb5591c02b89ab","target":"record","created_at":"2026-05-18T01:16:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c2cd7ab6e60983a2a2bf93d70384b6f3843e6fbdae0bbbee6196a87150fb6ceb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-12T23:41:57Z","title_canon_sha256":"c35c713a4bf5ca2dc20e4a9ed82f1dec7f4e1328a5c4eac7287defe7fb627e28"},"schema_version":"1.0","source":{"id":"1511.04126","kind":"arxiv","version":1}},"canonical_sha256":"a64e49c1bcb6f27c6d2747c2709b02ab641597914902726df34befe0b2b0f30e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a64e49c1bcb6f27c6d2747c2709b02ab641597914902726df34befe0b2b0f30e","first_computed_at":"2026-05-18T01:16:45.566515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:45.566515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l6NM6DLfPS6zbsRIx7yWobJDr0REjDx8tfN6hFbfg9JHX709i5RO6s2hACnkniqEbqPRSN6wJOBGHsrlbybIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:45.567335Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04126","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06c5183161e556df7eff69de9aad66e93beca51b10abadf50ffb5591c02b89ab","sha256:4d7c1e81e719ba249f8ac67b6e0c1bf32cbc330396744e9dc6b0c4fe398ba1f1"],"state_sha256":"284444ca871b6503c86c9441d224bf4155c63a76f232dd5e432e87969c55ff7a"}