{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HM3CUBURKOGCN73EJV5PYM2UXE","short_pith_number":"pith:HM3CUBUR","canonical_record":{"source":{"id":"1905.03950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-10T05:51:08Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"14987a505c1d6a533f64d77275806f0739ed87a79768012ead339cdde674b413","abstract_canon_sha256":"2aebad0bdadff582b17672fffcc5d9c42a10762660bd4338565d250ec232e11d"},"schema_version":"1.0"},"canonical_sha256":"3b362a0691538c26ff644d7afc3354b9295bf150f3f65855cb1d30a509cc62c8","source":{"kind":"arxiv","id":"1905.03950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03950","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03950v1","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03950","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"pith_short_12","alias_value":"HM3CUBURKOGC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HM3CUBURKOGCN73E","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HM3CUBUR","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HM3CUBURKOGCN73EJV5PYM2UXE","target":"record","payload":{"canonical_record":{"source":{"id":"1905.03950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-10T05:51:08Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"14987a505c1d6a533f64d77275806f0739ed87a79768012ead339cdde674b413","abstract_canon_sha256":"2aebad0bdadff582b17672fffcc5d9c42a10762660bd4338565d250ec232e11d"},"schema_version":"1.0"},"canonical_sha256":"3b362a0691538c26ff644d7afc3354b9295bf150f3f65855cb1d30a509cc62c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:35.095140Z","signature_b64":"8v8oqOfmhwwc0VSbNroW3WzuwRYmtBMOhAVnTMGLGNC53sQo+siHHKBn7mx/XO1rVNpIpbh9kquq5mNv51v/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b362a0691538c26ff644d7afc3354b9295bf150f3f65855cb1d30a509cc62c8","last_reissued_at":"2026-05-17T23:46:35.094438Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:35.094438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.03950","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-05-17T23:46:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FsktbpMn1uxc0OV0PR6PssPhTJUMKQq8Uu3iin0HCVeBpFtdqTNurYSsrdSeVLzJL+hsfcHb2xQdmQfryz03AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:12:59.660344Z"},"content_sha256":"0efa27cca64fb6d259c15914bca13e87afb9a2b21c94120a394fd474bfa45f8a","schema_version":"1.0","event_id":"sha256:0efa27cca64fb6d259c15914bca13e87afb9a2b21c94120a394fd474bfa45f8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HM3CUBURKOGCN73EJV5PYM2UXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inverse optimal transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"math.OC","authors_text":"Andrew M. Stuart, Marie-Therese Wolfram","submitted_at":"2019-05-10T05:51:08Z","abstract_excerpt":"Discrete optimal transportation problems arise in various contexts in engineering, the sciences and the social sciences. Often the underlying cost criterion is unknown, or only partly known, and the observed optimal solutions are corrupted by noise. In this paper we propose a systematic approach to infer unknown costs from noisy observations of optimal transportation plans. The algorithm requires only the ability to solve the forward optimal transport problem, which is a linear program, and to generate random numbers. It has a Bayesian interpretation, and may also be viewed as a form of stocha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03950","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":""},"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-17T23:46:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmZ9ZlVYCidsb6WYxPI0O7CyuNAcX21h04/krpKllL/brOAbULg5PF9NSPb4WdJKluJ+xRcq4VANqrlgnxqzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T17:12:59.661043Z"},"content_sha256":"c9335d2036b99060050a9e69bceb4bfad2a39bd6fc5b75db9481a44c58eda1b0","schema_version":"1.0","event_id":"sha256:c9335d2036b99060050a9e69bceb4bfad2a39bd6fc5b75db9481a44c58eda1b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HM3CUBURKOGCN73EJV5PYM2UXE/bundle.json","state_url":"https://pith.science/pith/HM3CUBURKOGCN73EJV5PYM2UXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HM3CUBURKOGCN73EJV5PYM2UXE/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-09T17:12:59Z","links":{"resolver":"https://pith.science/pith/HM3CUBURKOGCN73EJV5PYM2UXE","bundle":"https://pith.science/pith/HM3CUBURKOGCN73EJV5PYM2UXE/bundle.json","state":"https://pith.science/pith/HM3CUBURKOGCN73EJV5PYM2UXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HM3CUBURKOGCN73EJV5PYM2UXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HM3CUBURKOGCN73EJV5PYM2UXE","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":"2aebad0bdadff582b17672fffcc5d9c42a10762660bd4338565d250ec232e11d","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-10T05:51:08Z","title_canon_sha256":"14987a505c1d6a533f64d77275806f0739ed87a79768012ead339cdde674b413"},"schema_version":"1.0","source":{"id":"1905.03950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03950","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03950v1","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03950","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"pith_short_12","alias_value":"HM3CUBURKOGC","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HM3CUBURKOGCN73E","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HM3CUBUR","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:c9335d2036b99060050a9e69bceb4bfad2a39bd6fc5b75db9481a44c58eda1b0","target":"graph","created_at":"2026-05-17T23:46:35Z","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":"Discrete optimal transportation problems arise in various contexts in engineering, the sciences and the social sciences. Often the underlying cost criterion is unknown, or only partly known, and the observed optimal solutions are corrupted by noise. In this paper we propose a systematic approach to infer unknown costs from noisy observations of optimal transportation plans. The algorithm requires only the ability to solve the forward optimal transport problem, which is a linear program, and to generate random numbers. It has a Bayesian interpretation, and may also be viewed as a form of stocha","authors_text":"Andrew M. Stuart, Marie-Therese Wolfram","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-10T05:51:08Z","title":"Inverse optimal transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03950","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:0efa27cca64fb6d259c15914bca13e87afb9a2b21c94120a394fd474bfa45f8a","target":"record","created_at":"2026-05-17T23:46:35Z","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":"2aebad0bdadff582b17672fffcc5d9c42a10762660bd4338565d250ec232e11d","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-10T05:51:08Z","title_canon_sha256":"14987a505c1d6a533f64d77275806f0739ed87a79768012ead339cdde674b413"},"schema_version":"1.0","source":{"id":"1905.03950","kind":"arxiv","version":1}},"canonical_sha256":"3b362a0691538c26ff644d7afc3354b9295bf150f3f65855cb1d30a509cc62c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b362a0691538c26ff644d7afc3354b9295bf150f3f65855cb1d30a509cc62c8","first_computed_at":"2026-05-17T23:46:35.094438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:35.094438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8v8oqOfmhwwc0VSbNroW3WzuwRYmtBMOhAVnTMGLGNC53sQo+siHHKBn7mx/XO1rVNpIpbh9kquq5mNv51v/DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:35.095140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0efa27cca64fb6d259c15914bca13e87afb9a2b21c94120a394fd474bfa45f8a","sha256:c9335d2036b99060050a9e69bceb4bfad2a39bd6fc5b75db9481a44c58eda1b0"],"state_sha256":"1cebd53f95861753a51cacca96f6dcc470508f04a4535b6ec5e391bac87f8895"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67k63yFfB/W2WmW7L5U6oKt6oiefbALfMEHrMxpyJEZU4+DB4w57paA2QpyokvHO0txbJqcGsp3eyGvuDSNyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T17:12:59.665099Z","bundle_sha256":"9c2ebcd672825192bb04da8e6d233b1f266760772c6bb13f80a07722af3c66a8"}}