{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DAW7C7YCZEZ4D3LIEAMMUYDNXI","short_pith_number":"pith:DAW7C7YC","schema_version":"1.0","canonical_sha256":"182df17f02c933c1ed682018ca606dba33c08ac7b466955633759eee88dac313","source":{"kind":"arxiv","id":"2302.00406","version":1},"attestation_state":"computed","paper":{"title":"Learning Choice Functions with Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alessio Benavoli, Dario Azzimonti, Dario Piga","submitted_at":"2023-02-01T12:46:43Z","abstract_excerpt":"In consumer theory, ranking available objects by means of preference relations yields the most common description of individual choices. However, preference-based models assume that individuals: (1) give their preferences only between pairs of objects; (2) are always able to pick the best preferred object. In many situations, they may be instead choosing out of a set with more than two elements and, because of lack of information and/or incomparability (objects with contradictory characteristics), they may not able to select a single most preferred object. To address these situations, we need "},"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":"2302.00406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-01T12:46:43Z","cross_cats_sorted":[],"title_canon_sha256":"c03606e1c84b86c3b69e15382c49652c4955c35dad2fb566a33ce04b8cec7c14","abstract_canon_sha256":"a4fd5d78854c5071f4c2a21f42ee167fba3ff1a625cf344ef512308144bf6b19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:03.112471Z","signature_b64":"ATEp8zCaVuJWp1VGiiajOSa7Z9NIcnNm874z4cyjToxWEl8TINyCkjfEsq8UG6MAZDEX42RgWCu4RIcE8ot7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"182df17f02c933c1ed682018ca606dba33c08ac7b466955633759eee88dac313","last_reissued_at":"2026-07-05T05:38:03.111974Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:03.111974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Choice Functions with Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alessio Benavoli, Dario Azzimonti, Dario Piga","submitted_at":"2023-02-01T12:46:43Z","abstract_excerpt":"In consumer theory, ranking available objects by means of preference relations yields the most common description of individual choices. However, preference-based models assume that individuals: (1) give their preferences only between pairs of objects; (2) are always able to pick the best preferred object. In many situations, they may be instead choosing out of a set with more than two elements and, because of lack of information and/or incomparability (objects with contradictory characteristics), they may not able to select a single most preferred object. To address these situations, we need "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00406","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/2302.00406/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":"2302.00406","created_at":"2026-07-05T05:38:03.112032+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.00406v1","created_at":"2026-07-05T05:38:03.112032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00406","created_at":"2026-07-05T05:38:03.112032+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAW7C7YCZEZ4","created_at":"2026-07-05T05:38:03.112032+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAW7C7YCZEZ4D3LI","created_at":"2026-07-05T05:38:03.112032+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAW7C7YC","created_at":"2026-07-05T05:38:03.112032+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07166","citing_title":"Bayesian Optimization for Building Social-Influence-Free Consensus","ref_index":151,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DAW7C7YCZEZ4D3LIEAMMUYDNXI","json":"https://pith.science/pith/DAW7C7YCZEZ4D3LIEAMMUYDNXI.json","graph_json":"https://pith.science/api/pith-number/DAW7C7YCZEZ4D3LIEAMMUYDNXI/graph.json","events_json":"https://pith.science/api/pith-number/DAW7C7YCZEZ4D3LIEAMMUYDNXI/events.json","paper":"https://pith.science/paper/DAW7C7YC"},"agent_actions":{"view_html":"https://pith.science/pith/DAW7C7YCZEZ4D3LIEAMMUYDNXI","download_json":"https://pith.science/pith/DAW7C7YCZEZ4D3LIEAMMUYDNXI.json","view_paper":"https://pith.science/paper/DAW7C7YC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.00406&json=true","fetch_graph":"https://pith.science/api/pith-number/DAW7C7YCZEZ4D3LIEAMMUYDNXI/graph.json","fetch_events":"https://pith.science/api/pith-number/DAW7C7YCZEZ4D3LIEAMMUYDNXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAW7C7YCZEZ4D3LIEAMMUYDNXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAW7C7YCZEZ4D3LIEAMMUYDNXI/action/storage_attestation","attest_author":"https://pith.science/pith/DAW7C7YCZEZ4D3LIEAMMUYDNXI/action/author_attestation","sign_citation":"https://pith.science/pith/DAW7C7YCZEZ4D3LIEAMMUYDNXI/action/citation_signature","submit_replication":"https://pith.science/pith/DAW7C7YCZEZ4D3LIEAMMUYDNXI/action/replication_record"}},"created_at":"2026-07-05T05:38:03.112032+00:00","updated_at":"2026-07-05T05:38:03.112032+00:00"}