Data Shuffling in Wireless Distributed Computing via Low-Rank Optimization
Open accessThe DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
Intelligent mobile platforms such as smart vehicles and drones have recently become the focus of attention for onboard deployment of machine learning mechanisms to enable low latency decisions with low risk of privacy breach. However, most such machine learning algorithms are both computation-and-memory intensive, which makes it highly difficult to implement the requisite computations on a single device of limited computation, memory, and energy resources. Wireless distributed computing presents new opportunities by pooling the computation and storage resources among devices. For low-latency applications, the key bottleneck lies in the exchange of intermediate results among mobile devices for data shuffling. To improve communication efficiency, we propose a co-channel communication model and design transceivers by exploiting the locally computed intermediate values as side information. A low-rank optimization model is proposed to maximize the achieved degrees-of-freedom (DoF) by establishing the interference alignment condition for data shuffling. Unfortunately, existing approaches to approximate the rank function fail to yield satisfactory performance due to the poor structure in the formulated low-rank optimization problem. In this paper, we develop an efficient difference-of-convex-functions (DC) algorithm to solve the presented low-rank optimization problem by proposing a novel DC representation for the rank function. Numerical experiments demonstrate that the proposed DC approach can significantly improve the communication efficiency whereas the achievable DoF almost remains unchanged when the number of mobile devices grows.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“A low-rank matrix optimization based transceiver design approach was proposed in [52] for fast shuffling intermediate values in wireless distributed computing, thereby reducing the latency for horizontal edge inference via edge devices collaboration.”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [52]
Experimental — accuracy not yet measuredIn the citing paper
“This issue was addressed by a difference-of-convex-functions (DC) programme [31], [52], [99] by representing the rank function via an equivalent DC function.”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [52]
In the citing paper
“Most of the resource allocation problems in edge AI need to solve a series of nonconvex optimization problems, e.g., nonconvex sparse optimization for device selection in wireless FL, nonconvex quadratic programming for transceiver design in over-the-air FL [31], lowrank matrix optimization for interference management in edge device distributed inference [52], and unit modulus constrained phase”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [52]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476 · cited 5×
“The authors of [7] exploited the coded multicast opportunities by proposing a coded scheme called “Coded MapReduce” to reduce the communication load for data shuffling in wireline distributed computing framework.”
MethodInfluentialHan, S., Mao, H., & Dally, W. J. (2015) · arXiv · doi:10.48550/arxiv.1510.00149 · Cited by 4,662 · cited 3×
“However, the ultra-low latency requirement [2] for executing intensive computation tasks of mobile edge intelligence applications imposes an unrealistic burden on the computational capability of resource-constrained mobile devices [3] and ranks as one of the key challenges.”
BackgroundEfficient Processing of Deep Neural Networks: A Tutorial and Survey
Sze, V., Chen, Y.-H., Yang, T.-J., & Emer, J. S. (2017) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2761740 · Cited by 4,215
Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel
Cadambe, V. R., & Jafar, S. A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926344 · Cited by 2,970 · cited 4×
“y I 1(s l) = X i:l2T i U kl(H ki I r)V ils l; I 2(fs j: j2T kg) = X j2T k X i:j2T i U kl(H ki I r)V ijs j; I 3(fs j: j=2T k[flgg) = X j= 2T k[flg X i:j i U kl(H ki I r)V ijs j: Interference alignment [8] turns out to be a powerful tool to handle the mutual interference among users. The basic idea is to make signals re…”
BackgroundMethodInfluentialElements of Information Theory
Nalewajski, R. F. (2011) · Perspectives in Electronic Structure Theory · doi:10.1007/978-3-642-20180-6_8 · Cited by 2,309
Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training
Lin, Y., Han, S., Mao, H., Wang, Y., & Dally, W. J. (2017) · arXiv · doi:10.48550/arxiv.1712.01887 · Cited by 1,134 · cited 1×
“In wireless distributed computing systems, communication often becomes the key bottleneck [4] [14] to accomplish the computation tasks.”
BackgroundCheng, Y., Wang, D., Zhou, P., & Zhang, T. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2765695 · Cited by 817 · cited 1×
“Storage size is often one of the key limiting factors in a single device when deploying deep learning model [3], [5].”
BackgroundDeepTrust^RT: Confidential Deep Neural Inference Meets Real-Time!
Babar, M. F., & Hasan, M. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.ecrts.2024.13 · Cited by 708
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S. (2016) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-016-0892-3 · Cited by 664 · cited 2×
“The first-order alternating direction method of multipliers (ADMM) [20], [21] significantly reduces the computational cost to O ( SD 2 + D 3 ) for each iteration (please refer to IV-D for more details).”
Method
Research works printed but not linked: 2
- [11] P. D. Tao and L. T. H. An, 'Convex analysis approach to DC programming: Theory, algorithms and applications,' Acta Mathematica Vietnamica , vol. 22, no. 1, pp. 289-355, 1997. -
- [25] R. T. Rockafellar, Convex analysis . Princeton university press, 2015. -
Cited by
The Roadmap to 6G: AI Empowered Wireless Networks
Letaief, K. B., Chen, W., Shi, Y., Zhang, J., & Zhang, Y.-J. A. (2019) · IEEE Communications Magazine · doi:10.1109/mcom.2019.1900271 · Cited by 2,207
“A joint optimization of the uplink and downlink communication strategy was thus developed in [12] for shuffling the locally computed intermediate values across mobile devices.”
Self-citationEdge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“further improve the spectral efficiency, instead of reducing the volume of communication bits [221], a joint uplink and downlink design approach based on the interference alignment principle was developed in [52] to improve the communication data rates for local intermediate values shuffling.”
MethodInfluentialSelf-citationCommunication-efficient edge ai: algorithms and systems
Shi, Y., Yang, K., Jiang, T., Zhang, J., & Letaief, K. B. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3007787 · Cited by 488
“Interestingly, coding technique plays a critical role in scalable data shuffling [31], [141] as well as straggler mitigation [145].”
BackgroundMethodInfluentialSelf-citationZhou, Y., Liu, L., Wang, L., Hui, N., Cui, X., Wu, J., Peng, Y., Qi, Y., & Xing, C. (2020) · Digital Communications and Networks · doi:10.1016/j.dcan.2020.05.003 · Cited by 238
“The same scenario in [36,37] designs a down-link and uplink MIMO transmission between users and the BS, which uses interference alignment to maximize the achievable degree of freedom and reduce the required transmission bandwidth.”
BackgroundIntelligent Reflecting Surface for Downlink Non-Orthogonal Multiple Access Networks
Fu, M., Zhou, Y., & Shi, Y. (2019) · 2019 IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/gcwkshps45667.2019.9024675 · Cited by 199
“Specifically, we present an exact DC representation for the non-convex rank-one constrained positive semidefinite (PSD) matrix by exploiting the difference between the trace norm and the spectral norm [19].”
MethodSelf-citationReconfigurable Intelligent Surface Empowered Downlink Non-Orthogonal Multiple Access
Fu, M., Zhou, Y., Shi, Y., & Letaief, K. B. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3066587 · Cited by 175
“, degrees-of-freedom maximization for data shuffling in wireless distributed computing [46] and model aggregation via”
BackgroundSelf-citationNg, J. S., Lim, W. Y. B., Luong, N. C., Xiong, Z., Asheralieva, A., Niyato, D. T., Leung, C., & Miao, C. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3091684 · Cited by 159
“In order to improve spectral efficiency, the co-channel communication model is proposed in the study of [221] which consists of two stages, i.”
BackgroundMethodInfluentialTang, J., Jalalzai, M. M., Feng, C., Xiong, Z., & Zhang, Y. (2022) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2022.3149963 · Cited by 44
“The data generated by end devices are considered as the inputs of inference tasks [20].”
MethodA Survey on Technological Trends to Enhance Spectrum-Efficiency in 6G Communications
Iyer, S., Patil, A., Bhairanatti, S., Halagatti, S., & Pandya, R. J. (2022) · Transactions of Indian National Academy of Engineering · doi:10.1007/s41403-022-00372-w · Cited by 43
“[78] Data shuffling, Difference-ofconvex-functions (DC) algorithm, linear coding scheme Mobile edge intelligence Data shuffling problem in wireless distributed computing system to improve the communication efficiency The work proposes cochannel communication model for the data shuffling problem in wireless distributed…”
Balancing Security and Efficiency: A Power Consumption Analysis of a Lightweight Block Cipher
Rana, M., Mamun, Q., & Islam, R. (2024) · Electronics · doi:10.3390/electronics13214325 · Cited by 35
Reconfigurable Intelligent Surface for Interference Alignment in MIMO Device-to-Device Networks
Fu, M., Zhou, Y., & Shi, Y. (2021) · IEEE International Conference on Communications workshops · doi:10.1109/iccworkshops50388.2021.9473762 · Cited by 36
Self-citationKilcioglu, E., Mirghasemi, H., Stupia, I., & Vandendorpe, L. (2021) · IEEE Access · doi:10.1109/access.2021.3084689 · Cited by 27
“Therefore, deploying these applications into a single resource-constrained mobile node (MN) is infeasible since it is not able to perform the whole DL operation by itself due to its limited computing capability, battery level and memory [5]–[7].”
BackgroundNeural-Based Predefined-Time Distributed Optimization of High-Order Nonlinear Multiagent Systems
Zheng, X., Ma, H., Yao, D., & Li, H. (2023) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2023.3343684 · Cited by 25
“R ECENTLY, distributed optimization applied to multiagent systems (MASs) has emerged as a hot issue for its scalability and high computational efficiency, obtaining effective promotion in areas, such as distributed computing [1], resource allocation [2], and smart homes [3].”
BackgroundData Analytics Augmented by AI in the Realm of 6G Wireless Communication
Kaushik, P., Rathore, S. P. S., Rathore, R., & Sikarwar, S. S. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-80778-7_11 · Cited by 40
Sparse Optimization for Green Edge AI Inference
Yang, X., Hua, S., Shi, Y., Wang, H., Zhang, J., & Letaief, K. B. (2020) · Journal of Communications and Information Networks · doi:10.23919/jcin.2020.9055106 · Cited by 19
Self-citationWireless Map-Reduce Distributed Computing with Full-Duplex Radios and Imperfect CSI
Ha, S., Zhang, J., Simeone, O., & Kang, J. (2019) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc.2019.8815393 · Cited by 15
“A significant number of follow-up works has offered various refinements of this idea [6]–[9].”
BackgroundDoF of a Cooperative X-Channel with an Application to Distributed Computing
Bi, Y., Ciblat, P., Wigger, M., & Wu, Y. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834584 · Cited by 14
Shi, Y., Yang, K., Yang, Z., & Zhou, Y. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-823817-2.00013-9 · Cited by 14
Self-citationHan, F., Lau, V. K. N., & Gong, Y. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3132031 · Cited by 13
“2) Baseline 2 (Noncollaborative Scenario in the Interference Channel With Interference Alignment): This is the transceivers design scheme in [10], which exploits the locally computed intermediate values as side information to establish the interference alignment condition for intermediate values communication.”
BackgroundMethodInfluentialCrowd-Sensing Assisted Vehicular Distributed Computing for HD Map Update
Qi, Y., Zhou, Y., Pan, Z., Liu, L., & Shi, J. (2021) · International Conference on Communications · doi:10.1109/icc42927.2021.9501007 · Cited by 14
Mintoo, A. A., Saimon, A. S. M., Bakhsh, M. M., & Akter, M. (2022) · American Journal of Scholarly Research and Innovation · doi:10.63125/sdz8km60 · Cited by 32
Big Data Processing on Volunteer Computing
Lv, Z., Chen, D., & Singh, A. K. (2021) · ACM Transactions on Internet Technology · doi:10.1145/3409801 · Cited by 11
Hierarchical Broadcast Coding: Expediting Distributed Learning at the Wireless Edge
Han, D.-J., Sohn, J.-Y., & Moon, J. J. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.3040792 · Cited by 10
“In [34]–[36], wireless distributed computing schemes are proposed for data shuffling applications.”
BackgroundWang, F., & Lau, V. K. N. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3175733 · Cited by 10
On the Optimality of Data Exchange for Master-Aided Edge Computing Systems
Chen, H., Long, J., Ma, S., Tang, M., & Wu, Y. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3238373 · Cited by 9
“For the wireless distributed computing frameworks, apart from the model in [10] where the nodes have identical cache memory and communicate via an access point, the authors in [28] considered heterogeneous cache sizes at the computing devices, the authors in [29] focused on the transmission of data over interference c…”
MethodNormalized Delivery Time of Wireless MapReduce
Bi, Y., Wigger, M., & Wu, Y. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3423710 · Cited by 8
“For example, [12], [13] studied 0018-9448 © 2024 IEEE.”
AI based approach for 6G wireless communication
Singh, S., Sethi, S., Sharma, R., Rimjhim, N. A., & Kaushik, P. (2023) · International Journal of Communication and Information Technology · doi:10.33545/2707661x.2023.v4.i1a.64 · Cited by 7
Wireless Distributed Computing Networks With Interference Alignment and Neutralization
Tian, L., Liu, W., Geng, Y., Li, J., & Quek, T. Q. S. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3326499 · Cited by 7
“As the communication overhead is a major bottleneck in the wireless distributed computing network for real-time and low-latency applications, there has been significant interest in minimizing the communication overhead for a given computation load [10], [13], [15], [16], [17], [18].”
BackgroundMulti-access Distributed Computing Models using Map-Reduce Arrays
Sasi, S., Günlü, O., & Rajan, B. S. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619355 · Cited by 6
Communication-Efficient Coded Distributed Multi - Task Learning
Tang, H., Hu, H., Yuan, K., & Wu, Y. (2021) · Globecom · doi:10.1109/globecom46510.2021.9685246 · Cited by 6
“To alleviate the communication bottleneck of distributed learning, many gradient compression methods have been proposed to reduce the communication load, such as sparsification [1], [2] which only transmits part component of the gradient vector, quantization [3], [4] which reduces the number of bits of each component…”
MethodCommunication-Efficient Edge AI Inference Over Wireless NetworksPreprint
Yang, K., Zhou, Y., Yang, Z., & Shi, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.13351 · Cited by 9
“To this end, a promising structure of device-based edge inference is to enable cooperation among multiple devices via a distributed computing framework [3], i.e., on-device distributed AI inference.”
BackgroundInfluentialSelf-citationPliable Data Shuffling for On-device Distributed Learning
Jiang, T., Yang, K., & Shi, Y. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8682270 · Cited by 4
“(16) One subgradient of the square of Ky Fan 2-k norm 9X9(2)r,2 at point X is given as [16] ∂ 9 X9(2)r,2 = 2 ∑r i=1 σiuiv T i , where {σi}i=1, {ui}i=1 and {vi}i=1 are the r largest singular values and the corresponding left and right singular vectors of X .”
BackgroundSelf-citationBlind Deconvolution Meets Phase Retrieval in Optical Wireless Communications
Fu, M., & Shi, Y. (2019) · IEEE Vehicular Technology Conference · doi:10.1109/vtcfall.2019.8891314 · Cited by 4
“Specifically, the exact DC representation for the rank-one constraint is that the difference between nuclear norm and Ky Fan k-norm [11] is equal to zero by setting k of the Ky Fan k-norm as one [12, 13].”
MethodSelf-citationHan, F., Li, Q., & Gong, Y. (2023) · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) · doi:10.1109/pimrc56721.2023.10293975 · Cited by 2
“• Baseline 2 (Non-collaborative scenario in the interference channel with interference alignment): This is the transceivers design scheme in [24], in which all the locally computed value is transmitted to the AP without collaboration between edge devices.”
BackgroundBlind Interference Alignment for MapReduce: Exploiting Side-Information With Reconfigurable Antennas
Lu, Y., & Jafar, S. A. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3541808 · Cited by 2
“…aspect of communication networks in the context of distributed computation is the abundance of side-information , arising naturally as a file is typically processed at multiple computation nodes [1], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16] at intermediate stages of computation.”
Murad, S. S., Jasim, Z. A., Soltani, M. D., Badeel, R., Yussof, S., & Oraibi, B.-A. M. (2026) · IEEE Access · doi:10.1109/access.2026.3700819 · Cited by 1
Phase Retrieval via Difference of Convex Programming
He, J., Fu, M., Yu, K., & Shi, Y. (2020) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2020-spring48590.2020.9128755 · Cited by 1
“The rank-one solution can be accurately detected by the DC representation [15].”
BackgroundMethodSelf-citationCoded Distributed Computing Over Unreliable and Insecure D2D Networks
Chen, J., & Sung, C. W. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3345421 · Cited by 1
“The communication model of wireless distributed computing first follows the conventional master-server architecture in cloud computing scenarios, which involves uplink and downlink communications between distributed devices and a central master (e.g., a base station) [17], [18], [19].”
Background2019 Index IEEE Transactions on Signal Processing Vol. 67
(2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2968163 · Cited by 1
Efficient Coded Distributed Computing via Joint Cellular and D2D Communications
Tu, H., Zai, Q., Li, C., & Wu, Y. (2022) · International Conference on Communications · doi:10.1109/icc45855.2022.9838697
“To improve spectral efficiency, [10] utilized interference alignment approach for the case where edge nodes communicate with the access point through a shared wireless channel.”
MethodRobust incentive mechanisms for efficient and secure coded edge intelligence
Ng, J. S. (2023) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/164596
Lu, Y., & Jafar, S. A. (2023) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf59524.2023.10477052
“One distinguishing aspect of communication networks in the context of distributed computation is the abundance of side-information , arising naturally as a file is typically processed at multiple computation nodes [7], [8], [9], [10], [11], [12], [13], [14] at intermediate stages of computation.”
BackgroundZhao, X., 疏, T. 彤. S., Pang, D., Li, T., & 姚, M. 梅. Y. (2025) · Chinese Physics B · doi:10.1088/1674-1056/adf31b
Wireless Multiaccess Distributed Computing Networks
Tian, L., Liu, W., Geng, Y., Bai, B., Yang, H., & Xiang, W. (2026) · IEEE Internet of Things Journal · doi:10.1109/jiot.2026.3674652
“Based on the widely adopted distributed computing framework MapReduce [8], [9], [10], the typical WDC network operates through three phases [11], [12], [13].”
Metadata
- Authors
- Yang, K., Shi, Y., & Ding, Z.
- Affiliations
- University of Chinese Academy of Sciences (CN)
- ShanghaiTech University (CN)
- University of California, Davis (US)
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2019-06-15
- Volume
- 67
- Issue
- 12
- Pages
- 3087-3099
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2890278565
- Cited by
- 43
- References
- 24
- Citations by year
- 2026: 1 · 2025: 3 · 2024: 3 · 2023: 8 · 2022: 5 · 2021: 10 · 2020: 7 · 2019: 6
- FWCI
- 2.52
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Signal Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Natural Science Foundation of China (61601290)
- Shanghai Sailing Program (16YF1407700)
- National Science Foundation (CNS-1702752, ECCS1711823)
- Topics
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Physical Sciences › Computer Science › Computer Networks and Communications › Cooperative Communication and Network Coding
- Keywords
- data shuffling, low-rank optimization, difference of convex functions, interference alignment, degrees of freedom, side information, communication efficiency, onboard machine learning, mobile devices
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.