{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W5IOE2FCLTUM4SOP5MLBLYNHRK","short_pith_number":"pith:W5IOE2FC","canonical_record":{"source":{"id":"1707.05438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-18T02:04:37Z","cross_cats_sorted":[],"title_canon_sha256":"1c1a0dc4973cdd6da53237116fa570d6f8683e88b2976639226ad18118d10fe0","abstract_canon_sha256":"8fac93b5004d8ffbd014a307034810f7782090306b2835d6fada7575c80699da"},"schema_version":"1.0"},"canonical_sha256":"b750e268a25ce8ce49cfeb1615e1a78ab3ecb03bca7ed190d6d4fe6ac91d3015","source":{"kind":"arxiv","id":"1707.05438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05438","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05438v1","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05438","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"W5IOE2FCLTUM","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W5IOE2FCLTUM4SOP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W5IOE2FC","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W5IOE2FCLTUM4SOP5MLBLYNHRK","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-18T02:04:37Z","cross_cats_sorted":[],"title_canon_sha256":"1c1a0dc4973cdd6da53237116fa570d6f8683e88b2976639226ad18118d10fe0","abstract_canon_sha256":"8fac93b5004d8ffbd014a307034810f7782090306b2835d6fada7575c80699da"},"schema_version":"1.0"},"canonical_sha256":"b750e268a25ce8ce49cfeb1615e1a78ab3ecb03bca7ed190d6d4fe6ac91d3015","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:02.346032Z","signature_b64":"hNR4y1PQZn5aMlwsq8JXZIGbt1fSigpaQXwhQzlko5Pr08DKDuYACq30uEnxqx3sN+v68nPyqIc+RqEqSJdTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b750e268a25ce8ce49cfeb1615e1a78ab3ecb03bca7ed190d6d4fe6ac91d3015","last_reissued_at":"2026-05-18T00:40:02.345571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:02.345571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05438","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-18T00:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UJc736+Mx4ZHW15xF/IapZrk4iJkFj6IvR+3lPO8fB4Htopbc6c/mSOOFfhaKWkmNaMiwAkarRU+5Uj7lZIGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:36:25.999834Z"},"content_sha256":"e17bdf4610eaa49cb4f5d5124660a4b3e9674edd1f5f788f627dd1fc778dbeec","schema_version":"1.0","event_id":"sha256:e17bdf4610eaa49cb4f5d5124660a4b3e9674edd1f5f788f627dd1fc778dbeec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W5IOE2FCLTUM4SOP5MLBLYNHRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Top-Rank Enhanced Listwise Optimization for Statistical Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"David Chiang, Huadong Chen, Jiajun Chen, Shujian Huang, Xinyu Dai","submitted_at":"2017-07-18T02:04:37Z","abstract_excerpt":"Pairwise ranking methods are the basis of many widely used discriminative training approaches for structure prediction problems in natural language processing(NLP). Decomposing the problem of ranking hypotheses into pairwise comparisons enables simple and efficient solutions. However, neglecting the global ordering of the hypothesis list may hinder learning. We propose a listwise learning framework for structure prediction problems such as machine translation. Our framework directly models the entire translation list's ordering to learn parameters which may better fit the given listwise sample"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05438","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-18T00:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GmImmLFNU4XmbVLmOIweX35xQhnaQwk9G9LlTttlndg/a/jxJ9ZyTV+QbS0lgz19Em5CBFiF/QdipS0jk//IAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:36:26.000219Z"},"content_sha256":"2cbff3f23c213abfadcb35ba6b70c5e5420ccce8ed27573fb702ac10bbc3e8c3","schema_version":"1.0","event_id":"sha256:2cbff3f23c213abfadcb35ba6b70c5e5420ccce8ed27573fb702ac10bbc3e8c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5IOE2FCLTUM4SOP5MLBLYNHRK/bundle.json","state_url":"https://pith.science/pith/W5IOE2FCLTUM4SOP5MLBLYNHRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5IOE2FCLTUM4SOP5MLBLYNHRK/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-05-25T17:36:26Z","links":{"resolver":"https://pith.science/pith/W5IOE2FCLTUM4SOP5MLBLYNHRK","bundle":"https://pith.science/pith/W5IOE2FCLTUM4SOP5MLBLYNHRK/bundle.json","state":"https://pith.science/pith/W5IOE2FCLTUM4SOP5MLBLYNHRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5IOE2FCLTUM4SOP5MLBLYNHRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W5IOE2FCLTUM4SOP5MLBLYNHRK","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":"8fac93b5004d8ffbd014a307034810f7782090306b2835d6fada7575c80699da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-18T02:04:37Z","title_canon_sha256":"1c1a0dc4973cdd6da53237116fa570d6f8683e88b2976639226ad18118d10fe0"},"schema_version":"1.0","source":{"id":"1707.05438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05438","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05438v1","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05438","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"W5IOE2FCLTUM","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W5IOE2FCLTUM4SOP","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W5IOE2FC","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:2cbff3f23c213abfadcb35ba6b70c5e5420ccce8ed27573fb702ac10bbc3e8c3","target":"graph","created_at":"2026-05-18T00:40:02Z","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":"Pairwise ranking methods are the basis of many widely used discriminative training approaches for structure prediction problems in natural language processing(NLP). Decomposing the problem of ranking hypotheses into pairwise comparisons enables simple and efficient solutions. However, neglecting the global ordering of the hypothesis list may hinder learning. We propose a listwise learning framework for structure prediction problems such as machine translation. Our framework directly models the entire translation list's ordering to learn parameters which may better fit the given listwise sample","authors_text":"David Chiang, Huadong Chen, Jiajun Chen, Shujian Huang, Xinyu Dai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-18T02:04:37Z","title":"Top-Rank Enhanced Listwise Optimization for Statistical Machine Translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05438","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:e17bdf4610eaa49cb4f5d5124660a4b3e9674edd1f5f788f627dd1fc778dbeec","target":"record","created_at":"2026-05-18T00:40:02Z","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":"8fac93b5004d8ffbd014a307034810f7782090306b2835d6fada7575c80699da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-18T02:04:37Z","title_canon_sha256":"1c1a0dc4973cdd6da53237116fa570d6f8683e88b2976639226ad18118d10fe0"},"schema_version":"1.0","source":{"id":"1707.05438","kind":"arxiv","version":1}},"canonical_sha256":"b750e268a25ce8ce49cfeb1615e1a78ab3ecb03bca7ed190d6d4fe6ac91d3015","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b750e268a25ce8ce49cfeb1615e1a78ab3ecb03bca7ed190d6d4fe6ac91d3015","first_computed_at":"2026-05-18T00:40:02.345571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:02.345571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hNR4y1PQZn5aMlwsq8JXZIGbt1fSigpaQXwhQzlko5Pr08DKDuYACq30uEnxqx3sN+v68nPyqIc+RqEqSJdTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:02.346032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e17bdf4610eaa49cb4f5d5124660a4b3e9674edd1f5f788f627dd1fc778dbeec","sha256:2cbff3f23c213abfadcb35ba6b70c5e5420ccce8ed27573fb702ac10bbc3e8c3"],"state_sha256":"54ebc8ae921a20531101d75f891da083e7215bfa27d68d30dd4b88ed15116ba2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L4RvWJTEbQV4r9akgvz2xqt2zFKgA0qWwe46PbCkYjtThzkY7WfJT2ZluFfH2n5u8Y8jqAqkh/DAd2AuIzrFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:36:26.002991Z","bundle_sha256":"f67e152f3ddd052dc9f99b48e2a269c87bec16a8796aae308f3f9e7c84156b01"}}