Bun

Bun에 대해 3개 실제 데이터 소스에서 21개 공개 신호를 찾았습니다. GitHub 10건, Hacker News 1건, arXiv 10건을 원문 링크와 함께 보여줍니다.

검색 결과 보기

토픽 정보

이름
Bun
Slug
bun
관련 키워드
the, and, bun, for, with, based, prepare, strand
최근 7일 변화
MVP에서는 실시간 검색 결과 기반 점수만 계산합니다. DB snapshot 저장 후 추세가 표시됩니다.
마지막 업데이트
2026-09-21T09:49:13.778Z

출처별 최신 반응

Show HN: Radius – A Meetup.com Alternative

Hello HN! I'm relaunching Radius [1] - far too long after the original Show HN [2] (I'll blame the day job for that). Radius started out from my frustration with not knowing what was going on around me. The in...

hackernews · 원본 ID 49777539

HairCS: Reconstructing Strand-Based Hair from Hair Cards

We present an automated pipeline that converts hair-card models into high-quality strand-based hairstyles. Given a collection of textured triangular or quad strips as input, our method produces a strand-based representation that preserves the original hairstyle while enriching it with fine-scale geometric detail and adhering to standard production requirements: strands originate from the scalp, roots are uniformly distributed, and the hair volume is plausibly filled. The resulting assets are directly compatible wi...

arxiv · 원본 ID http://arxiv.org/abs/2609.16465v1

The image of the constant sheaf under the geometric Langlands equivalence

Let $X$ be a smooth projective curve and let $G$ be a reductive group over an algebraically closed field of characteristic zero. We compute the image of arbitrary finite-rank local systems on $\mathrm{Bun}_G(X)$ under the geometric Langlands equivalence, confirming a conjecture of V. Lafforgue in the case of the constant sheaf.

arxiv · 원본 ID http://arxiv.org/abs/2608.25357v1

A conjectural construction of Arthur packets in Fargues-Scholze's categorical local Langlands correspondence

We present a conjectural construction of Arthur packets within Fargues-Scholze's framework for the categorical local Langlands correspondence (CLLC). This construction consists of three parts. We first provide an overview the main statement of the CLLC, the underlying moduli stacks -- $\mathrm{Par}_G$ of parameters and $\mathrm{Bun}_G$ of $G$-bundles -- on the two sides of the correspondence, and its relation to representations of reductive p-adic groups. We then review the geometric Satake correspondence in order...

arxiv · 원본 ID http://arxiv.org/abs/2608.24341v1

Strand-based Hairstyle Generation via Large Reconstruction and Multimodal Models

Creating high-quality strand-based hairstyles in current production pipelines remains heavily dependent on skilled artists and time-consuming manual authoring, making it costly and difficult to scale. Existing learning-based methods have advanced image-driven hair reconstruction, but typically require large, diverse training datasets, struggle to generalize to complex styles such as buns and ponytails, and often operate in representations that are not directly compatible with strand-based modeling, editing, and si...

arxiv · 원본 ID http://arxiv.org/abs/2608.13679v1

Randomness Certification and Trade-offs in the Prepare-and-Broadcast Scenario

We investigate the prepare-and-broadcast scenario, a multipartite extension of dimension-constrained prepare-and-measure experiments in which a quantum system is distributed to multiple receivers. We derive fundamental trade-offs between prepare-and-measure witnesses, Bell nonlocality, and quantum random access code performance. We further develop a semi-device-independent randomness certification framework based on prepare-and-broadcast witnesses, showing that the maximal quantum violation certifies two bits of j...

arxiv · 원본 ID http://arxiv.org/abs/2608.08329v1

The extended Fargues--Scholze spectral action

Let $G$ be a connected reductive group over a non-archimedean local field. The main result of Fargues and Scholze [FS21] for the geometrization of the local Langlands correspondence is the construction of a ``spectral action'' on the category of $\ell$-adic sheaves on $\text{Bun}_{G}$, the stack of $G$-torsors on the Fargues-Fontaine curve. The goal of this paper is to prove a conjecture of Fargues which says that one can extend this construction to the larger stack $\text{Bun}_G^e$ of $G$-torsors on the Kaletha g...

arxiv · 원본 ID http://arxiv.org/abs/2608.02708v2

Multibranched parametric resonance and swallowtail catastrophe in electromechanical oscillators with nonlinear friction

Parametric resonance underpins the operation of a wide range of physical systems, from nanomechanical resonators to quantum-information systems and Ising machines. As an archetypal class of driven-dissipative systems, parametric oscillators are generally expected to exhibit a single pair of stable period-two states with opposite phases. This bistable behavior enables both the simulation of spin Hamiltonians and the preparation of superconducting cat states. Whether multiple pairs of such states can coexist in a si...

arxiv · 원본 ID http://arxiv.org/abs/2607.27242v1

Testing Distributions Against Bounded Distinguishers

Motivated by the challenge of testing distributions over high-dimensional or continuous domains, we study distribution testing with respect to bounded classes of distinguishers. A representative task is to use samples from an unknown distribution $P$ over a very large domain to decide between two cases: $P = P_{\mathsf{ref}}$ for a fixed reference distribution $P_{\mathsf{ref}}$, or there exists a distinguisher $f$ in a bounded class $\mathcal{F}$ which witnesses the separation $|\mathbf{E}_P[f] - \mathbf{E}_{P_{\...

arxiv · 원본 ID http://arxiv.org/abs/2607.15645v1

QMA Lower Bounds for Batch Verification via Approximate Degree

We study batch verification in QMA query and communication complexity, where the goal is to understand how the resources needed to verify $m$ copies of a Boolean function $f$ depend on $m$. We give a general technique for proving lower bounds on the witness-query tradeoff needed to batch verify a function $f$ in terms of its approximate degree. Applying this technique to an explicit family of DNF formulas $f$, we show that attempting to save even a constant factor on the witness length of the baseline approach to...

arxiv · 원본 ID http://arxiv.org/abs/2607.08888v2

The Prepare and Broadcast Scenario

We introduce the dimension-restricted prepare and broadcast (PAB) scenario, which generalizes standard prepare-and-measure frameworks. Here, the system prepared by a sender undergoes a broadcasting transformation before being locally measured by multiple receivers. We develop a hierarchy of classical, quantum, and nonsignalling models describing this scenario, characterize their corresponding correlation sets, and derive new families of Bell-like inequalities together with linear and semidefinite programming metho...

arxiv · 원본 ID http://arxiv.org/abs/2606.28632v1

can1357/oh-my-pi

⌥ Coding agent with the IDE wired in

github · 원본 ID 1125856365