{"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/data-process","entry":"data_process","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":3,"n_papers_ran_no_instrument_failure":1,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":1,"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":3,"ran_fixture":0,"ran":0,"unverified":3},"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":"2412.15280","arxiv_id_is_arxiv":true,"paper":"/paper/context-dpo-aligning-language-models-for","title":"Context-DPO: Aligning Language Models for Context-Faithfulness","date":"2024-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"byronbbl/context-dpo","path":"train_dpo.py","file_url":"https://github.com/byronbbl/context-dpo/blob/HEAD/train_dpo.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, byronbbl/context-dpo when it was checked","code_sha256":"e654bd2904dd9a4e","code_sha256_prefix":"e654bd2904dd9a4e","mcp_get_code":{"code_sha256":"e654bd2904dd9a4e"}},{"arxiv_id":"2410.21535","arxiv_id_is_arxiv":true,"paper":"/paper/ecmamba-consolidating-selective-state-space","title":"ECMamba: Consolidating Selective State Space Model with Retinex Guidance for Efficient Multiple Exposure Correction","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LowlevelAI/ECMamba","path":"basicsr/losses/onerestore_loss.py","file_url":"https://github.com/LowlevelAI/ECMamba/blob/HEAD/basicsr/losses/onerestore_loss.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":"7e067489302d7df6","code_sha256_prefix":"7e067489302d7df6","mcp_get_code":{"code_sha256":"7e067489302d7df6"}},{"arxiv_id":"2406.05954","arxiv_id_is_arxiv":true,"paper":"/paper/aligning-large-language-models-with-2","title":"Aligning Large Language Models with Representation Editing: A Control Perspective","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lingkai-kong/re-control","path":"measure_reward.py","file_url":"https://github.com/lingkai-kong/re-control/blob/HEAD/measure_reward.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, lingkai-kong/re-control when it was checked","code_sha256":"b2e30556f9379844","code_sha256_prefix":"b2e30556f9379844","mcp_get_code":{"code_sha256":"b2e30556f9379844"}},{"arxiv_id":"2402.03664","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-solvers-for-partial-gromov","title":"Partial Gromov-Wasserstein Metric","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mint-vu/PGW_Metric","path":"lib/pu_learning.py","file_url":"https://github.com/mint-vu/PGW_Metric/blob/HEAD/lib/pu_learning.py","status":"unverified","verification_level":0,"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, mint-vu/PGW_Metric when it was checked","code_sha256":"657b63a2f201207a","code_sha256_prefix":"657b63a2f201207a","mcp_get_code":{"code_sha256":"657b63a2f201207a"}},{"arxiv_id":"2310.04270","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-evaluation-of-large-language","title":"A Comprehensive Evaluation of Large Language Models on Benchmark Biomedical Text Processing Tasks","date":"2023-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tahmedge/llm-eval-biomed","path":"code/entity_linking.py","file_url":"https://github.com/tahmedge/llm-eval-biomed/blob/HEAD/code/entity_linking.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, tahmedge/llm-eval-biomed when it was checked","code_sha256":"f36f437ec2a3c1cb","code_sha256_prefix":"f36f437ec2a3c1cb","mcp_get_code":{"code_sha256":"f36f437ec2a3c1cb"}},{"arxiv_id":"2310.04270","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-evaluation-of-large-language","title":"A Comprehensive Evaluation of Large Language Models on Benchmark Biomedical Text Processing Tasks","date":"2023-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tahmedge/llm-eval-biomed","path":"code/ner.py","file_url":"https://github.com/tahmedge/llm-eval-biomed/blob/HEAD/code/ner.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, tahmedge/llm-eval-biomed when it was checked","code_sha256":"59582dffede49242","code_sha256_prefix":"59582dffede49242","mcp_get_code":{"code_sha256":"59582dffede49242"}},{"arxiv_id":"1910.12574","arxiv_id_is_arxiv":true,"paper":"/paper/a-bert-based-transfer-learning-approach-for","title":"A BERT-Based Transfer Learning Approach for Hate Speech Detection in Online Social Media","date":"2019-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZeroxTM/BERT-CNN-Fine-Tuning-For-Hate-Speech-Detection-in-Online-Social-Media","path":"Pre_Process.py","file_url":"https://github.com/ZeroxTM/BERT-CNN-Fine-Tuning-For-Hate-Speech-Detection-in-Online-Social-Media/blob/HEAD/Pre_Process.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":"8d988ff03c9c5894","code_sha256_prefix":"8d988ff03c9c5894","mcp_get_code":{"code_sha256":"8d988ff03c9c5894"}}],"record_sha256":"e9d12dd4a70931e29748c8be655c9045c209ca6fb86fc97fb6dba47d52649691","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}