{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:MIHNYCMZHLSCAZH2QAFLASX6LM","short_pith_number":"pith:MIHNYCMZ","canonical_record":{"source":{"id":"2111.10550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-20T09:36:06Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"912d8c4fe413976449efff4d2f698d46af0fccab08ea776e5a2114e5c863a54b","abstract_canon_sha256":"6d4b82da81fe78a3d3896991e217569bb220ab33e3cb770717f27c170a408184"},"schema_version":"1.0"},"canonical_sha256":"620edc09993ae42064fa800ab04afe5b2abf674ab2e1d49d496e843018772f29","source":{"kind":"arxiv","id":"2111.10550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.10550","created_at":"2026-07-05T03:33:54Z"},{"alias_kind":"arxiv_version","alias_value":"2111.10550v1","created_at":"2026-07-05T03:33:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.10550","created_at":"2026-07-05T03:33:54Z"},{"alias_kind":"pith_short_12","alias_value":"MIHNYCMZHLSC","created_at":"2026-07-05T03:33:54Z"},{"alias_kind":"pith_short_16","alias_value":"MIHNYCMZHLSCAZH2","created_at":"2026-07-05T03:33:54Z"},{"alias_kind":"pith_short_8","alias_value":"MIHNYCMZ","created_at":"2026-07-05T03:33:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:MIHNYCMZHLSCAZH2QAFLASX6LM","target":"record","payload":{"canonical_record":{"source":{"id":"2111.10550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-20T09:36:06Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"912d8c4fe413976449efff4d2f698d46af0fccab08ea776e5a2114e5c863a54b","abstract_canon_sha256":"6d4b82da81fe78a3d3896991e217569bb220ab33e3cb770717f27c170a408184"},"schema_version":"1.0"},"canonical_sha256":"620edc09993ae42064fa800ab04afe5b2abf674ab2e1d49d496e843018772f29","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:33:54.049028Z","signature_b64":"vrPbwrmYbX9qeXzV2yWIXN266YPdNVuAMxm/8Qj+Qvn79bzyu/Cs/prnyymQUsZqauVQKYICmXhmhB2XEk6TBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"620edc09993ae42064fa800ab04afe5b2abf674ab2e1d49d496e843018772f29","last_reissued_at":"2026-07-05T03:33:54.048603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:33:54.048603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.10550","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-07-05T03:33:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1SjTc4h2I6Ohz9RgVvmVS9poKlSAuhA1/yjAPUunvvcB9LEZA1+d7vTme/Dq9jbLzuByrITSM4Zt6H5w+AEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:32:41.578741Z"},"content_sha256":"eb89fc1c45dec252262559ce3830c8df8a110b62cf75f2a54d88161796be5db8","schema_version":"1.0","event_id":"sha256:eb89fc1c45dec252262559ce3830c8df8a110b62cf75f2a54d88161796be5db8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:MIHNYCMZHLSCAZH2QAFLASX6LM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Grouping Strategy for Reconfigurable Intelligent Surface Assisted Wireless Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Junhui Rao, Matthew R. McKay, Neel Kanth Kundu, Ross Murch, Shanpu Shen, Zan Li","submitted_at":"2021-11-20T09:36:06Z","abstract_excerpt":"The channel estimation overhead of reconfigurable intelligent surface (RIS) assisted communication systems can be prohibitive. Prior works have demonstrated via simulations that grouping neighbouring RIS elements can help to reduce the pilot overhead and improve achievable rate. In this paper, we present an analytical study of RIS element grouping. We derive a tight closed-form upper bound for the achievable rate and then maximize it with respect to the group size. Our analysis reveals that more coarse-grained grouping is important-when the channel coherence time is low (high mobility scenario"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.10550","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.10550/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:33:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8NiQpge5MIQ6xsjq5obS0t4SMegUoJR0NiO2REFJHERd9xYg/GS3nuornDHqd7tpns9Z378g6iDJ7TjTbW+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:32:41.579287Z"},"content_sha256":"ef3dee063fa7411c93e973c1110ea8498199a23a45af8537bbc0b8e1907fd9cc","schema_version":"1.0","event_id":"sha256:ef3dee063fa7411c93e973c1110ea8498199a23a45af8537bbc0b8e1907fd9cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIHNYCMZHLSCAZH2QAFLASX6LM/bundle.json","state_url":"https://pith.science/pith/MIHNYCMZHLSCAZH2QAFLASX6LM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIHNYCMZHLSCAZH2QAFLASX6LM/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-08-03T20:32:41Z","links":{"resolver":"https://pith.science/pith/MIHNYCMZHLSCAZH2QAFLASX6LM","bundle":"https://pith.science/pith/MIHNYCMZHLSCAZH2QAFLASX6LM/bundle.json","state":"https://pith.science/pith/MIHNYCMZHLSCAZH2QAFLASX6LM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIHNYCMZHLSCAZH2QAFLASX6LM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MIHNYCMZHLSCAZH2QAFLASX6LM","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":"6d4b82da81fe78a3d3896991e217569bb220ab33e3cb770717f27c170a408184","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-20T09:36:06Z","title_canon_sha256":"912d8c4fe413976449efff4d2f698d46af0fccab08ea776e5a2114e5c863a54b"},"schema_version":"1.0","source":{"id":"2111.10550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.10550","created_at":"2026-07-05T03:33:54Z"},{"alias_kind":"arxiv_version","alias_value":"2111.10550v1","created_at":"2026-07-05T03:33:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.10550","created_at":"2026-07-05T03:33:54Z"},{"alias_kind":"pith_short_12","alias_value":"MIHNYCMZHLSC","created_at":"2026-07-05T03:33:54Z"},{"alias_kind":"pith_short_16","alias_value":"MIHNYCMZHLSCAZH2","created_at":"2026-07-05T03:33:54Z"},{"alias_kind":"pith_short_8","alias_value":"MIHNYCMZ","created_at":"2026-07-05T03:33:54Z"}],"graph_snapshots":[{"event_id":"sha256:ef3dee063fa7411c93e973c1110ea8498199a23a45af8537bbc0b8e1907fd9cc","target":"graph","created_at":"2026-07-05T03:33: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.10550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The channel estimation overhead of reconfigurable intelligent surface (RIS) assisted communication systems can be prohibitive. Prior works have demonstrated via simulations that grouping neighbouring RIS elements can help to reduce the pilot overhead and improve achievable rate. In this paper, we present an analytical study of RIS element grouping. We derive a tight closed-form upper bound for the achievable rate and then maximize it with respect to the group size. Our analysis reveals that more coarse-grained grouping is important-when the channel coherence time is low (high mobility scenario","authors_text":"Junhui Rao, Matthew R. McKay, Neel Kanth Kundu, Ross Murch, Shanpu Shen, Zan Li","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-20T09:36:06Z","title":"Optimal Grouping Strategy for Reconfigurable Intelligent Surface Assisted Wireless Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.10550","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:eb89fc1c45dec252262559ce3830c8df8a110b62cf75f2a54d88161796be5db8","target":"record","created_at":"2026-07-05T03:33: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":"6d4b82da81fe78a3d3896991e217569bb220ab33e3cb770717f27c170a408184","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-11-20T09:36:06Z","title_canon_sha256":"912d8c4fe413976449efff4d2f698d46af0fccab08ea776e5a2114e5c863a54b"},"schema_version":"1.0","source":{"id":"2111.10550","kind":"arxiv","version":1}},"canonical_sha256":"620edc09993ae42064fa800ab04afe5b2abf674ab2e1d49d496e843018772f29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"620edc09993ae42064fa800ab04afe5b2abf674ab2e1d49d496e843018772f29","first_computed_at":"2026-07-05T03:33:54.048603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:33:54.048603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vrPbwrmYbX9qeXzV2yWIXN266YPdNVuAMxm/8Qj+Qvn79bzyu/Cs/prnyymQUsZqauVQKYICmXhmhB2XEk6TBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:33:54.049028Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.10550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb89fc1c45dec252262559ce3830c8df8a110b62cf75f2a54d88161796be5db8","sha256:ef3dee063fa7411c93e973c1110ea8498199a23a45af8537bbc0b8e1907fd9cc"],"state_sha256":"bac2698759dd87bd68eea26c602562fcbb066126e2a667587c562196543f1676"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V4rd2lSkPOnm4h/l1ZLGilbY+cBdSLjvVOfStlDHEyJbhPZ8kNb75GJ/hZgwasO1Scb9iGKWFPu4jWRsmwC3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:32:41.583033Z","bundle_sha256":"e4cd7e6c330554a060e701c04d3f533bf0705a593a03d1b6c163880d51b65d48"}}