{"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-models","entry":"get_models","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":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":5,"n_samples_fingerprinted":2,"n_places":12,"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":4,"unverified":5},"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":"2604.11841","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-11841","title":"Polynomial Expansion Rank Adaptation: Enhancing Low-Rank Fine-Tuning with High-Order Interactions","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"zhangwenhao6/PERA","path":"models/get_models.py","file_url":"https://github.com/zhangwenhao6/PERA/blob/HEAD/models/get_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, zhangwenhao6/PERA (NOASSERTION)","code_sha256":"29922d261463cc67","code_sha256_prefix":"29922d261463cc67","mcp_get_code":{"code_sha256":"29922d261463cc67"}},{"arxiv_id":"2510.24061","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-24061","title":"FALQON: Accelerating LoRA Fine-tuning with Low-Bit Floating-Point Arithmetic","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"iamkanghyunchoi/falqon","path":"transformers/utils/pr_slow_ci_models.py","file_url":"https://github.com/iamkanghyunchoi/falqon/blob/HEAD/transformers/utils/pr_slow_ci_models.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":"a82d62103131c8a3","code_sha256_prefix":"a82d62103131c8a3","mcp_get_code":{"code_sha256":"a82d62103131c8a3"}},{"arxiv_id":"2504.03933","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-are-implicitly-continuous","title":"Language Models Are Implicitly Continuous","date":"2025-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samuelemarro/continuous-llm-experiments","path":"utils/pr_slow_ci_models.py","file_url":"https://github.com/samuelemarro/continuous-llm-experiments/blob/HEAD/utils/pr_slow_ci_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, samuelemarro/continuous-llm-experiments, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"0dd0c5bdb6aa92c9","code_sha256_prefix":"0dd0c5bdb6aa92c9","mcp_get_code":{"code_sha256":"0dd0c5bdb6aa92c9"}},{"arxiv_id":"2405.18765","arxiv_id_is_arxiv":true,"paper":"/paper/large-brain-model-for-learning-generic","title":"Large Brain Model for Learning Generic Representations with Tremendous EEG Data in BCI","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"935963004/labram","path":"run_class_finetuning.py","file_url":"https://github.com/935963004/labram/blob/HEAD/run_class_finetuning.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":"41fe7c73b82c0541","code_sha256_prefix":"41fe7c73b82c0541","mcp_get_code":{"code_sha256":"41fe7c73b82c0541"}},{"arxiv_id":"2405.07987","arxiv_id_is_arxiv":true,"paper":"/paper/the-platonic-representation-hypothesis","title":"The Platonic Representation Hypothesis","date":"2024-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minyoungg/platonic-rep","path":"tasks.py","file_url":"https://github.com/minyoungg/platonic-rep/blob/HEAD/tasks.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, minyoungg/platonic-rep when it was checked","code_sha256":"3145793817719014","code_sha256_prefix":"3145793817719014","mcp_get_code":{"code_sha256":"3145793817719014"}},{"arxiv_id":"2402.17812","arxiv_id_is_arxiv":true,"paper":"/paper/dropbp-accelerating-fine-tuning-of-large","title":"DropBP: Accelerating Fine-Tuning of Large Language Models by Dropping Backward Propagation","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"woosunghyeon/dropbp","path":"huggingface/transformers_dropbp/utils/pr_slow_ci_models.py","file_url":"https://github.com/woosunghyeon/dropbp/blob/HEAD/huggingface/transformers_dropbp/utils/pr_slow_ci_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0dd0c5bdb6aa92c9","code_sha256_prefix":"0dd0c5bdb6aa92c9","mcp_get_code":{"code_sha256":"0dd0c5bdb6aa92c9"}},{"arxiv_id":"2310.01634","arxiv_id_is_arxiv":true,"paper":"/paper/deep-insights-into-noisy-pseudo-labeling-on-1","title":"Deep Insights into Noisy Pseudo Labeling on Graph Data","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AcEbt/CPL","path":"utils.py","file_url":"https://github.com/AcEbt/CPL/blob/HEAD/utils.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, AcEbt/CPL when it was checked","code_sha256":"e7bdfe97f195ccc6","code_sha256_prefix":"e7bdfe97f195ccc6","mcp_get_code":{"code_sha256":"e7bdfe97f195ccc6"}},{"arxiv_id":"2106.07035","arxiv_id_is_arxiv":true,"paper":"/paper/deep-bayesian-unsupervised-lifelong-learning","title":"Deep Bayesian Unsupervised Lifelong Learning","date":"2021-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KingSpencer/DBULL","path":"DBULL_dp_gen.py","file_url":"https://github.com/KingSpencer/DBULL/blob/HEAD/DBULL_dp_gen.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":"8d6ceeef4ca16578","code_sha256_prefix":"8d6ceeef4ca16578","mcp_get_code":{"code_sha256":"8d6ceeef4ca16578"}},{"arxiv_id":"2106.01357","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-schrodinger-bridge-with","title":"Diffusion Schrödinger Bridge with Applications to Score-Based Generative Modeling","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxencenoble/tree-diffusion-schrodinger-bridge","path":"bridge/runners/ipf.py","file_url":"https://github.com/maxencenoble/tree-diffusion-schrodinger-bridge/blob/HEAD/bridge/runners/ipf.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":"61f03451a0338d12","code_sha256_prefix":"61f03451a0338d12","mcp_get_code":{"code_sha256":"61f03451a0338d12"}},{"arxiv_id":"2106.01357","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-schrodinger-bridge-with","title":"Diffusion Schrödinger Bridge with Applications to Score-Based Generative Modeling","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JTT94/diffusion_schrodinger_bridge","path":"bridge/runners/ipf.py","file_url":"https://github.com/JTT94/diffusion_schrodinger_bridge/blob/HEAD/bridge/runners/ipf.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":"ce40987a5f51f481","code_sha256_prefix":"ce40987a5f51f481","mcp_get_code":{"code_sha256":"ce40987a5f51f481"}},{"arxiv_id":"2102.05188","arxiv_id_is_arxiv":true,"paper":"/paper/capc-learning-confidential-and-private-1","title":"CaPC Learning: Confidential and Private Collaborative Learning","date":"2021-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cleverhans-lab/capc-iclr","path":"run_experiment.py","file_url":"https://github.com/cleverhans-lab/capc-iclr/blob/HEAD/run_experiment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1aac2bdd0fc20a12","code_sha256_prefix":"1aac2bdd0fc20a12","mcp_get_code":{"code_sha256":"1aac2bdd0fc20a12"}},{"arxiv_id":"1906.03563","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-adversarial-training-min-max","title":"Adversarial Attack Generation Empowered by Min-Max Optimization","date":"2019-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangjksjtu/minmax-adv","path":"neurips21/ens_attack.py","file_url":"https://github.com/wangjksjtu/minmax-adv/blob/HEAD/neurips21/ens_attack.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":"8d68ad2ec3439b5c","code_sha256_prefix":"8d68ad2ec3439b5c","mcp_get_code":{"code_sha256":"8d68ad2ec3439b5c"}}],"record_sha256":"aa12600bb970b723fc26fff90d8557e3c06f7151cc2d3899029d1ba5609a818e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}