{"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/remove-space","entry":"remove_space","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":7,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":4,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":7,"n_places_pointer_only":5,"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":1,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":2,"unverified":0},"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":"2506.15583","arxiv_id_is_arxiv":true,"paper":"/paper/discosg-towards-discourse-level-text-scene","title":"DiscoSG: Towards Discourse-Level Text Scene Graph Parsing through Iterative Graph Refinement","date":"2025-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShaoqLin/DiscoSG","path":"src/factual_scene_graph/triple_utils.py","file_url":"https://github.com/ShaoqLin/DiscoSG/blob/HEAD/src/factual_scene_graph/triple_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ShaoqLin/DiscoSG when it was checked","code_sha256":"f1cc0f7668994de6","code_sha256_prefix":"f1cc0f7668994de6","mcp_get_code":{"code_sha256":"f1cc0f7668994de6"}},{"arxiv_id":"2406.05654","arxiv_id_is_arxiv":true,"paper":"/paper/domainrag-a-chinese-benchmark-for-evaluating","title":"DomainRAG: A Chinese Benchmark for Evaluating Domain-specific Retrieval-Augmented Generation","date":"2024-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShootingWong/DomainRAG","path":"BCM/evaluation/tasks/Datasets.py","file_url":"https://github.com/ShootingWong/DomainRAG/blob/HEAD/BCM/evaluation/tasks/Datasets.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ShootingWong/DomainRAG when it was checked","code_sha256":"a0b7c401fe27624d","code_sha256_prefix":"a0b7c401fe27624d","mcp_get_code":{"code_sha256":"a0b7c401fe27624d"}},{"arxiv_id":"2402.15000","arxiv_id_is_arxiv":true,"paper":"/paper/divide-or-conquer-which-part-should-you","title":"Divide-or-Conquer? Which Part Should You Distill Your LLM?","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-divide-or-conquer","path":"rejection_sampling/newselect_correct_chain_bamb.py","file_url":"https://github.com/apple/ml-divide-or-conquer/blob/HEAD/rejection_sampling/newselect_correct_chain_bamb.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, apple/ml-divide-or-conquer (NOASSERTION)","code_sha256":"4582ae4b3e09b21d","code_sha256_prefix":"4582ae4b3e09b21d","mcp_get_code":{"code_sha256":"4582ae4b3e09b21d"}},{"arxiv_id":"2210.03849","arxiv_id_is_arxiv":true,"paper":"/paper/convfinqa-exploring-the-chain-of-numerical","title":"ConvFinQA: Exploring the Chain of Numerical Reasoning in Conversational Finance Question Answering","date":"2022-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"czyssrs/convfinqa","path":"code/utils/general_utils.py","file_url":"https://github.com/czyssrs/convfinqa/blob/HEAD/code/utils/general_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"edc24c5af3e1a7cd","code_sha256_prefix":"edc24c5af3e1a7cd","mcp_get_code":{"code_sha256":"edc24c5af3e1a7cd"}},{"arxiv_id":"2205.10162","arxiv_id_is_arxiv":true,"paper":"/paper/autofednlp-an-efficient-fednlp-framework","title":"FedAdapter: Efficient Federated Learning for Modern NLP","date":"2022-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UbiquitousLearning/FedAdapter","path":"experiments/distributed/transformer_exps/run_tc_exps/trial_error.py","file_url":"https://github.com/UbiquitousLearning/FedAdapter/blob/HEAD/experiments/distributed/transformer_exps/run_tc_exps/trial_error.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, UbiquitousLearning/FedAdapter when it was checked","code_sha256":"39f533b6d649e5cf","code_sha256_prefix":"39f533b6d649e5cf","mcp_get_code":{"code_sha256":"39f533b6d649e5cf"}},{"arxiv_id":"2202.08396","arxiv_id_is_arxiv":true,"paper":"/paper/augment-with-care-contrastive-learning-for","title":"Augment with Care: Contrastive Learning for Combinatorial Problems","date":"2022-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"h4duan/contrastive-sat","path":"src/augmentation.py","file_url":"https://github.com/h4duan/contrastive-sat/blob/HEAD/src/augmentation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, h4duan/contrastive-sat when it was checked","code_sha256":"fe7a82700050aba5","code_sha256_prefix":"fe7a82700050aba5","mcp_get_code":{"code_sha256":"fe7a82700050aba5"}},{"arxiv_id":"2021.emnlp-main.635","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.emnlp-main.635","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"4AI/TDEER","path":"utils.py","file_url":"https://github.com/4AI/TDEER/blob/HEAD/utils.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":"760d0f385f0362f1","code_sha256_prefix":"760d0f385f0362f1","mcp_get_code":{"code_sha256":"760d0f385f0362f1"}}],"record_sha256":"d57b7c77a38265659bd50df5f5925f32d0bcae4f695ab379afe0efdfc2a12a15","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}