{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B3KRUEDBUJHBDEKC4PKXVEIBV3","short_pith_number":"pith:B3KRUEDB","canonical_record":{"source":{"id":"1807.00393","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-01T20:48:02Z","cross_cats_sorted":[],"title_canon_sha256":"5ef1606a0666860a47d6cbeee26ce248cc70d990286c147337cebf356d96571d","abstract_canon_sha256":"6c0016b92839d1f0ced1c6b3fb3149638dc244fdd1999e2d9f71496b7d003be8"},"schema_version":"1.0"},"canonical_sha256":"0ed51a1061a24e119142e3d57a9101aed16e32bc3c3da825ce1b3633b0fa89ab","source":{"kind":"arxiv","id":"1807.00393","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00393","created_at":"2026-05-17T23:53:42Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00393v2","created_at":"2026-05-17T23:53:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00393","created_at":"2026-05-17T23:53:42Z"},{"alias_kind":"pith_short_12","alias_value":"B3KRUEDBUJHB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B3KRUEDBUJHBDEKC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B3KRUEDB","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B3KRUEDBUJHBDEKC4PKXVEIBV3","target":"record","payload":{"canonical_record":{"source":{"id":"1807.00393","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-01T20:48:02Z","cross_cats_sorted":[],"title_canon_sha256":"5ef1606a0666860a47d6cbeee26ce248cc70d990286c147337cebf356d96571d","abstract_canon_sha256":"6c0016b92839d1f0ced1c6b3fb3149638dc244fdd1999e2d9f71496b7d003be8"},"schema_version":"1.0"},"canonical_sha256":"0ed51a1061a24e119142e3d57a9101aed16e32bc3c3da825ce1b3633b0fa89ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:42.435601Z","signature_b64":"X/fiBV3JVujvMsdiPK9ntq0A/9PFbuXLqXn9+nXbfvS3Gg8ZucamRE75heJ6xAvQqPaS2axk6jKEkLhvcA6tDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ed51a1061a24e119142e3d57a9101aed16e32bc3c3da825ce1b3633b0fa89ab","last_reissued_at":"2026-05-17T23:53:42.435173Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:42.435173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.00393","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-17T23:53:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhCx1ix6a/O275483SvvVhohHUd1i5xbJFae6L06GbnRmHwT+Nh8W2afHiBCLbFlJ9pZHuvuNCciTQvaIi75BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:53:18.398168Z"},"content_sha256":"d80eae8dce7a28664586cd372e6101f36664e535ef79f24d351f852775f0271e","schema_version":"1.0","event_id":"sha256:d80eae8dce7a28664586cd372e6101f36664e535ef79f24d351f852775f0271e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B3KRUEDBUJHBDEKC4PKXVEIBV3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Debra Laefer, Esteban G. Tabak, Montacer Essid","submitted_at":"2018-07-01T20:48:02Z","abstract_excerpt":"An adaptive, adversarial methodology is developed for the optimal transport problem between two distributions $\\mu$ and $\\nu$, known only through a finite set of independent samples $(x_i)_{i=1..N}$ and $(y_j)_{j=1..M}$. The methodology automatically creates features that adapt to the data, thus avoiding reliance on a priori knowledge of data distribution. Specifically, instead of a discrete point-bypoint assignment, the new procedure seeks an optimal map $T(x)$ defined for all $x$, minimizing the Kullback-Leibler divergence between $(T(xi))$ and the target $(y_j)$. The relative entropy is giv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00393","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-17T23:53:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d2fRFnFUTh5quh9V/d66ukC9ZBU3LV/xJAKbXM1DiGD2Sth8jrnFC8BNue9r+FufeVA4tscIY1ufadij2i0gBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:53:18.398723Z"},"content_sha256":"a23217f25e18876c85b6072df2e09780538a0b9bd7c5166c19fded3497efe562","schema_version":"1.0","event_id":"sha256:a23217f25e18876c85b6072df2e09780538a0b9bd7c5166c19fded3497efe562"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3/bundle.json","state_url":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3/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-23T12:53:18Z","links":{"resolver":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3","bundle":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3/bundle.json","state":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B3KRUEDBUJHBDEKC4PKXVEIBV3","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":"6c0016b92839d1f0ced1c6b3fb3149638dc244fdd1999e2d9f71496b7d003be8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-01T20:48:02Z","title_canon_sha256":"5ef1606a0666860a47d6cbeee26ce248cc70d990286c147337cebf356d96571d"},"schema_version":"1.0","source":{"id":"1807.00393","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00393","created_at":"2026-05-17T23:53:42Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00393v2","created_at":"2026-05-17T23:53:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00393","created_at":"2026-05-17T23:53:42Z"},{"alias_kind":"pith_short_12","alias_value":"B3KRUEDBUJHB","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B3KRUEDBUJHBDEKC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B3KRUEDB","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:a23217f25e18876c85b6072df2e09780538a0b9bd7c5166c19fded3497efe562","target":"graph","created_at":"2026-05-17T23:53:42Z","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":"An adaptive, adversarial methodology is developed for the optimal transport problem between two distributions $\\mu$ and $\\nu$, known only through a finite set of independent samples $(x_i)_{i=1..N}$ and $(y_j)_{j=1..M}$. The methodology automatically creates features that adapt to the data, thus avoiding reliance on a priori knowledge of data distribution. Specifically, instead of a discrete point-bypoint assignment, the new procedure seeks an optimal map $T(x)$ defined for all $x$, minimizing the Kullback-Leibler divergence between $(T(xi))$ and the target $(y_j)$. The relative entropy is giv","authors_text":"Debra Laefer, Esteban G. Tabak, Montacer Essid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-01T20:48:02Z","title":"Adaptive Optimal Transport"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00393","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:d80eae8dce7a28664586cd372e6101f36664e535ef79f24d351f852775f0271e","target":"record","created_at":"2026-05-17T23:53:42Z","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":"6c0016b92839d1f0ced1c6b3fb3149638dc244fdd1999e2d9f71496b7d003be8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-01T20:48:02Z","title_canon_sha256":"5ef1606a0666860a47d6cbeee26ce248cc70d990286c147337cebf356d96571d"},"schema_version":"1.0","source":{"id":"1807.00393","kind":"arxiv","version":2}},"canonical_sha256":"0ed51a1061a24e119142e3d57a9101aed16e32bc3c3da825ce1b3633b0fa89ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ed51a1061a24e119142e3d57a9101aed16e32bc3c3da825ce1b3633b0fa89ab","first_computed_at":"2026-05-17T23:53:42.435173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:42.435173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X/fiBV3JVujvMsdiPK9ntq0A/9PFbuXLqXn9+nXbfvS3Gg8ZucamRE75heJ6xAvQqPaS2axk6jKEkLhvcA6tDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:42.435601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00393","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d80eae8dce7a28664586cd372e6101f36664e535ef79f24d351f852775f0271e","sha256:a23217f25e18876c85b6072df2e09780538a0b9bd7c5166c19fded3497efe562"],"state_sha256":"c963f0862371b3781a0649ddceb32f55336ef9d64f3f4d9b0cf8eebeecdf0ce2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/IFKuvcCNMFa4nT6I21n0JibX9Nbt/KWxS6meq3s6XqZxssz1d9t4R5iRZ7FK22sjMomGDlxtAh7QGmT6pqTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:53:18.400820Z","bundle_sha256":"dd3728a2960b4657e6ed591735d4589cbe612ef923e60ba3218a0d39c6dc47ea"}}