{"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":"/paper/improved-semantic-representations-from-tree","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","arxiv_id":"1503.00075","date":"2015-02-28","proceeding":"IJCNLP 2015 7","authors":["Kai Sheng Tai","Richard Socher","Christopher D. Manning"],"abstract":"Because of their superior ability to preserve sequence information over time,\nLong Short-Term Memory (LSTM) networks, a type of recurrent neural network with\na more complex computational unit, have obtained strong results on a variety of\nsequence modeling tasks. The only underlying LSTM structure that has been\nexplored so far is a linear chain. However, natural language exhibits syntactic\nproperties that would naturally combine words to phrases. We introduce the\nTree-LSTM, a generalization of LSTMs to tree-structured network topologies.\nTree-LSTMs outperform all existing systems and strong LSTM baselines on two\ntasks: predicting the semantic relatedness of two sentences (SemEval 2014, Task\n1) and sentiment classification (Stanford Sentiment Treebank).","url_abs":"http://arxiv.org/abs/1503.00075v3","url_pdf":"http://arxiv.org/pdf/1503.00075v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/stanfordnlp/treelstm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"torch","reach":{"status":"ok","spdx":"GPL-2.0"}},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/EmilReinert/DeepLearningPipelines","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/Vivswan/Sentiment-Analysis-TreeLSTM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/dasguptar/treelstm.pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/inyukwo1/tree-lstm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/jayanti-prasad/TreeLSTM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/munashe5/SemanticTreeLSTM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/rohitguptacs/ReVal","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"torch","reach":{"status":"ok","spdx":"GPL-2.0"}},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/tensorflow/fold","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/tomekkorbak/treehopper","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/ttpro1995/TreeLSTMSentiment","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/vastsak/tree_structured_gru","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/zxk19981227/LSTM-SST","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/Mind23-2/MindCode-17","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":{"status":"ok"}},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/tree_lstm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"improved-semantic-representations-from-tree","repo_url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/tree_lstm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"semantic-similarity","task_name":"Semantic Similarity"},{"task_slug":"sentiment-analysis","task_name":"Sentiment Analysis"},{"task_slug":"sentiment-classification","task_name":"Sentiment Classification"}],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/semantic-similarity-on-sick","task":"Semantic Similarity","dataset":"SICK","model":"Dependency Tree-LSTM (Tai et al., 2015)","rank_in_archive_order":1,"of":5,"metrics":{"MSE":"0.2532","Pearson Correlation":"0.8676","Spearman Correlation":"0.8083"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-similarity-on-sick","task":"Semantic Similarity","dataset":"SICK","model":"Bidirectional LSTM (Tai et al., 2015)","rank_in_archive_order":3,"of":5,"metrics":{"MSE":"0.2736","Pearson Correlation":"0.8567","Spearman Correlation":"0.7966"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-similarity-on-sick","task":"Semantic Similarity","dataset":"SICK","model":"LSTM (Tai et al., 2015)","rank_in_archive_order":4,"of":5,"metrics":{"MSE":"0.2831","Pearson Correlation":"0.8528","Spearman Correlation":"0.7911"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-sst-2-binary","task":"Sentiment Analysis","dataset":"SST-2 Binary classification","model":"Consistency Tree LSTM with tuned Glove vectors [tai2015improved]","rank_in_archive_order":68,"of":87,"metrics":{"Accuracy":"88.0"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-sst-2-binary","task":"Sentiment Analysis","dataset":"SST-2 Binary classification","model":"2-layer LSTM [tai2015improved]","rank_in_archive_order":77,"of":87,"metrics":{"Accuracy":"86.3"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-sst-5-fine-grained","task":"Sentiment Analysis","dataset":"SST-5 Fine-grained classification","model":"Constituency Tree-LSTM","rank_in_archive_order":17,"of":31,"metrics":{"Accuracy":"51.0"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1503.00075","atlas_url":"https://app.syntology.ai/?focus=1503.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.00075"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1503.00075"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1503.00075"},"call":"get_harvested_code_for_paper(arxiv_id=\"1503.00075\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1503.00075"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1503.00075\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1503.00075"},"call":"get_concepts_for_paper(arxiv_id=\"1503.00075\")"}],"by_repo":[{"repo":"stanfordnlp/treelstm","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"EmilReinert/DeepLearningPipelines","kind":"listed","samples":3,"ran":3,"instrument":3,"unverified":0},{"repo":"Vivswan/Sentiment-Analysis-TreeLSTM","kind":"listed","samples":3,"ran":3,"instrument":3,"unverified":0},{"repo":"dasguptar/treelstm.pytorch","kind":"listed","samples":2,"ran":1,"instrument":0,"unverified":1},{"repo":"inyukwo1/tree-lstm","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jayanti-prasad/TreeLSTM","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"munashe5/SemanticTreeLSTM","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"rohitguptacs/ReVal","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tensorflow/fold","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1702.02181"],"harvested_for_calls":[{"arxiv_id":"1702.02181","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1702.02181"},"call":"get_harvested_code_for_paper(arxiv_id=\"1702.02181\")"}]},{"repo":"tomekkorbak/treehopper","kind":"listed","samples":4,"ran":2,"instrument":0,"unverified":2},{"repo":"ttpro1995/TreeLSTMSentiment","kind":"listed","samples":3,"ran":3,"instrument":0,"unverified":0},{"repo":"vastsak/tree_structured_gru","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zxk19981227/LSTM-SST","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Mind23-2/MindCode-17","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"dmlc/dgl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":6,"harvested_for":["1607.00653","1612.00222","1802.04364","1806.01973","2006.05582","2010.16103"],"harvested_for_calls":[{"arxiv_id":"1607.00653","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.00653"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.00653\")"},{"arxiv_id":"1612.00222","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.00222"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.00222\")"},{"arxiv_id":"1802.04364","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.04364"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.04364\")"},{"arxiv_id":"1806.01973","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.01973"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.01973\")"},{"arxiv_id":"2006.05582","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.05582"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.05582\")"},{"arxiv_id":"2010.16103","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.16103"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.16103\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1503.00075.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1503.00075.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/inyukwo1/tree-lstm","reach":{"status":"ok","spdx":"GPL-3.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/rohitguptacs/ReVal","reach":{"status":"ok","spdx":"GPL-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/tensorflow/fold","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Mind23-2/MindCode-17","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jayanti-prasad/TreeLSTM","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zxk19981227/LSTM-SST","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/munashe5/SemanticTreeLSTM","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/tree_lstm","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/EmilReinert/DeepLearningPipelines","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/stanfordnlp/treelstm","reach":{"status":"ok","spdx":"GPL-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/vastsak/tree_structured_gru","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/tomekkorbak/treehopper","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Vivswan/Sentiment-Analysis-TreeLSTM","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/dasguptar/treelstm.pytorch","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ttpro1995/TreeLSTMSentiment","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/tree_lstm","reach":null}],"summary":{"ran":6,"ran_fixture":2,"ran_draft_wrong":4,"unverified":3},"n_samples":15,"n_ran":12,"n_constructed":0,"n_ran_checked":6,"n_instrument":6,"n_unverified":3,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"listed":{"samples":15,"ran":12,"n_ran_checked":6,"n_instrument":6,"repositories":5}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"official_not_harvested":{"repositories":["stanfordnlp/treelstm"],"harvested_for_other_papers":[0],"samples_from_other_repositories":15,"other_repositories":5,"samples_unlocated":0},"n_pointer_only_for_licence":6,"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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":12,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-26","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"0f1a6ead94a1ebe2","code_sha256_prefix":"0f1a6ead94a1ebe2","entry":"choose_optimizer","repo":"tomekkorbak/treehopper","repo_kind":"listed","path":"treehopper/model/training.py","file_url":"https://github.com/tomekkorbak/treehopper/blob/HEAD/treehopper/model/training.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"args:Args/0/?, model:callable/0/?","fixture_out_type":"Adam","level_recorded_at":"2026-09-26T04:29:16.584584+00:00","code_page":"/code/choose-optimizer","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0f1a6ead94a1ebe2"}},{"code_sha256":"fd3e77b45ce34195","code_sha256_prefix":"fd3e77b45ce34195","entry":"load_constituency_tree","repo":"Vivswan/Sentiment-Analysis-TreeLSTM","repo_kind":"listed","path":"scripts/preprocess-sst.py","file_url":"https://github.com/Vivswan/Sentiment-Analysis-TreeLSTM/blob/HEAD/scripts/preprocess-sst.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"parents:list/1/int, words:list/1/str","fixture_out_type":"ConstTree","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"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)","mcp_get_code":{"code_sha256":"fd3e77b45ce34195"}},{"code_sha256":"48a87dac90a7d495","code_sha256_prefix":"48a87dac90a7d495","entry":"load_dependency_tree","repo":"Vivswan/Sentiment-Analysis-TreeLSTM","repo_kind":"listed","path":"scripts/preprocess-sst.py","file_url":"https://github.com/Vivswan/Sentiment-Analysis-TreeLSTM/blob/HEAD/scripts/preprocess-sst.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"parents:list/1/int","fixture_out_type":"DepTree","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"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)","mcp_get_code":{"code_sha256":"48a87dac90a7d495"}},{"code_sha256":"8817e369ca9baf24","code_sha256_prefix":"8817e369ca9baf24","entry":"load_trees","repo":"Vivswan/Sentiment-Analysis-TreeLSTM","repo_kind":"listed","path":"scripts/preprocess-sst.py","file_url":"https://github.com/Vivswan/Sentiment-Analysis-TreeLSTM/blob/HEAD/scripts/preprocess-sst.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"dirpath:str/0/str","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/load-trees","census":null,"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)","mcp_get_code":{"code_sha256":"8817e369ca9baf24"}},{"code_sha256":"04bd7091604bee59","code_sha256_prefix":"04bd7091604bee59","entry":"map_label_to_target","repo":"dasguptar/treelstm.pytorch","repo_kind":"listed","path":"treelstm/utils.py","file_url":"https://github.com/dasguptar/treelstm.pytorch/blob/HEAD/treelstm/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"label:float/0/float, num_classes:int/0/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-26T04:29:16.584584+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"04bd7091604bee59"}},{"code_sha256":"f55e0209ce694729","code_sha256_prefix":"f55e0209ce694729","entry":"map_label_to_target","repo":"ttpro1995/TreeLSTMSentiment","repo_kind":"listed","path":"utils.py","file_url":"https://github.com/ttpro1995/TreeLSTMSentiment/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"label:float/0/float, num_classes:int/0/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-26T04:29:16.584584+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f55e0209ce694729"}},{"code_sha256":"2c8d4f6f1b8eb9a3","code_sha256_prefix":"2c8d4f6f1b8eb9a3","entry":"map_label_to_target_sentiment","repo":"ttpro1995/TreeLSTMSentiment","repo_kind":"listed","path":"utils.py","file_url":"https://github.com/ttpro1995/TreeLSTMSentiment/blob/HEAD/utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"label:int/0/int, num_classes:int/0/int, fine_grain:bool/0/bool","fixture_out_type":"Tensor","level_recorded_at":"2026-09-26T04:29:16.584584+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2c8d4f6f1b8eb9a3"}},{"code_sha256":"816c1241731833a0","code_sha256_prefix":"816c1241731833a0","entry":"parse_args","repo":"ttpro1995/TreeLSTMSentiment","repo_kind":"listed","path":"config.py","file_url":"https://github.com/ttpro1995/TreeLSTMSentiment/blob/HEAD/config.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"type:int/0/int","fixture_out_type":"Namespace","level_recorded_at":"2026-09-26T04:29:16.584584+00:00","code_page":"/code/parse-args","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"816c1241731833a0"}},{"code_sha256":"bcabec498122625d","code_sha256_prefix":"bcabec498122625d","entry":"parse_args_train","repo":"tomekkorbak/treehopper","repo_kind":"listed","path":"treehopper/config.py","file_url":"https://github.com/tomekkorbak/treehopper/blob/HEAD/treehopper/config.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"parser:NoneType/0/?","fixture_out_type":"Namespace","level_recorded_at":"2026-09-26T04:29:16.584584+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bcabec498122625d"}},{"code_sha256":"55a0de7b0b6428f0","code_sha256_prefix":"55a0de7b0b6428f0","entry":"parse_data","repo":"EmilReinert/DeepLearningPipelines","repo_kind":"listed","path":"workspace/pipelines/defect_prediction.py","file_url":"https://github.com/EmilReinert/DeepLearningPipelines/blob/HEAD/workspace/pipelines/defect_prediction.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"data:list/1/str","fixture_out_type":"list","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/parse-data","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, EmilReinert/DeepLearningPipelines when it was checked","mcp_get_code":{"code_sha256":"55a0de7b0b6428f0"}},{"code_sha256":"33e96662baea2bc4","code_sha256_prefix":"33e96662baea2bc4","entry":"read_file","repo":"EmilReinert/DeepLearningPipelines","repo_kind":"listed","path":"workspace/pipelines/defect_prediction.py","file_url":"https://github.com/EmilReinert/DeepLearningPipelines/blob/HEAD/workspace/pipelines/defect_prediction.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"path:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/read-file","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, EmilReinert/DeepLearningPipelines when it was checked","mcp_get_code":{"code_sha256":"33e96662baea2bc4"}},{"code_sha256":"8041e074f5f2c31b","code_sha256_prefix":"8041e074f5f2c31b","entry":"tidy","repo":"EmilReinert/DeepLearningPipelines","repo_kind":"listed","path":"workspace/pipelines/defect_prediction.py","file_url":"https://github.com/EmilReinert/DeepLearningPipelines/blob/HEAD/workspace/pipelines/defect_prediction.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"files:list/1/str","fixture_out_type":"list","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"8041e074f5f2c31b"},"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, EmilReinert/DeepLearningPipelines when it was checked","mcp_get_code":{"code_sha256":"8041e074f5f2c31b"}},{"code_sha256":"bc4891355c566a35","code_sha256_prefix":"bc4891355c566a35","entry":"load_word_vectors","repo":"dasguptar/treelstm.pytorch","repo_kind":"listed","path":"treelstm/utils.py","file_url":"https://github.com/dasguptar/treelstm.pytorch/blob/HEAD/treelstm/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/load-word-vectors","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bc4891355c566a35"}},{"code_sha256":"83e2ff5af6039f69","code_sha256_prefix":"83e2ff5af6039f69","entry":"set_arguments","repo":"tomekkorbak/treehopper","repo_kind":"listed","path":"treehopper/config.py","file_url":"https://github.com/tomekkorbak/treehopper/blob/HEAD/treehopper/config.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"83e2ff5af6039f69"}},{"code_sha256":"d4a62a05dc3b8ff4","code_sha256_prefix":"d4a62a05dc3b8ff4","entry":"zoneout","repo":"tomekkorbak/treehopper","repo_kind":"listed","path":"treehopper/model/zoneout.py","file_url":"https://github.com/tomekkorbak/treehopper/blob/HEAD/treehopper/model/zoneout.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d4a62a05dc3b8ff4"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b64c5d2e499436493667c8d9d0d4403f3923d213a980ca1c0c6c1ac24b814fca","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}