{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PFOML7MDI4BJBVTYISZSRULIRI","short_pith_number":"pith:PFOML7MD","schema_version":"1.0","canonical_sha256":"795cc5fd83470290d67844b328d1688a2de7046663b1a5492c76325cb76aba15","source":{"kind":"arxiv","id":"1707.02786","version":4},"attestation_state":"computed","paper":{"title":"Learning to Compose Task-Specific Tree Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jihun Choi, Kang Min Yoo, Sang-goo Lee","submitted_at":"2017-07-10T10:18:08Z","abstract_excerpt":"For years, recursive neural networks (RvNNs) have been shown to be suitable for representing text into fixed-length vectors and achieved good performance on several natural language processing tasks. However, the main drawback of RvNNs is that they require structured input, which makes data preparation and model implementation hard. In this paper, we propose Gumbel Tree-LSTM, a novel tree-structured long short-term memory architecture that learns how to compose task-specific tree structures only from plain text data efficiently. Our model uses Straight-Through Gumbel-Softmax estimator to decid"},"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":"1707.02786","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-07-10T10:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"23f84e749e7a4808847b851ec44b5e21e6c686f002fe65590f5ce5500c1bf94c","abstract_canon_sha256":"c131e03d74d1d6de606b53a6610076c0344f710f257320972c88cb1cd92e2dd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:01.546244Z","signature_b64":"BBlmqYdRvLPRWfC1umWrM3VoGB06IL55NxclXaEZ81urvEsK2Mkl32mLdA1JuiH/54i5k+By0avSTkux2Z4HAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"795cc5fd83470290d67844b328d1688a2de7046663b1a5492c76325cb76aba15","last_reissued_at":"2026-05-18T00:30:01.545570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:01.545570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Compose Task-Specific Tree Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jihun Choi, Kang Min Yoo, Sang-goo Lee","submitted_at":"2017-07-10T10:18:08Z","abstract_excerpt":"For years, recursive neural networks (RvNNs) have been shown to be suitable for representing text into fixed-length vectors and achieved good performance on several natural language processing tasks. However, the main drawback of RvNNs is that they require structured input, which makes data preparation and model implementation hard. In this paper, we propose Gumbel Tree-LSTM, a novel tree-structured long short-term memory architecture that learns how to compose task-specific tree structures only from plain text data efficiently. Our model uses Straight-Through Gumbel-Softmax estimator to decid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02786","kind":"arxiv","version":4},"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":"1707.02786","created_at":"2026-05-18T00:30:01.545679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02786v4","created_at":"2026-05-18T00:30:01.545679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02786","created_at":"2026-05-18T00:30:01.545679+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFOML7MDI4BJ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFOML7MDI4BJBVTY","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFOML7MD","created_at":"2026-05-18T12:31:37.085036+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/PFOML7MDI4BJBVTYISZSRULIRI","json":"https://pith.science/pith/PFOML7MDI4BJBVTYISZSRULIRI.json","graph_json":"https://pith.science/api/pith-number/PFOML7MDI4BJBVTYISZSRULIRI/graph.json","events_json":"https://pith.science/api/pith-number/PFOML7MDI4BJBVTYISZSRULIRI/events.json","paper":"https://pith.science/paper/PFOML7MD"},"agent_actions":{"view_html":"https://pith.science/pith/PFOML7MDI4BJBVTYISZSRULIRI","download_json":"https://pith.science/pith/PFOML7MDI4BJBVTYISZSRULIRI.json","view_paper":"https://pith.science/paper/PFOML7MD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02786&json=true","fetch_graph":"https://pith.science/api/pith-number/PFOML7MDI4BJBVTYISZSRULIRI/graph.json","fetch_events":"https://pith.science/api/pith-number/PFOML7MDI4BJBVTYISZSRULIRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFOML7MDI4BJBVTYISZSRULIRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFOML7MDI4BJBVTYISZSRULIRI/action/storage_attestation","attest_author":"https://pith.science/pith/PFOML7MDI4BJBVTYISZSRULIRI/action/author_attestation","sign_citation":"https://pith.science/pith/PFOML7MDI4BJBVTYISZSRULIRI/action/citation_signature","submit_replication":"https://pith.science/pith/PFOML7MDI4BJBVTYISZSRULIRI/action/replication_record"}},"created_at":"2026-05-18T00:30:01.545679+00:00","updated_at":"2026-05-18T00:30:01.545679+00:00"}