{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BMDFNM3Z65CXSKIALLRTU6DCED","short_pith_number":"pith:BMDFNM3Z","canonical_record":{"source":{"id":"1607.04492","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-07-15T12:59:01Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e783d49377fcc83318e689bf47ee0ea42e952e1856b6f7a50e0361eca0ab0df4","abstract_canon_sha256":"1856d5c018896606fd08c862483f62a07dec84beda93d8ea711f4d3f71ac6db5"},"schema_version":"1.0"},"canonical_sha256":"0b0656b379f7457929005ae33a786220dded2a8a83914b3c9bcb48f37a680937","source":{"kind":"arxiv","id":"1607.04492","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04492","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04492v2","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04492","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"BMDFNM3Z65CX","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BMDFNM3Z65CXSKIA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BMDFNM3Z","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BMDFNM3Z65CXSKIALLRTU6DCED","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04492","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-07-15T12:59:01Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e783d49377fcc83318e689bf47ee0ea42e952e1856b6f7a50e0361eca0ab0df4","abstract_canon_sha256":"1856d5c018896606fd08c862483f62a07dec84beda93d8ea711f4d3f71ac6db5"},"schema_version":"1.0"},"canonical_sha256":"0b0656b379f7457929005ae33a786220dded2a8a83914b3c9bcb48f37a680937","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:52.050497Z","signature_b64":"2qtXqkrIh5aJZVg+BqazLQsDqCyblspowUSH4WYEpknxOlAh0VWiCqrNMH3ipbCPQ5u5qwBF3FVhMbYNnhnsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b0656b379f7457929005ae33a786220dded2a8a83914b3c9bcb48f37a680937","last_reissued_at":"2026-05-18T00:49:52.050113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:52.050113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04492","source_version":2,"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-18T00:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZdic9cfpg8g36uR7VzUDcJE9AcJQgMSsPpuRwHTSVtzI//bS4olEOjftXZMzkfHoHe46zgrkCUZjGt64S8GCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:44:50.103445Z"},"content_sha256":"06a53153ad91f53009240cfad808b79533a96bdebdf1c4b580a9452486b85350","schema_version":"1.0","event_id":"sha256:06a53153ad91f53009240cfad808b79533a96bdebdf1c4b580a9452486b85350"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BMDFNM3Z65CXSKIALLRTU6DCED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Tree Indexers for Text Understanding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CL","authors_text":"Hong Yu, Tsendsuren Munkhdalai","submitted_at":"2016-07-15T12:59:01Z","abstract_excerpt":"Recurrent neural networks (RNNs) process input text sequentially and model the conditional transition between word tokens. In contrast, the advantages of recursive networks include that they explicitly model the compositionality and the recursive structure of natural language. However, the current recursive architecture is limited by its dependence on syntactic tree. In this paper, we introduce a robust syntactic parsing-independent tree structured model, Neural Tree Indexers (NTI) that provides a middle ground between the sequential RNNs and the syntactic treebased recursive models. NTI const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04492","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"},"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-18T00:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+hXNwkyPMsESB3kK/odbRPrcpHbbuKan2MhHUXXbSr3KVBnQovLV1RThNkkxK2j0d3AtAg+PAH6jpqY+c2zDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:44:50.104187Z"},"content_sha256":"709ffba20ccbe46d4f2fd1461f93833463b18e92ebf6f7fa1852d8d7d2649936","schema_version":"1.0","event_id":"sha256:709ffba20ccbe46d4f2fd1461f93833463b18e92ebf6f7fa1852d8d7d2649936"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BMDFNM3Z65CXSKIALLRTU6DCED/bundle.json","state_url":"https://pith.science/pith/BMDFNM3Z65CXSKIALLRTU6DCED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BMDFNM3Z65CXSKIALLRTU6DCED/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-06-06T14:44:50Z","links":{"resolver":"https://pith.science/pith/BMDFNM3Z65CXSKIALLRTU6DCED","bundle":"https://pith.science/pith/BMDFNM3Z65CXSKIALLRTU6DCED/bundle.json","state":"https://pith.science/pith/BMDFNM3Z65CXSKIALLRTU6DCED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BMDFNM3Z65CXSKIALLRTU6DCED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BMDFNM3Z65CXSKIALLRTU6DCED","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":"1856d5c018896606fd08c862483f62a07dec84beda93d8ea711f4d3f71ac6db5","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-07-15T12:59:01Z","title_canon_sha256":"e783d49377fcc83318e689bf47ee0ea42e952e1856b6f7a50e0361eca0ab0df4"},"schema_version":"1.0","source":{"id":"1607.04492","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04492","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04492v2","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04492","created_at":"2026-05-18T00:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"BMDFNM3Z65CX","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BMDFNM3Z65CXSKIA","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BMDFNM3Z","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:709ffba20ccbe46d4f2fd1461f93833463b18e92ebf6f7fa1852d8d7d2649936","target":"graph","created_at":"2026-05-18T00:49:52Z","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":"Recurrent neural networks (RNNs) process input text sequentially and model the conditional transition between word tokens. In contrast, the advantages of recursive networks include that they explicitly model the compositionality and the recursive structure of natural language. However, the current recursive architecture is limited by its dependence on syntactic tree. In this paper, we introduce a robust syntactic parsing-independent tree structured model, Neural Tree Indexers (NTI) that provides a middle ground between the sequential RNNs and the syntactic treebased recursive models. NTI const","authors_text":"Hong Yu, Tsendsuren Munkhdalai","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-07-15T12:59:01Z","title":"Neural Tree Indexers for Text Understanding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04492","kind":"arxiv","version":2},"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:06a53153ad91f53009240cfad808b79533a96bdebdf1c4b580a9452486b85350","target":"record","created_at":"2026-05-18T00:49:52Z","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":"1856d5c018896606fd08c862483f62a07dec84beda93d8ea711f4d3f71ac6db5","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-07-15T12:59:01Z","title_canon_sha256":"e783d49377fcc83318e689bf47ee0ea42e952e1856b6f7a50e0361eca0ab0df4"},"schema_version":"1.0","source":{"id":"1607.04492","kind":"arxiv","version":2}},"canonical_sha256":"0b0656b379f7457929005ae33a786220dded2a8a83914b3c9bcb48f37a680937","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b0656b379f7457929005ae33a786220dded2a8a83914b3c9bcb48f37a680937","first_computed_at":"2026-05-18T00:49:52.050113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:52.050113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2qtXqkrIh5aJZVg+BqazLQsDqCyblspowUSH4WYEpknxOlAh0VWiCqrNMH3ipbCPQ5u5qwBF3FVhMbYNnhnsCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:52.050497Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04492","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06a53153ad91f53009240cfad808b79533a96bdebdf1c4b580a9452486b85350","sha256:709ffba20ccbe46d4f2fd1461f93833463b18e92ebf6f7fa1852d8d7d2649936"],"state_sha256":"0e7ca178699d1334758381afc2195f8d3fcda0956f61c0160607fd67ffe12410"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YY6FIH6HcVdX2pKprw1uoUAqCl+/UIRQ80/2ZhwbLuMHBcU1o+029Omvb8KzrfW+XJO8Py3aWGxl2DMo8En8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T14:44:50.108633Z","bundle_sha256":"6efa451cd39a6269313996818081861b1e949a87c969969b081a81560f0fc217"}}