{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:U5SHKQL6XZWQ2F62BDRKWYWWFG","short_pith_number":"pith:U5SHKQL6","canonical_record":{"source":{"id":"2503.03025","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-04T22:00:12Z","cross_cats_sorted":[],"title_canon_sha256":"eb149f67010c23003d773c42f19c36ad0d75c9f6effbb5c85dc8cd759a5361fe","abstract_canon_sha256":"98dcec8340aa125ec94ff33e7856f4959397d37b553ebc0c3d1e8e17fb0e0077"},"schema_version":"1.0"},"canonical_sha256":"a76475417ebe6d0d17da08e2ab62d6299db7e5de9d5c8c30b240a4d75a089bd1","source":{"kind":"arxiv","id":"2503.03025","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.03025","created_at":"2026-07-05T11:54:44Z"},{"alias_kind":"arxiv_version","alias_value":"2503.03025v3","created_at":"2026-07-05T11:54:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.03025","created_at":"2026-07-05T11:54:44Z"},{"alias_kind":"pith_short_12","alias_value":"U5SHKQL6XZWQ","created_at":"2026-07-05T11:54:44Z"},{"alias_kind":"pith_short_16","alias_value":"U5SHKQL6XZWQ2F62","created_at":"2026-07-05T11:54:44Z"},{"alias_kind":"pith_short_8","alias_value":"U5SHKQL6","created_at":"2026-07-05T11:54:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:U5SHKQL6XZWQ2F62BDRKWYWWFG","target":"record","payload":{"canonical_record":{"source":{"id":"2503.03025","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-04T22:00:12Z","cross_cats_sorted":[],"title_canon_sha256":"eb149f67010c23003d773c42f19c36ad0d75c9f6effbb5c85dc8cd759a5361fe","abstract_canon_sha256":"98dcec8340aa125ec94ff33e7856f4959397d37b553ebc0c3d1e8e17fb0e0077"},"schema_version":"1.0"},"canonical_sha256":"a76475417ebe6d0d17da08e2ab62d6299db7e5de9d5c8c30b240a4d75a089bd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:44.815636Z","signature_b64":"9odhTo8f1gKCkNTjizewjKBTotr3ycb39comTDlIBRmbYBIDyHTt1IMzaHWJTFvZza42lrheUZoaSnqDuUo3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a76475417ebe6d0d17da08e2ab62d6299db7e5de9d5c8c30b240a4d75a089bd1","last_reissued_at":"2026-07-05T11:54:44.815174Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:44.815174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.03025","source_version":3,"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-05T11:54:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5U1tVDw1lnYvRukSkmAuUiNUEV9pnS5253oV+9AXtMJbaoVd0LcOXsGrKlZ1gB+/5giObr8MX8YrEzSXjx5PCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:01:16.275055Z"},"content_sha256":"ba0f4d1a804f96407e0b7c40e1162d316d0924f5faa67112fa4d629f3cb201b5","schema_version":"1.0","event_id":"sha256:ba0f4d1a804f96407e0b7c40e1162d316d0924f5faa67112fa4d629f3cb201b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:U5SHKQL6XZWQ2F62BDRKWYWWFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Refinement: Optimal Transport to Infinity and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Benjamin J. Raphael, Julian Gold, Peter Halmos, Xinhao Liu","submitted_at":"2025-03-04T22:00:12Z","abstract_excerpt":"Optimal transport (OT) has enjoyed great success in machine learning as a principled way to align datasets via a least-cost correspondence, driven in large part by the runtime efficiency of the Sinkhorn algorithm (Cuturi, 2013). However, Sinkhorn has quadratic space and time complexity in the number of points, limiting scalability to larger datasets. Low-rank OT achieves linear complexity, but by definition, cannot compute a one-to-one correspondence between points. When the optimal transport problem is an assignment problem between datasets then an optimal mapping, known as the Monge map, is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.03025","kind":"arxiv","version":3},"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/2503.03025/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-05T11:54:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Hqgbb2cNTtQ0x7QiY9zD8zR+lqrGfHLlsw1DOALtrIRXoOYcN6vH11hPGfvloRB8ztvgGTrXsTBkXZCNEBwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:01:16.275446Z"},"content_sha256":"c8a143e7742f4f8c89210d04f5170527cb54eb26389f927ce031ae368357b9b5","schema_version":"1.0","event_id":"sha256:c8a143e7742f4f8c89210d04f5170527cb54eb26389f927ce031ae368357b9b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U5SHKQL6XZWQ2F62BDRKWYWWFG/bundle.json","state_url":"https://pith.science/pith/U5SHKQL6XZWQ2F62BDRKWYWWFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U5SHKQL6XZWQ2F62BDRKWYWWFG/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-07-07T08:01:16Z","links":{"resolver":"https://pith.science/pith/U5SHKQL6XZWQ2F62BDRKWYWWFG","bundle":"https://pith.science/pith/U5SHKQL6XZWQ2F62BDRKWYWWFG/bundle.json","state":"https://pith.science/pith/U5SHKQL6XZWQ2F62BDRKWYWWFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U5SHKQL6XZWQ2F62BDRKWYWWFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:U5SHKQL6XZWQ2F62BDRKWYWWFG","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":"98dcec8340aa125ec94ff33e7856f4959397d37b553ebc0c3d1e8e17fb0e0077","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-04T22:00:12Z","title_canon_sha256":"eb149f67010c23003d773c42f19c36ad0d75c9f6effbb5c85dc8cd759a5361fe"},"schema_version":"1.0","source":{"id":"2503.03025","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.03025","created_at":"2026-07-05T11:54:44Z"},{"alias_kind":"arxiv_version","alias_value":"2503.03025v3","created_at":"2026-07-05T11:54:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.03025","created_at":"2026-07-05T11:54:44Z"},{"alias_kind":"pith_short_12","alias_value":"U5SHKQL6XZWQ","created_at":"2026-07-05T11:54:44Z"},{"alias_kind":"pith_short_16","alias_value":"U5SHKQL6XZWQ2F62","created_at":"2026-07-05T11:54:44Z"},{"alias_kind":"pith_short_8","alias_value":"U5SHKQL6","created_at":"2026-07-05T11:54:44Z"}],"graph_snapshots":[{"event_id":"sha256:c8a143e7742f4f8c89210d04f5170527cb54eb26389f927ce031ae368357b9b5","target":"graph","created_at":"2026-07-05T11:54:44Z","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/2503.03025/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimal transport (OT) has enjoyed great success in machine learning as a principled way to align datasets via a least-cost correspondence, driven in large part by the runtime efficiency of the Sinkhorn algorithm (Cuturi, 2013). However, Sinkhorn has quadratic space and time complexity in the number of points, limiting scalability to larger datasets. Low-rank OT achieves linear complexity, but by definition, cannot compute a one-to-one correspondence between points. When the optimal transport problem is an assignment problem between datasets then an optimal mapping, known as the Monge map, is ","authors_text":"Benjamin J. Raphael, Julian Gold, Peter Halmos, Xinhao Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-04T22:00:12Z","title":"Hierarchical Refinement: Optimal Transport to Infinity and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.03025","kind":"arxiv","version":3},"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:ba0f4d1a804f96407e0b7c40e1162d316d0924f5faa67112fa4d629f3cb201b5","target":"record","created_at":"2026-07-05T11:54:44Z","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":"98dcec8340aa125ec94ff33e7856f4959397d37b553ebc0c3d1e8e17fb0e0077","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-04T22:00:12Z","title_canon_sha256":"eb149f67010c23003d773c42f19c36ad0d75c9f6effbb5c85dc8cd759a5361fe"},"schema_version":"1.0","source":{"id":"2503.03025","kind":"arxiv","version":3}},"canonical_sha256":"a76475417ebe6d0d17da08e2ab62d6299db7e5de9d5c8c30b240a4d75a089bd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a76475417ebe6d0d17da08e2ab62d6299db7e5de9d5c8c30b240a4d75a089bd1","first_computed_at":"2026-07-05T11:54:44.815174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:54:44.815174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9odhTo8f1gKCkNTjizewjKBTotr3ycb39comTDlIBRmbYBIDyHTt1IMzaHWJTFvZza42lrheUZoaSnqDuUo3DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:54:44.815636Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.03025","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba0f4d1a804f96407e0b7c40e1162d316d0924f5faa67112fa4d629f3cb201b5","sha256:c8a143e7742f4f8c89210d04f5170527cb54eb26389f927ce031ae368357b9b5"],"state_sha256":"42857b5b89540377c6ff9eccc4157a21e916878e30967a0d74701e8345b3c60f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5jvkKHAyOm28nwdYiYXloeEeK68NPSZLCFxY1K0tc7XhVDkDM+JOYDhPhq1VxxHeOTfdCKBjFIOXE+eM5DqMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:01:16.277707Z","bundle_sha256":"3cedcd0d09339afa6a862eb9c2889b0e2a5013af7164cc6b02662661b80bc9ab"}}