{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:3XME2VRRIAETZMWBCX4ELG5RIY","short_pith_number":"pith:3XME2VRR","canonical_record":{"source":{"id":"2006.07260","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-12T15:15:41Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"6858a24095808b4ddef5241cf4f76df76f68611d86e5be6d959be59c1f7c5303","abstract_canon_sha256":"e53acc0a7378ec5b7bbb884460d4b909f78547dc7064bb5387e8929cbf844707"},"schema_version":"1.0"},"canonical_sha256":"ddd84d563140093cb2c115f8459bb146318de1a3664bd2f3aa9771cea89d718d","source":{"kind":"arxiv","id":"2006.07260","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.07260","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"arxiv_version","alias_value":"2006.07260v3","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.07260","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"pith_short_12","alias_value":"3XME2VRRIAET","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"pith_short_16","alias_value":"3XME2VRRIAETZMWB","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"pith_short_8","alias_value":"3XME2VRR","created_at":"2026-07-05T02:18:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:3XME2VRRIAETZMWBCX4ELG5RIY","target":"record","payload":{"canonical_record":{"source":{"id":"2006.07260","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-12T15:15:41Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"6858a24095808b4ddef5241cf4f76df76f68611d86e5be6d959be59c1f7c5303","abstract_canon_sha256":"e53acc0a7378ec5b7bbb884460d4b909f78547dc7064bb5387e8929cbf844707"},"schema_version":"1.0"},"canonical_sha256":"ddd84d563140093cb2c115f8459bb146318de1a3664bd2f3aa9771cea89d718d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:16.139699Z","signature_b64":"k1Q8ivwvPwMLHz12tjyMu7c0o1sbUb1JUnTZD66l0NVtKvL5aAYuMvMhAWU0Xjkzn0jdg2w45yk3qzy3o4mEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddd84d563140093cb2c115f8459bb146318de1a3664bd2f3aa9771cea89d718d","last_reissued_at":"2026-07-05T02:18:16.139212Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:16.139212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.07260","source_version":3,"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:18:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ch7UJdnGhrC6M2u1AwAYWgkYbq0O8eyi3jYTDnFHWuECZbCb8D66BH6G4n7zElgLy5hovOZvEqba8ZHR23+OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T18:15:51.414612Z"},"content_sha256":"4b316ea25ffec5288b428724c43544a2746b0f6074b7538b994b47f1317f8df9","schema_version":"1.0","event_id":"sha256:4b316ea25ffec5288b428724c43544a2746b0f6074b7538b994b47f1317f8df9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:3XME2VRRIAETZMWBCX4ELG5RIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equitable and Optimal Transport with Multiple Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Jamal Atif, Laurent Meunier, Marco Cuturi, Meyer Scetbon","submitted_at":"2020-06-12T15:15:41Z","abstract_excerpt":"We introduce an extension of the Optimal Transport problem when multiple costs are involved. Considering each cost as an agent, we aim to share equally between agents the work of transporting one distribution to another. To do so, we minimize the transportation cost of the agent who works the most. Another point of view is when the goal is to partition equitably goods between agents according to their heterogeneous preferences. Here we aim to maximize the utility of the least advantaged agent. This is a fair division problem. Like Optimal Transport, the problem can be cast as a linear optimiza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.07260","kind":"arxiv","version":3},"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/2006.07260/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:18:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ryfaAhg9nt8B+KYZdMmeoannld9gxbEG9axSxTyLoxUPTKJxW2UYpnEtgYY+LcmT5jN/lvbuf3+OPr0YOYo1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T18:15:51.415531Z"},"content_sha256":"55b81346df788e9107331fb4083bc7f28f4dddb680e7fc8c6e23fb55c073a62c","schema_version":"1.0","event_id":"sha256:55b81346df788e9107331fb4083bc7f28f4dddb680e7fc8c6e23fb55c073a62c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3XME2VRRIAETZMWBCX4ELG5RIY/bundle.json","state_url":"https://pith.science/pith/3XME2VRRIAETZMWBCX4ELG5RIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3XME2VRRIAETZMWBCX4ELG5RIY/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-10T18:15:51Z","links":{"resolver":"https://pith.science/pith/3XME2VRRIAETZMWBCX4ELG5RIY","bundle":"https://pith.science/pith/3XME2VRRIAETZMWBCX4ELG5RIY/bundle.json","state":"https://pith.science/pith/3XME2VRRIAETZMWBCX4ELG5RIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3XME2VRRIAETZMWBCX4ELG5RIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:3XME2VRRIAETZMWBCX4ELG5RIY","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":"e53acc0a7378ec5b7bbb884460d4b909f78547dc7064bb5387e8929cbf844707","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-12T15:15:41Z","title_canon_sha256":"6858a24095808b4ddef5241cf4f76df76f68611d86e5be6d959be59c1f7c5303"},"schema_version":"1.0","source":{"id":"2006.07260","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.07260","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"arxiv_version","alias_value":"2006.07260v3","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.07260","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"pith_short_12","alias_value":"3XME2VRRIAET","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"pith_short_16","alias_value":"3XME2VRRIAETZMWB","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"pith_short_8","alias_value":"3XME2VRR","created_at":"2026-07-05T02:18:16Z"}],"graph_snapshots":[{"event_id":"sha256:55b81346df788e9107331fb4083bc7f28f4dddb680e7fc8c6e23fb55c073a62c","target":"graph","created_at":"2026-07-05T02:18:16Z","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/2006.07260/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce an extension of the Optimal Transport problem when multiple costs are involved. Considering each cost as an agent, we aim to share equally between agents the work of transporting one distribution to another. To do so, we minimize the transportation cost of the agent who works the most. Another point of view is when the goal is to partition equitably goods between agents according to their heterogeneous preferences. Here we aim to maximize the utility of the least advantaged agent. This is a fair division problem. Like Optimal Transport, the problem can be cast as a linear optimiza","authors_text":"Jamal Atif, Laurent Meunier, Marco Cuturi, Meyer Scetbon","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-12T15:15:41Z","title":"Equitable and Optimal Transport with Multiple Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.07260","kind":"arxiv","version":3},"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:4b316ea25ffec5288b428724c43544a2746b0f6074b7538b994b47f1317f8df9","target":"record","created_at":"2026-07-05T02:18:16Z","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":"e53acc0a7378ec5b7bbb884460d4b909f78547dc7064bb5387e8929cbf844707","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-12T15:15:41Z","title_canon_sha256":"6858a24095808b4ddef5241cf4f76df76f68611d86e5be6d959be59c1f7c5303"},"schema_version":"1.0","source":{"id":"2006.07260","kind":"arxiv","version":3}},"canonical_sha256":"ddd84d563140093cb2c115f8459bb146318de1a3664bd2f3aa9771cea89d718d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddd84d563140093cb2c115f8459bb146318de1a3664bd2f3aa9771cea89d718d","first_computed_at":"2026-07-05T02:18:16.139212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:18:16.139212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k1Q8ivwvPwMLHz12tjyMu7c0o1sbUb1JUnTZD66l0NVtKvL5aAYuMvMhAWU0Xjkzn0jdg2w45yk3qzy3o4mEBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:18:16.139699Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.07260","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b316ea25ffec5288b428724c43544a2746b0f6074b7538b994b47f1317f8df9","sha256:55b81346df788e9107331fb4083bc7f28f4dddb680e7fc8c6e23fb55c073a62c"],"state_sha256":"7b83149a07648cace7cc7f04c117be4d643ccabebd7143c9f77082c3de24b397"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TTgaBC9dVX/JaWvC1XfbJv3MzgjgenNCKNVHF4tnMNtE2AbCAKjLseE7lsUxwIb2Q8TnY979w7vkHrHK0OYfAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T18:15:51.422016Z","bundle_sha256":"1c1944fb7808b0475c88d1f9f105f18256ba0e6cd39914ff499f990100eaa50f"}}