{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TTM445TAUS7PN64TAMOA6XI6UK","short_pith_number":"pith:TTM445TA","canonical_record":{"source":{"id":"2011.05354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-10T19:09:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d6e3965057aecd629151f810f264e6aeaa0e85ae81ea6ef9a753e8d90eb4e12b","abstract_canon_sha256":"693ed9e7a5e52dde8fbc2c6ed26da29c8464a0d3b0b52a876c265f1bc9616e9a"},"schema_version":"1.0"},"canonical_sha256":"9cd9ce7660a4bef6fb93031c0f5d1ea298503c49fc9dd462687b7742cba16eb2","source":{"kind":"arxiv","id":"2011.05354","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.05354","created_at":"2026-07-05T02:55:08Z"},{"alias_kind":"arxiv_version","alias_value":"2011.05354v2","created_at":"2026-07-05T02:55:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05354","created_at":"2026-07-05T02:55:08Z"},{"alias_kind":"pith_short_12","alias_value":"TTM445TAUS7P","created_at":"2026-07-05T02:55:08Z"},{"alias_kind":"pith_short_16","alias_value":"TTM445TAUS7PN64T","created_at":"2026-07-05T02:55:08Z"},{"alias_kind":"pith_short_8","alias_value":"TTM445TA","created_at":"2026-07-05T02:55:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TTM445TAUS7PN64TAMOA6XI6UK","target":"record","payload":{"canonical_record":{"source":{"id":"2011.05354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-10T19:09:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d6e3965057aecd629151f810f264e6aeaa0e85ae81ea6ef9a753e8d90eb4e12b","abstract_canon_sha256":"693ed9e7a5e52dde8fbc2c6ed26da29c8464a0d3b0b52a876c265f1bc9616e9a"},"schema_version":"1.0"},"canonical_sha256":"9cd9ce7660a4bef6fb93031c0f5d1ea298503c49fc9dd462687b7742cba16eb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:55:08.644824Z","signature_b64":"/CyhZ50XK3N1AZMz0Y2yz3cp/HetFHDIFNInElUG864EYUtidNAM4T9YGWCVpm4J/xka+a1ElJ6v+uKK8wi0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cd9ce7660a4bef6fb93031c0f5d1ea298503c49fc9dd462687b7742cba16eb2","last_reissued_at":"2026-07-05T02:55:08.644339Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:55:08.644339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.05354","source_version":2,"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-05T02:55:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wvRgWqeuq9bKWi9jagp1qJUQq9IwSk2IUVhFJrRF31VDJHIVNhd9XYC20Sv14acPWI/1i3j/bDb/j7IOvQfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:40:55.110173Z"},"content_sha256":"9914ed800490bea168a8f32712b44333e61d20ae90391a90a612714e3f542407","schema_version":"1.0","event_id":"sha256:9914ed800490bea168a8f32712b44333e61d20ae90391a90a612714e3f542407"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TTM445TAUS7PN64TAMOA6XI6UK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contrastive Losses and Solution Caching for Predict-and-Optimize","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jayanta Mandi, Maxime Mulamba, Michelangelo Diligenti, Michele Lombardi, Tias Guns, Victor Bucarey","submitted_at":"2020-11-10T19:09:12Z","abstract_excerpt":"Many decision-making processes involve solving a combinatorial optimization problem with uncertain input that can be estimated from historic data. Recently, problems in this class have been successfully addressed via end-to-end learning approaches, which rely on solving one optimization problem for each training instance at every epoch. In this context, we provide two distinct contributions. First, we use a Noise Contrastive approach to motivate a family of surrogate loss functions, based on viewing non-optimal solutions as negative examples. Second, we address a major bottleneck of all predic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05354","kind":"arxiv","version":2},"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/2011.05354/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-05T02:55:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7JniVR7FX3v2MQGeKqtcST9Bco5kKc63jHnhGEa0aS3k38Ji16g8K54O1+GPBfrM97kOipdByyAD3uPdeB8lCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:40:55.110655Z"},"content_sha256":"164d28056c0fbeb0d9f0679c257f533b22539d68bb779cc5ab8e52341f4409d1","schema_version":"1.0","event_id":"sha256:164d28056c0fbeb0d9f0679c257f533b22539d68bb779cc5ab8e52341f4409d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTM445TAUS7PN64TAMOA6XI6UK/bundle.json","state_url":"https://pith.science/pith/TTM445TAUS7PN64TAMOA6XI6UK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTM445TAUS7PN64TAMOA6XI6UK/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-08T19:40:55Z","links":{"resolver":"https://pith.science/pith/TTM445TAUS7PN64TAMOA6XI6UK","bundle":"https://pith.science/pith/TTM445TAUS7PN64TAMOA6XI6UK/bundle.json","state":"https://pith.science/pith/TTM445TAUS7PN64TAMOA6XI6UK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTM445TAUS7PN64TAMOA6XI6UK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TTM445TAUS7PN64TAMOA6XI6UK","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":"693ed9e7a5e52dde8fbc2c6ed26da29c8464a0d3b0b52a876c265f1bc9616e9a","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-10T19:09:12Z","title_canon_sha256":"d6e3965057aecd629151f810f264e6aeaa0e85ae81ea6ef9a753e8d90eb4e12b"},"schema_version":"1.0","source":{"id":"2011.05354","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.05354","created_at":"2026-07-05T02:55:08Z"},{"alias_kind":"arxiv_version","alias_value":"2011.05354v2","created_at":"2026-07-05T02:55:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.05354","created_at":"2026-07-05T02:55:08Z"},{"alias_kind":"pith_short_12","alias_value":"TTM445TAUS7P","created_at":"2026-07-05T02:55:08Z"},{"alias_kind":"pith_short_16","alias_value":"TTM445TAUS7PN64T","created_at":"2026-07-05T02:55:08Z"},{"alias_kind":"pith_short_8","alias_value":"TTM445TA","created_at":"2026-07-05T02:55:08Z"}],"graph_snapshots":[{"event_id":"sha256:164d28056c0fbeb0d9f0679c257f533b22539d68bb779cc5ab8e52341f4409d1","target":"graph","created_at":"2026-07-05T02:55:08Z","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/2011.05354/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many decision-making processes involve solving a combinatorial optimization problem with uncertain input that can be estimated from historic data. Recently, problems in this class have been successfully addressed via end-to-end learning approaches, which rely on solving one optimization problem for each training instance at every epoch. In this context, we provide two distinct contributions. First, we use a Noise Contrastive approach to motivate a family of surrogate loss functions, based on viewing non-optimal solutions as negative examples. Second, we address a major bottleneck of all predic","authors_text":"Jayanta Mandi, Maxime Mulamba, Michelangelo Diligenti, Michele Lombardi, Tias Guns, Victor Bucarey","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-10T19:09:12Z","title":"Contrastive Losses and Solution Caching for Predict-and-Optimize"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.05354","kind":"arxiv","version":2},"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:9914ed800490bea168a8f32712b44333e61d20ae90391a90a612714e3f542407","target":"record","created_at":"2026-07-05T02:55:08Z","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":"693ed9e7a5e52dde8fbc2c6ed26da29c8464a0d3b0b52a876c265f1bc9616e9a","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-10T19:09:12Z","title_canon_sha256":"d6e3965057aecd629151f810f264e6aeaa0e85ae81ea6ef9a753e8d90eb4e12b"},"schema_version":"1.0","source":{"id":"2011.05354","kind":"arxiv","version":2}},"canonical_sha256":"9cd9ce7660a4bef6fb93031c0f5d1ea298503c49fc9dd462687b7742cba16eb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cd9ce7660a4bef6fb93031c0f5d1ea298503c49fc9dd462687b7742cba16eb2","first_computed_at":"2026-07-05T02:55:08.644339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:55:08.644339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/CyhZ50XK3N1AZMz0Y2yz3cp/HetFHDIFNInElUG864EYUtidNAM4T9YGWCVpm4J/xka+a1ElJ6v+uKK8wi0Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:55:08.644824Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.05354","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9914ed800490bea168a8f32712b44333e61d20ae90391a90a612714e3f542407","sha256:164d28056c0fbeb0d9f0679c257f533b22539d68bb779cc5ab8e52341f4409d1"],"state_sha256":"737ad72c1de7148d87eabae8c999b4dc4861c90c6d5963b6de536adac7130da9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6d61CLvYiDl2QCC4PIBcBpFHPEas4bREO2ZwuecN1r7178dLuS2rq9p2k2MFdzypG2EzqM8Q++P/WdUOfRyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:40:55.114108Z","bundle_sha256":"a984700b70e8b8328019f6820038ee241b3ecc08d624585f0de49e201ddb7030"}}