{"as_of":"2026-08-16T10:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:11e2bf556ba6b7806ad308131262250d82a39a07f56ba30dd79fe6d1774fc9de","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:16:38.349246Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.07724/citation-record","integrity":"/paper/1908.07724/integrity","json":"/paper/1908.07724/citation-record.json","paper":"/paper/1908.07724"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.202971Z","title":"Long short-term memory,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.202971Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:5a459408bd1c51f197407f7c93d19a3f1373d83ab491fbe1e850c985cfbb511f","observation_id":"0eacded8-335f-4ce3-906e-dc67e11f47ba","resolution":{"observed_at":"2026-08-14T12:16:38.202971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.1078","last_updated":"2014-09-03T00:25:02Z","snapshot_observed_at":"2026-08-15T13:36:27.756066Z","submitted_at":"2014-06-03T17:47:08Z","title":"Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.1078","snapshot_observed_at":"2026-08-14T12:16:38.208782Z","title":"Learning phrase representations using rnn encoder-decoder for statistical machine translation,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.208782Z"},"links":{"cited_paper":"/paper/1406.1078","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:aebddba57a802fc3e9eacc7bbc6ed4cef445614969808321780727cd34ba1d75","observation_id":"2fa94534-679f-4203-b510-99cd85f3caa5","resolution":{"observed_at":"2026-08-14T12:16:38.208782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.00149","last_updated":"2016-02-15T06:25:40Z","snapshot_observed_at":"2026-08-04T16:59:47.843960Z","submitted_at":"2015-10-01T09:03:44Z","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.00149","snapshot_observed_at":"2026-08-14T12:16:38.214316Z","title":"Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.214316Z"},"links":{"cited_paper":"/paper/1510.00149","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:4739e2fa0c22faeac0fe2bde3599ed1d89632d8ed5e8716d446ece259c0a17fe","observation_id":"4e7b6078-1c61-4ccb-bfb1-3fc7fc2a941d","resolution":{"observed_at":"2026-08-14T12:16:38.214316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.834746Z","title":"Learning structured sparsity in deep neural networks,","venue":null,"work_id":"93b68895-c3ad-4db8-bcbb-a8385ce5786d","year":2016},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.220382Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:421390c88df9db8f2a191e51e7dc202e393b0209e56056b6f6e78b96547ce622","observation_id":"f2685695-f2f6-4f3e-b90e-5735259eac0e","resolution":{"observed_at":"2026-08-14T12:16:38.840795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.09282","last_updated":"2020-06-14T19:10:03Z","snapshot_observed_at":"2026-08-14T20:21:05.078282Z","submitted_at":"2017-10-23T20:16:55Z","title":"A Survey of Model Compression and Acceleration for Deep Neural Networks","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.09282","snapshot_observed_at":"2026-08-14T12:16:38.226316Z","title":"A survey of model compression and acceleration for deep neural networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.226316Z"},"links":{"cited_paper":"/paper/1710.09282","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:de89f1b3f0757cf33cd60973812995ae3438bd11c6f07828c2f1405e69c41db6","observation_id":"381989c4-de2e-4ab5-9c19-b171a3b54e97","resolution":{"observed_at":"2026-08-14T12:16:38.226316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.816038Z","title":"On the compression of recurrent neural networks with an application to lvcsr acoustic modeling for embedded speech recognition,","venue":null,"work_id":"8757d98a-36e4-487c-91b9-998f889dc5aa","year":2016},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.232233Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:fe6334bc4ee2c9e2a886993d169278e0a0ebdd2ae25a39d5c693c1efa43abf2d","observation_id":"69ee5b04-ce73-49a3-a965-d32af7d24b46","resolution":{"observed_at":"2026-08-14T12:16:38.822143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.798257Z","title":"Learning compact recurrent neural networks,","venue":null,"work_id":"6ff8a2cf-7c94-4d57-81d7-c5d546e33c78","year":2016},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.238008Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:79c636bae0fe00872a45450ea35f6820ba3323759dbeab3dea86c2a2025dd94e","observation_id":"b9eb5a10-11d7-4eb1-842b-2739d03fad2f","resolution":{"observed_at":"2026-08-14T12:16:38.804025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.779734Z","title":"Compressing recurrent neural network with tensor train,","venue":null,"work_id":"301fce7a-e1bc-4518-ba97-1e19a543785d","year":2017},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.242849Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:b325817e2491f0e437750205dc6434cc3c14904f141b6d22c212d19c3dac018e","observation_id":"29924495-a945-4075-8b0a-a3cd87092ec0","resolution":{"observed_at":"2026-08-14T12:16:38.786523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.762553Z","title":"Compression of recurrent neural networks for efficient language modeling,","venue":null,"work_id":"d5b93b5f-2f67-4d3b-8dea-27b415616576","year":2019},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.248468Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:c7da50936221897f241fa0a1cf95f390566c677116e881535be42ccc04d220a0","observation_id":"e0802646-8e88-4488-b95a-2a5737d434d4","resolution":{"observed_at":"2026-08-14T12:16:38.768383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.253753Z","title":"Dropout: a simple way to prevent neural networks from over- fitting,","venue":null,"work_id":null,"year":1929},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.253753Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:2a93b46bcd1648438f2eca840e8db1de86f3e51eb681deada2fd11a262cdd6c9","observation_id":"d127b940-e080-4e64-99e5-88a628dc6c8f","resolution":{"observed_at":"2026-08-14T12:16:38.253753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1704.04861","last_updated":"2017-04-17T03:57:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-04-17T03:57:34Z","title":"MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1704.04861","snapshot_observed_at":"2026-08-14T12:16:38.259128Z","title":"Mobilenets: Efficient convo- lutional neural networks for mobile vision applications,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.259128Z"},"links":{"cited_paper":"/paper/1704.04861","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:220814d7d94ad8300d1db8c556ba7cc0b7b332ce3ca7398ff2461156ed3e5652","observation_id":"47166e70-c34d-4bd8-b8f9-e76236f777e8","resolution":{"observed_at":"2026-08-14T12:16:38.259128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.731801Z","title":"Shufflenet: An extremely effi- cient convolutional neural network for mobile devices,","venue":null,"work_id":"27715d99-d885-473f-b50d-01a16846cecb","year":2018},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.264572Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:df206a33189fd78f97c8830d323db426340d0c6155aebee9646b13d01440dd63","observation_id":"4db50fac-c361-423d-917c-c55c3f36e8d5","resolution":{"observed_at":"2026-08-14T12:16:38.739448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.714535Z","title":"Con- densenet: An efficient densenet using learned group convolutions,","venue":null,"work_id":"5ce07a17-15b2-4c6a-b3d2-87835aaf0f94","year":2018},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.269301Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:5185a2d23127394f5b479418ea40e1f1ebe16e91e645594ec573e8c107405377","observation_id":"dc7d710e-41b1-41b8-8015-710cc1d7a676","resolution":{"observed_at":"2026-08-14T12:16:38.720031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.275182Z","title":"Long short-term memory recurrent neural network architectures for large scale acoustic modeling,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.275182Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:7d38322f041de7d4cb291461a06f17019b65b0e2bb2d18aa978538fa42fc42a5","observation_id":"80d63c87-40bd-4483-8412-df6d252dc7d5","resolution":{"observed_at":"2026-08-14T12:16:38.275182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1409.2329","last_updated":"2015-02-19T14:46:00Z","snapshot_observed_at":"2026-08-14T23:20:21.606348Z","submitted_at":"2014-09-08T13:08:00Z","title":"Recurrent Neural Network Regularization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.2329","snapshot_observed_at":"2026-08-14T12:16:38.280401Z","title":"Recurrent neural network regularization,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.280401Z"},"links":{"cited_paper":"/paper/1409.2329","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:9d3fc306475bf7bd6ee51f9460cdc75e19da5858c225c0f56b0031a7bced5f58","observation_id":"d1c4451f-29e9-4c4c-af14-641953fbeb22","resolution":{"observed_at":"2026-08-14T12:16:38.280401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.684343Z","title":"An empirical exploration of recurrent network architectures,","venue":null,"work_id":"f87ab916-a104-4801-8923-7acd1b8fabbf","year":2015},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.286562Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:6310de6ae45e47b9e53cb25dbcbd9eb9ce4f89fdd00ec74c6a351d95cd32f87e","observation_id":"7a2b110c-711e-42a1-a2f7-98d375781559","resolution":{"observed_at":"2026-08-14T12:16:38.690008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1503.00075","last_updated":"2015-05-30T06:51:20Z","snapshot_observed_at":"2026-08-14T22:58:16.765701Z","submitted_at":"2015-02-28T06:31:50Z","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.00075","snapshot_observed_at":"2026-08-14T12:16:38.293729Z","title":"Improved semantic represen- tations from tree-structured long short-term memory networks,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.293729Z"},"links":{"cited_paper":"/paper/1503.00075","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:13beba684e77c853f1388f8539481805b2ac2be8a9bc965cd9595a905d619192","observation_id":"3698deca-6c79-4f05-b9b3-af1fe284b4a0","resolution":{"observed_at":"2026-08-14T12:16:38.293729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.667040Z","title":"Lstm: A search space odyssey,","venue":null,"work_id":"067c9b77-3771-4145-9ef3-2f9836850cac","year":2016},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.299702Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:68778ff8f0d557dd82593b7eda903b016878b36fbfdf89a854c3b4ad9ee10e89","observation_id":"0148501b-b588-4e28-be55-e24e7828dfff","resolution":{"observed_at":"2026-08-14T12:16:38.673038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.00525","last_updated":"2019-01-02T20:28:23Z","snapshot_observed_at":"2026-08-15T20:48:29.995666Z","submitted_at":"2019-01-02T20:28:23Z","title":"Performance of Three Slim Variants of The Long Short-Term Memory (LSTM) Layer","version":1},"cited_work":{"arxiv_id":"1901.00525","doi":null,"metadata_source":"pith","pith_arxiv_id":"1901.00525","snapshot_observed_at":"2026-08-14T12:16:38.507439Z","title":"Performance of Three Slim Variants of The Long Short-Term Memory (LSTM) Layer","venue":"cs.NE","work_id":"9aa7b4b6-f78a-4dd4-a90e-94ff7e546c7c","year":2019},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.305445Z"},"links":{"cited_paper":"/paper/1901.00525","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:83decb5103401e041324fd177a6c0b6cb91e8e1218f00b42a51a99b7969a55f7","observation_id":"04daa97c-3342-492f-857b-4ac12f15d7da","resolution":{"observed_at":"2026-08-14T12:16:38.513446Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.10927","last_updated":"2018-12-12T17:18:13Z","snapshot_observed_at":"2026-08-14T18:09:22.644747Z","submitted_at":"2018-10-25T15:27:23Z","title":"Bayesian Compression for Natural Language Processing","version":2},"cited_work":{"arxiv_id":"1810.10927","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.10927","snapshot_observed_at":"2026-08-14T12:16:38.480560Z","title":"Bayesian Compression for Natural Language Processing","venue":"cs.CL","work_id":"96f9feac-12f4-4bc1-85e8-b4600f9bdb28","year":2018},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.310657Z"},"links":{"cited_paper":"/paper/1810.10927","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:7b3315e2c7ab28e53951a1dc998d73a7911077c398ecc73726ca5c61b1e5d9b6","observation_id":"ef7e3fd2-d49a-4a89-8973-a39d34b221d9","resolution":{"observed_at":"2026-08-14T12:16:38.487943Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.648409Z","title":"Context dependent recurrent neural network language model,","venue":null,"work_id":"b3819706-b31b-4789-a26e-62841cdadcd0","year":2012},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.316038Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:30d2fc05e7c1a5fa90d6c50c8e5f1e8a72fbd36ff218bf658ac26606b99cc149","observation_id":"518a9ac0-e97f-434e-ac07-efe8a438c1e0","resolution":{"observed_at":"2026-08-14T12:16:38.653887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.02182","last_updated":"2017-08-07T16:03:44Z","snapshot_observed_at":"2026-08-14T20:42:45.344345Z","submitted_at":"2017-08-07T16:03:44Z","title":"Regularizing and Optimizing LSTM Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.02182","snapshot_observed_at":"2026-08-14T12:16:38.321501Z","title":"Regularizing and optimizing LSTM language models,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.321501Z"},"links":{"cited_paper":"/paper/1708.02182","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:4fa1e98e9a603a0b0ba8fcc370d1fef286eaba3629008c8922952f329ccbefb2","observation_id":"cb28a7ce-8c52-4986-9f75-a4fd28778f57","resolution":{"observed_at":"2026-08-14T12:16:38.321501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:16:38.631551Z","title":"Recurrent neural network based language model,","venue":null,"work_id":"eb199028-5a1d-4cec-852e-e3297cace94d","year":2010},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.326703Z"},"links":{"citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:f4fef31ad69ea23f0e7476e93e3e5604d7950324b897f54258adadd0ba621819","observation_id":"ac29bca7-6987-4884-94d9-c90b15de7a22","resolution":{"observed_at":"2026-08-14T12:16:38.637104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-07-06T05:12:10.387914Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-14T12:16:38.332171Z","title":"Pointer sentinel mixture models,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.332171Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:71756dc5ac49ee9bf778e561669ab6c4bc3637a0b35c570b37f5644dc2633e8f","observation_id":"8c76bcb9-59a2-4201-81e1-baf9d48336aa","resolution":{"observed_at":"2026-08-14T12:16:38.332171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1608.03983","last_updated":"2017-05-03T16:28:09Z","snapshot_observed_at":"2026-07-06T05:06:55.589962Z","submitted_at":"2016-08-13T13:46:05Z","title":"SGDR: Stochastic Gradient Descent with Warm Restarts","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1608.03983","snapshot_observed_at":"2026-08-14T12:16:38.337756Z","title":"Sgdr: Stochastic gradient descent with warm restarts,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.337756Z"},"links":{"cited_paper":"/paper/1608.03983","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:016a61fe7c105c414c3f42a0bc3ae4fa1162bbdff7b828ccf2a5151e070aed74","observation_id":"4823cfd3-4f6e-4751-8efe-c4806139dd40","resolution":{"observed_at":"2026-08-14T12:16:38.337756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1608.05859","last_updated":"2017-02-21T17:50:20Z","snapshot_observed_at":"2026-08-14T21:43:25.095281Z","submitted_at":"2016-08-20T18:32:05Z","title":"Using the Output Embedding to Improve Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1608.05859","snapshot_observed_at":"2026-08-14T12:16:38.344056Z","title":"Using the output embedding to improve language models,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.344056Z"},"links":{"cited_paper":"/paper/1608.05859","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:a58c81400d0f85ee2e26e08275b95935ade23f3ce51883562e771d7a24cabf4a","observation_id":"db7f295b-75cf-486e-8f5f-6a148cb710df","resolution":{"observed_at":"2026-08-14T12:16:38.344056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.01462","last_updated":"2017-03-11T19:13:52Z","snapshot_observed_at":"2026-08-14T21:31:55.712873Z","submitted_at":"2016-11-04T17:36:20Z","title":"Tying Word Vectors and Word Classifiers: A Loss Framework for Language Modeling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01462","snapshot_observed_at":"2026-08-14T12:16:38.349246Z","title":"Tying word vectors and word classifiers: A loss framework for language modeling,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:16:38.349246Z"},"links":{"cited_paper":"/paper/1611.01462","citing_paper":"/paper/1908.07724"},"observation_digest":"sha256:ec60fc3431a6aaed9109476e42624bbf8748abef7101ee858ac11c4a03cb237b","observation_id":"344e73f1-71f9-4b6e-83e0-ba4dcfc7379b","resolution":{"observed_at":"2026-08-14T12:16:38.349246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.07724","last_updated":"2019-11-14T21:52:34Z","latest_version":4,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T02:24:54.780623Z","submitted_at":"2019-08-21T07:12:31Z","title":"Restricted Recurrent Neural Networks"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":2,"verified_fuzzy":11},"total_outbound_references":27},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:1908.07724."}