{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AGPOFE3LVJSKJSXKAOUZRF4XPN","short_pith_number":"pith:AGPOFE3L","schema_version":"1.0","canonical_sha256":"019ee2936baa64a4caea03a99897977b741d2059e412ab830c16cb36b180c79b","source":{"kind":"arxiv","id":"1808.08003","version":3},"attestation_state":"computed","paper":{"title":"Approximate Distribution Matching for Sequence-to-Sequence Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Guanlin Li, Ming Zhou, Mu Li, Shujie Liu, Wenhu Chen, Zhirui Zhang","submitted_at":"2018-08-24T05:00:17Z","abstract_excerpt":"Sequence-to-Sequence models were introduced to tackle many real-life problems like machine translation, summarization, image captioning, etc. The standard optimization algorithms are mainly based on example-to-example matching like maximum likelihood estimation, which is known to suffer from data sparsity problem. Here we present an alternate view to explain sequence-to-sequence learning as a distribution matching problem, where each source or target example is viewed to represent a local latent distribution in the source or target domain. Then, we interpret sequence-to-sequence learning as le"},"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":"1808.08003","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-08-24T05:00:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8f2d27d6869452255104969cbfb6ec6622932eeb195a92689de2598750762ad7","abstract_canon_sha256":"5fc04cf3efbab2a0c12558b406a4afeff110d7c967391c12a605e7e3cae6a90c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:36.818790Z","signature_b64":"Ijo2PhxOBQ1Vl4eHEiKXY9Mw3UnPzzkc+ZgqSPPlzkMwug6+x6WLRHxcVw7y9S3cb5MYJPAQYPLDqvlAp30aCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"019ee2936baa64a4caea03a99897977b741d2059e412ab830c16cb36b180c79b","last_reissued_at":"2026-05-18T00:06:36.818308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:36.818308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Distribution Matching for Sequence-to-Sequence Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Guanlin Li, Ming Zhou, Mu Li, Shujie Liu, Wenhu Chen, Zhirui Zhang","submitted_at":"2018-08-24T05:00:17Z","abstract_excerpt":"Sequence-to-Sequence models were introduced to tackle many real-life problems like machine translation, summarization, image captioning, etc. The standard optimization algorithms are mainly based on example-to-example matching like maximum likelihood estimation, which is known to suffer from data sparsity problem. Here we present an alternate view to explain sequence-to-sequence learning as a distribution matching problem, where each source or target example is viewed to represent a local latent distribution in the source or target domain. Then, we interpret sequence-to-sequence learning as le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08003","kind":"arxiv","version":3},"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":"1808.08003","created_at":"2026-05-18T00:06:36.818391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08003v3","created_at":"2026-05-18T00:06:36.818391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08003","created_at":"2026-05-18T00:06:36.818391+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGPOFE3LVJSK","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGPOFE3LVJSKJSXK","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGPOFE3L","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/AGPOFE3LVJSKJSXKAOUZRF4XPN","json":"https://pith.science/pith/AGPOFE3LVJSKJSXKAOUZRF4XPN.json","graph_json":"https://pith.science/api/pith-number/AGPOFE3LVJSKJSXKAOUZRF4XPN/graph.json","events_json":"https://pith.science/api/pith-number/AGPOFE3LVJSKJSXKAOUZRF4XPN/events.json","paper":"https://pith.science/paper/AGPOFE3L"},"agent_actions":{"view_html":"https://pith.science/pith/AGPOFE3LVJSKJSXKAOUZRF4XPN","download_json":"https://pith.science/pith/AGPOFE3LVJSKJSXKAOUZRF4XPN.json","view_paper":"https://pith.science/paper/AGPOFE3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08003&json=true","fetch_graph":"https://pith.science/api/pith-number/AGPOFE3LVJSKJSXKAOUZRF4XPN/graph.json","fetch_events":"https://pith.science/api/pith-number/AGPOFE3LVJSKJSXKAOUZRF4XPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGPOFE3LVJSKJSXKAOUZRF4XPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGPOFE3LVJSKJSXKAOUZRF4XPN/action/storage_attestation","attest_author":"https://pith.science/pith/AGPOFE3LVJSKJSXKAOUZRF4XPN/action/author_attestation","sign_citation":"https://pith.science/pith/AGPOFE3LVJSKJSXKAOUZRF4XPN/action/citation_signature","submit_replication":"https://pith.science/pith/AGPOFE3LVJSKJSXKAOUZRF4XPN/action/replication_record"}},"created_at":"2026-05-18T00:06:36.818391+00:00","updated_at":"2026-05-18T00:06:36.818391+00:00"}