{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:I4YZRKEYC6R33EENY3XMT7PDZX","short_pith_number":"pith:I4YZRKEY","canonical_record":{"source":{"id":"2111.06546","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-12T03:10:45Z","cross_cats_sorted":[],"title_canon_sha256":"207d03df7828b910bd28dd8bc139e25fb106bc46476f4c0ddcb344661f16bc4c","abstract_canon_sha256":"447798a584aaf4dca99ba298b4805a133ec88c1458e89ba5b0b07324fa7e422a"},"schema_version":"1.0"},"canonical_sha256":"473198a89817a3bd908dc6eec9fde3cdcb7947d933e8491025f2211219544924","source":{"kind":"arxiv","id":"2111.06546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.06546","created_at":"2026-07-05T03:31:05Z"},{"alias_kind":"arxiv_version","alias_value":"2111.06546v1","created_at":"2026-07-05T03:31:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06546","created_at":"2026-07-05T03:31:05Z"},{"alias_kind":"pith_short_12","alias_value":"I4YZRKEYC6R3","created_at":"2026-07-05T03:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"I4YZRKEYC6R33EEN","created_at":"2026-07-05T03:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"I4YZRKEY","created_at":"2026-07-05T03:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:I4YZRKEYC6R33EENY3XMT7PDZX","target":"record","payload":{"canonical_record":{"source":{"id":"2111.06546","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-12T03:10:45Z","cross_cats_sorted":[],"title_canon_sha256":"207d03df7828b910bd28dd8bc139e25fb106bc46476f4c0ddcb344661f16bc4c","abstract_canon_sha256":"447798a584aaf4dca99ba298b4805a133ec88c1458e89ba5b0b07324fa7e422a"},"schema_version":"1.0"},"canonical_sha256":"473198a89817a3bd908dc6eec9fde3cdcb7947d933e8491025f2211219544924","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:31:05.929177Z","signature_b64":"L+5EIFSTEbQN+q5ssmQjagVHKV1IrAhsF5EYN9gq2yRSGW8o3dx1eBnb2jCKjb+H6L2IMUIPXrUQ3YKYOczVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"473198a89817a3bd908dc6eec9fde3cdcb7947d933e8491025f2211219544924","last_reissued_at":"2026-07-05T03:31:05.928689Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:31:05.928689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.06546","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-07-05T03:31:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PSUUcKn0tXfPB/wv6GdK6TnQVj4GEXdmG4+D/Hcm1jWy67Ike0OYPRKJvimyug/+PnDJoxLsc3zUYFiVBgeBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:10:29.555355Z"},"content_sha256":"4e476a40f32b7d12eed271ef13b3a30598a6c614733ec9c6a24ad3393a5ef634","schema_version":"1.0","event_id":"sha256:4e476a40f32b7d12eed271ef13b3a30598a6c614733ec9c6a24ad3393a5ef634"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:I4YZRKEYC6R33EENY3XMT7PDZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Optimal Transport via Low-rank and Sparse Factorization","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chao Zhang, Hui Qian, Nenggan Zheng, Weijie Liu","submitted_at":"2021-11-12T03:10:45Z","abstract_excerpt":"Optimal transport (OT) naturally arises in a wide range of machine learning applications but may often become the computational bottleneck. Recently, one line of works propose to solve OT approximately by searching the \\emph{transport plan} in a low-rank subspace. However, the optimal transport plan is often not low-rank, which tends to yield large approximation errors. For example, when Monge's \\emph{transport map} exists, the transport plan is full rank. This paper concerns the computation of the OT distance with adequate accuracy and efficiency. A novel approximation for OT is proposed, in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06546","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/2111.06546/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-05T03:31:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cmOZVFm54Bb+tzwCaNY8YwMcdJ8FK4+AMet57zdlhk9iSUQfHEa2BbGtwBmPagLHVrD2YaSa3xZGobRuiWQsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T18:10:29.556253Z"},"content_sha256":"ac0d5cea37d5d9a0f63c2922fa6da0ef66f2c4e2247bbc36aa2a143e7da6887b","schema_version":"1.0","event_id":"sha256:ac0d5cea37d5d9a0f63c2922fa6da0ef66f2c4e2247bbc36aa2a143e7da6887b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4YZRKEYC6R33EENY3XMT7PDZX/bundle.json","state_url":"https://pith.science/pith/I4YZRKEYC6R33EENY3XMT7PDZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4YZRKEYC6R33EENY3XMT7PDZX/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-06T18:10:29Z","links":{"resolver":"https://pith.science/pith/I4YZRKEYC6R33EENY3XMT7PDZX","bundle":"https://pith.science/pith/I4YZRKEYC6R33EENY3XMT7PDZX/bundle.json","state":"https://pith.science/pith/I4YZRKEYC6R33EENY3XMT7PDZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4YZRKEYC6R33EENY3XMT7PDZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:I4YZRKEYC6R33EENY3XMT7PDZX","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":"447798a584aaf4dca99ba298b4805a133ec88c1458e89ba5b0b07324fa7e422a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-12T03:10:45Z","title_canon_sha256":"207d03df7828b910bd28dd8bc139e25fb106bc46476f4c0ddcb344661f16bc4c"},"schema_version":"1.0","source":{"id":"2111.06546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.06546","created_at":"2026-07-05T03:31:05Z"},{"alias_kind":"arxiv_version","alias_value":"2111.06546v1","created_at":"2026-07-05T03:31:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06546","created_at":"2026-07-05T03:31:05Z"},{"alias_kind":"pith_short_12","alias_value":"I4YZRKEYC6R3","created_at":"2026-07-05T03:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"I4YZRKEYC6R33EEN","created_at":"2026-07-05T03:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"I4YZRKEY","created_at":"2026-07-05T03:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:ac0d5cea37d5d9a0f63c2922fa6da0ef66f2c4e2247bbc36aa2a143e7da6887b","target":"graph","created_at":"2026-07-05T03:31:05Z","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/2111.06546/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimal transport (OT) naturally arises in a wide range of machine learning applications but may often become the computational bottleneck. Recently, one line of works propose to solve OT approximately by searching the \\emph{transport plan} in a low-rank subspace. However, the optimal transport plan is often not low-rank, which tends to yield large approximation errors. For example, when Monge's \\emph{transport map} exists, the transport plan is full rank. This paper concerns the computation of the OT distance with adequate accuracy and efficiency. A novel approximation for OT is proposed, in ","authors_text":"Chao Zhang, Hui Qian, Nenggan Zheng, Weijie Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-12T03:10:45Z","title":"Approximating Optimal Transport via Low-rank and Sparse Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06546","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:4e476a40f32b7d12eed271ef13b3a30598a6c614733ec9c6a24ad3393a5ef634","target":"record","created_at":"2026-07-05T03:31:05Z","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":"447798a584aaf4dca99ba298b4805a133ec88c1458e89ba5b0b07324fa7e422a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-12T03:10:45Z","title_canon_sha256":"207d03df7828b910bd28dd8bc139e25fb106bc46476f4c0ddcb344661f16bc4c"},"schema_version":"1.0","source":{"id":"2111.06546","kind":"arxiv","version":1}},"canonical_sha256":"473198a89817a3bd908dc6eec9fde3cdcb7947d933e8491025f2211219544924","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"473198a89817a3bd908dc6eec9fde3cdcb7947d933e8491025f2211219544924","first_computed_at":"2026-07-05T03:31:05.928689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:31:05.928689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L+5EIFSTEbQN+q5ssmQjagVHKV1IrAhsF5EYN9gq2yRSGW8o3dx1eBnb2jCKjb+H6L2IMUIPXrUQ3YKYOczVCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:31:05.929177Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.06546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e476a40f32b7d12eed271ef13b3a30598a6c614733ec9c6a24ad3393a5ef634","sha256:ac0d5cea37d5d9a0f63c2922fa6da0ef66f2c4e2247bbc36aa2a143e7da6887b"],"state_sha256":"300f236435e699a53d2cddb17aeafa919745ba6bd17a439810ec6fd6330bb55d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PkJyMNoe2S9ku7OrWYWxg9YVUr+sXJlhvd6BtTUoWEf5E2Pe1HylAXS3/Umk6LNbqHwSlx/HQSkJUDOw1DwhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T18:10:29.562893Z","bundle_sha256":"62bbc4a84161477622a6a7c963557bd1ee8880c1004571b0b06d2b3eeab9d45a"}}