{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TGWTY5OMVX6VUCW3374PNCMRIE","short_pith_number":"pith:TGWTY5OM","schema_version":"1.0","canonical_sha256":"99ad3c75ccadfd5a0adbdff8f6899141009974118bb1a0771da54c0411d91f67","source":{"kind":"arxiv","id":"1505.05667","version":1},"attestation_state":"computed","paper":{"title":"A Re-ranking Model for Dependency Parser with Recursive Convolutional Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Chenxi Zhu, Xinchi Chen, Xipeng Qiu, Xuanjing Huang","submitted_at":"2015-05-21T10:23:10Z","abstract_excerpt":"In this work, we address the problem to model all the nodes (words or phrases) in a dependency tree with the dense representations. We propose a recursive convolutional neural network (RCNN) architecture to capture syntactic and compositional-semantic representations of phrases and words in a dependency tree. Different with the original recursive neural network, we introduce the convolution and pooling layers, which can model a variety of compositions by the feature maps and choose the most informative compositions by the pooling layers. Based on RCNN, we use a discriminative model to re-rank "},"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":"1505.05667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-05-21T10:23:10Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"9f5a59cfe4258cf1feb9c61b2e2e1b413bc34ce9faf14698f1627e3a28f5ed04","abstract_canon_sha256":"485907c08c5213907a5cc3fcb005c96c0976990d350c74c7d16bce9bbb2f74e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:53.825974Z","signature_b64":"pLQLD/+lQYgXhe5ghE3LPdE6j6+5qTEX7Qxyg7RXLo0V9EvFol5FhIzlGaeSByl6ql122xoqJbfknc4VnZNmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99ad3c75ccadfd5a0adbdff8f6899141009974118bb1a0771da54c0411d91f67","last_reissued_at":"2026-05-18T02:03:53.825392Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:53.825392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Re-ranking Model for Dependency Parser with Recursive Convolutional Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Chenxi Zhu, Xinchi Chen, Xipeng Qiu, Xuanjing Huang","submitted_at":"2015-05-21T10:23:10Z","abstract_excerpt":"In this work, we address the problem to model all the nodes (words or phrases) in a dependency tree with the dense representations. We propose a recursive convolutional neural network (RCNN) architecture to capture syntactic and compositional-semantic representations of phrases and words in a dependency tree. Different with the original recursive neural network, we introduce the convolution and pooling layers, which can model a variety of compositions by the feature maps and choose the most informative compositions by the pooling layers. Based on RCNN, we use a discriminative model to re-rank "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05667","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.05667","created_at":"2026-05-18T02:03:53.825503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05667v1","created_at":"2026-05-18T02:03:53.825503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05667","created_at":"2026-05-18T02:03:53.825503+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGWTY5OMVX6V","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGWTY5OMVX6VUCW3","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGWTY5OM","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TGWTY5OMVX6VUCW3374PNCMRIE","json":"https://pith.science/pith/TGWTY5OMVX6VUCW3374PNCMRIE.json","graph_json":"https://pith.science/api/pith-number/TGWTY5OMVX6VUCW3374PNCMRIE/graph.json","events_json":"https://pith.science/api/pith-number/TGWTY5OMVX6VUCW3374PNCMRIE/events.json","paper":"https://pith.science/paper/TGWTY5OM"},"agent_actions":{"view_html":"https://pith.science/pith/TGWTY5OMVX6VUCW3374PNCMRIE","download_json":"https://pith.science/pith/TGWTY5OMVX6VUCW3374PNCMRIE.json","view_paper":"https://pith.science/paper/TGWTY5OM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05667&json=true","fetch_graph":"https://pith.science/api/pith-number/TGWTY5OMVX6VUCW3374PNCMRIE/graph.json","fetch_events":"https://pith.science/api/pith-number/TGWTY5OMVX6VUCW3374PNCMRIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGWTY5OMVX6VUCW3374PNCMRIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGWTY5OMVX6VUCW3374PNCMRIE/action/storage_attestation","attest_author":"https://pith.science/pith/TGWTY5OMVX6VUCW3374PNCMRIE/action/author_attestation","sign_citation":"https://pith.science/pith/TGWTY5OMVX6VUCW3374PNCMRIE/action/citation_signature","submit_replication":"https://pith.science/pith/TGWTY5OMVX6VUCW3374PNCMRIE/action/replication_record"}},"created_at":"2026-05-18T02:03:53.825503+00:00","updated_at":"2026-05-18T02:03:53.825503+00:00"}