---
type: source
title: "Understanding Community Notes and Bridging-Based Ranking"
author: "Jonathan Warden"
url: https://jonathanwarden.com/understanding-community-notes/
date: 2024-01-01
domain: ai-alignment
secondary_domains: [mechanisms, collective-intelligence]
format: article
status: unprocessed
priority: high
tags: [community-notes, bridging-algorithm, matrix-factorization, polarity-factors, consensus-mechanism]
flagged_for_rio: ["Community Notes bridging algorithm as mechanism design — matrix factorization for consensus is novel governance mechanism"]
---

## Content

Technical explainer of how Community Notes' bridging algorithm works using matrix factorization.

**Core equation**: y_ij = w_i * x_j + b_i + c_j

Where:
- w_i = user's polarity factor (latent ideological position)
- x_j = post's polarity factor
- b_i = user's intercept (base tendency to rate positively/negatively)
- c_j = post's intercept — the "common ground" signal (the BRIDGING score)

**How it identifies bridging content**: A post receives high bridging scores when it has:
1. Low polarity slope — minimal correlation between user ideology and voting
2. High positive intercept — upvotes that persist regardless of user perspective

The intercept represents content that would receive more upvotes than downvotes with an equal balance of left and right participants.

**Key difference from majority voting**: The algorithm does NOT favor the majority. Even with 100 right-wing users versus a handful of left-wing users, the regression slope remains unchanged. This contrasts with vote aggregation which amplifies majority bias.

**How it sidesteps Arrow's theorem (implicit)**: By decomposing votes into separable dimensions (polarity + common ground) rather than aggregating them ordinally, it avoids Arrow's conditions. Arrow requires ordinal preference aggregation — matrix factorization operates in a continuous latent space.

**Limitations**: The polarity factor discovered "doesn't necessarily correspond exactly" to any measurable quantity — may represent linear combinations of multiple latent factors. Can fail in certain scenarios (multidimensional implementations needed).

**Gradient descent optimization** finds all factor values simultaneously.

## Agent Notes

**Why this matters:** This is the most technically detailed explanation of how bridging algorithms actually work. The key insight: by decomposing preferences into DIMENSIONS (polarity + common ground) rather than aggregating them into rankings, the algorithm operates outside Arrow's ordinal aggregation framework. Arrow's impossibility requires ordinal preferences — matrix factorization in continuous space may escape the theorem's conditions entirely.

**What surprised me:** The mathematical elegance. It's essentially linear regression run simultaneously on every user and every post. The "bridging score" is just the intercept — what remains after you subtract out ideological variance. This is simple enough to be implementable AND principled enough to have formal properties.

**What I expected but didn't find:** No formal proof that this sidesteps Arrow's theorem. The claim is implicit from the mathematical structure but nobody has written the theorem connecting matrix-factorization-based aggregation to Arrow's conditions. This is a gap worth filling.

**KB connections:**
- [[universal alignment is mathematically impossible because Arrows impossibility theorem applies to aggregating diverse human preferences into a single coherent objective]] — bridging may escape Arrow's by operating in continuous latent space rather than ordinal rankings
- [[pluralistic alignment must accommodate irreducibly diverse values simultaneously]] — bridging does this by finding common ground across diverse groups
- [[partial connectivity produces better collective intelligence than full connectivity on complex problems because it preserves diversity]] — bridging preserves ideological diversity while extracting consensus

**Extraction hints:** Claims about (1) matrix factorization as Arrow's-theorem-escaping mechanism, (2) bridging scores as preference decomposition rather than aggregation, (3) Community Notes as working implementation of pluralistic alignment.

**Context:** Jonathan Warden runs a blog focused on algorithmic democracy. Technical but accessible explainer based on the original Birdwatch paper (Wojcik et al. 2022).

## Curator Notes (structured handoff for extractor)
PRIMARY CONNECTION: [[universal alignment is mathematically impossible because Arrows impossibility theorem applies to aggregating diverse human preferences into a single coherent objective]]
WHY ARCHIVED: Technical mechanism showing HOW bridging algorithms may sidestep Arrow's theorem — the constructive escape our KB needs
EXTRACTION HINT: The key claim: preference DECOMPOSITION (into dimensions) escapes Arrow's impossibility because Arrow requires ordinal AGGREGATION