{"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":"/task/code-summarization","name":"Source Code Summarization","slug":"code-summarization","description_markdown":"**Code Summarization** is a task that tries to comprehend code and automatically generate descriptions directly from the source code.\r\n\r\n\r\n<span class=\"description-source\">Source: [Improving Automatic Source Code Summarization via Deep Reinforcement Learning ](https://arxiv.org/abs/1811.07234)</span>","categories":[{"name":"Computer Code","url":"/area/computer-code"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":58,"papers_with_code":39,"benchmarks":9,"benchmark_tables_in_archive":9,"benchmark_tables_shown":9,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":7,"subtasks":1,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/source-code-summarization-on-deepcom-java","slug":"source-code-summarization-on-deepcom-java","dataset":"DeepCom-Java","dataset_url":"/dataset/deepcom-java","rows_in_archive":2,"metrics":["BLEU-4","METEOR"],"first_row_in_archive_order":{"model":"AdaMo-noise","paper_title":"Assemble Foundation Models for Automatic Code Summarization","paper_url":"/paper/assemble-foundation-models-for-automatic-code","paper_date":"2022-01-13","arxiv_id":"2201.05222","code_links":[{"title":"jianguda/afm4acs","url":"https://github.com/jianguda/afm4acs"}],"syntology":null}},{"leaderboard":"/sota/source-code-summarization-on-parallelcorpus","slug":"source-code-summarization-on-parallelcorpus","dataset":"ParallelCorpus-Python","dataset_url":"/dataset/parallelcorpus-python","rows_in_archive":2,"metrics":["BLEU-4","METEOR"],"first_row_in_archive_order":{"model":"AdaMo-noise","paper_title":"Assemble Foundation Models for Automatic Code Summarization","paper_url":"/paper/assemble-foundation-models-for-automatic-code","paper_date":"2022-01-13","arxiv_id":"2201.05222","code_links":[{"title":"jianguda/afm4acs","url":"https://github.com/jianguda/afm4acs"}],"syntology":null}},{"leaderboard":"/sota/code-summarization-on-codesearchnet","slug":"code-summarization-on-codesearchnet","dataset":"CodeSearchNet","dataset_url":"/dataset/codesearchnet","rows_in_archive":1,"metrics":["F1"],"first_row_in_archive_order":{"model":"ContraCode","paper_title":"Contrastive Code Representation Learning","paper_url":"/paper/contrastive-code-representation-learning","paper_date":"2020-07-09","arxiv_id":"2007.04973","code_links":[{"title":"parasj/contracode","url":"https://github.com/parasj/contracode"}],"syntology":null}},{"leaderboard":"/sota/source-code-summarization-on-codesc","slug":"source-code-summarization-on-codesc","dataset":"CoDesc","dataset_url":"/dataset/codesc","rows_in_archive":1,"metrics":["BLEU-4"],"first_row_in_archive_order":{"model":"Transformer","paper_title":"CoDesc: A Large Code-Description Parallel Dataset","paper_url":"/paper/codesc-a-large-code-description-parallel","paper_date":"2021-05-29","arxiv_id":"2105.14220","code_links":[{"title":"csebuetnlp/CoDesc","url":"https://github.com/csebuetnlp/CoDesc"}],"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/codesc-a-large-code-description-parallel#ran","syntology_url":"https://syntology.ai/paper/2105.14220","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14220"}},"official":{"repos":["csebuetnlp/CoDesc"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/source-code-summarization-on-codesearchnet","slug":"source-code-summarization-on-codesearchnet","dataset":"CodeSearchNet - Python","dataset_url":"/dataset/codesearchnet","rows_in_archive":1,"metrics":["BLEU-4","METEOR"],"first_row_in_archive_order":{"model":"AdaMo-basic","paper_title":"Assemble Foundation Models for Automatic Code Summarization","paper_url":"/paper/assemble-foundation-models-for-automatic-code","paper_date":"2022-01-13","arxiv_id":"2201.05222","code_links":[{"title":"jianguda/afm4acs","url":"https://github.com/jianguda/afm4acs"}],"syntology":null}},{"leaderboard":"/sota/source-code-summarization-on-hybrid-deepcom","slug":"source-code-summarization-on-hybrid-deepcom","dataset":"Java scripts","dataset_url":"/dataset/hybrid-deepcom-java","rows_in_archive":1,"metrics":["BLEU-4","METEOR"],"first_row_in_archive_order":{"model":"AdaMo-basic","paper_title":"Assemble Foundation Models for Automatic Code Summarization","paper_url":"/paper/assemble-foundation-models-for-automatic-code","paper_date":"2022-01-13","arxiv_id":"2201.05222","code_links":[{"title":"jianguda/afm4acs","url":"https://github.com/jianguda/afm4acs"}],"syntology":null}},{"leaderboard":"/sota/source-code-summarization-on-summarizing-1","slug":"source-code-summarization-on-summarizing-1","dataset":"Summarizing Source Code using a Neural Attention Model - C#","dataset_url":null,"rows_in_archive":1,"metrics":["Smoothed BLEU-4"],"first_row_in_archive_order":{"model":"CodeTrans-MT-Large","paper_title":"CodeTrans: Towards Cracking the Language of Silicon's Code Through Self-Supervised Deep Learning and High Performance Computing","paper_url":"/paper/codetrans-towards-cracking-the-language-of","paper_date":"2021-04-06","arxiv_id":"2104.02443","code_links":[{"title":"agemagician/CodeTrans","url":"https://github.com/agemagician/CodeTrans"}],"syntology":null}},{"leaderboard":"/sota/source-code-summarization-on-summarizing-2","slug":"source-code-summarization-on-summarizing-2","dataset":"Summarizing Source Code using a Neural Attention Model - Python","dataset_url":null,"rows_in_archive":1,"metrics":["Smoothed BLEU-4"],"first_row_in_archive_order":{"model":"CodeTrans-MT-Base","paper_title":"CodeTrans: Towards Cracking the Language of Silicon's Code Through Self-Supervised Deep Learning and High Performance Computing","paper_url":"/paper/codetrans-towards-cracking-the-language-of","paper_date":"2021-04-06","arxiv_id":"2104.02443","code_links":[{"title":"agemagician/CodeTrans","url":"https://github.com/agemagician/CodeTrans"}],"syntology":null}},{"leaderboard":"/sota/source-code-summarization-on-summarizing-3","slug":"source-code-summarization-on-summarizing-3","dataset":"Summarizing Source Code using a Neural Attention Model - SQL","dataset_url":null,"rows_in_archive":1,"metrics":["Smoothed BLEU-4"],"first_row_in_archive_order":{"model":"CodeTrans-MT-TF-Large","paper_title":"CodeTrans: Towards Cracking the Language of Silicon's Code Through Self-Supervised Deep Learning and High Performance Computing","paper_url":"/paper/codetrans-towards-cracking-the-language-of","paper_date":"2021-04-06","arxiv_id":"2104.02443","code_links":[{"title":"agemagician/CodeTrans","url":"https://github.com/agemagician/CodeTrans"}],"syntology":null}}],"datasets":[{"url":"/dataset/codesearchnet","name":"CodeSearchNet","full_name":"","num_papers_in_archive":308},{"url":"/dataset/staqc","name":"StaQC","full_name":"","num_papers_in_archive":19},{"url":"/dataset/codesc","name":"CoDesc","full_name":"","num_papers_in_archive":4},{"url":"/dataset/summarizing-source-code-using-a-neural","name":"Summarizing Source Code using a Neural Attention Model","full_name":"","num_papers_in_archive":3},{"url":"/dataset/deepcom-java","name":"DeepCom-Java","full_name":"","num_papers_in_archive":2},{"url":"/dataset/hybrid-deepcom-java","name":"Java scripts","full_name":"","num_papers_in_archive":1},{"url":"/dataset/parallelcorpus-python","name":"ParallelCorpus-Python","full_name":"","num_papers_in_archive":1}],"subtasks":[{"url":"/task/method-name-prediction","name":"Method name prediction"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":58,"of":58,"of_with_code":39,"tagged_in_all":58,"counts":{"archive_papers_tagged":58,"with_a_code_link":39,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":58,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/a-transformer-based-approach-for-source-code","slug":"a-transformer-based-approach-for-source-code","title":"A Transformer-based Approach for Source Code Summarization","date":"2020-05-01","arxiv_id":"2005.00653","repositories_listed":9,"syntology":null},{"url":"/paper/recommendations-for-datasets-for-source-code","slug":"recommendations-for-datasets-for-source-code","title":"Recommendations for Datasets for Source Code Summarization","date":"2019-04-04","arxiv_id":"1904.02660","repositories_listed":7,"syntology":null},{"url":"/paper/code2seq-generating-sequences-from-structured","slug":"code2seq-generating-sequences-from-structured","title":"code2seq: Generating Sequences from Structured Representations of Code","date":"2018-08-04","arxiv_id":"1808.01400","repositories_listed":6,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/code2seq-generating-sequences-from-structured#ran","syntology_url":"https://syntology.ai/paper/1808.01400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.01400"}},"official":{"repos":["tech-srl/code2seq"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/structured-neural-summarization","slug":"structured-neural-summarization","title":"Structured Neural Summarization","date":"2018-11-05","arxiv_id":"1811.01824","repositories_listed":3,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/structured-neural-summarization#ran","syntology_url":"https://syntology.ai/paper/1811.01824","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.01824"}},"official":{"repos":["CoderPat/structured-neural-summarization"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/haconvgnn-hierarchical-attention-based","slug":"haconvgnn-hierarchical-attention-based","title":"HAConvGNN: Hierarchical Attention Based Convolutional Graph Neural Network for Code Documentation Generation in Jupyter Notebooks","date":"2021-03-31","arxiv_id":"2104.01002","repositories_listed":2,"syntology":null},{"url":"/paper/unified-pre-training-for-program","slug":"unified-pre-training-for-program","title":"Unified Pre-training for Program Understanding and Generation","date":"2021-03-10","arxiv_id":"2103.06333","repositories_listed":2,"syntology":null},{"url":"/paper/improved-code-summarization-via-a-graph","slug":"improved-code-summarization-via-a-graph","title":"Improved Code Summarization via a Graph Neural Network","date":"2020-04-06","arxiv_id":"2004.02843","repositories_listed":2,"syntology":null},{"url":"/paper/code-generation-as-a-dual-task-of-code","slug":"code-generation-as-a-dual-task-of-code","title":"Code Generation as a Dual Task of Code Summarization","date":"2019-10-14","arxiv_id":"1910.05923","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/code-generation-as-a-dual-task-of-code#ran","syntology_url":"https://syntology.ai/paper/1910.05923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.05923"}},"official":{"repos":["Bolin0215/CSCGDual"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/improving-automatic-source-code-summarization","slug":"improving-automatic-source-code-summarization","title":"Improving Automatic Source Code Summarization via Deep Reinforcement Learning","date":"2018-11-17","arxiv_id":"1811.07234","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-automatic-source-code-summarization#ran","syntology_url":"https://syntology.ai/paper/1811.07234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.07234"}},"official":null}},{"url":"/paper/variational-prefix-tuning-for-diverse-and","slug":"variational-prefix-tuning-for-diverse-and","title":"Variational Prefix Tuning for Diverse and Accurate Code Summarization Using Pre-trained Language Models","date":"2025-05-14","arxiv_id":"2505.09062","repositories_listed":1,"syntology":null},{"url":"/paper/source-code-summarization-in-the-era-of-large","slug":"source-code-summarization-in-the-era-of-large","title":"Source Code Summarization in the Era of Large Language Models","date":"2024-07-09","arxiv_id":"2407.07959","repositories_listed":1,"syntology":null},{"url":"/paper/a-prompt-learning-framework-for-source-code","slug":"a-prompt-learning-framework-for-source-code","title":"A Prompt Learning Framework for Source Code Summarization","date":"2023-12-26","arxiv_id":"2312.16066","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-file-context-for-source-code","slug":"revisiting-file-context-for-source-code","title":"Revisiting File Context for Source Code Summarization","date":"2023-09-05","arxiv_id":"2309.02326","repositories_listed":1,"syntology":null},{"url":"/paper/distilled-gpt-for-source-code-summarization","slug":"distilled-gpt-for-source-code-summarization","title":"Distilled GPT for Source Code Summarization","date":"2023-08-28","arxiv_id":"2308.14731","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-similarity-loss-for-neural-source","slug":"semantic-similarity-loss-for-neural-source","title":"Semantic Similarity Loss for Neural Source Code Summarization","date":"2023-08-14","arxiv_id":"2308.07429","repositories_listed":1,"syntology":null},{"url":"/paper/statement-based-memory-for-neural-source-code","slug":"statement-based-memory-for-neural-source-code","title":"Statement-based Memory for Neural Source Code Summarization","date":"2023-07-21","arxiv_id":"2307.11709","repositories_listed":1,"syntology":null},{"url":"/paper/tram-a-token-level-retrieval-augmented","slug":"tram-a-token-level-retrieval-augmented","title":"Tram: A Token-level Retrieval-augmented Mechanism for Source Code Summarization","date":"2023-05-18","arxiv_id":"2305.11074","repositories_listed":1,"syntology":null},{"url":"/paper/an-extractive-and-abstractive-framework-for","slug":"an-extractive-and-abstractive-framework-for","title":"An Extractive-and-Abstractive Framework for Source Code Summarization","date":"2022-06-15","arxiv_id":"2206.07245","repositories_listed":1,"syntology":null},{"url":"/paper/m2ts-multi-scale-multi-modal-approach-based","slug":"m2ts-multi-scale-multi-modal-approach-based","title":"M2TS: Multi-Scale Multi-Modal Approach Based on Transformer for Source Code Summarization","date":"2022-03-18","arxiv_id":"2203.09707","repositories_listed":1,"syntology":null},{"url":"/paper/source-code-summarization-with-structural","slug":"source-code-summarization-with-structural","title":"Source Code Summarization with Structural Relative Position Guided Transformer","date":"2022-02-14","arxiv_id":"2202.06521","repositories_listed":1,"syntology":null},{"url":"/paper/compositionality-aware-graph2seq-learning","slug":"compositionality-aware-graph2seq-learning","title":"Compositionality-Aware Graph2Seq Learning","date":"2022-01-28","arxiv_id":"2201.12178","repositories_listed":1,"syntology":null},{"url":"/paper/assemble-foundation-models-for-automatic-code","slug":"assemble-foundation-models-for-automatic-code","title":"Assemble Foundation Models for Automatic Code Summarization","date":"2022-01-13","arxiv_id":"2201.05222","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-unsupervised-learning-to-summarize","slug":"leveraging-unsupervised-learning-to-summarize","title":"Leveraging Unsupervised Learning to Summarize APIs Discussed in Stack Overflow","date":"2021-11-27","arxiv_id":"2111.13962","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-hierarchical-syntax-structure-with","slug":"modeling-hierarchical-syntax-structure-with","title":"Modeling Hierarchical Syntax Structure with Triplet Position for Source Code Summarization","date":"2021-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graphsearchnet-enhancing-gnns-via-capturing","slug":"graphsearchnet-enhancing-gnns-via-capturing","title":"GraphSearchNet: Enhancing GNNs via Capturing Global Dependencies for Semantic Code Search","date":"2021-11-04","arxiv_id":"2111.02671","repositories_listed":1,"syntology":null},{"url":"/paper/neural-code-summarization-how-far-are-we","slug":"neural-code-summarization-how-far-are-we","title":"On the Evaluation of Neural Code Summarization","date":"2021-07-15","arxiv_id":"2107.07112","repositories_listed":1,"syntology":null},{"url":"/paper/code-to-comment-translation-a-comparative","slug":"code-to-comment-translation-a-comparative","title":"Code to Comment Translation: A Comparative Study on Model Effectiveness & Errors","date":"2021-06-15","arxiv_id":"2106.08415","repositories_listed":1,"syntology":null},{"url":"/paper/codesc-a-large-code-description-parallel","slug":"codesc-a-large-code-description-parallel","title":"CoDesc: A Large Code-Description Parallel Dataset","date":"2021-05-29","arxiv_id":"2105.14220","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/codesc-a-large-code-description-parallel#ran","syntology_url":"https://syntology.ai/paper/2105.14220","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14220"}},"official":{"repos":["csebuetnlp/CoDesc"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/codetrans-towards-cracking-the-language-of","slug":"codetrans-towards-cracking-the-language-of","title":"CodeTrans: Towards Cracking the Language of Silicon's Code Through Self-Supervised Deep Learning and High Performance Computing","date":"2021-04-06","arxiv_id":"2104.02443","repositories_listed":1,"syntology":null},{"url":"/paper/project-level-encoding-for-neural-source-code","slug":"project-level-encoding-for-neural-source-code","title":"Project-Level Encoding for Neural Source Code Summarization of Subroutines","date":"2021-03-22","arxiv_id":"2103.11599","repositories_listed":1,"syntology":null},{"url":"/paper/language-agnostic-representation-learning-of-1","slug":"language-agnostic-representation-learning-of-1","title":"Language-Agnostic Representation Learning of Source Code from Structure and Context","date":"2021-03-21","arxiv_id":"2103.11318","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":6,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 6 samples that ran constructed an object rather than computing a result","sample_list":"/paper/language-agnostic-representation-learning-of-1#ran","syntology_url":"https://syntology.ai/paper/2103.11318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.11318"}},"official":{"repos":["danielzuegner/code-transformer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-code-summarization-with-block-wise","slug":"improving-code-summarization-with-block-wise","title":"Improving Code Summarization with Block-wise Abstract Syntax Tree Splitting","date":"2021-03-14","arxiv_id":"2103.07845","repositories_listed":1,"syntology":null},{"url":"/paper/neural-code-summarization","slug":"neural-code-summarization","title":"Neural Code Summarization","date":"2021-02-26","arxiv_id":"2103.01025","repositories_listed":1,"syntology":null},{"url":"/paper/sit3-code-summarization-with-structure","slug":"sit3-code-summarization-with-structure","title":"Code Summarization with Structure-induced Transformer","date":"2020-12-29","arxiv_id":"2012.14710","repositories_listed":1,"syntology":null},{"url":"/paper/graphcodebert-pre-training-code","slug":"graphcodebert-pre-training-code","title":"GraphCodeBERT: Pre-training Code Representations with Data Flow","date":"2020-09-17","arxiv_id":"2009.08366","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-code-representation-learning","slug":"contrastive-code-representation-learning","title":"Contrastive Code Representation Learning","date":"2020-07-09","arxiv_id":"2007.04973","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-code-summarization-via-multi","slug":"automatic-code-summarization-via-multi","title":"Retrieval-Augmented Generation for Code Summarization via Hybrid GNN","date":"2020-06-09","arxiv_id":"2006.05405","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-source-code-summarization-with","slug":"automatic-source-code-summarization-with","title":"Automatic Source Code Summarization with Extended Tree-LSTM","date":"2019-06-19","arxiv_id":"1906.08094","repositories_listed":1,"syntology":null},{"url":"/paper/summarizing-source-code-using-a-neural","slug":"summarizing-source-code-using-a-neural","title":"Summarizing Source Code using a Neural Attention Model","date":"2016-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"esale-enhancing-code-summary-alignment","title":"ESALE: Enhancing Code-Summary Alignment Learning for Source Code Summarization","date":"2024-07-01","arxiv_id":"2407.01646","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-training-a-neural-network-to-explain","title":"On Training a Neural Network to Explain Binaries","date":"2024-04-30","arxiv_id":"2404.19631","repositories_listed":0,"syntology":null},{"url":null,"slug":"editsum-a-retrieve-and-edit-framework-for","title":"EditSum: A Retrieve-and-Edit Framework for Source Code Summarization","date":"2023-08-26","arxiv_id":"2308.13775","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-modeling-human-attention-from-eye","title":"Towards Modeling Human Attention from Eye Movements for Neural Source Code Summarization","date":"2023-05-16","arxiv_id":"2305.09773","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-hierarchical-syntax-structure-with-1","title":"Modeling Hierarchical Syntax Structure with Triplet Position for Source Code Summarization","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-learning-for-code-summarization-1","title":"Meta Learning for Code Summarization","date":"2022-01-20","arxiv_id":"2201.08310","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-learning-for-code-summarization","title":"Meta Learning for Code Summarization","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"retrieval-based-layer-wise-adaptive","title":"Retrieval-based Layer-wise Adaptive Transformer for Source Code Summarization","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-sequential-and-structural","title":"Learning Sequential and Structural Information for Source Code Summarization","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"code-structure-guided-transformer-for-source","title":"Code Structure Guided Transformer for Source Code Summarization","date":"2021-04-19","arxiv_id":"2104.09340","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-method-names-to-improve-code","title":"Exploiting Method Names to Improve Code Summarization: A Deliberation Multi-Task Learning Approach","date":"2021-03-21","arxiv_id":"2103.11448","repositories_listed":0,"syntology":null},{"url":null,"slug":"demystifying-code-summarization-models","title":"WheaCha: A Method for Explaining the Predictions of Models of Code","date":"2021-02-09","arxiv_id":"2102.04625","repositories_listed":0,"syntology":null},{"url":null,"slug":"gn-transformer-fusing-ast-and-source-code","title":"GN-Transformer: Fusing AST and Source Code information in Graph Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-source-code-summarization-via","title":"Automatic Source Code Summarization via Reinforcement Learning","date":"2020-12-14","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-framework-for-learning-code","title":"Self-Supervised Contrastive Learning for Code Retrieval and Summarization via Semantic-Preserving Transformations","date":"2020-09-06","arxiv_id":"2009.02731","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-structural-transformer-with-relative","title":"A Structural Transformer with Relative Positions in Trees for Code-to-Sequence Tasks","date":"2020-06-04","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-code-generation-to-improve-code","title":"Leveraging Code Generation to Improve Code Retrieval and Summarization via Dual Learning","date":"2020-02-24","arxiv_id":"2002.10198","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-convolutional-neural-network-for-language","title":"A Convolutional Neural Network for Language-Agnostic Source Code Summarization","date":"2019-03-29","arxiv_id":"1904.00805","repositories_listed":0,"syntology":null},{"url":"/paper/learning-to-mine-aligned-code-and-natural","slug":"learning-to-mine-aligned-code-and-natural","title":"Learning to Mine Aligned Code and Natural Language Pairs from Stack Overflow","date":"2018-05-23","arxiv_id":"1805.08949","repositories_listed":0,"syntology":null}],"syntology_records":6,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":6,"papers_where_code_ran_first_page":"/task/code-summarization/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/code-summarization/papers/ran/1","json":"/task/code-summarization/papers/ran/1.json","rows":6}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"57ef85b0c3a75df000d67f3dcccc9be75341f421b70ece0f8d59413a44215338","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}