{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ZE3HOWJPNB3CUBIY3CRMZHY3YV","short_pith_number":"pith:ZE3HOWJP","canonical_record":{"source":{"id":"2203.00281","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-03-01T07:54:44Z","cross_cats_sorted":[],"title_canon_sha256":"7a39002f62118ec38b6ab889f2472a2c289747919025e5a8d2676c25690d66b5","abstract_canon_sha256":"684f6dfd635a4ce2fe06b18ce30e80c4f40ab44b25ab56b44ef160d2efaa1c13"},"schema_version":"1.0"},"canonical_sha256":"c93677592f68762a0518d8a2cc9f1bc570e0812bdc32fefeb70349a9f26c53b1","source":{"kind":"arxiv","id":"2203.00281","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.00281","created_at":"2026-07-05T05:12:27Z"},{"alias_kind":"arxiv_version","alias_value":"2203.00281v3","created_at":"2026-07-05T05:12:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00281","created_at":"2026-07-05T05:12:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZE3HOWJPNB3C","created_at":"2026-07-05T05:12:27Z"},{"alias_kind":"pith_short_16","alias_value":"ZE3HOWJPNB3CUBIY","created_at":"2026-07-05T05:12:27Z"},{"alias_kind":"pith_short_8","alias_value":"ZE3HOWJP","created_at":"2026-07-05T05:12:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ZE3HOWJPNB3CUBIY3CRMZHY3YV","target":"record","payload":{"canonical_record":{"source":{"id":"2203.00281","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-03-01T07:54:44Z","cross_cats_sorted":[],"title_canon_sha256":"7a39002f62118ec38b6ab889f2472a2c289747919025e5a8d2676c25690d66b5","abstract_canon_sha256":"684f6dfd635a4ce2fe06b18ce30e80c4f40ab44b25ab56b44ef160d2efaa1c13"},"schema_version":"1.0"},"canonical_sha256":"c93677592f68762a0518d8a2cc9f1bc570e0812bdc32fefeb70349a9f26c53b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:27.704292Z","signature_b64":"6/1clUe3iDGnC6OGd7118PstLQn+IJ7N3lka86GdCriLAuwHDCXFQ0HWp2hfG41NO5LjwDNLCcnscxu4mnnjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c93677592f68762a0518d8a2cc9f1bc570e0812bdc32fefeb70349a9f26c53b1","last_reissued_at":"2026-07-05T05:12:27.703810Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:27.703810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.00281","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-07-05T05:12:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2p/NGFiwnFyrHhrOqtMfs42V6kcSdauMbl+Xa97rSPip7gzNuLe12ZR2sHzAQVWWYP0notAP3r9R4vX28tmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:52:38.216836Z"},"content_sha256":"a67d2c59b54f976afebd6bbe13ea3aa9c29e3ed392c14b500cad8ed5b05cbbde","schema_version":"1.0","event_id":"sha256:a67d2c59b54f976afebd6bbe13ea3aa9c29e3ed392c14b500cad8ed5b05cbbde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ZE3HOWJPNB3CUBIY3CRMZHY3YV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast-R2D2: A Pretrained Recursive Neural Network based on Pruned CKY for Grammar Induction and Text Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Gerard de Melo, Haitao Mi, Liang Li, Xiang Hu","submitted_at":"2022-03-01T07:54:44Z","abstract_excerpt":"Recently CKY-based models show great potential in unsupervised grammar induction thanks to their human-like encoding paradigm, which runs recursively and hierarchically, but requires $O(n^3)$ time-complexity. Recursive Transformer based on Differentiable Trees (R2D2) makes it possible to scale to large language model pre-training even with complex tree encoder by introducing a heuristic pruning method. However, the rule-based pruning approach suffers from local optimum and slow inference issues. In this paper, we fix those issues in a unified method. We propose to use a top-down parser as a mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00281","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.00281/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-05T05:12:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VNVwWvxMHXPpW9jeGTg9e5bZCeETQEJHMFlh+FsINW/GzX8ChX/pDnbseWLi5+OGJxaktlQImN3zfIvMpMhzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:52:38.217353Z"},"content_sha256":"59e3b9e6130e6b093acad93bfecdccbf6df015e41ff24d23c30354d428009d06","schema_version":"1.0","event_id":"sha256:59e3b9e6130e6b093acad93bfecdccbf6df015e41ff24d23c30354d428009d06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZE3HOWJPNB3CUBIY3CRMZHY3YV/bundle.json","state_url":"https://pith.science/pith/ZE3HOWJPNB3CUBIY3CRMZHY3YV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZE3HOWJPNB3CUBIY3CRMZHY3YV/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-08-04T21:52:38Z","links":{"resolver":"https://pith.science/pith/ZE3HOWJPNB3CUBIY3CRMZHY3YV","bundle":"https://pith.science/pith/ZE3HOWJPNB3CUBIY3CRMZHY3YV/bundle.json","state":"https://pith.science/pith/ZE3HOWJPNB3CUBIY3CRMZHY3YV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZE3HOWJPNB3CUBIY3CRMZHY3YV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ZE3HOWJPNB3CUBIY3CRMZHY3YV","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":"684f6dfd635a4ce2fe06b18ce30e80c4f40ab44b25ab56b44ef160d2efaa1c13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-03-01T07:54:44Z","title_canon_sha256":"7a39002f62118ec38b6ab889f2472a2c289747919025e5a8d2676c25690d66b5"},"schema_version":"1.0","source":{"id":"2203.00281","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.00281","created_at":"2026-07-05T05:12:27Z"},{"alias_kind":"arxiv_version","alias_value":"2203.00281v3","created_at":"2026-07-05T05:12:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00281","created_at":"2026-07-05T05:12:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZE3HOWJPNB3C","created_at":"2026-07-05T05:12:27Z"},{"alias_kind":"pith_short_16","alias_value":"ZE3HOWJPNB3CUBIY","created_at":"2026-07-05T05:12:27Z"},{"alias_kind":"pith_short_8","alias_value":"ZE3HOWJP","created_at":"2026-07-05T05:12:27Z"}],"graph_snapshots":[{"event_id":"sha256:59e3b9e6130e6b093acad93bfecdccbf6df015e41ff24d23c30354d428009d06","target":"graph","created_at":"2026-07-05T05:12:27Z","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/2203.00281/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently CKY-based models show great potential in unsupervised grammar induction thanks to their human-like encoding paradigm, which runs recursively and hierarchically, but requires $O(n^3)$ time-complexity. Recursive Transformer based on Differentiable Trees (R2D2) makes it possible to scale to large language model pre-training even with complex tree encoder by introducing a heuristic pruning method. However, the rule-based pruning approach suffers from local optimum and slow inference issues. In this paper, we fix those issues in a unified method. We propose to use a top-down parser as a mo","authors_text":"Gerard de Melo, Haitao Mi, Liang Li, Xiang Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-03-01T07:54:44Z","title":"Fast-R2D2: A Pretrained Recursive Neural Network based on Pruned CKY for Grammar Induction and Text Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00281","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:a67d2c59b54f976afebd6bbe13ea3aa9c29e3ed392c14b500cad8ed5b05cbbde","target":"record","created_at":"2026-07-05T05:12:27Z","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":"684f6dfd635a4ce2fe06b18ce30e80c4f40ab44b25ab56b44ef160d2efaa1c13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-03-01T07:54:44Z","title_canon_sha256":"7a39002f62118ec38b6ab889f2472a2c289747919025e5a8d2676c25690d66b5"},"schema_version":"1.0","source":{"id":"2203.00281","kind":"arxiv","version":3}},"canonical_sha256":"c93677592f68762a0518d8a2cc9f1bc570e0812bdc32fefeb70349a9f26c53b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c93677592f68762a0518d8a2cc9f1bc570e0812bdc32fefeb70349a9f26c53b1","first_computed_at":"2026-07-05T05:12:27.703810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:12:27.703810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6/1clUe3iDGnC6OGd7118PstLQn+IJ7N3lka86GdCriLAuwHDCXFQ0HWp2hfG41NO5LjwDNLCcnscxu4mnnjBg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:12:27.704292Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.00281","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a67d2c59b54f976afebd6bbe13ea3aa9c29e3ed392c14b500cad8ed5b05cbbde","sha256:59e3b9e6130e6b093acad93bfecdccbf6df015e41ff24d23c30354d428009d06"],"state_sha256":"9cec305673e05dc983aaea5f83f5195779e5fb7245b5394047dfac603c73bcd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3JL/fJp63RKNeG+Dl84Y+HgBwyJih5B4mZnrxeduY1p9HD0FGUCDnFEI5+EfS9np8PUqs+1WHcZxnGxMqB7jDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:52:38.268934Z","bundle_sha256":"64b255e024c552e8c9c9a3ab330e5314131735d94d35faf0b17e73e8e0f463f5"}}