{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B3KRUEDBUJHBDEKC4PKXVEIBV3","short_pith_number":"pith:B3KRUEDB","schema_version":"1.0","canonical_sha256":"0ed51a1061a24e119142e3d57a9101aed16e32bc3c3da825ce1b3633b0fa89ab","source":{"kind":"arxiv","id":"1807.00393","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.00393","created_at":"2026-05-17T23:53:42.435237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00393v2","created_at":"2026-05-17T23:53:42.435237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00393","created_at":"2026-05-17T23:53:42.435237+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3KRUEDBUJHB","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3KRUEDBUJHBDEKC","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3KRUEDB","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3","json":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3.json","graph_json":"https://pith.science/api/pith-number/B3KRUEDBUJHBDEKC4PKXVEIBV3/graph.json","events_json":"https://pith.science/api/pith-number/B3KRUEDBUJHBDEKC4PKXVEIBV3/events.json","paper":"https://pith.science/paper/B3KRUEDB"},"agent_actions":{"view_html":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3","download_json":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3.json","view_paper":"https://pith.science/paper/B3KRUEDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00393&json=true","fetch_graph":"https://pith.science/api/pith-number/B3KRUEDBUJHBDEKC4PKXVEIBV3/graph.json","fetch_events":"https://pith.science/api/pith-number/B3KRUEDBUJHBDEKC4PKXVEIBV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3/action/storage_attestation","attest_author":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3/action/author_attestation","sign_citation":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3/action/citation_signature","submit_replication":"https://pith.science/pith/B3KRUEDBUJHBDEKC4PKXVEIBV3/action/replication_record"}},"created_at":"2026-05-17T23:53:42.435237+00:00","updated_at":"2026-05-17T23:53:42.435237+00:00"}