theseus: extract claims from 2024-00-00-warden-community-notes-bridging-algorithm (#401)

Co-authored-by: Theseus <theseus@agents.livingip.xyz>
Co-committed-by: Theseus <theseus@agents.livingip.xyz>
This commit is contained in:
Theseus 2026-03-11 06:39:44 +00:00 committed by Leo
parent f117806d67
commit 2052da9fd6

View file

@ -6,11 +6,16 @@ url: https://jonathanwarden.com/understanding-community-notes/
date: 2024-01-01
domain: ai-alignment
secondary_domains: [mechanisms, collective-intelligence]
format: article
status: unprocessed
format: report
status: null-result
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"]
processed_by: theseus
processed_date: 2026-03-11
enrichments_applied: ["pluralistic alignment must accommodate irreducibly diverse values simultaneously.md", "collective intelligence requires diversity as a structural precondition not a moral preference.md", "AI alignment is a coordination problem not a technical problem.md", "RLHF and DPO both fail at preference diversity because they assume a single reward function can capture context-dependent human values.md", "some disagreements are permanently irreducible because they stem from genuine value differences not information gaps and systems must map rather than eliminate them.md"]
extraction_model: "anthropic/claude-sonnet-4.5"
extraction_notes: "Three new claims extracted focused on (1) matrix factorization as potential escape from Arrow's theorem, (2) bridging algorithm as pluralistic alignment implementation, (3) majority-bias resistance through continuous polarity factors. Five enrichments to existing alignment and collective intelligence claims. Core insight: preference DECOMPOSITION into continuous dimensions vs ordinal AGGREGATION may sidestep Arrow's impossibility conditions—this is the constructive mechanism the KB needed. No formal proof exists yet connecting matrix factorization to Arrow's theorem conditions (noted as open question in claim)."
---
## Content
@ -60,3 +65,10 @@ The intercept represents content that would receive more upvotes than downvotes
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
## Key Facts
- Community Notes equation: y_ij = w_i * x_j + b_i + c_j
- Gradient descent optimization finds all factor values simultaneously
- Polarity factor may represent linear combinations of multiple latent factors (per Warden)
- Community Notes operates at scale on Twitter/X processing millions of votes