BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Rong Li

Rong Li contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Information Theorymath.IThep-phRoboticsArtificial Intelligenceeess.SPeess.SYGenomicsSystems and Control

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
12works
0followers
9topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

12 published item(s)

preprint2026arXiv

AI for Auto-Research: Roadmap & User Guide

AI-assisted research is crossing a threshold: fully automated systems can now generate research papers for as little as $15, while long-horizon agents can execute experiments, draft manuscripts, and simulate critique with minimal human input. Yet this productivity frontier exposes a deeper integrity problem: under scientific pressure, even frontier LLMs still fabricate results, miss hidden errors, and fail to judge novelty reliably. Studying developments through April 2026, we present an end-to-end analysis of AI across the complete research lifecycle, organized into four epistemological phases: Creation (idea generation, literature review, coding & experiments, tables & figures), Writing (paper writing), Validation (peer review, rebuttal & revision), and Dissemination (posters, slides, videos, social media, project pages, and interactive agents). We identify a sharp, stage-dependent boundary between reliable assistance and unreliable autonomy: AI excels at structured, retrieval-grounded, and tool-mediated tasks, but remains fragile for genuinely novel ideas, research-level experiments, and scientific judgment. Generated ideas often degrade after implementation, research code lags far behind pattern-matching benchmarks, and end-to-end autonomous systems have not yet consistently reached major-venue acceptance standards. We further show that greater automation can obscure rather than eliminate failure modes, making human-governed collaboration the most credible deployment paradigm. Finally, we provide a structured taxonomy, benchmark suite, and tool inventory, cross-stage design principles, and a practitioner-oriented playbook, with resources maintained at our project page.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Stairway to Success: An Online Floor-Aware Zero-Shot Object-Goal Navigation Framework via LLM-Driven Coarse-to-Fine Exploration

Deployable service and delivery robots struggle to navigate multi-floor buildings to reach object goals, as existing systems fail due to single-floor assumptions and requirements for offline, globally consistent maps. Multi-floor environments pose unique challenges including cross-floor transitions and vertical spatial reasoning, especially navigating unknown buildings. Object-Goal Navigation benchmarks like HM3D and MP3D also capture this multi-floor reality, yet current methods lack support for online, floor-aware navigation. To bridge this gap, we propose \textbf{\textit{ASCENT}}, an online framework for Zero-Shot Object-Goal Navigation that enables robots to operate without pre-built maps or retraining on new object categories. It introduces: (1) a \textbf{Multi-Floor Abstraction} module that dynamically constructs hierarchical representations with stair-aware obstacle mapping and cross-floor topology modeling, and (2) a \textbf{Coarse-to-Fine Reasoning} module that combines frontier ranking with LLM-driven contextual analysis for multi-floor navigation decisions. We evaluate on HM3D and MP3D benchmarks, outperforming state-of-the-art zero-shot approaches, and demonstrate real-world deployment on a quadruped robot.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

The RoboSense Challenge: Sense Anything, Navigate Anywhere, Adapt Across Platforms

Autonomous systems are increasingly deployed in open and dynamic environments -- from city streets to aerial and indoor spaces -- where perception models must remain reliable under sensor noise, environmental variation, and platform shifts. However, even state-of-the-art methods often degrade under unseen conditions, highlighting the need for robust and generalizable robot sensing. The RoboSense 2025 Challenge is designed to advance robustness and adaptability in robot perception across diverse sensing scenarios. It unifies five complementary research tracks spanning language-grounded decision making, socially compliant navigation, sensor configuration generalization, cross-view and cross-modal correspondence, and cross-platform 3D perception. Together, these tasks form a comprehensive benchmark for evaluating real-world sensing reliability under domain shifts, sensor failures, and platform discrepancies. RoboSense 2025 provides standardized datasets, baseline models, and unified evaluation protocols, enabling large-scale and reproducible comparison of robust perception methods. The challenge attracted 143 teams from 85 institutions across 16 countries, reflecting broad community engagement. By consolidating insights from 23 winning solutions, this report highlights emerging methodological trends, shared design principles, and open challenges across all tracks, marking a step toward building robots that can sense reliably, act robustly, and adapt across platforms in real-world environments.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

The Complete SC-invariant Affine Automorphisms of Polar Codes

Automorphism ensemble (AE) decoding for polar codes was proposed by decoding permuted codewords with successive cancellation (SC) decoders in parallel and hence has lower latency compared to that of successive cancellation list (SCL) decoding. However, some automorphisms are SC-invariant, thus are redundant in AE decoding. In this paper, we find a necessary and sufficient condition related to the block lower-triangular structure of transformation matrices to identify SC-invariant automorphisms. Furthermore, we provide an algorithm to determine the complete SC-invariant affine automorphisms under a specific polar code construction.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A Soft Cancellation Decoder for Parity-Check Polar Codes

Polar codes has been selected as the channel coding scheme for 5G new radio (NR) control channel. Specifically, a special type of parity-check polar (PC-Polar) codes was adopted in uplink control information (UCI). In this paper, we propose a parity-check soft-cancellation (PC-SCAN) algorithm and its simplified version to decode PC-Polar codes. The potential benefits are two-fold. First, PC-SCAN can provide soft output for PC-Polar codes, which is essential for advanced turbo receivers. Second, the decoding performance is better than that of successive cancellation (SC). This is due to the fact that parity-check constraints can be exploited by PC-SCAN to enhance the reliability of other information bits over the iterations. Moreover, we describe a cyclic-shift-register (CSR) based implementation "CSR-SCAN" to reduce both hardware cost and latency with minimum performance loss.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Exclusive quarkonium production or decay in soft gluon factorization

