{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EWHMCFH73WTAF7ABC2GIDXYYAA","short_pith_number":"pith:EWHMCFH7","canonical_record":{"source":{"id":"1603.05579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-17T17:22:42Z","cross_cats_sorted":["cs.CG","math.AP"],"title_canon_sha256":"19a985c85152ec9d19eff3705bf5d6022e6eeeb95600727361d9d2bf6b8509e8","abstract_canon_sha256":"b65a7eaa297c3e79ee40d0a2bfd45685a9e6e8f693851918e73ca768a5099e4a"},"schema_version":"1.0"},"canonical_sha256":"258ec114ffdda602fc01168c81df18003c2a4b98e4b3733cd08d3c8b74932bae","source":{"kind":"arxiv","id":"1603.05579","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05579","created_at":"2026-05-18T00:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05579v2","created_at":"2026-05-18T00:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05579","created_at":"2026-05-18T00:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"EWHMCFH73WTA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EWHMCFH73WTAF7AB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EWHMCFH7","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EWHMCFH73WTAF7ABC2GIDXYYAA","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-17T17:22:42Z","cross_cats_sorted":["cs.CG","math.AP"],"title_canon_sha256":"19a985c85152ec9d19eff3705bf5d6022e6eeeb95600727361d9d2bf6b8509e8","abstract_canon_sha256":"b65a7eaa297c3e79ee40d0a2bfd45685a9e6e8f693851918e73ca768a5099e4a"},"schema_version":"1.0"},"canonical_sha256":"258ec114ffdda602fc01168c81df18003c2a4b98e4b3733cd08d3c8b74932bae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:24.940867Z","signature_b64":"TJ48gZDdqFqZq/yB3zBWTWXvRLcwrUjpxKZE6vhoefl3ncfAcqAgGsZcYpPw2uy5TLY3xlO+pJfRZKgcvO33BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"258ec114ffdda602fc01168c81df18003c2a4b98e4b3733cd08d3c8b74932bae","last_reissued_at":"2026-05-18T00:49:24.940255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:24.940255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05579","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-05-18T00:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gU0vB44r28gpo6IMeVHVwCWWOUlgF70nokPk3Ui6QiwJ1jxHgnvvNKlRtkwR0xXxmQsTWHfiIjVP9lmFc9YGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:16:19.161041Z"},"content_sha256":"de78218fb0002da6a078428495399aca475b4c308fba9e6654eb2f9d772c3518","schema_version":"1.0","event_id":"sha256:de78218fb0002da6a078428495399aca475b4c308fba9e6654eb2f9d772c3518"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EWHMCFH73WTAF7ABC2GIDXYYAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence of a Newton algorithm for semi-discrete optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.AP"],"primary_cat":"math.NA","authors_text":"Boris Thibert, Jun Kitagawa, Quentin M\\'erigot","submitted_at":"2016-03-17T17:22:42Z","abstract_excerpt":"Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems numerically is to assume that the source probability measure is absolutely continuous while the target measure is finitely supported. We refer to this setting as semi-discrete optimal transport. Among the several algorithms proposed to solve semi-discrete optimal transport problems, one currently needs to choose between algorithms that are slow but come with a conv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05579","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":""},"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-05-18T00:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBnGV3FsZvjEY1AxcqMBuKiVHqGMru5ndbSWh2W5Ga23sqvyW4LaiUlkXGJICOQdKWN1BAbCeE/xLB7sPMwyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:16:19.161407Z"},"content_sha256":"bbd8281c87a061faa7b5575afd120747ce1f816b28f9a7a9071f11ed411fd63c","schema_version":"1.0","event_id":"sha256:bbd8281c87a061faa7b5575afd120747ce1f816b28f9a7a9071f11ed411fd63c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWHMCFH73WTAF7ABC2GIDXYYAA/bundle.json","state_url":"https://pith.science/pith/EWHMCFH73WTAF7ABC2GIDXYYAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWHMCFH73WTAF7ABC2GIDXYYAA/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-06-03T12:16:19Z","links":{"resolver":"https://pith.science/pith/EWHMCFH73WTAF7ABC2GIDXYYAA","bundle":"https://pith.science/pith/EWHMCFH73WTAF7ABC2GIDXYYAA/bundle.json","state":"https://pith.science/pith/EWHMCFH73WTAF7ABC2GIDXYYAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWHMCFH73WTAF7ABC2GIDXYYAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EWHMCFH73WTAF7ABC2GIDXYYAA","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":"b65a7eaa297c3e79ee40d0a2bfd45685a9e6e8f693851918e73ca768a5099e4a","cross_cats_sorted":["cs.CG","math.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-17T17:22:42Z","title_canon_sha256":"19a985c85152ec9d19eff3705bf5d6022e6eeeb95600727361d9d2bf6b8509e8"},"schema_version":"1.0","source":{"id":"1603.05579","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05579","created_at":"2026-05-18T00:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05579v2","created_at":"2026-05-18T00:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05579","created_at":"2026-05-18T00:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"EWHMCFH73WTA","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"EWHMCFH73WTAF7AB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"EWHMCFH7","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:bbd8281c87a061faa7b5575afd120747ce1f816b28f9a7a9071f11ed411fd63c","target":"graph","created_at":"2026-05-18T00:49:24Z","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"},"paper":{"abstract_excerpt":"Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems numerically is to assume that the source probability measure is absolutely continuous while the target measure is finitely supported. We refer to this setting as semi-discrete optimal transport. Among the several algorithms proposed to solve semi-discrete optimal transport problems, one currently needs to choose between algorithms that are slow but come with a conv","authors_text":"Boris Thibert, Jun Kitagawa, Quentin M\\'erigot","cross_cats":["cs.CG","math.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-17T17:22:42Z","title":"Convergence of a Newton algorithm for semi-discrete optimal transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05579","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:de78218fb0002da6a078428495399aca475b4c308fba9e6654eb2f9d772c3518","target":"record","created_at":"2026-05-18T00:49:24Z","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":"b65a7eaa297c3e79ee40d0a2bfd45685a9e6e8f693851918e73ca768a5099e4a","cross_cats_sorted":["cs.CG","math.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-17T17:22:42Z","title_canon_sha256":"19a985c85152ec9d19eff3705bf5d6022e6eeeb95600727361d9d2bf6b8509e8"},"schema_version":"1.0","source":{"id":"1603.05579","kind":"arxiv","version":2}},"canonical_sha256":"258ec114ffdda602fc01168c81df18003c2a4b98e4b3733cd08d3c8b74932bae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"258ec114ffdda602fc01168c81df18003c2a4b98e4b3733cd08d3c8b74932bae","first_computed_at":"2026-05-18T00:49:24.940255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:24.940255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TJ48gZDdqFqZq/yB3zBWTWXvRLcwrUjpxKZE6vhoefl3ncfAcqAgGsZcYpPw2uy5TLY3xlO+pJfRZKgcvO33BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:24.940867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05579","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de78218fb0002da6a078428495399aca475b4c308fba9e6654eb2f9d772c3518","sha256:bbd8281c87a061faa7b5575afd120747ce1f816b28f9a7a9071f11ed411fd63c"],"state_sha256":"7357b0c5c2fbfef6041b0aca55d1153f14a5ecd8150d07340cbeae9162cffc45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nniPhPXgq8qStFzqldXKrHg2L/Pu4i8EsDbJCYtIIoHPlrNlz8nAIdQcUI1X9AJgAMjEIsg/M0/iA8sIWJDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:16:19.163510Z","bundle_sha256":"c7f943c9588a069e4fd89a6256cb95d70bdaa68d5d11a3adb5175d8307d6ed8c"}}