{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WWSI5OSKXMB75EPEESMX4SPADF","short_pith_number":"pith:WWSI5OSK","schema_version":"1.0","canonical_sha256":"b5a48eba4abb03fe91e424997e49e01963df97645d0dccb924ef277ee54da314","source":{"kind":"arxiv","id":"1511.00060","version":3},"attestation_state":"computed","paper":{"title":"Top-down Tree Long Short-Term Memory Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Liang Lu, Mirella Lapata, Xingxing Zhang","submitted_at":"2015-10-31T02:05:28Z","abstract_excerpt":"Long Short-Term Memory (LSTM) networks, a type of recurrent neural network with a more complex computational unit, have been successfully applied to a variety of sequence modeling tasks. In this paper we develop Tree Long Short-Term Memory (TreeLSTM), a neural network model based on LSTM, which is designed to predict a tree rather than a linear sequence. TreeLSTM defines the probability of a sentence by estimating the generation probability of its dependency tree. At each time step, a node is generated based on the representation of the generated sub-tree. We further enhance the modeling power"},"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":"1511.00060","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-10-31T02:05:28Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1fabf515db6142ebf966cbdfa8dd711aca74eccfa93a90185eb77071791f81ee","abstract_canon_sha256":"109a07ddbd5dd6767cb5b96573bdeb861d9c2987b6db1d8cc726e541931f2a75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:52.304376Z","signature_b64":"qW8xpWYGek/6U9yCN+bJUlalCIHMucIqQPPV5W0oaPaLtY8WDDVfT56L3RSS5cLxNN2WIJhqmwtIzzzo6stCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5a48eba4abb03fe91e424997e49e01963df97645d0dccb924ef277ee54da314","last_reissued_at":"2026-05-18T01:17:52.303646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:52.303646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Top-down Tree Long Short-Term Memory Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Liang Lu, Mirella Lapata, Xingxing Zhang","submitted_at":"2015-10-31T02:05:28Z","abstract_excerpt":"Long Short-Term Memory (LSTM) networks, a type of recurrent neural network with a more complex computational unit, have been successfully applied to a variety of sequence modeling tasks. In this paper we develop Tree Long Short-Term Memory (TreeLSTM), a neural network model based on LSTM, which is designed to predict a tree rather than a linear sequence. TreeLSTM defines the probability of a sentence by estimating the generation probability of its dependency tree. At each time step, a node is generated based on the representation of the generated sub-tree. We further enhance the modeling power"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00060","kind":"arxiv","version":3},"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":"1511.00060","created_at":"2026-05-18T01:17:52.303767+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.00060v3","created_at":"2026-05-18T01:17:52.303767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00060","created_at":"2026-05-18T01:17:52.303767+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWSI5OSKXMB7","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWSI5OSKXMB75EPE","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWSI5OSK","created_at":"2026-05-18T12:29:47.479230+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/WWSI5OSKXMB75EPEESMX4SPADF","json":"https://pith.science/pith/WWSI5OSKXMB75EPEESMX4SPADF.json","graph_json":"https://pith.science/api/pith-number/WWSI5OSKXMB75EPEESMX4SPADF/graph.json","events_json":"https://pith.science/api/pith-number/WWSI5OSKXMB75EPEESMX4SPADF/events.json","paper":"https://pith.science/paper/WWSI5OSK"},"agent_actions":{"view_html":"https://pith.science/pith/WWSI5OSKXMB75EPEESMX4SPADF","download_json":"https://pith.science/pith/WWSI5OSKXMB75EPEESMX4SPADF.json","view_paper":"https://pith.science/paper/WWSI5OSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.00060&json=true","fetch_graph":"https://pith.science/api/pith-number/WWSI5OSKXMB75EPEESMX4SPADF/graph.json","fetch_events":"https://pith.science/api/pith-number/WWSI5OSKXMB75EPEESMX4SPADF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWSI5OSKXMB75EPEESMX4SPADF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWSI5OSKXMB75EPEESMX4SPADF/action/storage_attestation","attest_author":"https://pith.science/pith/WWSI5OSKXMB75EPEESMX4SPADF/action/author_attestation","sign_citation":"https://pith.science/pith/WWSI5OSKXMB75EPEESMX4SPADF/action/citation_signature","submit_replication":"https://pith.science/pith/WWSI5OSKXMB75EPEESMX4SPADF/action/replication_record"}},"created_at":"2026-05-18T01:17:52.303767+00:00","updated_at":"2026-05-18T01:17:52.303767+00:00"}