{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7DKD6VNLFRL33QAZ6JFYDEL3IA","short_pith_number":"pith:7DKD6VNL","schema_version":"1.0","canonical_sha256":"f8d43f55ab2c57bdc019f24b81917b401338eb7f7ca2e761223cf1051baf3cf0","source":{"kind":"arxiv","id":"2502.07166","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Optimization for Building Social-Influence-Free Consensus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","cs.LG","stat.ML"],"primary_cat":"cs.MA","authors_text":"Anurag Singh, Krikamol Muandet, Masaki Adachi, Michael A. Osborne, Siu Lun Chau, Wenjie Xu","submitted_at":"2025-02-11T01:20:32Z","abstract_excerpt":"We introduce Social Bayesian Optimization (SBO), a vote-efficient algorithm for consensus-building in collective decision-making. In contrast to single-agent scenarios, collective decision-making encompasses group dynamics that may distort agents' preference feedback, thereby impeding their capacity to achieve a social-influence-free consensus -- the most preferable decision based on the aggregated agent utilities. We demonstrate that under mild rationality axioms, reaching social-influence-free consensus using noisy feedback alone is impossible. To address this, SBO employs a dual voting syst"},"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":"2502.07166","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-02-11T01:20:32Z","cross_cats_sorted":["cs.GT","cs.LG","stat.ML"],"title_canon_sha256":"cc566f10ee8c4794da4c177a9ade7f686dee43377338c6134c09a4f885be09d5","abstract_canon_sha256":"cacba2aaf80ed01549ed168d59a42073e99eb852fb28cbaaf66ddd1fcf7da7f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:12:33.807911Z","signature_b64":"U2TlF10z+LiRppMUqAaueGUpKnWAFgzH534Mn8v5NvuefA4rtRfJoT1WdfWP33ygE29aE4UVUJtd3Woq99xgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8d43f55ab2c57bdc019f24b81917b401338eb7f7ca2e761223cf1051baf3cf0","last_reissued_at":"2026-07-05T10:12:33.807412Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:12:33.807412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Optimization for Building Social-Influence-Free Consensus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.GT","cs.LG","stat.ML"],"primary_cat":"cs.MA","authors_text":"Anurag Singh, Krikamol Muandet, Masaki Adachi, Michael A. Osborne, Siu Lun Chau, Wenjie Xu","submitted_at":"2025-02-11T01:20:32Z","abstract_excerpt":"We introduce Social Bayesian Optimization (SBO), a vote-efficient algorithm for consensus-building in collective decision-making. In contrast to single-agent scenarios, collective decision-making encompasses group dynamics that may distort agents' preference feedback, thereby impeding their capacity to achieve a social-influence-free consensus -- the most preferable decision based on the aggregated agent utilities. We demonstrate that under mild rationality axioms, reaching social-influence-free consensus using noisy feedback alone is impossible. To address this, SBO employs a dual voting syst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.07166","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.07166/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.07166","created_at":"2026-07-05T10:12:33.807464+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.07166v1","created_at":"2026-07-05T10:12:33.807464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.07166","created_at":"2026-07-05T10:12:33.807464+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DKD6VNLFRL3","created_at":"2026-07-05T10:12:33.807464+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DKD6VNLFRL33QAZ","created_at":"2026-07-05T10:12:33.807464+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DKD6VNL","created_at":"2026-07-05T10:12:33.807464+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10385","citing_title":"Regret Analysis of Guided Diffusion for Black-Box Optimization over Structured Inputs","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07572","citing_title":"Open-Ended Task Discovery via Bayesian Optimization","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7DKD6VNLFRL33QAZ6JFYDEL3IA","json":"https://pith.science/pith/7DKD6VNLFRL33QAZ6JFYDEL3IA.json","graph_json":"https://pith.science/api/pith-number/7DKD6VNLFRL33QAZ6JFYDEL3IA/graph.json","events_json":"https://pith.science/api/pith-number/7DKD6VNLFRL33QAZ6JFYDEL3IA/events.json","paper":"https://pith.science/paper/7DKD6VNL"},"agent_actions":{"view_html":"https://pith.science/pith/7DKD6VNLFRL33QAZ6JFYDEL3IA","download_json":"https://pith.science/pith/7DKD6VNLFRL33QAZ6JFYDEL3IA.json","view_paper":"https://pith.science/paper/7DKD6VNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.07166&json=true","fetch_graph":"https://pith.science/api/pith-number/7DKD6VNLFRL33QAZ6JFYDEL3IA/graph.json","fetch_events":"https://pith.science/api/pith-number/7DKD6VNLFRL33QAZ6JFYDEL3IA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DKD6VNLFRL33QAZ6JFYDEL3IA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DKD6VNLFRL33QAZ6JFYDEL3IA/action/storage_attestation","attest_author":"https://pith.science/pith/7DKD6VNLFRL33QAZ6JFYDEL3IA/action/author_attestation","sign_citation":"https://pith.science/pith/7DKD6VNLFRL33QAZ6JFYDEL3IA/action/citation_signature","submit_replication":"https://pith.science/pith/7DKD6VNLFRL33QAZ6JFYDEL3IA/action/replication_record"}},"created_at":"2026-07-05T10:12:33.807464+00:00","updated_at":"2026-07-05T10:12:33.807464+00:00"}