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

Harang Ju

Harang Ju contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Neurons and CognitionArtificial IntelligenceHuman-Computer InteractionMachine LearningQuantitative Methods

Trust snapshot

Quick read

Trust 17 - UnverifiedVerification L1Unclaimed author
4works
0followers
5topics
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

4 published item(s)

preprint2026arXiv

Advancing AI Negotiations: A Large-Scale Autonomous Negotiation Competition

We conducted an International AI Negotiation Competition in which participants designed and refined prompts for AI negotiation agents. We then facilitated over 180,000 negotiations between these agents across multiple scenarios with diverse characteristics and objectives. Our findings revealed that principles from human negotiation theory remain crucial even in AI-AI contexts. Surprisingly, warmth -- a traditionally human relationship-building trait -- was consistently associated with superior outcomes across all key performance metrics. Dominant agents, meanwhile, were especially effective at claiming value. Our analysis also revealed unique dynamics in AI-AI negotiations not fully explained by existing theory, including AI-specific technical strategies like chain-of-thought reasoning and prompt injection. When we applied natural language processing (NLP) methods to the full transcripts of all negotiations, we found positivity, gratitude, and question-asking (associated with warmth) were strongly associated with reaching deals as well as objective and subjective value, whereas conversation lengths (associated with dominance) were strongly associated with impasses. The results suggest the need to establish a new theory of AI negotiation, which integrates classic negotiation theory with AI-specific negotiation theories to better understand autonomous negotiations and optimize agent performance.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

SMolLM: Small Language Models Learn Small Molecular Grammar

Language models for molecular design have scaled to hundreds of millions of parameters, yet how they learn chemical grammar is poorly understood. We train SMolLM, a 53K-parameter weight-shared transformer, to generate novel SMILES with 95% validity on the ZINC-250K drug-like-molecule benchmark, outperforming a standard GPT with 10 times more parameters. Mechanistically, the same block resolves SMILES constraints across passes in a fixed order: brackets first, rings second, and valence last, as shown by error classification, linear probing, and sparse autoencoders. A systematic ablation across attention heads and passes further localizes the first bracket-matching step to a single attention head. Together, these results yield a compact, mechanistically interpretable molecular generator and a testbed for studying iterative computation in formal-language domains.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Curiosity as filling, compressing, and reconfiguring knowledge networks

Due to the significant role that curiosity plays in our lives, several theoretical constructs, such as the information gap theory and compression progress theory, have sought to explain how we engage in its practice. According to the former, curiosity is the drive to acquire information that is missing from our understanding of the world. According to the latter, curiosity is the drive to construct an increasingly parsimonious mental model of the world. To complement the densification processes inherent to these theories, we propose the conformational change theory, wherein we posit that curiosity results in mental models with marked conceptual flexibility. We formalize curiosity as the process of building a growing knowledge network to quantitatively investigate information gap theory, compression progress theory, and the conformational change theory of curiosity. In knowledge networks, gaps can be identified as topological cavities, compression progress can be quantified using network compressibility, and flexibility can be measured as the number of conformational degrees of freedom. We leverage data acquired from the online encyclopedia Wikipedia to determine the degree to which each theory explains the growth of knowledge networks built by individuals and by collectives. Our findings lend support to a pluralistic view of curiosity, wherein intrinsically motivated information acquisition fills knowledge gaps and simultaneously leads to increasingly compressible and flexible knowledge networks. Across individuals and collectives, we determine the contexts in which each theoretical account may be explanatory, thereby clarifying their complementary and distinct explanations of curiosity. Our findings offer a novel network theoretical perspective on intrinsically motivated information acquisition that may harmonize with or compel an expansion of the traditional taxonomy of curiosity.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

The control of brain network dynamics across diverse scales of space and time

The human brain is composed of distinct regions that are each associated with particular functions and distinct propensities for the control of neural dynamics. However, the relation between these functions and control profiles is poorly understood, as is the variation in this relation across diverse scales of space and time. Here we probe the relation between control and dynamics in brain networks constructed from diffusion tensor imaging data in a large community based sample of young adults. Specifically, we probe the control properties of each brain region and investigate their relationship with dynamics across various spatial scales using the Laplacian eigenspectrum. In addition, through analysis of regional modal controllability and partitioning of modes, we determine whether the associated dynamics are fast or slow, as well as whether they are alternating or monotone. We find that brain regions that facilitate the control of energetically easy transitions are associated with activity on short length scales and slow time scales. Conversely, brain regions that facilitate control of difficult transitions are associated with activity on long length scales and fast time scales. Built on linear dynamical models, our results offer parsimonious explanations for the activity propagation and network control profiles supported by regions of differing neuroanatomical structure.

0 citations0 reviewsNo code linkedOpen access