{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DEYOWWB3XSLNNPG7W4K2NL4NHP","short_pith_number":"pith:DEYOWWB3","schema_version":"1.0","canonical_sha256":"1930eb583bbc96d6bcdfb715a6af8d3bef86bbbc5f2098db2ce774281c08c0be","source":{"kind":"arxiv","id":"2003.12170","version":2},"attestation_state":"computed","paper":{"title":"Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Avneesh Sud, Ben Usman, Kate Saenko, Nick Dufour","submitted_at":"2020-03-26T22:10:04Z","abstract_excerpt":"Distribution alignment has many applications in deep learning, including domain adaptation and unsupervised image-to-image translation. Most prior work on unsupervised distribution alignment relies either on minimizing simple non-parametric statistical distances such as maximum mean discrepancy or on adversarial alignment. However, the former fails to capture the structure of complex real-world distributions, while the latter is difficult to train and does not provide any universal convergence guarantees or automatic quantitative validation procedures. In this paper, we propose a new distribut"},"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":"2003.12170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-26T22:10:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1c612ad3ad225a77dee88eb20cdab48d5b1c9171b58e88749343957e535f70c6","abstract_canon_sha256":"d109d42b44c1adb9db2dec4f2aaa4ad2e0ad3628f29dbbcb0b9e9e3405717698"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:46:00.694495Z","signature_b64":"ZZZ8R8UMrd+oCxRQL6rxO3/t2ie5h3+tgCbGVzpRaP75bCcrnfJtEO19LdNCyZbUWy31R6Ug2MZ5B2EnsvouBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1930eb583bbc96d6bcdfb715a6af8d3bef86bbbc5f2098db2ce774281c08c0be","last_reissued_at":"2026-07-05T01:46:00.694023Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:46:00.694023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Avneesh Sud, Ben Usman, Kate Saenko, Nick Dufour","submitted_at":"2020-03-26T22:10:04Z","abstract_excerpt":"Distribution alignment has many applications in deep learning, including domain adaptation and unsupervised image-to-image translation. Most prior work on unsupervised distribution alignment relies either on minimizing simple non-parametric statistical distances such as maximum mean discrepancy or on adversarial alignment. However, the former fails to capture the structure of complex real-world distributions, while the latter is difficult to train and does not provide any universal convergence guarantees or automatic quantitative validation procedures. In this paper, we propose a new distribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.12170","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.12170/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.12170","created_at":"2026-07-05T01:46:00.694081+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.12170v2","created_at":"2026-07-05T01:46:00.694081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.12170","created_at":"2026-07-05T01:46:00.694081+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEYOWWB3XSLN","created_at":"2026-07-05T01:46:00.694081+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEYOWWB3XSLNNPG7","created_at":"2026-07-05T01:46:00.694081+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEYOWWB3","created_at":"2026-07-05T01:46:00.694081+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/DEYOWWB3XSLNNPG7W4K2NL4NHP","json":"https://pith.science/pith/DEYOWWB3XSLNNPG7W4K2NL4NHP.json","graph_json":"https://pith.science/api/pith-number/DEYOWWB3XSLNNPG7W4K2NL4NHP/graph.json","events_json":"https://pith.science/api/pith-number/DEYOWWB3XSLNNPG7W4K2NL4NHP/events.json","paper":"https://pith.science/paper/DEYOWWB3"},"agent_actions":{"view_html":"https://pith.science/pith/DEYOWWB3XSLNNPG7W4K2NL4NHP","download_json":"https://pith.science/pith/DEYOWWB3XSLNNPG7W4K2NL4NHP.json","view_paper":"https://pith.science/paper/DEYOWWB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.12170&json=true","fetch_graph":"https://pith.science/api/pith-number/DEYOWWB3XSLNNPG7W4K2NL4NHP/graph.json","fetch_events":"https://pith.science/api/pith-number/DEYOWWB3XSLNNPG7W4K2NL4NHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEYOWWB3XSLNNPG7W4K2NL4NHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEYOWWB3XSLNNPG7W4K2NL4NHP/action/storage_attestation","attest_author":"https://pith.science/pith/DEYOWWB3XSLNNPG7W4K2NL4NHP/action/author_attestation","sign_citation":"https://pith.science/pith/DEYOWWB3XSLNNPG7W4K2NL4NHP/action/citation_signature","submit_replication":"https://pith.science/pith/DEYOWWB3XSLNNPG7W4K2NL4NHP/action/replication_record"}},"created_at":"2026-07-05T01:46:00.694081+00:00","updated_at":"2026-07-05T01:46:00.694081+00:00"}