{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CUDGATAIG26ACXD3KVEOFHNLKS","short_pith_number":"pith:CUDGATAI","canonical_record":{"source":{"id":"1709.01696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-06T07:08:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f7831502f389d9550ebf500029848f8d54b6a90fe17810f4c113870f2b04253f","abstract_canon_sha256":"7e3251d9c7682280901d280ecf8790e12dbcbcb9c2e09b3a5df2b9268900d219"},"schema_version":"1.0"},"canonical_sha256":"1506604c0836bc015c7b5548e29dab54a43d2dbb3d72dbc7cdaba7ac53cd5711","source":{"kind":"arxiv","id":"1709.01696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01696","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01696v1","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01696","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"pith_short_12","alias_value":"CUDGATAIG26A","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CUDGATAIG26ACXD3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CUDGATAI","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CUDGATAIG26ACXD3KVEOFHNLKS","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-06T07:08:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f7831502f389d9550ebf500029848f8d54b6a90fe17810f4c113870f2b04253f","abstract_canon_sha256":"7e3251d9c7682280901d280ecf8790e12dbcbcb9c2e09b3a5df2b9268900d219"},"schema_version":"1.0"},"canonical_sha256":"1506604c0836bc015c7b5548e29dab54a43d2dbb3d72dbc7cdaba7ac53cd5711","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:54.572890Z","signature_b64":"KcFYFCKcptlxlv4v3SX4UzvYleIuKAKmittH0eeEQ01Lmj12YnBUTrWTwPcQw1kaXd/EN+6801bi63xeWgvEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1506604c0836bc015c7b5548e29dab54a43d2dbb3d72dbc7cdaba7ac53cd5711","last_reissued_at":"2026-05-18T00:35:54.572499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:54.572499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01696","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsY6bpiVE4QxxVmj3S6ZdLuCZ/ilfvLV7FmCt2J2FLbyLX4kDC0rYoaq3gytyg9DeXFoRJqrxRyA1glLd0LhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:01:36.204916Z"},"content_sha256":"14a4c8a552243a8c54ff54082469954489681058ea5e10a0f4560104674e0f86","schema_version":"1.0","event_id":"sha256:14a4c8a552243a8c54ff54082469954489681058ea5e10a0f4560104674e0f86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CUDGATAIG26ACXD3KVEOFHNLKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"User Assignment with Distributed Large Intelligent Surface (LIS) Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fredrik Rusek, Krishna Chitti, Ove Edfors, Sha Hu","submitted_at":"2017-09-06T07:08:17Z","abstract_excerpt":"In this paper, we consider a wireless communication system where a large intelligent surface (LIS) is deployed comprising a number of small and distributed LIS-Units. Each LIS-Unit has a separate signal process unit (SPU) and is connected to a central process unit (CPU) that coordinates the behaviors of all the LIS-Units. With such a LIS system, we consider the user assignments both for sum-rate and minimal user-rate maximizations. That is, assuming $M$ LIS-Units deployed in the LIS system, the objective is to select $K$ ($K\\!\\leq\\!M$) best LIS-Units to serve $K$ autonomous users simultaneousl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01696","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRwmxhUf4ZXNm+MmZR76R4H1ojP3zBJO5wBzFMMR1PA5/H8nwDXLc7xshPMOxC1Q8kU72p1ysXVv8yU3CpcgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:01:36.205265Z"},"content_sha256":"5bb9435c997e81f4012a594b7a29d9ba84596eec556befc73342fe78285eeeb5","schema_version":"1.0","event_id":"sha256:5bb9435c997e81f4012a594b7a29d9ba84596eec556befc73342fe78285eeeb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUDGATAIG26ACXD3KVEOFHNLKS/bundle.json","state_url":"https://pith.science/pith/CUDGATAIG26ACXD3KVEOFHNLKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUDGATAIG26ACXD3KVEOFHNLKS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T05:01:36Z","links":{"resolver":"https://pith.science/pith/CUDGATAIG26ACXD3KVEOFHNLKS","bundle":"https://pith.science/pith/CUDGATAIG26ACXD3KVEOFHNLKS/bundle.json","state":"https://pith.science/pith/CUDGATAIG26ACXD3KVEOFHNLKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUDGATAIG26ACXD3KVEOFHNLKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CUDGATAIG26ACXD3KVEOFHNLKS","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":"7e3251d9c7682280901d280ecf8790e12dbcbcb9c2e09b3a5df2b9268900d219","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-06T07:08:17Z","title_canon_sha256":"f7831502f389d9550ebf500029848f8d54b6a90fe17810f4c113870f2b04253f"},"schema_version":"1.0","source":{"id":"1709.01696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01696","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01696v1","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01696","created_at":"2026-05-18T00:35:54Z"},{"alias_kind":"pith_short_12","alias_value":"CUDGATAIG26A","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CUDGATAIG26ACXD3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CUDGATAI","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:5bb9435c997e81f4012a594b7a29d9ba84596eec556befc73342fe78285eeeb5","target":"graph","created_at":"2026-05-18T00:35:54Z","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":"In this paper, we consider a wireless communication system where a large intelligent surface (LIS) is deployed comprising a number of small and distributed LIS-Units. Each LIS-Unit has a separate signal process unit (SPU) and is connected to a central process unit (CPU) that coordinates the behaviors of all the LIS-Units. With such a LIS system, we consider the user assignments both for sum-rate and minimal user-rate maximizations. That is, assuming $M$ LIS-Units deployed in the LIS system, the objective is to select $K$ ($K\\!\\leq\\!M$) best LIS-Units to serve $K$ autonomous users simultaneousl","authors_text":"Fredrik Rusek, Krishna Chitti, Ove Edfors, Sha Hu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-06T07:08:17Z","title":"User Assignment with Distributed Large Intelligent Surface (LIS) Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01696","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:14a4c8a552243a8c54ff54082469954489681058ea5e10a0f4560104674e0f86","target":"record","created_at":"2026-05-18T00:35:54Z","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":"7e3251d9c7682280901d280ecf8790e12dbcbcb9c2e09b3a5df2b9268900d219","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-06T07:08:17Z","title_canon_sha256":"f7831502f389d9550ebf500029848f8d54b6a90fe17810f4c113870f2b04253f"},"schema_version":"1.0","source":{"id":"1709.01696","kind":"arxiv","version":1}},"canonical_sha256":"1506604c0836bc015c7b5548e29dab54a43d2dbb3d72dbc7cdaba7ac53cd5711","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1506604c0836bc015c7b5548e29dab54a43d2dbb3d72dbc7cdaba7ac53cd5711","first_computed_at":"2026-05-18T00:35:54.572499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:54.572499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KcFYFCKcptlxlv4v3SX4UzvYleIuKAKmittH0eeEQ01Lmj12YnBUTrWTwPcQw1kaXd/EN+6801bi63xeWgvEBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:54.572890Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14a4c8a552243a8c54ff54082469954489681058ea5e10a0f4560104674e0f86","sha256:5bb9435c997e81f4012a594b7a29d9ba84596eec556befc73342fe78285eeeb5"],"state_sha256":"0efab642f06800e01fca9342a48119c232edf632b5217fd54f9bd7615dc362e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8HBFEfTJOCMn2J7OXjzJbt1dxJnj25HVVqFkLHcg0xm9df6xlSYimzzHPtwN+1w6HVRYrKv5O7Z+/6pdNgr6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:01:36.207606Z","bundle_sha256":"81f3d94b4270b60c98ea77c863e6e80fe738142c370c4a784d74ba080be4a516"}}