{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:D63234ITBUSKA2KXRXDBEBWUT5","short_pith_number":"pith:D63234IT","schema_version":"1.0","canonical_sha256":"1fb7adf1130d24a069578dc61206d49f67c09fbaeb8cd0e2dc741b34ac37a6a0","source":{"kind":"arxiv","id":"2407.05898","version":1},"attestation_state":"computed","paper":{"title":"Contrastive Learning of Preferences with a Contextual InfoNCE Loss","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Johannes F\\\"urnkranz, Martin M\\\"uller, Timo Bertram","submitted_at":"2024-07-08T13:05:08Z","abstract_excerpt":"A common problem in contextual preference ranking is that a single preferred action is compared against several choices, thereby blowing up the complexity and skewing the preference distribution. In this work, we show how one can solve this problem via a suitable adaptation of the CLIP framework.This adaptation is not entirely straight-forward, because although the InfoNCE loss used by CLIP has achieved great success in computer vision and multi-modal domains, its batch-construction technique requires the ability to compare arbitrary items, and is not well-defined if one item has multiple posi"},"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":"2407.05898","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-08T13:05:08Z","cross_cats_sorted":[],"title_canon_sha256":"f666f93f8263d4387c8fdd6741622d9cd57cce47ff9564049ee36467831658eb","abstract_canon_sha256":"34ca3160849d63eb849f2e5726eaf83f621bb401a3cb5aec38cf65c418e13412"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:20.470797Z","signature_b64":"FBZh/ThdqnB0PRFSdxkIDSmQMGX6dbuSjnhyKNJ3aUoBVpt5WOCHdzJg/b1ouuIECGLbM2U4x5nNfuX2d8kVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fb7adf1130d24a069578dc61206d49f67c09fbaeb8cd0e2dc741b34ac37a6a0","last_reissued_at":"2026-07-05T08:41:20.470300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:20.470300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contrastive Learning of Preferences with a Contextual InfoNCE Loss","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Johannes F\\\"urnkranz, Martin M\\\"uller, Timo Bertram","submitted_at":"2024-07-08T13:05:08Z","abstract_excerpt":"A common problem in contextual preference ranking is that a single preferred action is compared against several choices, thereby blowing up the complexity and skewing the preference distribution. In this work, we show how one can solve this problem via a suitable adaptation of the CLIP framework.This adaptation is not entirely straight-forward, because although the InfoNCE loss used by CLIP has achieved great success in computer vision and multi-modal domains, its batch-construction technique requires the ability to compare arbitrary items, and is not well-defined if one item has multiple posi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05898","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/2407.05898/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":"2407.05898","created_at":"2026-07-05T08:41:20.470370+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05898v1","created_at":"2026-07-05T08:41:20.470370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05898","created_at":"2026-07-05T08:41:20.470370+00:00"},{"alias_kind":"pith_short_12","alias_value":"D63234ITBUSK","created_at":"2026-07-05T08:41:20.470370+00:00"},{"alias_kind":"pith_short_16","alias_value":"D63234ITBUSKA2KX","created_at":"2026-07-05T08:41:20.470370+00:00"},{"alias_kind":"pith_short_8","alias_value":"D63234IT","created_at":"2026-07-05T08:41:20.470370+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.17765","citing_title":"AURORA: Contextual Orthogonalization for Geometric Representation Learning in Healthcare Foundation Models","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08685","citing_title":"Event Fields: Learning Latent Event Structure for Waveform Foundation Models","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09765","citing_title":"WISTERIA: Learning Clinical Representations from Noisy Supervision via Multi-View Consistency in Electronic Health Records","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5","json":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5.json","graph_json":"https://pith.science/api/pith-number/D63234ITBUSKA2KXRXDBEBWUT5/graph.json","events_json":"https://pith.science/api/pith-number/D63234ITBUSKA2KXRXDBEBWUT5/events.json","paper":"https://pith.science/paper/D63234IT"},"agent_actions":{"view_html":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5","download_json":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5.json","view_paper":"https://pith.science/paper/D63234IT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05898&json=true","fetch_graph":"https://pith.science/api/pith-number/D63234ITBUSKA2KXRXDBEBWUT5/graph.json","fetch_events":"https://pith.science/api/pith-number/D63234ITBUSKA2KXRXDBEBWUT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5/action/storage_attestation","attest_author":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5/action/author_attestation","sign_citation":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5/action/citation_signature","submit_replication":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5/action/replication_record"}},"created_at":"2026-07-05T08:41:20.470370+00:00","updated_at":"2026-07-05T08:41:20.470370+00:00"}