{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/load-trees","entry":"load_trees","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"unverified":1},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2509.20734","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-20734","title":"Probability Distribution Collapse: A Critical Bottleneck to Compact Unsupervised Neural Grammar Induction","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"GIST-IRR/CRNP","path":"utils.py","file_url":"https://github.com/GIST-IRR/CRNP/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, GIST-IRR/CRNP when it was checked","code_sha256":"d258d00327fa6982","code_sha256_prefix":"d258d00327fa6982","mcp_get_code":{"code_sha256":"d258d00327fa6982"}},{"arxiv_id":"1907.02684","arxiv_id_is_arxiv":true,"paper":"/paper/head-driven-phrase-structure-grammar-parsing","title":"Head-Driven Phrase Structure Grammar Parsing on Penn Treebank","date":"2019-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DoodleJZ/HPSG-Neural-Parser","path":"src_division/trees.py","file_url":"https://github.com/DoodleJZ/HPSG-Neural-Parser/blob/HEAD/src_division/trees.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d32f40efd7da15c3","code_sha256_prefix":"d32f40efd7da15c3","mcp_get_code":{"code_sha256":"d32f40efd7da15c3"}},{"arxiv_id":"1805.01052","arxiv_id_is_arxiv":true,"paper":"/paper/constituency-parsing-with-a-self-attentive","title":"Constituency Parsing with a Self-Attentive Encoder","date":"2018-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ringos/nfc-parser","path":"src/analysis/trees.py","file_url":"https://github.com/ringos/nfc-parser/blob/HEAD/src/analysis/trees.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"79f8c62f9471a066","code_sha256_prefix":"79f8c62f9471a066","mcp_get_code":{"code_sha256":"79f8c62f9471a066"}},{"arxiv_id":"1804.07853","arxiv_id_is_arxiv":true,"paper":"/paper/whats-going-on-in-neural-constituency-parsers","title":"What's Going On in Neural Constituency Parsers? An Analysis","date":"2018-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dgaddy/parser-analysis","path":"src/trees.py","file_url":"https://github.com/dgaddy/parser-analysis/blob/HEAD/src/trees.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"08496ab8d64a4e5e","code_sha256_prefix":"08496ab8d64a4e5e","mcp_get_code":{"code_sha256":"08496ab8d64a4e5e"}},{"arxiv_id":"1702.02181","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-with-dynamic-computation-graphs","title":"Deep Learning with Dynamic Computation Graphs","date":"2017-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tensorflow/fold","path":"tensorflow_fold/blocks/examples/sentiment/sentiment.py","file_url":"https://github.com/tensorflow/fold/blob/HEAD/tensorflow_fold/blocks/examples/sentiment/sentiment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"137e0ba52672b4b6","code_sha256_prefix":"137e0ba52672b4b6","mcp_get_code":{"code_sha256":"137e0ba52672b4b6"}},{"arxiv_id":"1503.00075","arxiv_id_is_arxiv":true,"paper":"/paper/improved-semantic-representations-from-tree","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","date":"2015-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vivswan/Sentiment-Analysis-TreeLSTM","path":"scripts/preprocess-sst.py","file_url":"https://github.com/Vivswan/Sentiment-Analysis-TreeLSTM/blob/HEAD/scripts/preprocess-sst.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Vivswan/Sentiment-Analysis-TreeLSTM (NOASSERTION)","code_sha256":"8817e369ca9baf24","code_sha256_prefix":"8817e369ca9baf24","mcp_get_code":{"code_sha256":"8817e369ca9baf24"}},{"arxiv_id":"2021.acl-long.205","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.acl-long.205","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"NP-NET-research/Recursive-Semi-Markov-Model","path":"src_cn/trees.py","file_url":"https://github.com/NP-NET-research/Recursive-Semi-Markov-Model/blob/HEAD/src_cn/trees.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5aa11900408131f7","code_sha256_prefix":"5aa11900408131f7","mcp_get_code":{"code_sha256":"5aa11900408131f7"}}],"record_sha256":"a7d3523f7cd1a916527c126786c61ac99f73ecdaf51a673fe8956047cbb5b72d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}