{"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-base-model","entry":"get_base_model","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":10,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":5,"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":9,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":5,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":8,"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":5,"ran_fixture":0,"ran":1,"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":"2606.29712","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-29712","title":"Why Struggle with Continuous Latents? Interpretable Discrete Latent Reasoning via Rendered Compression","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Miraclecsc/Discrete-Latent-Reasoning","path":"deepseek_codebook/export_codebook_ids.py","file_url":"https://github.com/Miraclecsc/Discrete-Latent-Reasoning/blob/HEAD/deepseek_codebook/export_codebook_ids.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, Miraclecsc/Discrete-Latent-Reasoning when it was checked","code_sha256":"771d0a6e88b87f34","code_sha256_prefix":"771d0a6e88b87f34","mcp_get_code":{"code_sha256":"771d0a6e88b87f34"}},{"arxiv_id":"2604.01622","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-01622","title":"Expert-Choice Routing Enables Adaptive Computation in Diffusion Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"zhangshuibai/EC-DLM","path":"pretrain_difflm.py","file_url":"https://github.com/zhangshuibai/EC-DLM/blob/HEAD/pretrain_difflm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, zhangshuibai/EC-DLM (NOASSERTION)","code_sha256":"59a142f8f6eaf7b8","code_sha256_prefix":"59a142f8f6eaf7b8","mcp_get_code":{"code_sha256":"59a142f8f6eaf7b8"}},{"arxiv_id":"2603.03291","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-03291","title":"One Bias After Another: Mechanistic Reward Shaping and Persistent Biases in Language Reward Models","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"drfein/OneBiasAfterAnother","path":"src/nb/nullbias/probe.py","file_url":"https://github.com/drfein/OneBiasAfterAnother/blob/HEAD/src/nb/nullbias/probe.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, drfein/OneBiasAfterAnother when it was checked","code_sha256":"30b665edf3dcc249","code_sha256_prefix":"30b665edf3dcc249","mcp_get_code":{"code_sha256":"30b665edf3dcc249"}},{"arxiv_id":"2601.04025","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-04025","title":"Simulated Students in Tutoring Dialogues: Substance or Illusion?","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"umass-ml4ed/sim-student-eval","path":"sim_student/model.py","file_url":"https://github.com/umass-ml4ed/sim-student-eval/blob/HEAD/sim_student/model.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, umass-ml4ed/sim-student-eval (NOASSERTION)","code_sha256":"0158809fcf0bbf0a","code_sha256_prefix":"0158809fcf0bbf0a","mcp_get_code":{"code_sha256":"0158809fcf0bbf0a"}},{"arxiv_id":"2412.21151","arxiv_id_is_arxiv":true,"paper":"/paper/pyg-ssl-a-graph-self-supervised-learning","title":"PyG-SSL: A Graph Self-Supervised Learning Toolkit","date":"2024-12-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idea-isail-lab-uiuc/pyg-ssl","path":"src/augment/gca_augments.py","file_url":"https://github.com/idea-isail-lab-uiuc/pyg-ssl/blob/HEAD/src/augment/gca_augments.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":"ac347f756d23a465","code_sha256_prefix":"ac347f756d23a465","mcp_get_code":{"code_sha256":"ac347f756d23a465"}},{"arxiv_id":"2412.03187","arxiv_id_is_arxiv":true,"paper":"/paper/weighted-reward-preference-optimization-for","title":"Weighted-Reward Preference Optimization for Implicit Model Fusion","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fanqiwan/fusellm","path":"FuseLLM/src/utils/others.py","file_url":"https://github.com/fanqiwan/fusellm/blob/HEAD/FuseLLM/src/utils/others.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, fanqiwan/fusellm when it was checked","code_sha256":"df472be23644090f","code_sha256_prefix":"df472be23644090f","mcp_get_code":{"code_sha256":"df472be23644090f"}},{"arxiv_id":"2401.10491","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-fusion-of-large-language-models","title":"Knowledge Fusion of Large Language Models","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fanqiwan/FuseLLM","path":"FuseLLM/src/utils/others.py","file_url":"https://github.com/fanqiwan/FuseLLM/blob/HEAD/FuseLLM/src/utils/others.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, fanqiwan/FuseLLM when it was checked","code_sha256":"df472be23644090f","code_sha256_prefix":"df472be23644090f","mcp_get_code":{"code_sha256":"df472be23644090f"}},{"arxiv_id":"2305.04658","arxiv_id_is_arxiv":true,"paper":"/paper/csgcl-community-strength-enhanced-graph","title":"CSGCL: Community-Strength-Enhanced Graph Contrastive Learning","date":"2023-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanchen-hust/csgcl","path":"src/utils.py","file_url":"https://github.com/hanchen-hust/csgcl/blob/HEAD/src/utils.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":"4bcc3cd0abc7030a","code_sha256_prefix":"4bcc3cd0abc7030a","mcp_get_code":{"code_sha256":"4bcc3cd0abc7030a"}},{"arxiv_id":"2104.13400","arxiv_id_is_arxiv":true,"paper":"/paper/frameexit-conditional-early-exiting-for","title":"FrameExit: Conditional Early Exiting for Efficient Video Recognition","date":"2021-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Qualcomm-AI-research/FrameExit","path":"model/adaptive_models.py","file_url":"https://github.com/Qualcomm-AI-research/FrameExit/blob/HEAD/model/adaptive_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-3-Clause-Clear, as GitHub detects it on this paper's repository, Qualcomm-AI-research/FrameExit, is not in the permissive set Syntology serves inline","code_sha256":"833518687587ac53","code_sha256_prefix":"833518687587ac53","mcp_get_code":{"code_sha256":"833518687587ac53"}},{"arxiv_id":"2002.05709","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kawshik8/DL-project","path":"src/SSLmodels.py","file_url":"https://github.com/kawshik8/DL-project/blob/HEAD/src/SSLmodels.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, kawshik8/DL-project when it was checked","code_sha256":"8c4252f18f2e14a8","code_sha256_prefix":"8c4252f18f2e14a8","mcp_get_code":{"code_sha256":"8c4252f18f2e14a8"}}],"record_sha256":"798563820c18f125383e8e1a9760c4cc8a7f6c17181b2ed7f79a8b9dfbe4381c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}