{"as_of":"2026-07-15T13:02:00Z","canonical_paper_id":"2011.03965","canonical_url":"https://pith.science/paper/2011.03965/integrity","context_digest":"sha256:c3a36f9197950a7c216e8a4e7f6e3e78536887884e71dd70ff591ab4c09a6aca","coverage_summary":[],"findings":[],"findings_empty_copy":"No checks are listed for this paper yet.","findings_observation_state":"no_listed_checks","links":{"arxiv":"https://arxiv.org/abs/2011.03965","bundle_json":"/pith/Q7HXGUB634V6ZTVFHSQ4LC4WAX/bundle.json","citation_record":"/paper/2011.03965/citation-record","evidence":"/evidence","html":"/paper/2011.03965/integrity","integrity_json":"/paper/2011.03965/integrity.json","json":"/paper/2011.03965/integrity.json","legacy_integrity_json":"/pith/2011.03965/integrity.json","paper":"/paper/2011.03965","reference_changes":"/flags?citing=2011.03965"},"paper":{"arxiv_id":"2011.03965","latest_version":1,"primary_cat":"cs.CL","title":"On the Practical Ability of Recurrent Neural Networks to Recognize Hierarchical Languages"},"pith_number":"pith:2020:Q7HXGUB634V6ZTVFHSQ4LC4WAX","pith_short":"Q7HXGUB634V6ZTVFHSQ4LC4WAX","record":{"arxiv_id":"2011.03965","claim":"As of an unrecorded date, Pith completed 0 of 0 listed checks against arXiv:2011.03965. No listed check completed, so this record makes no findings claim.","counts":{"completed":0,"failed":0,"listed":0,"not_collected":0,"not_requested":0,"partial":0,"public_findings_from_completed":0,"skipped":0,"unavailable":0,"withheld":0},"coverage":[],"observed_at":null,"refusal":"This is a record of named checks, not a clean-status claim or a paper verdict.","schema":"pith.integrity.v1"},"schema":"pith.paper-integrity-record.v1","species":"LEDGER"}