{"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/concatenate","entry":"concatenate","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":1,"ran_fixture":0,"ran":5,"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":"2311.07230","arxiv_id_is_arxiv":true,"paper":"/paper/how-are-prompts-different-in-terms-of","title":"How are Prompts Different in Terms of Sensitivity?","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ukplab/naacl2024-prompt-sensitivity","path":"utils.py","file_url":"https://github.com/ukplab/naacl2024-prompt-sensitivity/blob/HEAD/utils.py","status":"ran","verification_level":1,"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":"abc6223d385b9dfc","code_sha256_prefix":"abc6223d385b9dfc","mcp_get_code":{"code_sha256":"abc6223d385b9dfc"}},{"arxiv_id":"2310.04723","arxiv_id_is_arxiv":true,"paper":"/paper/subspace-identification-for-multi-source","title":"Subspace Identification for Multi-Source Domain Adaptation","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jozerozero/subspace_identification","path":"common/utils/data.py","file_url":"https://github.com/jozerozero/subspace_identification/blob/HEAD/common/utils/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, jozerozero/subspace_identification when it was checked","code_sha256":"03365b3c9ecbafe8","code_sha256_prefix":"03365b3c9ecbafe8","mcp_get_code":{"code_sha256":"03365b3c9ecbafe8"}},{"arxiv_id":"2305.16498","arxiv_id_is_arxiv":true,"paper":"/paper/coherent-soft-imitation-learning","title":"Coherent Soft Imitation Learning","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-deepmind/csil","path":"sil/config.py","file_url":"https://github.com/google-deepmind/csil/blob/HEAD/sil/config.py","status":"ran","verification_level":1,"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":"e6ddaceea6772f28","code_sha256_prefix":"e6ddaceea6772f28","mcp_get_code":{"code_sha256":"e6ddaceea6772f28"}},{"arxiv_id":"2304.13774","arxiv_id_is_arxiv":true,"paper":"/paper/distance-weighted-supervised-learning-for","title":"Distance Weighted Supervised Learning for Offline Interaction Data","date":"2023-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhejna/dwsl","path":"research/algs/dwsl.py","file_url":"https://github.com/jhejna/dwsl/blob/HEAD/research/algs/dwsl.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":"28abd9986e85184e","code_sha256_prefix":"28abd9986e85184e","mcp_get_code":{"code_sha256":"28abd9986e85184e"}},{"arxiv_id":"2302.02169","arxiv_id_is_arxiv":true,"paper":"/paper/how-many-and-which-training-points-would-need","title":"How Many and Which Training Points Would Need to be Removed to Flip this Prediction?","date":"2023-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ecielyang/smallest_set","path":"recursive.py","file_url":"https://github.com/ecielyang/smallest_set/blob/HEAD/recursive.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ecielyang/smallest_set when it was checked","code_sha256":"f0458fd6f37c6080","code_sha256_prefix":"f0458fd6f37c6080","mcp_get_code":{"code_sha256":"f0458fd6f37c6080"}},{"arxiv_id":"2203.11819","arxiv_id_is_arxiv":true,"paper":"/paper/a-broad-study-of-pre-training-for-domain","title":"A Broad Study of Pre-training for Domain Generalization and Adaptation","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VisionLearningGroup/Benchmark_Domain_Transfer","path":"utils/data.py","file_url":"https://github.com/VisionLearningGroup/Benchmark_Domain_Transfer/blob/HEAD/utils/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from jozerozero/subspace_identification, and GitHub detected no licence in that repository when it was checked","code_sha256":"03365b3c9ecbafe8","code_sha256_prefix":"03365b3c9ecbafe8","mcp_get_code":{"code_sha256":"03365b3c9ecbafe8"}},{"arxiv_id":"2003.13479","arxiv_id_is_arxiv":true,"paper":"/paper/2003-13479","title":"RPM-Net: Robust Point Matching using Learned Features","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yewzijian/RPMNet","path":"src/common/math/se3.py","file_url":"https://github.com/yewzijian/RPMNet/blob/HEAD/src/common/math/se3.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":"8a632dcefddc5fc1","code_sha256_prefix":"8a632dcefddc5fc1","mcp_get_code":{"code_sha256":"8a632dcefddc5fc1"}},{"arxiv_id":"2003.13479","arxiv_id_is_arxiv":true,"paper":"/paper/2003-13479","title":"RPM-Net: Robust Point Matching using Learned Features","date":"2020-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yewzijian/RPMNet","path":"src/common/math_torch/se3.py","file_url":"https://github.com/yewzijian/RPMNet/blob/HEAD/src/common/math_torch/se3.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":"5eef8614474cef47","code_sha256_prefix":"5eef8614474cef47","mcp_get_code":{"code_sha256":"5eef8614474cef47"}},{"arxiv_id":"2020.findings-emnlp.289","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2020.findings-emnlp.289","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"h4ste/mtft_zsl","path":"fslks/experiments/hf_experiment.py","file_url":"https://github.com/h4ste/mtft_zsl/blob/HEAD/fslks/experiments/hf_experiment.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":"2d5fe114848cfc80","code_sha256_prefix":"2d5fe114848cfc80","mcp_get_code":{"code_sha256":"2d5fe114848cfc80"}}],"record_sha256":"a8879e7185d5feb9b43eebf33e5e1ca9983cb2dbf49052797e5e714f7bfed355","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}