{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SDGBN5LPN5H35343OMIPFSJX2T","short_pith_number":"pith:SDGBN5LP","schema_version":"1.0","canonical_sha256":"90cc16f56f6f4fbeef9b7310f2c937d4edf62ab14789518c879a5b452398aa73","source":{"kind":"arxiv","id":"1606.04289","version":2},"attestation_state":"computed","paper":{"title":"Automatic Text Scoring Using Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Dimitrios Alikaniotis, Helen Yannakoudakis, Marek Rei","submitted_at":"2016-06-14T10:17:27Z","abstract_excerpt":"Automated Text Scoring (ATS) provides a cost-effective and consistent alternative to human marking. However, in order to achieve good performance, the predictive features of the system need to be manually engineered by human experts. We introduce a model that forms word representations by learning the extent to which specific words contribute to the text's score. Using Long-Short Term Memory networks to represent the meaning of texts, we demonstrate that a fully automated framework is able to achieve excellent results over similar approaches. In an attempt to make our results more interpretabl"},"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":"1606.04289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-06-14T10:17:27Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"41515ac45b7cb7b09a97d7ea79f5338834a2d8c9ea177c00cd707da71f8269ef","abstract_canon_sha256":"331cbd1d94475fe552abe45162f84e53fd941c6d3e5422b58d027c2ad40cb0bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:13.876930Z","signature_b64":"n5oqyfoDxqs94y+aNEeK23jcvKxw7jH01f4GLu4pqO+areyBb0i71hqzWdDqeGHDqnD8GL+CTzY5JoIKEUuHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90cc16f56f6f4fbeef9b7310f2c937d4edf62ab14789518c879a5b452398aa73","last_reissued_at":"2026-05-18T00:40:13.876187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:13.876187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Text Scoring Using Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Dimitrios Alikaniotis, Helen Yannakoudakis, Marek Rei","submitted_at":"2016-06-14T10:17:27Z","abstract_excerpt":"Automated Text Scoring (ATS) provides a cost-effective and consistent alternative to human marking. However, in order to achieve good performance, the predictive features of the system need to be manually engineered by human experts. We introduce a model that forms word representations by learning the extent to which specific words contribute to the text's score. Using Long-Short Term Memory networks to represent the meaning of texts, we demonstrate that a fully automated framework is able to achieve excellent results over similar approaches. In an attempt to make our results more interpretabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04289","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":"1606.04289","created_at":"2026-05-18T00:40:13.876306+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04289v2","created_at":"2026-05-18T00:40:13.876306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04289","created_at":"2026-05-18T00:40:13.876306+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDGBN5LPN5H3","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDGBN5LPN5H35343","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDGBN5LP","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07001","citing_title":"Latent Adversarial Defence with Boundary-guided Generation","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SDGBN5LPN5H35343OMIPFSJX2T","json":"https://pith.science/pith/SDGBN5LPN5H35343OMIPFSJX2T.json","graph_json":"https://pith.science/api/pith-number/SDGBN5LPN5H35343OMIPFSJX2T/graph.json","events_json":"https://pith.science/api/pith-number/SDGBN5LPN5H35343OMIPFSJX2T/events.json","paper":"https://pith.science/paper/SDGBN5LP"},"agent_actions":{"view_html":"https://pith.science/pith/SDGBN5LPN5H35343OMIPFSJX2T","download_json":"https://pith.science/pith/SDGBN5LPN5H35343OMIPFSJX2T.json","view_paper":"https://pith.science/paper/SDGBN5LP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04289&json=true","fetch_graph":"https://pith.science/api/pith-number/SDGBN5LPN5H35343OMIPFSJX2T/graph.json","fetch_events":"https://pith.science/api/pith-number/SDGBN5LPN5H35343OMIPFSJX2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDGBN5LPN5H35343OMIPFSJX2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDGBN5LPN5H35343OMIPFSJX2T/action/storage_attestation","attest_author":"https://pith.science/pith/SDGBN5LPN5H35343OMIPFSJX2T/action/author_attestation","sign_citation":"https://pith.science/pith/SDGBN5LPN5H35343OMIPFSJX2T/action/citation_signature","submit_replication":"https://pith.science/pith/SDGBN5LPN5H35343OMIPFSJX2T/action/replication_record"}},"created_at":"2026-05-18T00:40:13.876306+00:00","updated_at":"2026-05-18T00:40:13.876306+00:00"}