{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:74YZOIIEZBSC742N5LZ43NQ3DG","short_pith_number":"pith:74YZOIIE","schema_version":"1.0","canonical_sha256":"ff31972104c8642ff34deaf3cdb61b19b9677dcb5b2a03cb312bf3af58966f2b","source":{"kind":"arxiv","id":"2504.09570","version":2},"attestation_state":"computed","paper":{"title":"LLMs Can Achieve High-quality Simultaneous Machine Translation as Efficiently as Offline","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Biao Fu, Chengxi Li, Kai Fan, Liang Zhang, Minpeng Liao, Xiaodong Shi, Yidong Chen","submitted_at":"2025-04-13T13:45:53Z","abstract_excerpt":"When the complete source sentence is provided, Large Language Models (LLMs) perform excellently in offline machine translation even with a simple prompt \"Translate the following sentence from [src lang] into [tgt lang]:\". However, in many real scenarios, the source tokens arrive in a streaming manner and simultaneous machine translation (SiMT) is required, then the efficiency and performance of decoder-only LLMs are significantly limited by their auto-regressive nature. To enable LLMs to achieve high-quality SiMT as efficiently as offline translation, we propose a novel paradigm that includes "},"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":"2504.09570","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-04-13T13:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"d40d7aec64b752fa7033f5e59341df51bb7d57a0b5b479c91e19cec368a3448f","abstract_canon_sha256":"e27fbbcebbdf23c917f25338cd1bc93a00fc753ee8bf2e51c11f34aaae9eb1ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:44.035444Z","signature_b64":"Xu0t9jDHczXB7eyNb9P+Dg7MLfZrznLQJpw+oPHcP2HJZqCWq5I9WgNWTPLQdLH8AKRDRxytp7IrdCNp00ojBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff31972104c8642ff34deaf3cdb61b19b9677dcb5b2a03cb312bf3af58966f2b","last_reissued_at":"2026-07-05T11:11:44.034919Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:44.034919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLMs Can Achieve High-quality Simultaneous Machine Translation as Efficiently as Offline","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Biao Fu, Chengxi Li, Kai Fan, Liang Zhang, Minpeng Liao, Xiaodong Shi, Yidong Chen","submitted_at":"2025-04-13T13:45:53Z","abstract_excerpt":"When the complete source sentence is provided, Large Language Models (LLMs) perform excellently in offline machine translation even with a simple prompt \"Translate the following sentence from [src lang] into [tgt lang]:\". However, in many real scenarios, the source tokens arrive in a streaming manner and simultaneous machine translation (SiMT) is required, then the efficiency and performance of decoder-only LLMs are significantly limited by their auto-regressive nature. To enable LLMs to achieve high-quality SiMT as efficiently as offline translation, we propose a novel paradigm that includes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.09570","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/2504.09570/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":"2504.09570","created_at":"2026-07-05T11:11:44.034978+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.09570v2","created_at":"2026-07-05T11:11:44.034978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.09570","created_at":"2026-07-05T11:11:44.034978+00:00"},{"alias_kind":"pith_short_12","alias_value":"74YZOIIEZBSC","created_at":"2026-07-05T11:11:44.034978+00:00"},{"alias_kind":"pith_short_16","alias_value":"74YZOIIEZBSC742N","created_at":"2026-07-05T11:11:44.034978+00:00"},{"alias_kind":"pith_short_8","alias_value":"74YZOIIE","created_at":"2026-07-05T11:11:44.034978+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30553","citing_title":"COSM: A Cooperative Scheduling Framework for Concurrent PIM and CPU Execution on Mobile Devices","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30553","citing_title":"COSM: A Cooperative Scheduling Framework for Concurrent PIM and CPU Execution on Mobile Devices","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74YZOIIEZBSC742N5LZ43NQ3DG","json":"https://pith.science/pith/74YZOIIEZBSC742N5LZ43NQ3DG.json","graph_json":"https://pith.science/api/pith-number/74YZOIIEZBSC742N5LZ43NQ3DG/graph.json","events_json":"https://pith.science/api/pith-number/74YZOIIEZBSC742N5LZ43NQ3DG/events.json","paper":"https://pith.science/paper/74YZOIIE"},"agent_actions":{"view_html":"https://pith.science/pith/74YZOIIEZBSC742N5LZ43NQ3DG","download_json":"https://pith.science/pith/74YZOIIEZBSC742N5LZ43NQ3DG.json","view_paper":"https://pith.science/paper/74YZOIIE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.09570&json=true","fetch_graph":"https://pith.science/api/pith-number/74YZOIIEZBSC742N5LZ43NQ3DG/graph.json","fetch_events":"https://pith.science/api/pith-number/74YZOIIEZBSC742N5LZ43NQ3DG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74YZOIIEZBSC742N5LZ43NQ3DG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74YZOIIEZBSC742N5LZ43NQ3DG/action/storage_attestation","attest_author":"https://pith.science/pith/74YZOIIEZBSC742N5LZ43NQ3DG/action/author_attestation","sign_citation":"https://pith.science/pith/74YZOIIEZBSC742N5LZ43NQ3DG/action/citation_signature","submit_replication":"https://pith.science/pith/74YZOIIEZBSC742N5LZ43NQ3DG/action/replication_record"}},"created_at":"2026-07-05T11:11:44.034978+00:00","updated_at":"2026-07-05T11:11:44.034978+00:00"}