{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:G4GHMHBWFL7MDPPJFTBMA22ZWU","short_pith_number":"pith:G4GHMHBW","schema_version":"1.0","canonical_sha256":"370c761c362afec1bde92cc2c06b59b536e1521cb265041bf4a6f62f979ed328","source":{"kind":"arxiv","id":"2605.01642","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Pluralistic Alignment: A pipeline for dynamic artificial democracy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A pipeline called Adaptive Pluralistic Alignment lets AI systems update their pluralistic alignment by adapting only the weights on fixed reward model bases as values evolve.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Rachel Freedman","submitted_at":"2026-05-02T23:22:23Z","abstract_excerpt":"Prevailing alignment methods target a fixed set of preferences and therefore risk forcing value lock-in as societal norms evolve over time. We introduce Adaptive Pluralistic Alignment (APA), a modular pipeline for updating pluralistically aligned AI systems to track evolving values and avoid value lock-in without repeating costly pretraining or large-scale data collection. APA has three stages: (1) learning compact personalized reward models via low-rank reward basis decomposition, (2) using these models as a jury that collectively selects among candidate outputs through social-choice-theoreti"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.01642","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-02T23:22:23Z","cross_cats_sorted":[],"title_canon_sha256":"0a6d59f6026b8db4246e3eb66cb13bd5be108f1ead3cb0cb2b9b03fc1ba274cc","abstract_canon_sha256":"7db267445fbb73c478a4ba284eb737d6fe47151f307d7fdbbf22dfe9dc31fa5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:11.481116Z","signature_b64":"SatNPo5N42RAxIXaLn5SlgcBwOcT6VEjDYBeIaH4+yFfax0KDLagFlUym5N5Pk1RNF3QB32RtNF6+gsKErnkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"370c761c362afec1bde92cc2c06b59b536e1521cb265041bf4a6f62f979ed328","last_reissued_at":"2026-06-08T01:05:11.480182Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:11.480182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Pluralistic Alignment: A pipeline for dynamic artificial democracy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A pipeline called Adaptive Pluralistic Alignment lets AI systems update their pluralistic alignment by adapting only the weights on fixed reward model bases as values evolve.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Rachel Freedman","submitted_at":"2026-05-02T23:22:23Z","abstract_excerpt":"Prevailing alignment methods target a fixed set of preferences and therefore risk forcing value lock-in as societal norms evolve over time. We introduce Adaptive Pluralistic Alignment (APA), a modular pipeline for updating pluralistically aligned AI systems to track evolving values and avoid value lock-in without repeating costly pretraining or large-scale data collection. APA has three stages: (1) learning compact personalized reward models via low-rank reward basis decomposition, (2) using these models as a jury that collectively selects among candidate outputs through social-choice-theoreti"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"APA has three stages: (1) learning compact personalized reward models via low-rank reward basis decomposition, (2) using these models as a jury that collectively selects among candidate outputs through social-choice-theoretic voting, and (3) efficiently adapting the jury over time by fitting new annotator weights over the fixed reward bases as values shift.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That low-rank reward basis decomposition captures enough structure of individual preferences for weight-only adaptation to track genuine value shifts without requiring updates to the bases themselves.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"APA is a modular pipeline that decomposes preferences into compact reward bases, aggregates them via jury voting, and adapts only annotator weights over time to track shifting values.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A pipeline called Adaptive Pluralistic Alignment lets AI systems update their pluralistic alignment by adapting only the weights on fixed reward model bases as values evolve.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"37a9c34592236c6f1f268d08c5c44f64dcae2b52695a78f748a02347dd33edd0"},"source":{"id":"2605.01642","kind":"arxiv","version":2},"verdict":{"id":"eb02e5e7-cc9a-461d-8b4f-4a9f595192a1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T14:03:40.273306Z","strongest_claim":"APA has three stages: (1) learning compact personalized reward models via low-rank reward basis decomposition, (2) using these models as a jury that collectively selects among candidate outputs through social-choice-theoretic voting, and (3) efficiently adapting the jury over time by fitting new annotator weights over the fixed reward bases as values shift.","one_line_summary":"APA is a modular pipeline that decomposes preferences into compact reward bases, aggregates them via jury voting, and adapts only annotator weights over time to track shifting values.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That low-rank reward basis decomposition captures enough structure of individual preferences for weight-only adaptation to track genuine value shifts without requiring updates to the bases themselves.","pith_extraction_headline":"A pipeline called Adaptive Pluralistic Alignment lets AI systems update their pluralistic alignment by adapting only the weights on fixed reward model bases as values evolve."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.01642/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T17:38:53.658885Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T17:06:53.677301Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"64177b1b75c49b2aa47ce8e766227233f29d58a3025c5f1f35ab22e8c4e1b63e"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.01642","created_at":"2026-06-08T01:05:11.480306+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.01642v2","created_at":"2026-06-08T01:05:11.480306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01642","created_at":"2026-06-08T01:05:11.480306+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4GHMHBWFL7M","created_at":"2026-06-08T01:05:11.480306+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4GHMHBWFL7MDPPJ","created_at":"2026-06-08T01:05:11.480306+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4GHMHBW","created_at":"2026-06-08T01:05:11.480306+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.11240","citing_title":"When to Ask a Question: Understanding Communication Strategies in Generative AI Tools","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G4GHMHBWFL7MDPPJFTBMA22ZWU","json":"https://pith.science/pith/G4GHMHBWFL7MDPPJFTBMA22ZWU.json","graph_json":"https://pith.science/api/pith-number/G4GHMHBWFL7MDPPJFTBMA22ZWU/graph.json","events_json":"https://pith.science/api/pith-number/G4GHMHBWFL7MDPPJFTBMA22ZWU/events.json","paper":"https://pith.science/paper/G4GHMHBW"},"agent_actions":{"view_html":"https://pith.science/pith/G4GHMHBWFL7MDPPJFTBMA22ZWU","download_json":"https://pith.science/pith/G4GHMHBWFL7MDPPJFTBMA22ZWU.json","view_paper":"https://pith.science/paper/G4GHMHBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.01642&json=true","fetch_graph":"https://pith.science/api/pith-number/G4GHMHBWFL7MDPPJFTBMA22ZWU/graph.json","fetch_events":"https://pith.science/api/pith-number/G4GHMHBWFL7MDPPJFTBMA22ZWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4GHMHBWFL7MDPPJFTBMA22ZWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4GHMHBWFL7MDPPJFTBMA22ZWU/action/storage_attestation","attest_author":"https://pith.science/pith/G4GHMHBWFL7MDPPJFTBMA22ZWU/action/author_attestation","sign_citation":"https://pith.science/pith/G4GHMHBWFL7MDPPJFTBMA22ZWU/action/citation_signature","submit_replication":"https://pith.science/pith/G4GHMHBWFL7MDPPJFTBMA22ZWU/action/replication_record"}},"created_at":"2026-06-08T01:05:11.480306+00:00","updated_at":"2026-06-08T01:05:11.480306+00:00"}