{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YZIOR2NH5KRULISBOT34TCFARR","short_pith_number":"pith:YZIOR2NH","schema_version":"1.0","canonical_sha256":"c650e8e9a7eaa345a24174f7c988a08c7ead229e21be916438622ce7d1fd21a9","source":{"kind":"arxiv","id":"1605.03835","version":1},"attestation_state":"computed","paper":{"title":"Noisy Parallel Approximate Decoding for Conditional Recurrent Language Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Kyunghyun Cho","submitted_at":"2016-05-12T14:39:50Z","abstract_excerpt":"Recent advances in conditional recurrent language modelling have mainly focused on network architectures (e.g., attention mechanism), learning algorithms (e.g., scheduled sampling and sequence-level training) and novel applications (e.g., image/video description generation, speech recognition, etc.) On the other hand, we notice that decoding algorithms/strategies have not been investigated as much, and it has become standard to use greedy or beam search. In this paper, we propose a novel decoding strategy motivated by an earlier observation that nonlinear hidden layers of a deep neural network"},"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":"1605.03835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-12T14:39:50Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"484b4f5cb6e0006868980bbc4308a4ab96a44064478f3668d334521f98d79587","abstract_canon_sha256":"732d2ce8ce6203a01475d2ea395f877af3bcbbe8aa637a48076ff4b9557fc1e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:59.376351Z","signature_b64":"B39wO7g8Vm8Y0zsx5bnBrJ8RFD/x3v7pUH8GLKItkvd1xR4s882AofdJZuwvqrm7ajlPo9P+SD4UqZNT0V19Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c650e8e9a7eaa345a24174f7c988a08c7ead229e21be916438622ce7d1fd21a9","last_reissued_at":"2026-05-18T01:14:59.375682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:59.375682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy Parallel Approximate Decoding for Conditional Recurrent Language Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Kyunghyun Cho","submitted_at":"2016-05-12T14:39:50Z","abstract_excerpt":"Recent advances in conditional recurrent language modelling have mainly focused on network architectures (e.g., attention mechanism), learning algorithms (e.g., scheduled sampling and sequence-level training) and novel applications (e.g., image/video description generation, speech recognition, etc.) On the other hand, we notice that decoding algorithms/strategies have not been investigated as much, and it has become standard to use greedy or beam search. In this paper, we propose a novel decoding strategy motivated by an earlier observation that nonlinear hidden layers of a deep neural network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03835","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.03835","created_at":"2026-05-18T01:14:59.375780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03835v1","created_at":"2026-05-18T01:14:59.375780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03835","created_at":"2026-05-18T01:14:59.375780+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZIOR2NH5KRU","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZIOR2NH5KRULISB","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZIOR2NH","created_at":"2026-05-18T12:30:53.716459+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/YZIOR2NH5KRULISBOT34TCFARR","json":"https://pith.science/pith/YZIOR2NH5KRULISBOT34TCFARR.json","graph_json":"https://pith.science/api/pith-number/YZIOR2NH5KRULISBOT34TCFARR/graph.json","events_json":"https://pith.science/api/pith-number/YZIOR2NH5KRULISBOT34TCFARR/events.json","paper":"https://pith.science/paper/YZIOR2NH"},"agent_actions":{"view_html":"https://pith.science/pith/YZIOR2NH5KRULISBOT34TCFARR","download_json":"https://pith.science/pith/YZIOR2NH5KRULISBOT34TCFARR.json","view_paper":"https://pith.science/paper/YZIOR2NH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03835&json=true","fetch_graph":"https://pith.science/api/pith-number/YZIOR2NH5KRULISBOT34TCFARR/graph.json","fetch_events":"https://pith.science/api/pith-number/YZIOR2NH5KRULISBOT34TCFARR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZIOR2NH5KRULISBOT34TCFARR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZIOR2NH5KRULISBOT34TCFARR/action/storage_attestation","attest_author":"https://pith.science/pith/YZIOR2NH5KRULISBOT34TCFARR/action/author_attestation","sign_citation":"https://pith.science/pith/YZIOR2NH5KRULISBOT34TCFARR/action/citation_signature","submit_replication":"https://pith.science/pith/YZIOR2NH5KRULISBOT34TCFARR/action/replication_record"}},"created_at":"2026-05-18T01:14:59.375780+00:00","updated_at":"2026-05-18T01:14:59.375780+00:00"}