{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7AIERS53D6YCQ4BGSPJCYG2ZNX","short_pith_number":"pith:7AIERS53","canonical_record":{"source":{"id":"2511.13847","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-11-17T19:04:28Z","cross_cats_sorted":["cs.NA","math.NA","stat.CO"],"title_canon_sha256":"69cf1c7c7b50a7353adda99b15cb13655af62e15eadb7946915f399e33dccfcf","abstract_canon_sha256":"05c6f06209e143884ebe8418dc8a07e16ed6565d6d401202440bf160adc790b0"},"schema_version":"1.0"},"canonical_sha256":"f81048cbbb1fb028702693d22c1b596dd400a74f2ac21bfa6caa012d7cf1d896","source":{"kind":"arxiv","id":"2511.13847","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.13847","created_at":"2026-07-01T00:17:09Z"},{"alias_kind":"arxiv_version","alias_value":"2511.13847v3","created_at":"2026-07-01T00:17:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.13847","created_at":"2026-07-01T00:17:09Z"},{"alias_kind":"pith_short_12","alias_value":"7AIERS53D6YC","created_at":"2026-07-01T00:17:09Z"},{"alias_kind":"pith_short_16","alias_value":"7AIERS53D6YCQ4BG","created_at":"2026-07-01T00:17:09Z"},{"alias_kind":"pith_short_8","alias_value":"7AIERS53","created_at":"2026-07-01T00:17:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7AIERS53D6YCQ4BGSPJCYG2ZNX","target":"record","payload":{"canonical_record":{"source":{"id":"2511.13847","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-11-17T19:04:28Z","cross_cats_sorted":["cs.NA","math.NA","stat.CO"],"title_canon_sha256":"69cf1c7c7b50a7353adda99b15cb13655af62e15eadb7946915f399e33dccfcf","abstract_canon_sha256":"05c6f06209e143884ebe8418dc8a07e16ed6565d6d401202440bf160adc790b0"},"schema_version":"1.0"},"canonical_sha256":"f81048cbbb1fb028702693d22c1b596dd400a74f2ac21bfa6caa012d7cf1d896","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T00:17:09.250474Z","signature_b64":"IaR55Q8vnUpiGqbAv6j9/PIuRCJwT3+2dlbxB7gAg7Tk3JI0Wbh6AllCH7YEfu3GbvvRDLB9PRzyEIXrm/WuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f81048cbbb1fb028702693d22c1b596dd400a74f2ac21bfa6caa012d7cf1d896","last_reissued_at":"2026-07-01T00:17:09.249982Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T00:17:09.249982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.13847","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-01T00:17:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vB5tgdN+JS6uTJIYixZOryuiwOMVDtCEda90LDoQX9WB3w47aqew/lv/sy9vPVbvvjEdRr5xMgkTndWQYtV7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T16:51:45.648143Z"},"content_sha256":"c15ac4297b9f06bfa2d07ad12f39b3c767aef728f74b2563168be4f3616d1a5f","schema_version":"1.0","event_id":"sha256:c15ac4297b9f06bfa2d07ad12f39b3c767aef728f74b2563168be4f3616d1a5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7AIERS53D6YCQ4BGSPJCYG2ZNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex relaxation approaches for high-dimensional optimal transport","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.CO"],"primary_cat":"math.OC","authors_text":"Tianyun Tang, YueHaw Khoo","submitted_at":"2025-11-17T19:04:28Z","abstract_excerpt":"Optimal transport (OT) is a powerful tool in mathematics and data science but faces severe computational and statistical challenges in high dimensions. We propose convex relaxation approaches based on marginal and cluster moment relaxations that exploit locality in the distributions. These methods approximate high-dimensional couplings using low-order marginals and sparse moment statistics, yielding semidefinite programs that provide lower bounds on the OT cost with greatly reduced complexity. For Gaussian measures with sparse correlations, we prove an exponential convergence rate for the clus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.13847","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/2511.13847/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-01T00:17:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C4gdTge8/btlp4hBkkdI4hhzxRgXpBszfghE12m4zNDaJyIGOoHRVEgIN8DSqrvv6GfobAzNfVWzg4qlJgBABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T16:51:45.648640Z"},"content_sha256":"56fc619b29f97521e112b236ff8c7e99fa5162ae28f3a648afcb29351347353e","schema_version":"1.0","event_id":"sha256:56fc619b29f97521e112b236ff8c7e99fa5162ae28f3a648afcb29351347353e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7AIERS53D6YCQ4BGSPJCYG2ZNX/bundle.json","state_url":"https://pith.science/pith/7AIERS53D6YCQ4BGSPJCYG2ZNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7AIERS53D6YCQ4BGSPJCYG2ZNX/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-01T16:51:45Z","links":{"resolver":"https://pith.science/pith/7AIERS53D6YCQ4BGSPJCYG2ZNX","bundle":"https://pith.science/pith/7AIERS53D6YCQ4BGSPJCYG2ZNX/bundle.json","state":"https://pith.science/pith/7AIERS53D6YCQ4BGSPJCYG2ZNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7AIERS53D6YCQ4BGSPJCYG2ZNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7AIERS53D6YCQ4BGSPJCYG2ZNX","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":"05c6f06209e143884ebe8418dc8a07e16ed6565d6d401202440bf160adc790b0","cross_cats_sorted":["cs.NA","math.NA","stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-11-17T19:04:28Z","title_canon_sha256":"69cf1c7c7b50a7353adda99b15cb13655af62e15eadb7946915f399e33dccfcf"},"schema_version":"1.0","source":{"id":"2511.13847","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.13847","created_at":"2026-07-01T00:17:09Z"},{"alias_kind":"arxiv_version","alias_value":"2511.13847v3","created_at":"2026-07-01T00:17:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.13847","created_at":"2026-07-01T00:17:09Z"},{"alias_kind":"pith_short_12","alias_value":"7AIERS53D6YC","created_at":"2026-07-01T00:17:09Z"},{"alias_kind":"pith_short_16","alias_value":"7AIERS53D6YCQ4BG","created_at":"2026-07-01T00:17:09Z"},{"alias_kind":"pith_short_8","alias_value":"7AIERS53","created_at":"2026-07-01T00:17:09Z"}],"graph_snapshots":[{"event_id":"sha256:56fc619b29f97521e112b236ff8c7e99fa5162ae28f3a648afcb29351347353e","target":"graph","created_at":"2026-07-01T00:17:09Z","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/2511.13847/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimal transport (OT) is a powerful tool in mathematics and data science but faces severe computational and statistical challenges in high dimensions. We propose convex relaxation approaches based on marginal and cluster moment relaxations that exploit locality in the distributions. These methods approximate high-dimensional couplings using low-order marginals and sparse moment statistics, yielding semidefinite programs that provide lower bounds on the OT cost with greatly reduced complexity. For Gaussian measures with sparse correlations, we prove an exponential convergence rate for the clus","authors_text":"Tianyun Tang, YueHaw Khoo","cross_cats":["cs.NA","math.NA","stat.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-11-17T19:04:28Z","title":"Convex relaxation approaches for high-dimensional optimal transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.13847","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:c15ac4297b9f06bfa2d07ad12f39b3c767aef728f74b2563168be4f3616d1a5f","target":"record","created_at":"2026-07-01T00:17:09Z","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":"05c6f06209e143884ebe8418dc8a07e16ed6565d6d401202440bf160adc790b0","cross_cats_sorted":["cs.NA","math.NA","stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-11-17T19:04:28Z","title_canon_sha256":"69cf1c7c7b50a7353adda99b15cb13655af62e15eadb7946915f399e33dccfcf"},"schema_version":"1.0","source":{"id":"2511.13847","kind":"arxiv","version":3}},"canonical_sha256":"f81048cbbb1fb028702693d22c1b596dd400a74f2ac21bfa6caa012d7cf1d896","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f81048cbbb1fb028702693d22c1b596dd400a74f2ac21bfa6caa012d7cf1d896","first_computed_at":"2026-07-01T00:17:09.249982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T00:17:09.249982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IaR55Q8vnUpiGqbAv6j9/PIuRCJwT3+2dlbxB7gAg7Tk3JI0Wbh6AllCH7YEfu3GbvvRDLB9PRzyEIXrm/WuDA==","signature_status":"signed_v1","signed_at":"2026-07-01T00:17:09.250474Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.13847","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c15ac4297b9f06bfa2d07ad12f39b3c767aef728f74b2563168be4f3616d1a5f","sha256:56fc619b29f97521e112b236ff8c7e99fa5162ae28f3a648afcb29351347353e"],"state_sha256":"1f5bcbc51ffc6ab42fab7d6dab298fe3a74d893606ffdf919983aa5bad187db8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8UmDFUC4pM11D8UNWTPM3TuNxSHOl4PrIl6wejN0VhGgqxEjuGcg9WWGtct1iPAHUK3cDK0zmOZU78WtfPBCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T16:51:45.653770Z","bundle_sha256":"78c619bb62e688ccaad773b9608ed37958cb02926a3e97e526b4c9c617893e55"}}