{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RTAGWRYR2SUMIG75IKOGEWBXKW","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":"411b40854c3183730cf4497023faac7f0bf75cf5fcd987a7f36e9c28fd8a9389","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-11T09:30:05Z","title_canon_sha256":"3614e1588e3560415bb6086f44a5b703689b8ee677b6791abdb03c80e15d12ee"},"schema_version":"1.0","source":{"id":"1804.03891","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03891","created_at":"2026-05-17T23:55:21Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03891v2","created_at":"2026-05-17T23:55:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03891","created_at":"2026-05-17T23:55:21Z"},{"alias_kind":"pith_short_12","alias_value":"RTAGWRYR2SUM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RTAGWRYR2SUMIG75","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RTAGWRYR","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:7f3754408d976418f832e7939a5c14f3f7247561fed3a94eb7541822a43cf99a","target":"graph","created_at":"2026-05-17T23:55:21Z","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":"Next generation multi-beam SatCom architectures will heavily exploit full frequency reuse schemes along with interference management techniques, e.g., precoding or multiuser detection, to drastically increase the system throughput. In this framework, we address the problem of the user selection for multicast precoding by formulating it as a clustering problem. By introducing a novel mathematical framework, we design fixed-/variable-size clustering algorithms that group users into simultaneously precoded and served clusters while maximising the system throughput. Numerical simulations are used ","authors_text":"Alessandro Guidotti, Alessandro Vanelli-Coralli","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-11T09:30:05Z","title":"Clustering Strategies for Multicast Precoding in Multi-Beam Satellite Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03891","kind":"arxiv","version":2},"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:0cacbd73f77c8b8cb452523a679ce363f694451fc4f2754cf2411ca6b71baefc","target":"record","created_at":"2026-05-17T23:55:21Z","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":"411b40854c3183730cf4497023faac7f0bf75cf5fcd987a7f36e9c28fd8a9389","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-11T09:30:05Z","title_canon_sha256":"3614e1588e3560415bb6086f44a5b703689b8ee677b6791abdb03c80e15d12ee"},"schema_version":"1.0","source":{"id":"1804.03891","kind":"arxiv","version":2}},"canonical_sha256":"8cc06b4711d4a8c41bfd429c62583755968415714900c5a8e18edef9b5cc8a36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cc06b4711d4a8c41bfd429c62583755968415714900c5a8e18edef9b5cc8a36","first_computed_at":"2026-05-17T23:55:21.004464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:21.004464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ftSwTPYbe07JJ83z4+Xv696mYxbXKGytRRaKJcld5V6OvJMwpJuc5RqrZ8vMFT464aCyHABsdGsDWAq9pTRZCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:21.004844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03891","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cacbd73f77c8b8cb452523a679ce363f694451fc4f2754cf2411ca6b71baefc","sha256:7f3754408d976418f832e7939a5c14f3f7247561fed3a94eb7541822a43cf99a"],"state_sha256":"9d489d8b54fd395c021d82ed11f4fe2123a9645911a1d2ea859411b08dbad688"}