{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HL4YGK7IQBRUE7PQSJUW53ZWPV","short_pith_number":"pith:HL4YGK7I","canonical_record":{"source":{"id":"1905.11885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T15:28:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c762dbce7c18fc5664f9027e5adbedf7c4d23d42bd89b1b931358d46977e91a7","abstract_canon_sha256":"32ca58543edfc8e77cd92586da4e308d195134bdbd6cca0aebd28c262ad28ce0"},"schema_version":"1.0"},"canonical_sha256":"3af9832be88063427df092696eef367d4d90f1e40cc1dd096d96b95d5b1b2198","source":{"kind":"arxiv","id":"1905.11885","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11885","created_at":"2026-07-05T00:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11885v2","created_at":"2026-07-05T00:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11885","created_at":"2026-07-05T00:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"HL4YGK7IQBRU","created_at":"2026-07-05T00:16:34Z"},{"alias_kind":"pith_short_16","alias_value":"HL4YGK7IQBRUE7PQ","created_at":"2026-07-05T00:16:34Z"},{"alias_kind":"pith_short_8","alias_value":"HL4YGK7I","created_at":"2026-07-05T00:16:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HL4YGK7IQBRUE7PQSJUW53ZWPV","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11885","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T15:28:07Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c762dbce7c18fc5664f9027e5adbedf7c4d23d42bd89b1b931358d46977e91a7","abstract_canon_sha256":"32ca58543edfc8e77cd92586da4e308d195134bdbd6cca0aebd28c262ad28ce0"},"schema_version":"1.0"},"canonical_sha256":"3af9832be88063427df092696eef367d4d90f1e40cc1dd096d96b95d5b1b2198","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:34.686393Z","signature_b64":"SngS4lgvBuDtYUk6nMvhiSJgqRJGtZvWkZUblMKAxs4zqk9hgeLEIGsA85PRO0FnAucIUAvV0angL4490h4RBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3af9832be88063427df092696eef367d4d90f1e40cc1dd096d96b95d5b1b2198","last_reissued_at":"2026-07-05T00:16:34.685991Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:34.685991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11885","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-05T00:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQia+vWPRovUhJ3WPzD07sXeVqX6xtoOVASk4ueJfjXudDhePRIqZLDR+L6pjBZCHP6+OvvKi0KA+wpVqzC0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:36:53.406268Z"},"content_sha256":"b7be97028e82324fed26248aa3a9095b218f4a05ab23957a11a5f03fd170a32a","schema_version":"1.0","event_id":"sha256:b7be97028e82324fed26248aa3a9095b218f4a05ab23957a11a5f03fd170a32a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HL4YGK7IQBRUE7PQSJUW53ZWPV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentiable Ranks and Sorting using Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jean-Philippe Vert, Marco Cuturi, Olivier Teboul","submitted_at":"2019-05-28T15:28:07Z","abstract_excerpt":"Sorting an array is a fundamental routine in machine learning, one that is used to compute rank-based statistics, cumulative distribution functions (CDFs), quantiles, or to select closest neighbors and labels. The sorting function is however piece-wise constant (the sorting permutation of a vector does not change if the entries of that vector are infinitesimally perturbed) and therefore has no gradient information to back-propagate. We propose a framework to sort elements that is algorithmically differentiable. We leverage the fact that sorting can be seen as a particular instance of the optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11885","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/1905.11885/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-05T00:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GmISH4VLrQUt4adepsGSzO9Zeno95kX1EVTPncKlGIi5W1ov5WJJgt3adBwZqmo7ysONOBAcEOIazswRLymFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:36:53.406643Z"},"content_sha256":"ea28cd603dffc87d170db024fc8470e4b17e198a9a3ecfb4427ae954fa38fdda","schema_version":"1.0","event_id":"sha256:ea28cd603dffc87d170db024fc8470e4b17e198a9a3ecfb4427ae954fa38fdda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HL4YGK7IQBRUE7PQSJUW53ZWPV/bundle.json","state_url":"https://pith.science/pith/HL4YGK7IQBRUE7PQSJUW53ZWPV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HL4YGK7IQBRUE7PQSJUW53ZWPV/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-19T08:36:53Z","links":{"resolver":"https://pith.science/pith/HL4YGK7IQBRUE7PQSJUW53ZWPV","bundle":"https://pith.science/pith/HL4YGK7IQBRUE7PQSJUW53ZWPV/bundle.json","state":"https://pith.science/pith/HL4YGK7IQBRUE7PQSJUW53ZWPV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HL4YGK7IQBRUE7PQSJUW53ZWPV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HL4YGK7IQBRUE7PQSJUW53ZWPV","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":"32ca58543edfc8e77cd92586da4e308d195134bdbd6cca0aebd28c262ad28ce0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T15:28:07Z","title_canon_sha256":"c762dbce7c18fc5664f9027e5adbedf7c4d23d42bd89b1b931358d46977e91a7"},"schema_version":"1.0","source":{"id":"1905.11885","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11885","created_at":"2026-07-05T00:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11885v2","created_at":"2026-07-05T00:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11885","created_at":"2026-07-05T00:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"HL4YGK7IQBRU","created_at":"2026-07-05T00:16:34Z"},{"alias_kind":"pith_short_16","alias_value":"HL4YGK7IQBRUE7PQ","created_at":"2026-07-05T00:16:34Z"},{"alias_kind":"pith_short_8","alias_value":"HL4YGK7I","created_at":"2026-07-05T00:16:34Z"}],"graph_snapshots":[{"event_id":"sha256:ea28cd603dffc87d170db024fc8470e4b17e198a9a3ecfb4427ae954fa38fdda","target":"graph","created_at":"2026-07-05T00:16:34Z","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/1905.11885/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sorting an array is a fundamental routine in machine learning, one that is used to compute rank-based statistics, cumulative distribution functions (CDFs), quantiles, or to select closest neighbors and labels. The sorting function is however piece-wise constant (the sorting permutation of a vector does not change if the entries of that vector are infinitesimally perturbed) and therefore has no gradient information to back-propagate. We propose a framework to sort elements that is algorithmically differentiable. We leverage the fact that sorting can be seen as a particular instance of the optim","authors_text":"Jean-Philippe Vert, Marco Cuturi, Olivier Teboul","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T15:28:07Z","title":"Differentiable Ranks and Sorting using Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11885","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:b7be97028e82324fed26248aa3a9095b218f4a05ab23957a11a5f03fd170a32a","target":"record","created_at":"2026-07-05T00:16:34Z","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":"32ca58543edfc8e77cd92586da4e308d195134bdbd6cca0aebd28c262ad28ce0","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T15:28:07Z","title_canon_sha256":"c762dbce7c18fc5664f9027e5adbedf7c4d23d42bd89b1b931358d46977e91a7"},"schema_version":"1.0","source":{"id":"1905.11885","kind":"arxiv","version":2}},"canonical_sha256":"3af9832be88063427df092696eef367d4d90f1e40cc1dd096d96b95d5b1b2198","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3af9832be88063427df092696eef367d4d90f1e40cc1dd096d96b95d5b1b2198","first_computed_at":"2026-07-05T00:16:34.685991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:16:34.685991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SngS4lgvBuDtYUk6nMvhiSJgqRJGtZvWkZUblMKAxs4zqk9hgeLEIGsA85PRO0FnAucIUAvV0angL4490h4RBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:16:34.686393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11885","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7be97028e82324fed26248aa3a9095b218f4a05ab23957a11a5f03fd170a32a","sha256:ea28cd603dffc87d170db024fc8470e4b17e198a9a3ecfb4427ae954fa38fdda"],"state_sha256":"08c3fdf3fb1faf767fcf83ba4397f617f0ac1bd812cc9f38e606dd80fc4633fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vO+pXW9A+WXNBmkVuklAOHUdsPqjp43k6qFEUKsTX9770DnYAMBZKGmMOziiE1tqiq/tE8zXm3gq5b3AwWn7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T08:36:53.409159Z","bundle_sha256":"8fdbf586417a7eb2ff4765f1a7f1246f7ee99352c6ce5a8b0cb553112524a4e9"}}