{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JAFRAD7J2ECHWQU6WWP2NRKJ5D","short_pith_number":"pith:JAFRAD7J","schema_version":"1.0","canonical_sha256":"480b100fe9d1047b429eb59fa6c549e8f61ba6ffcd9b1aabae604e9aca1d8198","source":{"kind":"arxiv","id":"1711.10203","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.10203","created_at":"2026-05-18T00:17:59.794594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10203v2","created_at":"2026-05-18T00:17:59.794594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10203","created_at":"2026-05-18T00:17:59.794594+00:00"},{"alias_kind":"pith_short_12","alias_value":"JAFRAD7J2ECH","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"JAFRAD7J2ECHWQU6","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"JAFRAD7J","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.07996","citing_title":"Structured Relational Reasoning for Group Activity Assessment","ref_index":2020,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D","json":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D.json","graph_json":"https://pith.science/api/pith-number/JAFRAD7J2ECHWQU6WWP2NRKJ5D/graph.json","events_json":"https://pith.science/api/pith-number/JAFRAD7J2ECHWQU6WWP2NRKJ5D/events.json","paper":"https://pith.science/paper/JAFRAD7J"},"agent_actions":{"view_html":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D","download_json":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D.json","view_paper":"https://pith.science/paper/JAFRAD7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10203&json=true","fetch_graph":"https://pith.science/api/pith-number/JAFRAD7J2ECHWQU6WWP2NRKJ5D/graph.json","fetch_events":"https://pith.science/api/pith-number/JAFRAD7J2ECHWQU6WWP2NRKJ5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D/action/storage_attestation","attest_author":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D/action/author_attestation","sign_citation":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D/action/citation_signature","submit_replication":"https://pith.science/pith/JAFRAD7J2ECHWQU6WWP2NRKJ5D/action/replication_record"}},"created_at":"2026-05-18T00:17:59.794594+00:00","updated_at":"2026-05-18T00:17:59.794594+00:00"}