{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VEQ7K2DEBKSXYVBMEAVITLSKYH","short_pith_number":"pith:VEQ7K2DE","canonical_record":{"source":{"id":"1809.02790","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-08T11:54:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f05cd0ff27930a6863e53f599f24454d37740717a97dd522ede6d8e4a7a66d69","abstract_canon_sha256":"ddeaba908df36a0329ff74deeec33e74b063303ca7c0e9ca70bbb49c3e043352"},"schema_version":"1.0"},"canonical_sha256":"a921f568640aa57c542c202a89ae4ac1c4d676b02b5a6f4e4f30ff488f6c8b8a","source":{"kind":"arxiv","id":"1809.02790","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02790","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02790v4","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02790","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"pith_short_12","alias_value":"VEQ7K2DEBKSX","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VEQ7K2DEBKSXYVBM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VEQ7K2DE","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VEQ7K2DEBKSXYVBMEAVITLSKYH","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02790","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-08T11:54:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f05cd0ff27930a6863e53f599f24454d37740717a97dd522ede6d8e4a7a66d69","abstract_canon_sha256":"ddeaba908df36a0329ff74deeec33e74b063303ca7c0e9ca70bbb49c3e043352"},"schema_version":"1.0"},"canonical_sha256":"a921f568640aa57c542c202a89ae4ac1c4d676b02b5a6f4e4f30ff488f6c8b8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:46.722787Z","signature_b64":"KfmBT54U+LyaElAGQWHeoLP4hQ8LJewOKQ2px0S7dTMNCUDn1ArsoCHJQrbIfAeqdyELL5EIvAMCzqnmFGfCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a921f568640aa57c542c202a89ae4ac1c4d676b02b5a6f4e4f30ff488f6c8b8a","last_reissued_at":"2026-05-17T23:45:46.722216Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:46.722216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02790","source_version":4,"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-17T23:45:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kAi2Sz1KKrt267O+Q7E7gpOIdidJmCRA0nKFKmxmR4PNnpCt9Oz6ZvqeWK26rCsTtIMlQCCrZ/bE5W9juLPpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:56:35.108559Z"},"content_sha256":"2fcab918f874e3ce06e36633ad09945ff2b2500bd5f01f16ce24db9f39f49cf8","schema_version":"1.0","event_id":"sha256:2fcab918f874e3ce06e36633ad09945ff2b2500bd5f01f16ce24db9f39f49cf8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VEQ7K2DEBKSXYVBMEAVITLSKYH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Lower The Simpler: Simplifying Hierarchical Recurrent Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Chao Wang, Hui Jiang","submitted_at":"2018-09-08T11:54:09Z","abstract_excerpt":"To improve the training efficiency of hierarchical recurrent models without compromising their performance, we propose a strategy named as `the lower the simpler', which is to simplify the baseline models by making the lower layers simpler than the upper layers. We carry out this strategy to simplify two typical hierarchical recurrent models, namely Hierarchical Recurrent Encoder-Decoder (HRED) and R-NET, whose basic building block is GRU. Specifically, we propose Scalar Gated Unit (SGU), which is a simplified variant of GRU, and use it to replace the GRUs at the middle layers of HRED and R-NE"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02790","kind":"arxiv","version":4},"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-17T23:45:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CaK3E8sApNLXF/gZZiipoEACM7tSrGfzaOwQs3mm3CQgqhx6lD9sQN74HLq5lAnLtAYZTjQxg7jcgHuIrAPoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:56:35.108904Z"},"content_sha256":"c315b47bf856d7776910dc8779f902959156e46bb180258ae7d60814a1b31d3b","schema_version":"1.0","event_id":"sha256:c315b47bf856d7776910dc8779f902959156e46bb180258ae7d60814a1b31d3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VEQ7K2DEBKSXYVBMEAVITLSKYH/bundle.json","state_url":"https://pith.science/pith/VEQ7K2DEBKSXYVBMEAVITLSKYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VEQ7K2DEBKSXYVBMEAVITLSKYH/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-03T19:56:35Z","links":{"resolver":"https://pith.science/pith/VEQ7K2DEBKSXYVBMEAVITLSKYH","bundle":"https://pith.science/pith/VEQ7K2DEBKSXYVBMEAVITLSKYH/bundle.json","state":"https://pith.science/pith/VEQ7K2DEBKSXYVBMEAVITLSKYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VEQ7K2DEBKSXYVBMEAVITLSKYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VEQ7K2DEBKSXYVBMEAVITLSKYH","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":"ddeaba908df36a0329ff74deeec33e74b063303ca7c0e9ca70bbb49c3e043352","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-08T11:54:09Z","title_canon_sha256":"f05cd0ff27930a6863e53f599f24454d37740717a97dd522ede6d8e4a7a66d69"},"schema_version":"1.0","source":{"id":"1809.02790","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02790","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02790v4","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02790","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"pith_short_12","alias_value":"VEQ7K2DEBKSX","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VEQ7K2DEBKSXYVBM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VEQ7K2DE","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:c315b47bf856d7776910dc8779f902959156e46bb180258ae7d60814a1b31d3b","target":"graph","created_at":"2026-05-17T23:45:46Z","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":"To improve the training efficiency of hierarchical recurrent models without compromising their performance, we propose a strategy named as `the lower the simpler', which is to simplify the baseline models by making the lower layers simpler than the upper layers. We carry out this strategy to simplify two typical hierarchical recurrent models, namely Hierarchical Recurrent Encoder-Decoder (HRED) and R-NET, whose basic building block is GRU. Specifically, we propose Scalar Gated Unit (SGU), which is a simplified variant of GRU, and use it to replace the GRUs at the middle layers of HRED and R-NE","authors_text":"Chao Wang, Hui Jiang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-08T11:54:09Z","title":"The Lower The Simpler: Simplifying Hierarchical Recurrent Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02790","kind":"arxiv","version":4},"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:2fcab918f874e3ce06e36633ad09945ff2b2500bd5f01f16ce24db9f39f49cf8","target":"record","created_at":"2026-05-17T23:45:46Z","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":"ddeaba908df36a0329ff74deeec33e74b063303ca7c0e9ca70bbb49c3e043352","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-09-08T11:54:09Z","title_canon_sha256":"f05cd0ff27930a6863e53f599f24454d37740717a97dd522ede6d8e4a7a66d69"},"schema_version":"1.0","source":{"id":"1809.02790","kind":"arxiv","version":4}},"canonical_sha256":"a921f568640aa57c542c202a89ae4ac1c4d676b02b5a6f4e4f30ff488f6c8b8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a921f568640aa57c542c202a89ae4ac1c4d676b02b5a6f4e4f30ff488f6c8b8a","first_computed_at":"2026-05-17T23:45:46.722216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:46.722216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KfmBT54U+LyaElAGQWHeoLP4hQ8LJewOKQ2px0S7dTMNCUDn1ArsoCHJQrbIfAeqdyELL5EIvAMCzqnmFGfCDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:46.722787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02790","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fcab918f874e3ce06e36633ad09945ff2b2500bd5f01f16ce24db9f39f49cf8","sha256:c315b47bf856d7776910dc8779f902959156e46bb180258ae7d60814a1b31d3b"],"state_sha256":"c0fac8255aab1ec71c3c1b870ee30237cf00e0c005f45049f4bcbb90c90b0144"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HKDcv6Turx28MbPJIaeumgtk+V1bl14nUgc8IECCemAHwMg/0b8th9o66vd1z3snS569CB5GsNmbgiV5vAE2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:56:35.110854Z","bundle_sha256":"280c3850ffee5907f263f5029255b8e3894f4a841116a42757930aa855056e50"}}