In this paper, we study the application of the recently proposed soft gluon factorization (SGF) to exclusive quarkonium production or decay. We find that in the nonrelativistic QCD factorization framework there are too many nonperturbative parameters. Thanks to the factorization of kinematical physics from dynamical physics, the SGF significantly reduces the number of nonperturbative parameters. Therefore, the SGF can improve our predictive power of exclusive quarkonium production or decay. By applying to $η_c+γ$ production at B-factories, our result is the closest one to data among all theoretical calculations.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

On the Transcriptomic Signature and General Stress State Associated with Aneuploidy

Whether aneuploid cells with diverse karyotypes have any properties in common has a been a subject of intense interest. A recent study by Terhorst et al. (1) reinvestigated the common aneuploidy gene expression (CAGE), disputing the conclusion of our recent work (2). In this short article, which has been submitted to PNAS as a Letter to the Editor, we explain our major concerns about Terhorst et al. and why we believe that our previous conclusion stands valid.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Toward Terabits-per-second Communications: A High-Throughput Hardware Implementation of $G_N$-Coset Codes

Recently, a parallel decoding algorithm of $G_N$-coset codes was proposed.The algorithm exploits two equivalent decoding graphs.For each graph, the inner code part, which consists of independent component codes, is decoded in parallel. The extrinsic information of the code bits is obtained and iteratively exchanged between the graphs until convergence. This algorithm enjoys a higher decoding parallelism than the previous successive cancellation algorithms, due to the avoidance of serial outer code processing. In this work, we present a hardware implementation of the parallel decoding algorithm, it can support maximum $N=16384$. We complete the decoder's physical layout in TSMC $16nm$ process and the size is $999.936μm\times 999.936μm, \,\approx 1.00mm^2$. The decoder's area efficiency and power consumption are evaluated for the cases of $N=16384,K=13225$ and $N=16384, K=14161$. Scaled to $7nm$ process, the decoder's throughput is higher than $477Gbps/mm^2$ and $533Gbps/mm^2$ with five iterations.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Toward Terabits-per-second Communications: Low-Complexity Parallel Decoding of $G_N$-Coset Codes

Recently, a parallel decoding framework of $G_N$-coset codes was proposed. High throughput is achieved by decoding the independent component polar codes in parallel. Various algorithms can be employed to decode these component codes, enabling a flexible throughput-performance tradeoff. In this work, we adopt SC as the component decoders to achieve the highest-throughput end of the tradeoff. The benefits over soft-output component decoders are reduced complexity and simpler (binary) interconnections among component decoders. To reduce performance degradation, we integrate an error detector and a log-likelihood ratio (LLR) generator into each component decoder. The LLR generator, specifically the damping factors therein, is designed by a genetic algorithm. This low-complexity design can achieve an area efficiency of $533Gbps/mm^2$ under 7nm technology.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Delayed state synchronization of continuous-time multi-agent systems in the presence of unknown communication delays (including complete proofs)

This paper studies delayed synchronization of continuous-time multi-agent systems (MAS) in the presence of unknown nonuniform communication delays. A delay-free transformation is developed based on a communication network which is a directed spanning tree, which can transform the original MAS to a new one without delays. By using this transformation, we design a static protocol for full-state coupling and a dynamic protocol for delayed state synchronization for homogeneous MAS via full- and partial-state coupling. Meanwhile, the delayed output synchronization is also studied for heterogeneous MAS, which is achieved by using a low-gain and output regulation based dynamic protocol design via the delay-free transformation.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Relativistic effect of $J/ψ$ hadroproduction in large $p_T$ region

By combining NRQCD factorization and collinear factorization, we compute a series of relativistic corrections for $J/ψ$ hadroproduction to all orders in $v^2$ at large $p_T$ limit. The $v^2$ expansion converges well for all channels. We find that the ratio of relativistic correction term to the corresponding leading term is independent of kinematic variables for any channel, which generalizes the proportional relations found in previous works to all orders.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

The production of $J/ψ$ associated with $c\bar{c}$ at ep colliders

We investigate the direct photoproduction of $J/ψ+c\bar{c}$ at $ep$ colliders with different center of mass energies in this paper. For the color-singlet part we take into account the contribution from QED subprocess as well as the QCD one. Our results show that the QED subprocess not only enhances the differential cross section in the large $p_t$ region but also gives a more transverse $J/ψ$ with $p_t$ increase, which is different from the almost unpolarized $J/ψ$ predicted by the QCD subprocess. The contribution from color octet subprocesses enhances the differential cross section by a factor of 5 in large $p_t$ region and predicts an even more transverse $J/ψ$ in the medium and large $p_t$ region. The sensitivity of this process to the color-octet matrix element $\langle O^{J/ψ}(^3S_1^8)\rangle$ may give great help in studying the matrix element.

0 citations0 reviewsNo code linkedOpen access