{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CIECXBY6X3KHOPMKXS7IPUCSVG","short_pith_number":"pith:CIECXBY6","schema_version":"1.0","canonical_sha256":"12082b871ebed4773d8abcbe87d052a992783872614cdf82da075e33e374a954","source":{"kind":"arxiv","id":"2402.03014","version":1},"attestation_state":"computed","paper":{"title":"Whom to Trust? Elective Learning for Distributed Gaussian Process Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Akshat Dubey, Georges Hattab, Sandra Hirche, Xiaobing Dai, Zewen Yang","submitted_at":"2024-02-05T13:52:56Z","abstract_excerpt":"This paper introduces an innovative approach to enhance distributed cooperative learning using Gaussian process (GP) regression in multi-agent systems (MASs). The key contribution of this work is the development of an elective learning algorithm, namely prior-aware elective distributed GP (Pri-GP), which empowers agents with the capability to selectively request predictions from neighboring agents based on their trustworthiness. The proposed Pri-GP effectively improves individual prediction accuracy, especially in cases where the prior knowledge of an agent is incorrect. Moreover, it eliminate"},"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":"2402.03014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-05T13:52:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3ae42c1db5444ae5099ebff381bf0fa870f3d1cd2918e0b79da217e63d556f80","abstract_canon_sha256":"04ad00c15153681537a0d01d914cba8dc995d731a8e3d2ef8af7f2228425d42a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:41:20.425882Z","signature_b64":"cKGa9grPqtWFRKLqbFca4X1NYto0cQ/+KrUXMiWF42R7xlWMK5dUIrAjgfy+qAlKZ/k4N10ewq8+lgiat+M3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12082b871ebed4773d8abcbe87d052a992783872614cdf82da075e33e374a954","last_reissued_at":"2026-07-05T07:41:20.425533Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:41:20.425533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Whom to Trust? Elective Learning for Distributed Gaussian Process Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Akshat Dubey, Georges Hattab, Sandra Hirche, Xiaobing Dai, Zewen Yang","submitted_at":"2024-02-05T13:52:56Z","abstract_excerpt":"This paper introduces an innovative approach to enhance distributed cooperative learning using Gaussian process (GP) regression in multi-agent systems (MASs). The key contribution of this work is the development of an elective learning algorithm, namely prior-aware elective distributed GP (Pri-GP), which empowers agents with the capability to selectively request predictions from neighboring agents based on their trustworthiness. The proposed Pri-GP effectively improves individual prediction accuracy, especially in cases where the prior knowledge of an agent is incorrect. Moreover, it eliminate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.03014","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/2402.03014/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":"2402.03014","created_at":"2026-07-05T07:41:20.425588+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.03014v1","created_at":"2026-07-05T07:41:20.425588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.03014","created_at":"2026-07-05T07:41:20.425588+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIECXBY6X3KH","created_at":"2026-07-05T07:41:20.425588+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIECXBY6X3KHOPMK","created_at":"2026-07-05T07:41:20.425588+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIECXBY6","created_at":"2026-07-05T07:41:20.425588+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.16682","citing_title":"The Task Shield: Enforcing Task Alignment to Defend Against Indirect Prompt Injection in LLM Agents","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CIECXBY6X3KHOPMKXS7IPUCSVG","json":"https://pith.science/pith/CIECXBY6X3KHOPMKXS7IPUCSVG.json","graph_json":"https://pith.science/api/pith-number/CIECXBY6X3KHOPMKXS7IPUCSVG/graph.json","events_json":"https://pith.science/api/pith-number/CIECXBY6X3KHOPMKXS7IPUCSVG/events.json","paper":"https://pith.science/paper/CIECXBY6"},"agent_actions":{"view_html":"https://pith.science/pith/CIECXBY6X3KHOPMKXS7IPUCSVG","download_json":"https://pith.science/pith/CIECXBY6X3KHOPMKXS7IPUCSVG.json","view_paper":"https://pith.science/paper/CIECXBY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.03014&json=true","fetch_graph":"https://pith.science/api/pith-number/CIECXBY6X3KHOPMKXS7IPUCSVG/graph.json","fetch_events":"https://pith.science/api/pith-number/CIECXBY6X3KHOPMKXS7IPUCSVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIECXBY6X3KHOPMKXS7IPUCSVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIECXBY6X3KHOPMKXS7IPUCSVG/action/storage_attestation","attest_author":"https://pith.science/pith/CIECXBY6X3KHOPMKXS7IPUCSVG/action/author_attestation","sign_citation":"https://pith.science/pith/CIECXBY6X3KHOPMKXS7IPUCSVG/action/citation_signature","submit_replication":"https://pith.science/pith/CIECXBY6X3KHOPMKXS7IPUCSVG/action/replication_record"}},"created_at":"2026-07-05T07:41:20.425588+00:00","updated_at":"2026-07-05T07:41:20.425588+00:00"}