{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2XFKAVV4RPZPVD7VRHP2Z7DLXH","short_pith_number":"pith:2XFKAVV4","schema_version":"1.0","canonical_sha256":"d5caa056bc8bf2fa8ff589dfacfc6bb9e7188dccd8a975fc03932530ed1b9089","source":{"kind":"arxiv","id":"2111.14031","version":1},"attestation_state":"computed","paper":{"title":"FastTrees: Parallel Latent Tree-Induction for Faster Sequence Encoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Alvin Chan, Bill Tuck Weng Pung","submitted_at":"2021-11-28T03:08:06Z","abstract_excerpt":"Inducing latent tree structures from sequential data is an emerging trend in the NLP research landscape today, largely popularized by recent methods such as Gumbel LSTM and Ordered Neurons (ON-LSTM). This paper proposes FASTTREES, a new general purpose neural module for fast sequence encoding. Unlike most previous works that consider recurrence to be necessary for tree induction, our work explores the notion of parallel tree induction, i.e., imbuing our model with hierarchical inductive biases in a parallelizable, non-autoregressive fashion. To this end, our proposed FASTTREES achieves competi"},"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":"2111.14031","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-11-28T03:08:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"db6d7cb954a049cd4b257213a4b890bd9acbbf5619a6af5a714372ff419483c6","abstract_canon_sha256":"61de36c680f910504de7a63dc8219d653e2832d6d641189c970bb24e8a9bc192"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:35:38.426640Z","signature_b64":"LvPZuF7JmUClCAwS9g5oWtwcksCZq0gxFDxQyZn5DKEqWPBYgunF5WcZ1xLdzryKcPrYiDhaNI8Jrby6YfUdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5caa056bc8bf2fa8ff589dfacfc6bb9e7188dccd8a975fc03932530ed1b9089","last_reissued_at":"2026-07-05T03:35:38.426199Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:35:38.426199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FastTrees: Parallel Latent Tree-Induction for Faster Sequence Encoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Alvin Chan, Bill Tuck Weng Pung","submitted_at":"2021-11-28T03:08:06Z","abstract_excerpt":"Inducing latent tree structures from sequential data is an emerging trend in the NLP research landscape today, largely popularized by recent methods such as Gumbel LSTM and Ordered Neurons (ON-LSTM). This paper proposes FASTTREES, a new general purpose neural module for fast sequence encoding. Unlike most previous works that consider recurrence to be necessary for tree induction, our work explores the notion of parallel tree induction, i.e., imbuing our model with hierarchical inductive biases in a parallelizable, non-autoregressive fashion. To this end, our proposed FASTTREES achieves competi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14031","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.14031/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2111.14031","created_at":"2026-07-05T03:35:38.426263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.14031v1","created_at":"2026-07-05T03:35:38.426263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14031","created_at":"2026-07-05T03:35:38.426263+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XFKAVV4RPZP","created_at":"2026-07-05T03:35:38.426263+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XFKAVV4RPZPVD7V","created_at":"2026-07-05T03:35:38.426263+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XFKAVV4","created_at":"2026-07-05T03:35:38.426263+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/2XFKAVV4RPZPVD7VRHP2Z7DLXH","json":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH.json","graph_json":"https://pith.science/api/pith-number/2XFKAVV4RPZPVD7VRHP2Z7DLXH/graph.json","events_json":"https://pith.science/api/pith-number/2XFKAVV4RPZPVD7VRHP2Z7DLXH/events.json","paper":"https://pith.science/paper/2XFKAVV4"},"agent_actions":{"view_html":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH","download_json":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH.json","view_paper":"https://pith.science/paper/2XFKAVV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.14031&json=true","fetch_graph":"https://pith.science/api/pith-number/2XFKAVV4RPZPVD7VRHP2Z7DLXH/graph.json","fetch_events":"https://pith.science/api/pith-number/2XFKAVV4RPZPVD7VRHP2Z7DLXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH/action/storage_attestation","attest_author":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH/action/author_attestation","sign_citation":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH/action/citation_signature","submit_replication":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH/action/replication_record"}},"created_at":"2026-07-05T03:35:38.426263+00:00","updated_at":"2026-07-05T03:35:38.426263+00:00"}