{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LDCTUMOP5PXKDBXVTX2DPS4PSB","short_pith_number":"pith:LDCTUMOP","canonical_record":{"source":{"id":"1707.06130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-19T14:49:35Z","cross_cats_sorted":[],"title_canon_sha256":"5c0ba1c83577e841f5f7d7284dd7f03c0913c620d86fbc08088c010cc50b2eaf","abstract_canon_sha256":"c595ebe35b822a3ba78e810c1c50e2c37b6722bc57ebc07161e8ab553a8012e3"},"schema_version":"1.0"},"canonical_sha256":"58c53a31cfebeea186f59df437cb8f9063ca1e5486506bbb5d420b56e22eeca0","source":{"kind":"arxiv","id":"1707.06130","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06130","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06130v1","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06130","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"pith_short_12","alias_value":"LDCTUMOP5PXK","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LDCTUMOP5PXKDBXV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LDCTUMOP","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LDCTUMOP5PXKDBXVTX2DPS4PSB","target":"record","payload":{"canonical_record":{"source":{"id":"1707.06130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-19T14:49:35Z","cross_cats_sorted":[],"title_canon_sha256":"5c0ba1c83577e841f5f7d7284dd7f03c0913c620d86fbc08088c010cc50b2eaf","abstract_canon_sha256":"c595ebe35b822a3ba78e810c1c50e2c37b6722bc57ebc07161e8ab553a8012e3"},"schema_version":"1.0"},"canonical_sha256":"58c53a31cfebeea186f59df437cb8f9063ca1e5486506bbb5d420b56e22eeca0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:57.562538Z","signature_b64":"/eeTGOSpZggDtdjRgMh1kVsB5YROWeM8F7KsExlVFig02LBAHXK56ujGSZg1lST7LU5zZrzLiMIRc2i2EV0GBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58c53a31cfebeea186f59df437cb8f9063ca1e5486506bbb5d420b56e22eeca0","last_reissued_at":"2026-05-18T00:39:57.561901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:57.561901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.06130","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:39:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7d8uTmvh7Ry0jw4OBAE9BERP5hAZVfdRSha1IhUoY8XWaqtmnGaq3LFmk8L/Acso+6PaVXu9juntqsvW0Qx8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:12:48.220906Z"},"content_sha256":"def0af027419f61f54a67ac2461177db814dea41be524288fd0cdac18d6531e9","schema_version":"1.0","event_id":"sha256:def0af027419f61f54a67ac2461177db814dea41be524288fd0cdac18d6531e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LDCTUMOP5PXKDBXVTX2DPS4PSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Language Modeling using Densely Connected Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Fr\\'ederic Godin, Joni Dambre, Wesley De Neve","submitted_at":"2017-07-19T14:49:35Z","abstract_excerpt":"In this paper, we introduce the novel concept of densely connected layers into recurrent neural networks. We evaluate our proposed architecture on the Penn Treebank language modeling task. We show that we can obtain similar perplexity scores with six times fewer parameters compared to a standard stacked 2-layer LSTM model trained with dropout (Zaremba et al. 2014). In contrast with the current usage of skip connections, we show that densely connecting only a few stacked layers with skip connections already yields significant perplexity reductions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06130","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:39:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrmx1HtsQYjXAk+m3x3niT8pVmp806R9i4K3hPX3RCJlsrZbI2wd8SaN/btqSM+FBsXuU6+7LZ0KmwtVcq33Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:12:48.221244Z"},"content_sha256":"44cfef058f006b739cd51a08da0ebcb537fe510dbc7550b3df966d115b5dcc85","schema_version":"1.0","event_id":"sha256:44cfef058f006b739cd51a08da0ebcb537fe510dbc7550b3df966d115b5dcc85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDCTUMOP5PXKDBXVTX2DPS4PSB/bundle.json","state_url":"https://pith.science/pith/LDCTUMOP5PXKDBXVTX2DPS4PSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDCTUMOP5PXKDBXVTX2DPS4PSB/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-06-24T17:12:48Z","links":{"resolver":"https://pith.science/pith/LDCTUMOP5PXKDBXVTX2DPS4PSB","bundle":"https://pith.science/pith/LDCTUMOP5PXKDBXVTX2DPS4PSB/bundle.json","state":"https://pith.science/pith/LDCTUMOP5PXKDBXVTX2DPS4PSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDCTUMOP5PXKDBXVTX2DPS4PSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LDCTUMOP5PXKDBXVTX2DPS4PSB","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":"c595ebe35b822a3ba78e810c1c50e2c37b6722bc57ebc07161e8ab553a8012e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-19T14:49:35Z","title_canon_sha256":"5c0ba1c83577e841f5f7d7284dd7f03c0913c620d86fbc08088c010cc50b2eaf"},"schema_version":"1.0","source":{"id":"1707.06130","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06130","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06130v1","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06130","created_at":"2026-05-18T00:39:57Z"},{"alias_kind":"pith_short_12","alias_value":"LDCTUMOP5PXK","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LDCTUMOP5PXKDBXV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LDCTUMOP","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:44cfef058f006b739cd51a08da0ebcb537fe510dbc7550b3df966d115b5dcc85","target":"graph","created_at":"2026-05-18T00:39:57Z","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":"In this paper, we introduce the novel concept of densely connected layers into recurrent neural networks. We evaluate our proposed architecture on the Penn Treebank language modeling task. We show that we can obtain similar perplexity scores with six times fewer parameters compared to a standard stacked 2-layer LSTM model trained with dropout (Zaremba et al. 2014). In contrast with the current usage of skip connections, we show that densely connecting only a few stacked layers with skip connections already yields significant perplexity reductions.","authors_text":"Fr\\'ederic Godin, Joni Dambre, Wesley De Neve","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-19T14:49:35Z","title":"Improving Language Modeling using Densely Connected Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06130","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:def0af027419f61f54a67ac2461177db814dea41be524288fd0cdac18d6531e9","target":"record","created_at":"2026-05-18T00:39:57Z","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":"c595ebe35b822a3ba78e810c1c50e2c37b6722bc57ebc07161e8ab553a8012e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-19T14:49:35Z","title_canon_sha256":"5c0ba1c83577e841f5f7d7284dd7f03c0913c620d86fbc08088c010cc50b2eaf"},"schema_version":"1.0","source":{"id":"1707.06130","kind":"arxiv","version":1}},"canonical_sha256":"58c53a31cfebeea186f59df437cb8f9063ca1e5486506bbb5d420b56e22eeca0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58c53a31cfebeea186f59df437cb8f9063ca1e5486506bbb5d420b56e22eeca0","first_computed_at":"2026-05-18T00:39:57.561901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:57.561901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/eeTGOSpZggDtdjRgMh1kVsB5YROWeM8F7KsExlVFig02LBAHXK56ujGSZg1lST7LU5zZrzLiMIRc2i2EV0GBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:57.562538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06130","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:def0af027419f61f54a67ac2461177db814dea41be524288fd0cdac18d6531e9","sha256:44cfef058f006b739cd51a08da0ebcb537fe510dbc7550b3df966d115b5dcc85"],"state_sha256":"fcffcc2fb9a24a2ac9a8c1de727744a37ad9e14a9d2917a179ad5d785be4fe6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XU1zD5Za478i5QHacLQfWVSb5qS546pJ5ZoKvgTnjO39f4xh4+8URPG7ixhMGplZxCOwCzVnEiz3WEgpMG47DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:12:48.223146Z","bundle_sha256":"e56f3a2e7c043d8ce5c68055e25acc31e0f0e0cded9f7a7cd4a30264fb0e9af8"}}