{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WDVSSDS5Z7N57JGDW6P5OKINET","short_pith_number":"pith:WDVSSDS5","schema_version":"1.0","canonical_sha256":"b0eb290e5dcfdbdfa4c3b79fd7290d24efe6c62c347411703600f72f22d21d40","source":{"kind":"arxiv","id":"1805.11461","version":1},"attestation_state":"computed","paper":{"title":"Syntactic Dependency Representations in Neural Relation Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Farhad Nooralahzadeh, Lilja {\\O}vrelid","submitted_at":"2018-05-28T16:17:27Z","abstract_excerpt":"We investigate the use of different syntactic dependency representations in a neural relation classification task and compare the CoNLL, Stanford Basic and Universal Dependencies schemes. We further compare with a syntax-agnostic approach and perform an error analysis in order to gain a better understanding of the results."},"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":"1805.11461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-05-28T16:17:27Z","cross_cats_sorted":[],"title_canon_sha256":"f08bdcaabba3619c58a1a9c58cd084e60f0b8c2a9b59b48533948de4b9a32954","abstract_canon_sha256":"cf0a56155b268000d88b5c92675f1fe639753bf49c5c01ce843b96c9f31f6684"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:42.472720Z","signature_b64":"9N+QCPlPsP2pIoJZ7bpf3cYMJdZEGTn8180v2CmVO1LoTUYFQ6pPfb703HarZcWDV9cXlRFgcTkCfcLplm15BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0eb290e5dcfdbdfa4c3b79fd7290d24efe6c62c347411703600f72f22d21d40","last_reissued_at":"2026-05-18T00:14:42.472110Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:42.472110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Syntactic Dependency Representations in Neural Relation Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Farhad Nooralahzadeh, Lilja {\\O}vrelid","submitted_at":"2018-05-28T16:17:27Z","abstract_excerpt":"We investigate the use of different syntactic dependency representations in a neural relation classification task and compare the CoNLL, Stanford Basic and Universal Dependencies schemes. We further compare with a syntax-agnostic approach and perform an error analysis in order to gain a better understanding of the results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11461","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":"1805.11461","created_at":"2026-05-18T00:14:42.472203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11461v1","created_at":"2026-05-18T00:14:42.472203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11461","created_at":"2026-05-18T00:14:42.472203+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDVSSDS5Z7N5","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDVSSDS5Z7N57JGD","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDVSSDS5","created_at":"2026-05-18T12:32:59.047623+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/WDVSSDS5Z7N57JGDW6P5OKINET","json":"https://pith.science/pith/WDVSSDS5Z7N57JGDW6P5OKINET.json","graph_json":"https://pith.science/api/pith-number/WDVSSDS5Z7N57JGDW6P5OKINET/graph.json","events_json":"https://pith.science/api/pith-number/WDVSSDS5Z7N57JGDW6P5OKINET/events.json","paper":"https://pith.science/paper/WDVSSDS5"},"agent_actions":{"view_html":"https://pith.science/pith/WDVSSDS5Z7N57JGDW6P5OKINET","download_json":"https://pith.science/pith/WDVSSDS5Z7N57JGDW6P5OKINET.json","view_paper":"https://pith.science/paper/WDVSSDS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11461&json=true","fetch_graph":"https://pith.science/api/pith-number/WDVSSDS5Z7N57JGDW6P5OKINET/graph.json","fetch_events":"https://pith.science/api/pith-number/WDVSSDS5Z7N57JGDW6P5OKINET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDVSSDS5Z7N57JGDW6P5OKINET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDVSSDS5Z7N57JGDW6P5OKINET/action/storage_attestation","attest_author":"https://pith.science/pith/WDVSSDS5Z7N57JGDW6P5OKINET/action/author_attestation","sign_citation":"https://pith.science/pith/WDVSSDS5Z7N57JGDW6P5OKINET/action/citation_signature","submit_replication":"https://pith.science/pith/WDVSSDS5Z7N57JGDW6P5OKINET/action/replication_record"}},"created_at":"2026-05-18T00:14:42.472203+00:00","updated_at":"2026-05-18T00:14:42.472203+00:00"}