{"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/process-input","entry":"process_input","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":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":4,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":2,"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":4,"ran_fixture":0,"ran":3,"unverified":0},"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.09413","arxiv_id_is_arxiv":true,"paper":"/paper/imitate-explore-and-self-improve-a","title":"Imitate, Explore, and Self-Improve: A Reproduction Report on Slow-thinking Reasoning Systems","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RUCAIBox/Slow_Thinking_with_LLMs","path":"STILL-3-TOOL/data_synthesis/coding_by_thinking.py","file_url":"https://github.com/RUCAIBox/Slow_Thinking_with_LLMs/blob/HEAD/STILL-3-TOOL/data_synthesis/coding_by_thinking.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, RUCAIBox/Slow_Thinking_with_LLMs when it was checked","code_sha256":"8a715d0671890763","code_sha256_prefix":"8a715d0671890763","mcp_get_code":{"code_sha256":"8a715d0671890763"}},{"arxiv_id":"2411.17388","arxiv_id_is_arxiv":true,"paper":"/paper/can-llms-be-good-graph-judger-for-knowledge","title":"Can LLMs be Good Graph Judge for Knowledge Graph Construction?","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhy-huang/graphjudge","path":"graph_judger/bert_classifier_infer.py","file_url":"https://github.com/hhy-huang/graphjudge/blob/HEAD/graph_judger/bert_classifier_infer.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":"d47506b71865ea46","code_sha256_prefix":"d47506b71865ea46","mcp_get_code":{"code_sha256":"d47506b71865ea46"}},{"arxiv_id":"2403.09085","arxiv_id_is_arxiv":true,"paper":"/paper/meaningful-learning-advancing-abstract","title":"Meaningful Learning: Enhancing Abstract Reasoning in Large Language Models via Generic Fact Guidance","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Waste-Wood/MeanLearn","path":"reason_ppl.py","file_url":"https://github.com/Waste-Wood/MeanLearn/blob/HEAD/reason_ppl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, Waste-Wood/MeanLearn when it was checked","code_sha256":"8461d5c9186434c7","code_sha256_prefix":"8461d5c9186434c7","mcp_get_code":{"code_sha256":"8461d5c9186434c7"}},{"arxiv_id":"2402.02750","arxiv_id_is_arxiv":true,"paper":"/paper/kivi-a-tuning-free-asymmetric-2bit","title":"KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cache","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jy-yuan/kivi","path":"models/utils_quant.py","file_url":"https://github.com/jy-yuan/kivi/blob/HEAD/models/utils_quant.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":"d54a29178ce3203f","code_sha256_prefix":"d54a29178ce3203f","mcp_get_code":{"code_sha256":"d54a29178ce3203f"}},{"arxiv_id":"2207.08824","arxiv_id_is_arxiv":true,"paper":"/paper/3d-equivariant-molecular-graph-pretraining","title":"Energy-Motivated Equivariant Pretraining for 3D Molecular Graphs","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaor17/3d-emgp","path":"script/finetune_qm9.py","file_url":"https://github.com/jiaor17/3d-emgp/blob/HEAD/script/finetune_qm9.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"255d015f7e8d573c","code_sha256_prefix":"255d015f7e8d573c","mcp_get_code":{"code_sha256":"255d015f7e8d573c"}},{"arxiv_id":"2207.08824","arxiv_id_is_arxiv":true,"paper":"/paper/3d-equivariant-molecular-graph-pretraining","title":"Energy-Motivated Equivariant Pretraining for 3D Molecular Graphs","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaor17/3d-emgp","path":"script/finetune_md17.py","file_url":"https://github.com/jiaor17/3d-emgp/blob/HEAD/script/finetune_md17.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"654a4b9e4afe14f4","code_sha256_prefix":"654a4b9e4afe14f4","mcp_get_code":{"code_sha256":"654a4b9e4afe14f4"}},{"arxiv_id":"2009.11551","arxiv_id_is_arxiv":true,"paper":"/paper/residual-feature-distillation-network-for","title":"Residual Feature Distillation Network for Lightweight Image Super-Resolution","date":"2020-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tuvovan/RFDNet-ImageSuperResolution","path":"utils.py","file_url":"https://github.com/tuvovan/RFDNet-ImageSuperResolution/blob/HEAD/utils.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":"e8527b9fdd187d26","code_sha256_prefix":"e8527b9fdd187d26","mcp_get_code":{"code_sha256":"e8527b9fdd187d26"}},{"arxiv_id":"aaai_25978","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25978","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jiaor17/3D-EMGP","path":"script/finetune_qm9.py","file_url":"https://github.com/jiaor17/3D-EMGP/blob/HEAD/script/finetune_qm9.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"255d015f7e8d573c","code_sha256_prefix":"255d015f7e8d573c","mcp_get_code":{"code_sha256":"255d015f7e8d573c"}},{"arxiv_id":"aaai_25978","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25978","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jiaor17/3D-EMGP","path":"script/finetune_md17.py","file_url":"https://github.com/jiaor17/3D-EMGP/blob/HEAD/script/finetune_md17.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"654a4b9e4afe14f4","code_sha256_prefix":"654a4b9e4afe14f4","mcp_get_code":{"code_sha256":"654a4b9e4afe14f4"}},{"arxiv_id":"Li_MBQ_Modality-Balanced_Quantization_for_Large_Vision-Language_Models_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Li_MBQ_Modality-Balanced_Quantization_for_Large_Vision-Language_Models_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"thu-nics/MBQ","path":"qmllm/methods/mbq/quantize/pre_quant.py","file_url":"https://github.com/thu-nics/MBQ/blob/HEAD/qmllm/methods/mbq/quantize/pre_quant.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":"72644f3889bd62df","code_sha256_prefix":"72644f3889bd62df","mcp_get_code":{"code_sha256":"72644f3889bd62df"}}],"record_sha256":"39cc0002e6d624576357a089a273f5bf88cf6694fcf8923b7e1227805a5d4463","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}