{"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/create-datasets","entry":"create_datasets","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":11,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"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":11,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":4,"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":2,"ran_fixture":0,"ran":3,"unverified":6},"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":"2411.00566","arxiv_id_is_arxiv":true,"paper":"/paper/patternboost-constructions-in-mathematics","title":"PatternBoost: Constructions in Mathematics with a Little Help from AI","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zawagner22/transformers_math_experiments","path":"makebettertokens.py","file_url":"https://github.com/zawagner22/transformers_math_experiments/blob/HEAD/makebettertokens.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, zawagner22/transformers_math_experiments when it was checked","code_sha256":"d8a9cf83d322e37d","code_sha256_prefix":"d8a9cf83d322e37d","mcp_get_code":{"code_sha256":"d8a9cf83d322e37d"}},{"arxiv_id":"2406.10023","arxiv_id_is_arxiv":true,"paper":"/paper/deep-bayesian-active-learning-for-preference","title":"Deep Bayesian Active Learning for Preference Modeling in Large Language Models","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luckeciano/BAL-PM","path":"uqlrm/adapter_ensemble_reward_training.py","file_url":"https://github.com/luckeciano/BAL-PM/blob/HEAD/uqlrm/adapter_ensemble_reward_training.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, luckeciano/BAL-PM when it was checked","code_sha256":"7a7d51a3dd2dbbc7","code_sha256_prefix":"7a7d51a3dd2dbbc7","mcp_get_code":{"code_sha256":"7a7d51a3dd2dbbc7"}},{"arxiv_id":"2311.08744","arxiv_id_is_arxiv":true,"paper":"/paper/towards-graph-aware-diffusion-modeling-for","title":"Graph Signal Diffusion Model for Collaborative Filtering","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hasined/giffcf","path":"utils/data.py","file_url":"https://github.com/hasined/giffcf/blob/HEAD/utils/data.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, hasined/giffcf when it was checked","code_sha256":"9c52c5e53ddf46a4","code_sha256_prefix":"9c52c5e53ddf46a4","mcp_get_code":{"code_sha256":"9c52c5e53ddf46a4"}},{"arxiv_id":"2310.16450","arxiv_id_is_arxiv":true,"paper":"/paper/clex-continuous-length-extrapolation-for","title":"CLEX: Continuous Length Extrapolation for Large Language Models","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DAMO-NLP-SG/CLEX","path":"train/dataset.py","file_url":"https://github.com/DAMO-NLP-SG/CLEX/blob/HEAD/train/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":"b8f03a1ab044bb33","code_sha256_prefix":"b8f03a1ab044bb33","mcp_get_code":{"code_sha256":"b8f03a1ab044bb33"}},{"arxiv_id":"2309.15840","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-catch-an-ai-liar-lie-detection-in","title":"How to Catch an AI Liar: Lie Detection in Black-Box LLMs by Asking Unrelated Questions","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorypack/llm-liedetector","path":"lllm/classification_utils.py","file_url":"https://github.com/lorypack/llm-liedetector/blob/HEAD/lllm/classification_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8203982687f4831b","code_sha256_prefix":"8203982687f4831b","mcp_get_code":{"code_sha256":"8203982687f4831b"}},{"arxiv_id":"2309.09812","arxiv_id_is_arxiv":true,"paper":"/paper/r2gengpt-radiology-report-generation-with","title":"R2GenGPT: Radiology Report Generation with Frozen LLMs","date":"2023-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wang-zhanyu/r2gengpt","path":"dataset/data_helper.py","file_url":"https://github.com/wang-zhanyu/r2gengpt/blob/HEAD/dataset/data_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"09f67cc7856cfd02","code_sha256_prefix":"09f67cc7856cfd02","mcp_get_code":{"code_sha256":"09f67cc7856cfd02"}},{"arxiv_id":"2307.10404","arxiv_id_is_arxiv":true,"paper":"/paper/interpreting-and-correcting-medical-image","title":"Interpreting and Correcting Medical Image Classification with PIP-Net","date":"2023-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m-nauta/pipnet","path":"util/data.py","file_url":"https://github.com/m-nauta/pipnet/blob/HEAD/util/data.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, m-nauta/pipnet when it was checked","code_sha256":"30b661379a36af8f","code_sha256_prefix":"30b661379a36af8f","mcp_get_code":{"code_sha256":"30b661379a36af8f"}},{"arxiv_id":"2305.07730","arxiv_id_is_arxiv":true,"paper":"/paper/learning-in-inverse-optimization-incenter","title":"Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms","date":"2023-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pedroszattoni/invopt","path":"examples/FOM/first_order_methods.py","file_url":"https://github.com/pedroszattoni/invopt/blob/HEAD/examples/FOM/first_order_methods.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f81b8a1f93701a57","code_sha256_prefix":"f81b8a1f93701a57","mcp_get_code":{"code_sha256":"f81b8a1f93701a57"}},{"arxiv_id":"2212.09651","arxiv_id_is_arxiv":true,"paper":"/paper/cross-lingual-retrieval-augmented-prompt-for","title":"Cross-Lingual Retrieval Augmented Prompt for Low-Resource Languages","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ercong21/parc","path":"measure_trans_quality.py","file_url":"https://github.com/ercong21/parc/blob/HEAD/measure_trans_quality.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":"72a5dcad3d519d9a","code_sha256_prefix":"72a5dcad3d519d9a","mcp_get_code":{"code_sha256":"72a5dcad3d519d9a"}},{"arxiv_id":"1901.10137","arxiv_id_is_arxiv":true,"paper":"/paper/attention-based-context-aggregation-network","title":"Attention-based Context Aggregation Network for Monocular Depth Estimation","date":"2019-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miraiaroha/ACAN","path":"code/dataloaders/get_datasets.py","file_url":"https://github.com/miraiaroha/ACAN/blob/HEAD/code/dataloaders/get_datasets.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":"6c3dd8fb65a40c15","code_sha256_prefix":"6c3dd8fb65a40c15","mcp_get_code":{"code_sha256":"6c3dd8fb65a40c15"}},{"arxiv_id":"aaai_32596","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_32596","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"TengfeiLiu966/HC-LLM","path":"dataset/data_helper.py","file_url":"https://github.com/TengfeiLiu966/HC-LLM/blob/HEAD/dataset/data_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"562ab9bef0c7f834","code_sha256_prefix":"562ab9bef0c7f834","mcp_get_code":{"code_sha256":"562ab9bef0c7f834"}}],"record_sha256":"6962abc10c96258e1091c9dac15aeba29682b6a6f8bddda544c51f5e7e1a9437","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}