{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E5REP4LWBH5QJTLLWKCIYE5K5W","short_pith_number":"pith:E5REP4LW","schema_version":"1.0","canonical_sha256":"276247f17609fb04cd6bb2848c13aaedb547c5d5ffcb77f46fa2d43e06c9a93b","source":{"kind":"arxiv","id":"1704.04675","version":4},"attestation_state":"computed","paper":{"title":"Graph Convolutional Encoders for Syntax-aware Neural Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Diego Marcheggiani, Ivan Titov, Jasmijn Bastings, Khalil Sima'an, Wilker Aziz","submitted_at":"2017-04-15T19:04:59Z","abstract_excerpt":"We present a simple and effective approach to incorporating syntactic structure into neural attention-based encoder-decoder models for machine translation. We rely on graph-convolutional networks (GCNs), a recent class of neural networks developed for modeling graph-structured data. Our GCNs use predicted syntactic dependency trees of source sentences to produce representations of words (i.e. hidden states of the encoder) that are sensitive to their syntactic neighborhoods. GCNs take word representations as input and produce word representations as output, so they can easily be incorporated as"},"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":"1704.04675","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-15T19:04:59Z","cross_cats_sorted":[],"title_canon_sha256":"044bf92c76b43ff1473688af8c837a6b4c0d96d5ee878f9bf825e68ae4c07508","abstract_canon_sha256":"c2aa7e1ab6318b8ca073c03c2cb02bd4ec6bae521a61f52889a1549ca097c5a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:21.667811Z","signature_b64":"Dc6E1Swa8jzSVzS6g1zshD7JZdQcroV78nxjwNcirWsmzn2W3wsDRUnAlinUMPuHjCR/f0MD8bMDyOAjeXwbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"276247f17609fb04cd6bb2848c13aaedb547c5d5ffcb77f46fa2d43e06c9a93b","last_reissued_at":"2026-07-05T01:11:21.667350Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:21.667350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Convolutional Encoders for Syntax-aware Neural Machine Translation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Diego Marcheggiani, Ivan Titov, Jasmijn Bastings, Khalil Sima'an, Wilker Aziz","submitted_at":"2017-04-15T19:04:59Z","abstract_excerpt":"We present a simple and effective approach to incorporating syntactic structure into neural attention-based encoder-decoder models for machine translation. We rely on graph-convolutional networks (GCNs), a recent class of neural networks developed for modeling graph-structured data. Our GCNs use predicted syntactic dependency trees of source sentences to produce representations of words (i.e. hidden states of the encoder) that are sensitive to their syntactic neighborhoods. GCNs take word representations as input and produce word representations as output, so they can easily be incorporated as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04675","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1704.04675/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1704.04675","created_at":"2026-07-05T01:11:21.667400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04675v4","created_at":"2026-07-05T01:11:21.667400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04675","created_at":"2026-07-05T01:11:21.667400+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5REP4LWBH5Q","created_at":"2026-07-05T01:11:21.667400+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5REP4LWBH5QJTLL","created_at":"2026-07-05T01:11:21.667400+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5REP4LW","created_at":"2026-07-05T01:11:21.667400+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04942","citing_title":"Reinforcement Learning Based Graph-to-Sequence Model for Natural Question Generation","ref_index":2018,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E5REP4LWBH5QJTLLWKCIYE5K5W","json":"https://pith.science/pith/E5REP4LWBH5QJTLLWKCIYE5K5W.json","graph_json":"https://pith.science/api/pith-number/E5REP4LWBH5QJTLLWKCIYE5K5W/graph.json","events_json":"https://pith.science/api/pith-number/E5REP4LWBH5QJTLLWKCIYE5K5W/events.json","paper":"https://pith.science/paper/E5REP4LW"},"agent_actions":{"view_html":"https://pith.science/pith/E5REP4LWBH5QJTLLWKCIYE5K5W","download_json":"https://pith.science/pith/E5REP4LWBH5QJTLLWKCIYE5K5W.json","view_paper":"https://pith.science/paper/E5REP4LW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04675&json=true","fetch_graph":"https://pith.science/api/pith-number/E5REP4LWBH5QJTLLWKCIYE5K5W/graph.json","fetch_events":"https://pith.science/api/pith-number/E5REP4LWBH5QJTLLWKCIYE5K5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5REP4LWBH5QJTLLWKCIYE5K5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5REP4LWBH5QJTLLWKCIYE5K5W/action/storage_attestation","attest_author":"https://pith.science/pith/E5REP4LWBH5QJTLLWKCIYE5K5W/action/author_attestation","sign_citation":"https://pith.science/pith/E5REP4LWBH5QJTLLWKCIYE5K5W/action/citation_signature","submit_replication":"https://pith.science/pith/E5REP4LWBH5QJTLLWKCIYE5K5W/action/replication_record"}},"created_at":"2026-07-05T01:11:21.667400+00:00","updated_at":"2026-07-05T01:11:21.667400+00:00"}