{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DA56ENYPWGJPQPN3TXZK3XEGYX","short_pith_number":"pith:DA56ENYP","schema_version":"1.0","canonical_sha256":"183be2370fb192f83dbb9df2addc86c5dc8cdbab8cef41632ab5e2e92fc92f75","source":{"kind":"arxiv","id":"1806.04189","version":1},"attestation_state":"computed","paper":{"title":"Navigating with Graph Representations for Fast and Scalable Decoding of Neural Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jianfeng Gao, Minjia Zhang, Wenhan Wang, XiaoDong Liu, Yuxiong He","submitted_at":"2018-06-11T18:57:49Z","abstract_excerpt":"Neural language models (NLMs) have recently gained a renewed interest by achieving state-of-the-art performance across many natural language processing (NLP) tasks. However, NLMs are very computationally demanding largely due to the computational cost of the softmax layer over a large vocabulary. We observe that, in decoding of many NLP tasks, only the probabilities of the top-K hypotheses need to be calculated preciously and K is often much smaller than the vocabulary size. This paper proposes a novel softmax layer approximation algorithm, called Fast Graph Decoder (FGD), which quickly identi"},"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":"1806.04189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-06-11T18:57:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d23b77df390cce2e1a219a25def61bee7f240b703100ba8b420b4f93286d0822","abstract_canon_sha256":"99b542fccc3c99931dcb668c52de80c2d160e3db763bece7a7f90b811af13991"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:36.339867Z","signature_b64":"+ZuOLeEi5dFgVFLenmWdBf/Do1nKVJjTDM10uMvj7TJQRSldNGa1iLYFYocvlBqRHw/CQ+GVRORdKMBp+apbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"183be2370fb192f83dbb9df2addc86c5dc8cdbab8cef41632ab5e2e92fc92f75","last_reissued_at":"2026-05-18T00:13:36.339174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:36.339174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Navigating with Graph Representations for Fast and Scalable Decoding of Neural Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jianfeng Gao, Minjia Zhang, Wenhan Wang, XiaoDong Liu, Yuxiong He","submitted_at":"2018-06-11T18:57:49Z","abstract_excerpt":"Neural language models (NLMs) have recently gained a renewed interest by achieving state-of-the-art performance across many natural language processing (NLP) tasks. However, NLMs are very computationally demanding largely due to the computational cost of the softmax layer over a large vocabulary. We observe that, in decoding of many NLP tasks, only the probabilities of the top-K hypotheses need to be calculated preciously and K is often much smaller than the vocabulary size. This paper proposes a novel softmax layer approximation algorithm, called Fast Graph Decoder (FGD), which quickly identi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04189","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":"1806.04189","created_at":"2026-05-18T00:13:36.339274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04189v1","created_at":"2026-05-18T00:13:36.339274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04189","created_at":"2026-05-18T00:13:36.339274+00:00"},{"alias_kind":"pith_short_12","alias_value":"DA56ENYPWGJP","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DA56ENYPWGJPQPN3","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DA56ENYP","created_at":"2026-05-18T12:32:19.392346+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/DA56ENYPWGJPQPN3TXZK3XEGYX","json":"https://pith.science/pith/DA56ENYPWGJPQPN3TXZK3XEGYX.json","graph_json":"https://pith.science/api/pith-number/DA56ENYPWGJPQPN3TXZK3XEGYX/graph.json","events_json":"https://pith.science/api/pith-number/DA56ENYPWGJPQPN3TXZK3XEGYX/events.json","paper":"https://pith.science/paper/DA56ENYP"},"agent_actions":{"view_html":"https://pith.science/pith/DA56ENYPWGJPQPN3TXZK3XEGYX","download_json":"https://pith.science/pith/DA56ENYPWGJPQPN3TXZK3XEGYX.json","view_paper":"https://pith.science/paper/DA56ENYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04189&json=true","fetch_graph":"https://pith.science/api/pith-number/DA56ENYPWGJPQPN3TXZK3XEGYX/graph.json","fetch_events":"https://pith.science/api/pith-number/DA56ENYPWGJPQPN3TXZK3XEGYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DA56ENYPWGJPQPN3TXZK3XEGYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DA56ENYPWGJPQPN3TXZK3XEGYX/action/storage_attestation","attest_author":"https://pith.science/pith/DA56ENYPWGJPQPN3TXZK3XEGYX/action/author_attestation","sign_citation":"https://pith.science/pith/DA56ENYPWGJPQPN3TXZK3XEGYX/action/citation_signature","submit_replication":"https://pith.science/pith/DA56ENYPWGJPQPN3TXZK3XEGYX/action/replication_record"}},"created_at":"2026-05-18T00:13:36.339274+00:00","updated_at":"2026-05-18T00:13:36.339274+00:00"}