{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZKNWXLARD36GKXTVQ6VWOV2EE3","short_pith_number":"pith:ZKNWXLAR","canonical_record":{"source":{"id":"1503.00075","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-02-28T06:31:50Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"c0bb8be94602a98fe393cd773c95aae695f2ba3a7e3eca3a294cd149c680cc95","abstract_canon_sha256":"57919850648b827c1bc0b0e5aea810a73830995c2c82bb11dc0ed6416cbc04ae"},"schema_version":"1.0"},"canonical_sha256":"ca9b6bac111efc655e7587ab67574426e76f927ae141bd0c3b84c095ffe6eca3","source":{"kind":"arxiv","id":"1503.00075","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00075","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00075v3","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00075","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZKNWXLARD36G","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZKNWXLARD36GKXTV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZKNWXLAR","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZKNWXLARD36GKXTVQ6VWOV2EE3","target":"record","payload":{"canonical_record":{"source":{"id":"1503.00075","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-02-28T06:31:50Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"c0bb8be94602a98fe393cd773c95aae695f2ba3a7e3eca3a294cd149c680cc95","abstract_canon_sha256":"57919850648b827c1bc0b0e5aea810a73830995c2c82bb11dc0ed6416cbc04ae"},"schema_version":"1.0"},"canonical_sha256":"ca9b6bac111efc655e7587ab67574426e76f927ae141bd0c3b84c095ffe6eca3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:57.682824Z","signature_b64":"XcllF0LS/LiYV7+SUxC33M82ceezl3lMqacU2oc9cHYCEfTnUC1Ca6ZWEdm+NSY3iiPDGJZj60YCAWk6tfK+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca9b6bac111efc655e7587ab67574426e76f927ae141bd0c3b84c095ffe6eca3","last_reissued_at":"2026-05-18T01:59:57.682303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:57.682303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.00075","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p/sT8KpKm82tr2z1tEDUmJR6si3iXIsMSJpLOs2pAB3T38XKeQMS9K3EbskDTGtf3OQ9B1ZdN7hYmcIdq+9XCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:31:36.141865Z"},"content_sha256":"8aa4d0e3bd5a94338a97490079dff3a820fadcf0d54d2001b4ef78fd33fa0b47","schema_version":"1.0","event_id":"sha256:8aa4d0e3bd5a94338a97490079dff3a820fadcf0d54d2001b4ef78fd33fa0b47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZKNWXLARD36GKXTVQ6VWOV2EE3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Christopher D. Manning, Kai Sheng Tai, Richard Socher","submitted_at":"2015-02-28T06:31:50Z","abstract_excerpt":"Because of their superior ability to preserve sequence information over time, Long Short-Term Memory (LSTM) networks, a type of recurrent neural network with a more complex computational unit, have obtained strong results on a variety of sequence modeling tasks. The only underlying LSTM structure that has been explored so far is a linear chain. However, natural language exhibits syntactic properties that would naturally combine words to phrases. We introduce the Tree-LSTM, a generalization of LSTMs to tree-structured network topologies. Tree-LSTMs outperform all existing systems and strong LST"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00075","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlJApl7/GHOgO82es6UZiP6YbNrAHzV5h/S154ekG+6G6eDprm9o2ufZez6bMI/5I97gPt7px/Ogq0FFLuWcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:31:36.142554Z"},"content_sha256":"1aa8d0462392631dc64ae90f28362c368b8b79e664196160a538ee40ee78f757","schema_version":"1.0","event_id":"sha256:1aa8d0462392631dc64ae90f28362c368b8b79e664196160a538ee40ee78f757"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKNWXLARD36GKXTVQ6VWOV2EE3/bundle.json","state_url":"https://pith.science/pith/ZKNWXLARD36GKXTVQ6VWOV2EE3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKNWXLARD36GKXTVQ6VWOV2EE3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T18:31:36Z","links":{"resolver":"https://pith.science/pith/ZKNWXLARD36GKXTVQ6VWOV2EE3","bundle":"https://pith.science/pith/ZKNWXLARD36GKXTVQ6VWOV2EE3/bundle.json","state":"https://pith.science/pith/ZKNWXLARD36GKXTVQ6VWOV2EE3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKNWXLARD36GKXTVQ6VWOV2EE3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZKNWXLARD36GKXTVQ6VWOV2EE3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"57919850648b827c1bc0b0e5aea810a73830995c2c82bb11dc0ed6416cbc04ae","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-02-28T06:31:50Z","title_canon_sha256":"c0bb8be94602a98fe393cd773c95aae695f2ba3a7e3eca3a294cd149c680cc95"},"schema_version":"1.0","source":{"id":"1503.00075","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00075","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00075v3","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00075","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZKNWXLARD36G","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZKNWXLARD36GKXTV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZKNWXLAR","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:1aa8d0462392631dc64ae90f28362c368b8b79e664196160a538ee40ee78f757","target":"graph","created_at":"2026-05-18T01:59:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Because of their superior ability to preserve sequence information over time, Long Short-Term Memory (LSTM) networks, a type of recurrent neural network with a more complex computational unit, have obtained strong results on a variety of sequence modeling tasks. The only underlying LSTM structure that has been explored so far is a linear chain. However, natural language exhibits syntactic properties that would naturally combine words to phrases. We introduce the Tree-LSTM, a generalization of LSTMs to tree-structured network topologies. Tree-LSTMs outperform all existing systems and strong LST","authors_text":"Christopher D. Manning, Kai Sheng Tai, Richard Socher","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-02-28T06:31:50Z","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00075","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8aa4d0e3bd5a94338a97490079dff3a820fadcf0d54d2001b4ef78fd33fa0b47","target":"record","created_at":"2026-05-18T01:59:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"57919850648b827c1bc0b0e5aea810a73830995c2c82bb11dc0ed6416cbc04ae","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-02-28T06:31:50Z","title_canon_sha256":"c0bb8be94602a98fe393cd773c95aae695f2ba3a7e3eca3a294cd149c680cc95"},"schema_version":"1.0","source":{"id":"1503.00075","kind":"arxiv","version":3}},"canonical_sha256":"ca9b6bac111efc655e7587ab67574426e76f927ae141bd0c3b84c095ffe6eca3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca9b6bac111efc655e7587ab67574426e76f927ae141bd0c3b84c095ffe6eca3","first_computed_at":"2026-05-18T01:59:57.682303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:57.682303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XcllF0LS/LiYV7+SUxC33M82ceezl3lMqacU2oc9cHYCEfTnUC1Ca6ZWEdm+NSY3iiPDGJZj60YCAWk6tfK+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:57.682824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00075","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8aa4d0e3bd5a94338a97490079dff3a820fadcf0d54d2001b4ef78fd33fa0b47","sha256:1aa8d0462392631dc64ae90f28362c368b8b79e664196160a538ee40ee78f757"],"state_sha256":"e1024ca11b149647c567cf4323df7ae7a5fb9d7b6b33616ae986fd3847a540e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBAhdnbJjMQ07Cz++4Y8I/zn7tFEhAMZRCod1tMU6elnibw+BxRM/AmCo1jYaPoZTQ8Jg4hh55RBFDSK2CT7Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:31:36.146101Z","bundle_sha256":"998b08415bfa1963584afc56ccce0a02596daf947edb376bf0a2e36dc07a3548"}}