{"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/get-sentences","entry":"get_sentences","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":6,"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":1,"ran_fixture":0,"ran":3,"unverified":2},"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":"2605.30022","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30022","title":"Give it Space! Explicit Disentangling of Positional and Semantic Representations in Encoders","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"LequeuISIR/DSTG-encoder","path":"src/neobert/glue/process.py","file_url":"https://github.com/LequeuISIR/DSTG-encoder/blob/HEAD/src/neobert/glue/process.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, LequeuISIR/DSTG-encoder when it was checked","code_sha256":"0c835bff99754e6f","code_sha256_prefix":"0c835bff99754e6f","mcp_get_code":{"code_sha256":"0c835bff99754e6f"}},{"arxiv_id":"2310.15799","arxiv_id_is_arxiv":true,"paper":"/paper/dale-generative-data-augmentation-for-low","title":"DALE: Generative Data Augmentation for Low-Resource Legal NLP","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sreyan88/DALE","path":"mask_dataset.py","file_url":"https://github.com/Sreyan88/DALE/blob/HEAD/mask_dataset.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":"7aa4ea289d984233","code_sha256_prefix":"7aa4ea289d984233","mcp_get_code":{"code_sha256":"7aa4ea289d984233"}},{"arxiv_id":"2310.13012","arxiv_id_is_arxiv":true,"paper":"/paper/h2o-open-ecosystem-for-state-of-the-art-large","title":"H2O Open Ecosystem for State-of-the-art Large Language Models","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"h2oai/h2ogpt","path":"src/create_data.py","file_url":"https://github.com/h2oai/h2ogpt/blob/HEAD/src/create_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aca03ba436af1dd6","code_sha256_prefix":"aca03ba436af1dd6","mcp_get_code":{"code_sha256":"aca03ba436af1dd6"}},{"arxiv_id":"2308.09687","arxiv_id_is_arxiv":true,"paper":"/paper/graph-of-thoughts-solving-elaborate-problems","title":"Graph of Thoughts: Solving Elaborate Problems with Large Language Models","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chiral-carbon/kg-for-science","path":"src/processing/generate.py","file_url":"https://github.com/chiral-carbon/kg-for-science/blob/HEAD/src/processing/generate.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":"ad9b90d9f3f1381c","code_sha256_prefix":"ad9b90d9f3f1381c","mcp_get_code":{"code_sha256":"ad9b90d9f3f1381c"}},{"arxiv_id":"2010.09697","arxiv_id_is_arxiv":true,"paper":"/paper/parameter-norm-growth-during-training-of","title":"Effects of Parameter Norm Growth During Transformer Training: Inductive Bias from Gradient Descent","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"viking-sudo-rm/norm-growth","path":"eval_pretrain_sat_brown.py","file_url":"https://github.com/viking-sudo-rm/norm-growth/blob/HEAD/eval_pretrain_sat_brown.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, viking-sudo-rm/norm-growth when it was checked","code_sha256":"ffc6543d0b4f8d4b","code_sha256_prefix":"ffc6543d0b4f8d4b","mcp_get_code":{"code_sha256":"ffc6543d0b4f8d4b"}},{"arxiv_id":"1611.04230","arxiv_id_is_arxiv":true,"paper":"/paper/summarunner-a-recurrent-neural-network-based","title":"SummaRuNNer: A Recurrent Neural Network based Sequence Model for Extractive Summarization of Documents","date":"2016-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dennlinger/summaries","path":"summaries/baselines/lead.py","file_url":"https://github.com/dennlinger/summaries/blob/HEAD/summaries/baselines/lead.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":"a35beac0b32ed534","code_sha256_prefix":"a35beac0b32ed534","mcp_get_code":{"code_sha256":"a35beac0b32ed534"}}],"record_sha256":"47c0fe4e7504e167e4c5af0cb0312d973ff55e798f70740d774cd6ab716f5bc4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}