{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:YRTFL5UFU4OLHKGDEWV4UKK5BS","short_pith_number":"pith:YRTFL5UF","canonical_record":{"source":{"id":"2107.06876","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-14T17:40:08Z","cross_cats_sorted":["cs.CL","cs.DS","cs.SI","stat.ML"],"title_canon_sha256":"93cfb0fcc5ac0bc2be8e16604ee44110bbf906baa02c9e2d5f8d62d787fffb5e","abstract_canon_sha256":"fdc810e3a734c6809cb34d84d9505ee95b946e75c77a2e4248fc207a72289336"},"schema_version":"1.0"},"canonical_sha256":"c46655f685a71cb3a8c325abca295d0c868c95e400b6f1d0fbcd9fae96c37680","source":{"kind":"arxiv","id":"2107.06876","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06876","created_at":"2026-07-05T04:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06876v2","created_at":"2026-07-05T04:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06876","created_at":"2026-07-05T04:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"YRTFL5UFU4OL","created_at":"2026-07-05T04:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"YRTFL5UFU4OLHKGD","created_at":"2026-07-05T04:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"YRTFL5UF","created_at":"2026-07-05T04:11:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:YRTFL5UFU4OLHKGDEWV4UKK5BS","target":"record","payload":{"canonical_record":{"source":{"id":"2107.06876","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-14T17:40:08Z","cross_cats_sorted":["cs.CL","cs.DS","cs.SI","stat.ML"],"title_canon_sha256":"93cfb0fcc5ac0bc2be8e16604ee44110bbf906baa02c9e2d5f8d62d787fffb5e","abstract_canon_sha256":"fdc810e3a734c6809cb34d84d9505ee95b946e75c77a2e4248fc207a72289336"},"schema_version":"1.0"},"canonical_sha256":"c46655f685a71cb3a8c325abca295d0c868c95e400b6f1d0fbcd9fae96c37680","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:11:25.285843Z","signature_b64":"g2oSaA4i0iYHOcv0gdGoLlAcsomOl8oQ6wDxLdoZaaYJUgPkx+q6zObP+XPZ0Ffm/dFXZKMMWi+7wRGnHWs3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c46655f685a71cb3a8c325abca295d0c868c95e400b6f1d0fbcd9fae96c37680","last_reissued_at":"2026-07-05T04:11:25.285429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:11:25.285429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.06876","source_version":2,"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-05T04:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oG6y6d6Hhb6efzoyHNk2rrJUAFkkOxXnybKbxRjnWTv4wldnxGp6MsRQGTXlHCHkK2fqYWvYoQVCqYOIEvkyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T21:13:39.403585Z"},"content_sha256":"f41f936218198730969740d310cd8db76081ef64dcd2879d5093dfee506d8e58","schema_version":"1.0","event_id":"sha256:f41f936218198730969740d310cd8db76081ef64dcd2879d5093dfee506d8e58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:YRTFL5UFU4OLHKGDEWV4UKK5BS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, and More","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.DS","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Johannes Gasteiger, Marten Lienen, Stephan G\\\"unnemann","submitted_at":"2021-07-14T17:40:08Z","abstract_excerpt":"The current best practice for computing optimal transport (OT) is via entropy regularization and Sinkhorn iterations. This algorithm runs in quadratic time as it requires the full pairwise cost matrix, which is prohibitively expensive for large sets of objects. In this work we propose two effective log-linear time approximations of the cost matrix: First, a sparse approximation based on locality-sensitive hashing (LSH) and, second, a Nystr\\\"om approximation with LSH-based sparse corrections, which we call locally corrected Nystr\\\"om (LCN). These approximations enable general log-linear time al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06876","kind":"arxiv","version":2},"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/2107.06876/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-05T04:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+HOPXYlbAwziXuYWejX5bzBkJQ4f2rc/zMaSWIWWZH7z5YqhK3kP+Quv0zN0c9qFkCDz6UbzdiwTSr1FQmDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T21:13:39.404523Z"},"content_sha256":"d71d6e0b13d765cdd50398f18b9465b23e1132de981063db094f17648544564f","schema_version":"1.0","event_id":"sha256:d71d6e0b13d765cdd50398f18b9465b23e1132de981063db094f17648544564f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YRTFL5UFU4OLHKGDEWV4UKK5BS/bundle.json","state_url":"https://pith.science/pith/YRTFL5UFU4OLHKGDEWV4UKK5BS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YRTFL5UFU4OLHKGDEWV4UKK5BS/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-17T21:13:39Z","links":{"resolver":"https://pith.science/pith/YRTFL5UFU4OLHKGDEWV4UKK5BS","bundle":"https://pith.science/pith/YRTFL5UFU4OLHKGDEWV4UKK5BS/bundle.json","state":"https://pith.science/pith/YRTFL5UFU4OLHKGDEWV4UKK5BS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YRTFL5UFU4OLHKGDEWV4UKK5BS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:YRTFL5UFU4OLHKGDEWV4UKK5BS","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":"fdc810e3a734c6809cb34d84d9505ee95b946e75c77a2e4248fc207a72289336","cross_cats_sorted":["cs.CL","cs.DS","cs.SI","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-14T17:40:08Z","title_canon_sha256":"93cfb0fcc5ac0bc2be8e16604ee44110bbf906baa02c9e2d5f8d62d787fffb5e"},"schema_version":"1.0","source":{"id":"2107.06876","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.06876","created_at":"2026-07-05T04:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"2107.06876v2","created_at":"2026-07-05T04:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06876","created_at":"2026-07-05T04:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"YRTFL5UFU4OL","created_at":"2026-07-05T04:11:25Z"},{"alias_kind":"pith_short_16","alias_value":"YRTFL5UFU4OLHKGD","created_at":"2026-07-05T04:11:25Z"},{"alias_kind":"pith_short_8","alias_value":"YRTFL5UF","created_at":"2026-07-05T04:11:25Z"}],"graph_snapshots":[{"event_id":"sha256:d71d6e0b13d765cdd50398f18b9465b23e1132de981063db094f17648544564f","target":"graph","created_at":"2026-07-05T04:11:25Z","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/2107.06876/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The current best practice for computing optimal transport (OT) is via entropy regularization and Sinkhorn iterations. This algorithm runs in quadratic time as it requires the full pairwise cost matrix, which is prohibitively expensive for large sets of objects. In this work we propose two effective log-linear time approximations of the cost matrix: First, a sparse approximation based on locality-sensitive hashing (LSH) and, second, a Nystr\\\"om approximation with LSH-based sparse corrections, which we call locally corrected Nystr\\\"om (LCN). These approximations enable general log-linear time al","authors_text":"Johannes Gasteiger, Marten Lienen, Stephan G\\\"unnemann","cross_cats":["cs.CL","cs.DS","cs.SI","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-14T17:40:08Z","title":"Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, and More"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06876","kind":"arxiv","version":2},"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:f41f936218198730969740d310cd8db76081ef64dcd2879d5093dfee506d8e58","target":"record","created_at":"2026-07-05T04:11:25Z","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":"fdc810e3a734c6809cb34d84d9505ee95b946e75c77a2e4248fc207a72289336","cross_cats_sorted":["cs.CL","cs.DS","cs.SI","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-07-14T17:40:08Z","title_canon_sha256":"93cfb0fcc5ac0bc2be8e16604ee44110bbf906baa02c9e2d5f8d62d787fffb5e"},"schema_version":"1.0","source":{"id":"2107.06876","kind":"arxiv","version":2}},"canonical_sha256":"c46655f685a71cb3a8c325abca295d0c868c95e400b6f1d0fbcd9fae96c37680","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c46655f685a71cb3a8c325abca295d0c868c95e400b6f1d0fbcd9fae96c37680","first_computed_at":"2026-07-05T04:11:25.285429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:11:25.285429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g2oSaA4i0iYHOcv0gdGoLlAcsomOl8oQ6wDxLdoZaaYJUgPkx+q6zObP+XPZ0Ffm/dFXZKMMWi+7wRGnHWs3Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:11:25.285843Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.06876","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f41f936218198730969740d310cd8db76081ef64dcd2879d5093dfee506d8e58","sha256:d71d6e0b13d765cdd50398f18b9465b23e1132de981063db094f17648544564f"],"state_sha256":"e2cce303fc8e77a557f1bd45f1dc92bf5dd21e782b4b5c899df93ce0f303d4da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQcuYxqWZau5P4Vp21C9PliIJHwuIiSmftvRn9FHe19DHjuFoUT5zpBm6ztxBSEeJ6TnMxMaSxbYWejtvSe3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T21:13:39.410343Z","bundle_sha256":"ce24190f69a55a3863cc2804883f2c44b11881db1ac100b6eedd4704f8d73343"}}