{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:D63234ITBUSKA2KXRXDBEBWUT5","short_pith_number":"pith:D63234IT","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"},"canonical_sha256":"1fb7adf1130d24a069578dc61206d49f67c09fbaeb8cd0e2dc741b34ac37a6a0","source":{"kind":"arxiv","id":"2407.05898","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.05898","created_at":"2026-07-05T08:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"2407.05898v1","created_at":"2026-07-05T08:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05898","created_at":"2026-07-05T08:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"D63234ITBUSK","created_at":"2026-07-05T08:41:20Z"},{"alias_kind":"pith_short_16","alias_value":"D63234ITBUSKA2KX","created_at":"2026-07-05T08:41:20Z"},{"alias_kind":"pith_short_8","alias_value":"D63234IT","created_at":"2026-07-05T08:41:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:D63234ITBUSKA2KXRXDBEBWUT5","target":"record","payload":{"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"},"canonical_sha256":"1fb7adf1130d24a069578dc61206d49f67c09fbaeb8cd0e2dc741b34ac37a6a0","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"},"source_kind":"arxiv","source_id":"2407.05898","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odtQEo+SjgENA+e5oEA/7KfoXZ2NBbdny0+lVFiFkDr9JR10WU1waf3aRYwQ5FRljJu0ILxKa+MM/tYHBqgKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:19:23.855508Z"},"content_sha256":"3536051f2ee3f2ba0bb00c2af3cdccddd8d3e31ffb228f579def3092e0e509fc","schema_version":"1.0","event_id":"sha256:3536051f2ee3f2ba0bb00c2af3cdccddd8d3e31ffb228f579def3092e0e509fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:D63234ITBUSKA2KXRXDBEBWUT5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:41:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJSVGcyew8j8k3zziAZoQK+uPviBRQ9wyGKXIuztox877Y2FAAxv8TjiuLKz7jHOUmarcwP796iQbRwNcrJ7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:19:23.856122Z"},"content_sha256":"ec4fbcc2a4bb354c2b32ff9cab199e393bbb9940fc74594f6d8ecd045e274387","schema_version":"1.0","event_id":"sha256:ec4fbcc2a4bb354c2b32ff9cab199e393bbb9940fc74594f6d8ecd045e274387"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5/bundle.json","state_url":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D63234ITBUSKA2KXRXDBEBWUT5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T22:19:23Z","links":{"resolver":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5","bundle":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5/bundle.json","state":"https://pith.science/pith/D63234ITBUSKA2KXRXDBEBWUT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D63234ITBUSKA2KXRXDBEBWUT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:D63234ITBUSKA2KXRXDBEBWUT5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"34ca3160849d63eb849f2e5726eaf83f621bb401a3cb5aec38cf65c418e13412","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-08T13:05:08Z","title_canon_sha256":"f666f93f8263d4387c8fdd6741622d9cd57cce47ff9564049ee36467831658eb"},"schema_version":"1.0","source":{"id":"2407.05898","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.05898","created_at":"2026-07-05T08:41:20Z"},{"alias_kind":"arxiv_version","alias_value":"2407.05898v1","created_at":"2026-07-05T08:41:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05898","created_at":"2026-07-05T08:41:20Z"},{"alias_kind":"pith_short_12","alias_value":"D63234ITBUSK","created_at":"2026-07-05T08:41:20Z"},{"alias_kind":"pith_short_16","alias_value":"D63234ITBUSKA2KX","created_at":"2026-07-05T08:41:20Z"},{"alias_kind":"pith_short_8","alias_value":"D63234IT","created_at":"2026-07-05T08:41:20Z"}],"graph_snapshots":[{"event_id":"sha256:ec4fbcc2a4bb354c2b32ff9cab199e393bbb9940fc74594f6d8ecd045e274387","target":"graph","created_at":"2026-07-05T08:41:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.05898/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Johannes F\\\"urnkranz, Martin M\\\"uller, Timo Bertram","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-08T13:05:08Z","title":"Contrastive Learning of Preferences with a Contextual InfoNCE Loss"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05898","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3536051f2ee3f2ba0bb00c2af3cdccddd8d3e31ffb228f579def3092e0e509fc","target":"record","created_at":"2026-07-05T08:41:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"34ca3160849d63eb849f2e5726eaf83f621bb401a3cb5aec38cf65c418e13412","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-08T13:05:08Z","title_canon_sha256":"f666f93f8263d4387c8fdd6741622d9cd57cce47ff9564049ee36467831658eb"},"schema_version":"1.0","source":{"id":"2407.05898","kind":"arxiv","version":1}},"canonical_sha256":"1fb7adf1130d24a069578dc61206d49f67c09fbaeb8cd0e2dc741b34ac37a6a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fb7adf1130d24a069578dc61206d49f67c09fbaeb8cd0e2dc741b34ac37a6a0","first_computed_at":"2026-07-05T08:41:20.470300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:41:20.470300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FBZh/ThdqnB0PRFSdxkIDSmQMGX6dbuSjnhyKNJ3aUoBVpt5WOCHdzJg/b1ouuIECGLbM2U4x5nNfuX2d8kVBA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:41:20.470797Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.05898","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3536051f2ee3f2ba0bb00c2af3cdccddd8d3e31ffb228f579def3092e0e509fc","sha256:ec4fbcc2a4bb354c2b32ff9cab199e393bbb9940fc74594f6d8ecd045e274387"],"state_sha256":"4e21fe7457548d0ead0f6b8d0bb389a98394de7bd55d1c5863886ce3552ee22d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9QBpDfbEJ2rZxEfEUO+L5u05zvHjIk88/gFmrLEicK5rlFbzTbCt3NSIf+JtGUHNmjAbioqTOkLRXdaqx1mCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T22:19:23.859799Z","bundle_sha256":"952b33cb42bb581e005685da329d4dc62113cc7abf420adebfe7ebed7326409a"}}