{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JAFRAD7J2ECHWQU6WWP2NRKJ5D","short_pith_number":"pith:JAFRAD7J","canonical_record":{"source":{"id":"1711.10203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-28T09:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"8b970dd07dd1c20b34011a64377aea72bf02ca683b8f8251bb55ee10a2a4f637","abstract_canon_sha256":"9b33ce816d2920596047e0c92cbc43dcefe915320342414de0fa205346b9dbfb"},"schema_version":"1.0"},"canonical_sha256":"480b100fe9d1047b429eb59fa6c549e8f61ba6ffcd9b1aabae604e9aca1d8198","source":{"kind":"arxiv","id":"1711.10203","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10203","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10203v2","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10203","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"JAFRAD7J2ECH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JAFRAD7J2ECHWQU6","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JAFRAD7J","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JAFRAD7J2ECHWQU6WWP2NRKJ5D","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-28T09:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"8b970dd07dd1c20b34011a64377aea72bf02ca683b8f8251bb55ee10a2a4f637","abstract_canon_sha256":"9b33ce816d2920596047e0c92cbc43dcefe915320342414de0fa205346b9dbfb"},"schema_version":"1.0"},"canonical_sha256":"480b100fe9d1047b429eb59fa6c549e8f61ba6ffcd9b1aabae604e9aca1d8198","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:59.795047Z","signature_b64":"IyYdIoL5Y6SQg/S6R8rSvPh66pRVO7SyIxESzbcQjfG03CjDE0BlvB5+HAVPYTJFHz/zUqhK536K5Jmq3cGqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"480b100fe9d1047b429eb59fa6c549e8f61ba6ffcd9b1aabae604e9aca1d8198","last_reissued_at":"2026-05-18T00:17:59.794492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:59.794492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10203","source_version":2,"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:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8V+k17kwE5jCukCaTr30C9yTXsKUnn2F2xMZ5gGy0pr/xqLIFkOfJReDa8bGwvPLU3dJxK+dGa/UbgQ+yTUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T10:22:29.994983Z"},"content_sha256":"3aa42707ce08184904f33ad0361f307baa2d21ab8f5e0ec8e29fee2d25f5fb33","schema_version":"1.0","event_id":"sha256:3aa42707ce08184904f33ad0361f307baa2d21ab8f5e0ec8e29fee2d25f5fb33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JAFRAD7J2ECHWQU6WWP2NRKJ5D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Visualisation and 'diagnostic classifiers' reveal how recurrent and recursive neural networks process hierarchical structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dieuwke Hupkes, Sara Veldhoen, Willem Zuidema","submitted_at":"2017-11-28T09:41:34Z","abstract_excerpt":"We investigate how neural networks can learn and process languages with hierarchical, compositional semantics. To this end, we define the artificial task of processing nested arithmetic expressions, and study whether different types of neural networks can learn to compute their meaning. We find that recursive neural networks can find a generalising solution to this problem, and we visualise this solution by breaking it up in three steps: project, sum and squash. As a next step, we investigate recurrent neural networks, and show that a gated recurrent unit, that processes its input incrementall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10203","kind":"arxiv","version":2},"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:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FFDdaZpGdXYC1kg3mDvxhDWD+hQj9P7TYiLf/Q0S76cKys/LAjv3MU5mIGjh1M5qdnyvMcdZ3GV6ZBPFejtbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T10:22:29.995624Z"},"content_sha256":"8961c2e988213cddd6c15d9f68019fdd291a7487b252aacefdbfcabef9680c90","schema_version":"1.0","event_id":"sha256:8961c2e988213cddd6c15d9f68019fdd291a7487b252aacefdbfcabef9680c90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D/bundle.json","state_url":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D/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-08-08T10:22:29Z","links":{"resolver":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D","bundle":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D/bundle.json","state":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JAFRAD7J2ECHWQU6WWP2NRKJ5D","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":"9b33ce816d2920596047e0c92cbc43dcefe915320342414de0fa205346b9dbfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-28T09:41:34Z","title_canon_sha256":"8b970dd07dd1c20b34011a64377aea72bf02ca683b8f8251bb55ee10a2a4f637"},"schema_version":"1.0","source":{"id":"1711.10203","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10203","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10203v2","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10203","created_at":"2026-05-18T00:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"JAFRAD7J2ECH","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JAFRAD7J2ECHWQU6","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JAFRAD7J","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:8961c2e988213cddd6c15d9f68019fdd291a7487b252aacefdbfcabef9680c90","target":"graph","created_at":"2026-05-18T00:17:59Z","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":"We investigate how neural networks can learn and process languages with hierarchical, compositional semantics. To this end, we define the artificial task of processing nested arithmetic expressions, and study whether different types of neural networks can learn to compute their meaning. We find that recursive neural networks can find a generalising solution to this problem, and we visualise this solution by breaking it up in three steps: project, sum and squash. As a next step, we investigate recurrent neural networks, and show that a gated recurrent unit, that processes its input incrementall","authors_text":"Dieuwke Hupkes, Sara Veldhoen, Willem Zuidema","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-28T09:41:34Z","title":"Visualisation and 'diagnostic classifiers' reveal how recurrent and recursive neural networks process hierarchical structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10203","kind":"arxiv","version":2},"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:3aa42707ce08184904f33ad0361f307baa2d21ab8f5e0ec8e29fee2d25f5fb33","target":"record","created_at":"2026-05-18T00:17:59Z","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":"9b33ce816d2920596047e0c92cbc43dcefe915320342414de0fa205346b9dbfb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-11-28T09:41:34Z","title_canon_sha256":"8b970dd07dd1c20b34011a64377aea72bf02ca683b8f8251bb55ee10a2a4f637"},"schema_version":"1.0","source":{"id":"1711.10203","kind":"arxiv","version":2}},"canonical_sha256":"480b100fe9d1047b429eb59fa6c549e8f61ba6ffcd9b1aabae604e9aca1d8198","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"480b100fe9d1047b429eb59fa6c549e8f61ba6ffcd9b1aabae604e9aca1d8198","first_computed_at":"2026-05-18T00:17:59.794492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:59.794492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IyYdIoL5Y6SQg/S6R8rSvPh66pRVO7SyIxESzbcQjfG03CjDE0BlvB5+HAVPYTJFHz/zUqhK536K5Jmq3cGqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:59.795047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10203","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3aa42707ce08184904f33ad0361f307baa2d21ab8f5e0ec8e29fee2d25f5fb33","sha256:8961c2e988213cddd6c15d9f68019fdd291a7487b252aacefdbfcabef9680c90"],"state_sha256":"ebae2841761ef4156c475592ea0ec8e3f20588740bd1cae389c75db173143eb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGX8zs1FZXHimNZkOAeBReNP6UaY0RgepcJq3TwMTQic6TGd/A7ROsTGb2TSsSV9hHmk2e8kVdN/coXx5bFxBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T10:22:30.000253Z","bundle_sha256":"cf0c377674a7d1e45f4cd634c456e77518981ace1f81bb2ac46471ba41db064e"}}