{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:2XFKAVV4RPZPVD7VRHP2Z7DLXH","short_pith_number":"pith:2XFKAVV4","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"},"canonical_sha256":"d5caa056bc8bf2fa8ff589dfacfc6bb9e7188dccd8a975fc03932530ed1b9089","source":{"kind":"arxiv","id":"2111.14031","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.14031","created_at":"2026-07-05T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"2111.14031v1","created_at":"2026-07-05T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14031","created_at":"2026-07-05T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"2XFKAVV4RPZP","created_at":"2026-07-05T03:35:38Z"},{"alias_kind":"pith_short_16","alias_value":"2XFKAVV4RPZPVD7V","created_at":"2026-07-05T03:35:38Z"},{"alias_kind":"pith_short_8","alias_value":"2XFKAVV4","created_at":"2026-07-05T03:35:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:2XFKAVV4RPZPVD7VRHP2Z7DLXH","target":"record","payload":{"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"},"canonical_sha256":"d5caa056bc8bf2fa8ff589dfacfc6bb9e7188dccd8a975fc03932530ed1b9089","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"},"source_kind":"arxiv","source_id":"2111.14031","source_version":1,"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-07-05T03:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7CrCxRDPPUbNuW67eKJ7VLsJEF9o08zgPGE4Lew23/RhSvqUYGJjvUpofcuXcmyoZM52lSBJF/ctbUFxir/EAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:32:31.831228Z"},"content_sha256":"4a5320253120571f5b26833c798d8efa2cdb2fd18257895f2a44aa9e5ee317cc","schema_version":"1.0","event_id":"sha256:4a5320253120571f5b26833c798d8efa2cdb2fd18257895f2a44aa9e5ee317cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:2XFKAVV4RPZPVD7VRHP2Z7DLXH","target":"graph","payload":{"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"},"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-07-05T03:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnt7EJ8FBduX/O6ItaU4cEWPYHpKoYXdo492+Rbvk9DZMHP41+kfeqkHC5xk/uO9gEFrykpFITWzr48CZPcMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:32:31.831611Z"},"content_sha256":"63141e6ad90d0108e7456143abda9492c2d20fa544ce9d4ca43b2020ab149dbc","schema_version":"1.0","event_id":"sha256:63141e6ad90d0108e7456143abda9492c2d20fa544ce9d4ca43b2020ab149dbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH/bundle.json","state_url":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH/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-07-07T12:32:31Z","links":{"resolver":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH","bundle":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH/bundle.json","state":"https://pith.science/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2XFKAVV4RPZPVD7VRHP2Z7DLXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:2XFKAVV4RPZPVD7VRHP2Z7DLXH","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":"61de36c680f910504de7a63dc8219d653e2832d6d641189c970bb24e8a9bc192","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-11-28T03:08:06Z","title_canon_sha256":"db6d7cb954a049cd4b257213a4b890bd9acbbf5619a6af5a714372ff419483c6"},"schema_version":"1.0","source":{"id":"2111.14031","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.14031","created_at":"2026-07-05T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"2111.14031v1","created_at":"2026-07-05T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.14031","created_at":"2026-07-05T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"2XFKAVV4RPZP","created_at":"2026-07-05T03:35:38Z"},{"alias_kind":"pith_short_16","alias_value":"2XFKAVV4RPZPVD7V","created_at":"2026-07-05T03:35:38Z"},{"alias_kind":"pith_short_8","alias_value":"2XFKAVV4","created_at":"2026-07-05T03:35:38Z"}],"graph_snapshots":[{"event_id":"sha256:63141e6ad90d0108e7456143abda9492c2d20fa544ce9d4ca43b2020ab149dbc","target":"graph","created_at":"2026-07-05T03:35:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.14031/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alvin Chan, Bill Tuck Weng Pung","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-11-28T03:08:06Z","title":"FastTrees: Parallel Latent Tree-Induction for Faster Sequence Encoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.14031","kind":"arxiv","version":1},"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:4a5320253120571f5b26833c798d8efa2cdb2fd18257895f2a44aa9e5ee317cc","target":"record","created_at":"2026-07-05T03:35:38Z","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":"61de36c680f910504de7a63dc8219d653e2832d6d641189c970bb24e8a9bc192","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-11-28T03:08:06Z","title_canon_sha256":"db6d7cb954a049cd4b257213a4b890bd9acbbf5619a6af5a714372ff419483c6"},"schema_version":"1.0","source":{"id":"2111.14031","kind":"arxiv","version":1}},"canonical_sha256":"d5caa056bc8bf2fa8ff589dfacfc6bb9e7188dccd8a975fc03932530ed1b9089","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5caa056bc8bf2fa8ff589dfacfc6bb9e7188dccd8a975fc03932530ed1b9089","first_computed_at":"2026-07-05T03:35:38.426199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:35:38.426199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LvPZuF7JmUClCAwS9g5oWtwcksCZq0gxFDxQyZn5DKEqWPBYgunF5WcZ1xLdzryKcPrYiDhaNI8Jrby6YfUdDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:35:38.426640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.14031","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a5320253120571f5b26833c798d8efa2cdb2fd18257895f2a44aa9e5ee317cc","sha256:63141e6ad90d0108e7456143abda9492c2d20fa544ce9d4ca43b2020ab149dbc"],"state_sha256":"f4213e088473d9935e570959662c4aed91ec2a2416fd35d55fc7117d7c226a92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4Ofmc7QueycF6Prr8gGJf2GtvZPkI61he6cYfBzYidMz5VDeA5pmBgAWWcbruEf43qNWHUkg/tFIJUHZdPmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T12:32:31.833547Z","bundle_sha256":"94ae8d65ca12b9b4518464fbc9da4ec4f2140a5c78f129cfaf04afa4cc8c3e21"}}