{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OHZHY4TPZ2QDTDIRRXGIJB4FHA","short_pith_number":"pith:OHZHY4TP","canonical_record":{"source":{"id":"1904.04318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-08T19:32:55Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9555b3627461271f5f290610ec74bd8bb849b0f0aba37458b62909dff1370833","abstract_canon_sha256":"c3688c98880d2c81f5900856227ad2a0d9452126f949aac3783be274986c93b9"},"schema_version":"1.0"},"canonical_sha256":"71f27c726fcea0398d118dcc848785383eadfeb5b482ca073573ccea2c064f9d","source":{"kind":"arxiv","id":"1904.04318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04318","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04318v1","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04318","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"OHZHY4TPZ2QD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OHZHY4TPZ2QDTDIR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OHZHY4TP","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OHZHY4TPZ2QDTDIRRXGIJB4FHA","target":"record","payload":{"canonical_record":{"source":{"id":"1904.04318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-08T19:32:55Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9555b3627461271f5f290610ec74bd8bb849b0f0aba37458b62909dff1370833","abstract_canon_sha256":"c3688c98880d2c81f5900856227ad2a0d9452126f949aac3783be274986c93b9"},"schema_version":"1.0"},"canonical_sha256":"71f27c726fcea0398d118dcc848785383eadfeb5b482ca073573ccea2c064f9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:59.311346Z","signature_b64":"eetaDQrmQ2+HBrL+sSmSgH4BMuvDqHi2fAjaS9D0Z9+HPeBxe11zFqB9MGZZ01+qD3KH2SSken7lf/F2G02mBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71f27c726fcea0398d118dcc848785383eadfeb5b482ca073573ccea2c064f9d","last_reissued_at":"2026-05-17T23:48:59.310947Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:59.310947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.04318","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-05-17T23:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WPTYwusA9HziBUCM7c00WcAzmrneIvwAiVrjP9WGwCWa/N76Zp5AOj0YbS32yNSHcaKHKDMcqrWIej+lKAceCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:32:34.022442Z"},"content_sha256":"5c54551697cc10023baa22cf123ef28d416c6ded4b6bed91916011f2a6d9eb63","schema_version":"1.0","event_id":"sha256:5c54551697cc10023baa22cf123ef28d416c6ded4b6bed91916011f2a6d9eb63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OHZHY4TPZ2QDTDIRRXGIJB4FHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consensus-based Distributed Discrete Optimal Transport for Decentralized Resource Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Quanyan Zhu, Rui Zhang","submitted_at":"2019-04-08T19:32:55Z","abstract_excerpt":"Optimal transport has been used extensively in resource matching to promote the efficiency of resources usages by matching sources to targets. However, it requires a significant amount of computations and storage spaces for large-scale problems. In this paper, we take a consensus-based approach to decentralize discrete optimal transport problems and develop fully distributed algorithms with alternating direction method of multipliers. We show that our algorithms guarantee certain levels of efficiency and privacy besides the distributed nature. We further derive primal and dual algorithms by ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04318","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":""},"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-05-17T23:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gF5RZWc32fvDrTnpITxvzc+wpt51GABXD5zuq/8wtGF8BT7Ni+idgnznZJ7i1qT8i/ScR7XgDxluWpLwG4jUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:32:34.022812Z"},"content_sha256":"da337bba016846e989d50821d5ffba6df8629eebf3e00088621ef937743ebe88","schema_version":"1.0","event_id":"sha256:da337bba016846e989d50821d5ffba6df8629eebf3e00088621ef937743ebe88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OHZHY4TPZ2QDTDIRRXGIJB4FHA/bundle.json","state_url":"https://pith.science/pith/OHZHY4TPZ2QDTDIRRXGIJB4FHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OHZHY4TPZ2QDTDIRRXGIJB4FHA/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-05-28T14:32:34Z","links":{"resolver":"https://pith.science/pith/OHZHY4TPZ2QDTDIRRXGIJB4FHA","bundle":"https://pith.science/pith/OHZHY4TPZ2QDTDIRRXGIJB4FHA/bundle.json","state":"https://pith.science/pith/OHZHY4TPZ2QDTDIRRXGIJB4FHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OHZHY4TPZ2QDTDIRRXGIJB4FHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OHZHY4TPZ2QDTDIRRXGIJB4FHA","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":"c3688c98880d2c81f5900856227ad2a0d9452126f949aac3783be274986c93b9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-08T19:32:55Z","title_canon_sha256":"9555b3627461271f5f290610ec74bd8bb849b0f0aba37458b62909dff1370833"},"schema_version":"1.0","source":{"id":"1904.04318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04318","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04318v1","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04318","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"OHZHY4TPZ2QD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OHZHY4TPZ2QDTDIR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OHZHY4TP","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:da337bba016846e989d50821d5ffba6df8629eebf3e00088621ef937743ebe88","target":"graph","created_at":"2026-05-17T23:48:59Z","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"},"paper":{"abstract_excerpt":"Optimal transport has been used extensively in resource matching to promote the efficiency of resources usages by matching sources to targets. However, it requires a significant amount of computations and storage spaces for large-scale problems. In this paper, we take a consensus-based approach to decentralize discrete optimal transport problems and develop fully distributed algorithms with alternating direction method of multipliers. We show that our algorithms guarantee certain levels of efficiency and privacy besides the distributed nature. We further derive primal and dual algorithms by ex","authors_text":"Quanyan Zhu, Rui Zhang","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-08T19:32:55Z","title":"Consensus-based Distributed Discrete Optimal Transport for Decentralized Resource Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04318","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:5c54551697cc10023baa22cf123ef28d416c6ded4b6bed91916011f2a6d9eb63","target":"record","created_at":"2026-05-17T23:48:59Z","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":"c3688c98880d2c81f5900856227ad2a0d9452126f949aac3783be274986c93b9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-08T19:32:55Z","title_canon_sha256":"9555b3627461271f5f290610ec74bd8bb849b0f0aba37458b62909dff1370833"},"schema_version":"1.0","source":{"id":"1904.04318","kind":"arxiv","version":1}},"canonical_sha256":"71f27c726fcea0398d118dcc848785383eadfeb5b482ca073573ccea2c064f9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71f27c726fcea0398d118dcc848785383eadfeb5b482ca073573ccea2c064f9d","first_computed_at":"2026-05-17T23:48:59.310947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:59.310947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eetaDQrmQ2+HBrL+sSmSgH4BMuvDqHi2fAjaS9D0Z9+HPeBxe11zFqB9MGZZ01+qD3KH2SSken7lf/F2G02mBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:59.311346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c54551697cc10023baa22cf123ef28d416c6ded4b6bed91916011f2a6d9eb63","sha256:da337bba016846e989d50821d5ffba6df8629eebf3e00088621ef937743ebe88"],"state_sha256":"2b7917cf52599a052eba2a73413cebbc5878b943aa61546a86d7631e1db0ce51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e2aKa8sFIO2BlMrPp2L+yRSyBHLR00sKhsFGwTyPJYVgXtAuplXE0Jk9OAZ3MukQMMsmRpHDvOJpQUYFnBBsBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:32:34.025303Z","bundle_sha256":"f7a3d278608f26294d50f507755efc3cd1b9eb9331a1a3beeb11d33d223a8c15"}}