{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:LSLI2VGASUTKFBUDUBXROTVMW6","short_pith_number":"pith:LSLI2VGA","canonical_record":{"source":{"id":"2103.04737","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-03-08T13:18:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ef92a97a9d856315e04d50a33135fd905706f9fda0d5f2718178e45f83ebded0","abstract_canon_sha256":"a9637b6fffc67042d34addaf46433e732a51bf82f4090909c3a480bf09b7c57c"},"schema_version":"1.0"},"canonical_sha256":"5c968d54c09526a28683a06f174eacb7bba8b613a5ce362431bb5602aad9b0c9","source":{"kind":"arxiv","id":"2103.04737","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.04737","created_at":"2026-07-05T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"2103.04737v1","created_at":"2026-07-05T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.04737","created_at":"2026-07-05T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"LSLI2VGASUTK","created_at":"2026-07-05T02:21:08Z"},{"alias_kind":"pith_short_16","alias_value":"LSLI2VGASUTKFBUD","created_at":"2026-07-05T02:21:08Z"},{"alias_kind":"pith_short_8","alias_value":"LSLI2VGA","created_at":"2026-07-05T02:21:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:LSLI2VGASUTKFBUDUBXROTVMW6","target":"record","payload":{"canonical_record":{"source":{"id":"2103.04737","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-03-08T13:18:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ef92a97a9d856315e04d50a33135fd905706f9fda0d5f2718178e45f83ebded0","abstract_canon_sha256":"a9637b6fffc67042d34addaf46433e732a51bf82f4090909c3a480bf09b7c57c"},"schema_version":"1.0"},"canonical_sha256":"5c968d54c09526a28683a06f174eacb7bba8b613a5ce362431bb5602aad9b0c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:21:08.929236Z","signature_b64":"C2L4orsY0eEC2BcLw3KnD4dc2Z00BJ1GE7E+hY+tYWu/DQPG//4Y2H5PuXXc/GmOstsBUj7ycHDRQoPngO00DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c968d54c09526a28683a06f174eacb7bba8b613a5ce362431bb5602aad9b0c9","last_reissued_at":"2026-07-05T02:21:08.928719Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:21:08.928719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.04737","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-05T02:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mya0jUQYSvtwYpuESgw9Vwd9RraO7Mryd7X89Gwrn5+W+7t62s1Pwg6VqmkhDF6QqExD9l9r6UnveLMwsidFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T18:07:19.955309Z"},"content_sha256":"73147ba6b169c50fec48a0f2341bb23e6e16a7c0a8ee3ad0cf035f3da5ebec87","schema_version":"1.0","event_id":"sha256:73147ba6b169c50fec48a0f2341bb23e6e16a7c0a8ee3ad0cf035f3da5ebec87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:LSLI2VGASUTKFBUDUBXROTVMW6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Rank Sinkhorn Factorization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Gabriel Peyr\\'e, Marco Cuturi, Meyer Scetbon","submitted_at":"2021-03-08T13:18:45Z","abstract_excerpt":"Several recent applications of optimal transport (OT) theory to machine learning have relied on regularization, notably entropy and the Sinkhorn algorithm. Because matrix-vector products are pervasive in the Sinkhorn algorithm, several works have proposed to \\textit{approximate} kernel matrices appearing in its iterations using low-rank factors. Another route lies instead in imposing low-rank constraints on the feasible set of couplings considered in OT problems, with no approximations on cost nor kernel matrices. This route was first explored by Forrow et al., 2018, who proposed an algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.04737","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/2103.04737/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:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wc/zhoxQ5hPukqKvhMFw8+kFlC0Wh+PTuuczD+gpDbXEPzZUlisDRLqd0zp7EWWLV4zVIvS0q7yjyhNGgcV7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T18:07:19.956247Z"},"content_sha256":"f3a889c19cbfd686b10337a72aa7ec7bde03eada7c9e823e0b9af16c7bca92d6","schema_version":"1.0","event_id":"sha256:f3a889c19cbfd686b10337a72aa7ec7bde03eada7c9e823e0b9af16c7bca92d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSLI2VGASUTKFBUDUBXROTVMW6/bundle.json","state_url":"https://pith.science/pith/LSLI2VGASUTKFBUDUBXROTVMW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSLI2VGASUTKFBUDUBXROTVMW6/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:07:19Z","links":{"resolver":"https://pith.science/pith/LSLI2VGASUTKFBUDUBXROTVMW6","bundle":"https://pith.science/pith/LSLI2VGASUTKFBUDUBXROTVMW6/bundle.json","state":"https://pith.science/pith/LSLI2VGASUTKFBUDUBXROTVMW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSLI2VGASUTKFBUDUBXROTVMW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:LSLI2VGASUTKFBUDUBXROTVMW6","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":"a9637b6fffc67042d34addaf46433e732a51bf82f4090909c3a480bf09b7c57c","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-03-08T13:18:45Z","title_canon_sha256":"ef92a97a9d856315e04d50a33135fd905706f9fda0d5f2718178e45f83ebded0"},"schema_version":"1.0","source":{"id":"2103.04737","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.04737","created_at":"2026-07-05T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"2103.04737v1","created_at":"2026-07-05T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.04737","created_at":"2026-07-05T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"LSLI2VGASUTK","created_at":"2026-07-05T02:21:08Z"},{"alias_kind":"pith_short_16","alias_value":"LSLI2VGASUTKFBUD","created_at":"2026-07-05T02:21:08Z"},{"alias_kind":"pith_short_8","alias_value":"LSLI2VGA","created_at":"2026-07-05T02:21:08Z"}],"graph_snapshots":[{"event_id":"sha256:f3a889c19cbfd686b10337a72aa7ec7bde03eada7c9e823e0b9af16c7bca92d6","target":"graph","created_at":"2026-07-05T02:21:08Z","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/2103.04737/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Several recent applications of optimal transport (OT) theory to machine learning have relied on regularization, notably entropy and the Sinkhorn algorithm. Because matrix-vector products are pervasive in the Sinkhorn algorithm, several works have proposed to \\textit{approximate} kernel matrices appearing in its iterations using low-rank factors. Another route lies instead in imposing low-rank constraints on the feasible set of couplings considered in OT problems, with no approximations on cost nor kernel matrices. This route was first explored by Forrow et al., 2018, who proposed an algorithm ","authors_text":"Gabriel Peyr\\'e, Marco Cuturi, Meyer Scetbon","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-03-08T13:18:45Z","title":"Low-Rank Sinkhorn Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.04737","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:73147ba6b169c50fec48a0f2341bb23e6e16a7c0a8ee3ad0cf035f3da5ebec87","target":"record","created_at":"2026-07-05T02:21:08Z","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":"a9637b6fffc67042d34addaf46433e732a51bf82f4090909c3a480bf09b7c57c","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-03-08T13:18:45Z","title_canon_sha256":"ef92a97a9d856315e04d50a33135fd905706f9fda0d5f2718178e45f83ebded0"},"schema_version":"1.0","source":{"id":"2103.04737","kind":"arxiv","version":1}},"canonical_sha256":"5c968d54c09526a28683a06f174eacb7bba8b613a5ce362431bb5602aad9b0c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c968d54c09526a28683a06f174eacb7bba8b613a5ce362431bb5602aad9b0c9","first_computed_at":"2026-07-05T02:21:08.928719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:21:08.928719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C2L4orsY0eEC2BcLw3KnD4dc2Z00BJ1GE7E+hY+tYWu/DQPG//4Y2H5PuXXc/GmOstsBUj7ycHDRQoPngO00DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:21:08.929236Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.04737","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73147ba6b169c50fec48a0f2341bb23e6e16a7c0a8ee3ad0cf035f3da5ebec87","sha256:f3a889c19cbfd686b10337a72aa7ec7bde03eada7c9e823e0b9af16c7bca92d6"],"state_sha256":"3f5b576b2fb48d3282ef84d3402106fe980bc2ee686e093abbc427c8d454a017"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gLsmUYYUJcGKzd3Xt3IKyUp/4n2ZqLFOuzSyld/j/4J/ZHEEEn4aeemZHJXDuCu2B9CuUTFg23RBwCuY+jA0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T18:07:19.962323Z","bundle_sha256":"51b4c291ed9d2693e452f852036cff653a5060ac967a6ca7f64180d2846dfad2"}}