{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JFX7377XIG2EPLOXC6RLHJ6IMW","short_pith_number":"pith:JFX7377X","schema_version":"1.0","canonical_sha256":"496ffdfff741b447add717a2b3a7c86586e47868c79aff69bb2c9e521ae4785c","source":{"kind":"arxiv","id":"2412.11079","version":1},"attestation_state":"computed","paper":{"title":"MAP-UOT: A Memory-Efficient Approach to Unbalanced Optimal Transport Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chengyu Sun, Hong Jiang, Jinyu Hu","submitted_at":"2024-12-15T06:39:25Z","abstract_excerpt":"Unbalanced optimal transport (UOT) has been widely used as a fundamental tool in many application domains, where it often dominates the application running time. While many researchers have proposed various optimizations for UOT, few have attempted to optimize it from a computer architecture's perspective. In this paper, we first study the performance bottlenecks of UOT through a series of experiments, which reveals that UOT is heavily memory-bound. Guided by these findings, we propose MAP-UOT, a Memory-efficient APproach to the implementation and optimization of UOT on CPU and GPU platforms. "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.11079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-12-15T06:39:25Z","cross_cats_sorted":[],"title_canon_sha256":"93813ba0d651e25db3729b346e5de71deb95c2f2875ea508a2a76bbc6927b3c5","abstract_canon_sha256":"425dd16cbdc77f94009de14a4865cde71c0d60effa12be775384aabddd18df16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:49:27.127200Z","signature_b64":"lFoI41pONDK9vLqcSr1e17knMzsyGju0YZp8J22GVPTDjafhtPy9KO7HPM4sYbWEySoJxUlGpqoL9F+tfH5QBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"496ffdfff741b447add717a2b3a7c86586e47868c79aff69bb2c9e521ae4785c","last_reissued_at":"2026-07-05T09:49:27.126637Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:49:27.126637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MAP-UOT: A Memory-Efficient Approach to Unbalanced Optimal Transport Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chengyu Sun, Hong Jiang, Jinyu Hu","submitted_at":"2024-12-15T06:39:25Z","abstract_excerpt":"Unbalanced optimal transport (UOT) has been widely used as a fundamental tool in many application domains, where it often dominates the application running time. While many researchers have proposed various optimizations for UOT, few have attempted to optimize it from a computer architecture's perspective. In this paper, we first study the performance bottlenecks of UOT through a series of experiments, which reveals that UOT is heavily memory-bound. Guided by these findings, we propose MAP-UOT, a Memory-efficient APproach to the implementation and optimization of UOT on CPU and GPU platforms. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.11079","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/2412.11079/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.11079","created_at":"2026-07-05T09:49:27.126706+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.11079v1","created_at":"2026-07-05T09:49:27.126706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.11079","created_at":"2026-07-05T09:49:27.126706+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFX7377XIG2E","created_at":"2026-07-05T09:49:27.126706+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFX7377XIG2EPLOX","created_at":"2026-07-05T09:49:27.126706+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFX7377X","created_at":"2026-07-05T09:49:27.126706+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24786","citing_title":"Counting Trees from Satellite Imagery with Noisy Supervision","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2606.24786","citing_title":"Counting Trees from Satellite Imagery with Noisy Supervision","ref_index":54,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JFX7377XIG2EPLOXC6RLHJ6IMW","json":"https://pith.science/pith/JFX7377XIG2EPLOXC6RLHJ6IMW.json","graph_json":"https://pith.science/api/pith-number/JFX7377XIG2EPLOXC6RLHJ6IMW/graph.json","events_json":"https://pith.science/api/pith-number/JFX7377XIG2EPLOXC6RLHJ6IMW/events.json","paper":"https://pith.science/paper/JFX7377X"},"agent_actions":{"view_html":"https://pith.science/pith/JFX7377XIG2EPLOXC6RLHJ6IMW","download_json":"https://pith.science/pith/JFX7377XIG2EPLOXC6RLHJ6IMW.json","view_paper":"https://pith.science/paper/JFX7377X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.11079&json=true","fetch_graph":"https://pith.science/api/pith-number/JFX7377XIG2EPLOXC6RLHJ6IMW/graph.json","fetch_events":"https://pith.science/api/pith-number/JFX7377XIG2EPLOXC6RLHJ6IMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFX7377XIG2EPLOXC6RLHJ6IMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFX7377XIG2EPLOXC6RLHJ6IMW/action/storage_attestation","attest_author":"https://pith.science/pith/JFX7377XIG2EPLOXC6RLHJ6IMW/action/author_attestation","sign_citation":"https://pith.science/pith/JFX7377XIG2EPLOXC6RLHJ6IMW/action/citation_signature","submit_replication":"https://pith.science/pith/JFX7377XIG2EPLOXC6RLHJ6IMW/action/replication_record"}},"created_at":"2026-07-05T09:49:27.126706+00:00","updated_at":"2026-07-05T09:49:27.126706+00:00"}