{"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/minmax","entry":"minmax","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":0,"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":11,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":10,"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":4,"ran_draft_wrong":0,"ran_fixture":0,"ran":7,"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":"2608.21702","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-21702","title":"From Association to Causation: Improving Retrieval Precision of Retrieval-Augmented Generation via Causal Relations and an Attention Mechanism","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Silk-Road/causal-rag-rerank","path":"experiment_reranker.py","file_url":"https://github.com/Silk-Road/causal-rag-rerank/blob/HEAD/experiment_reranker.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Silk-Road/causal-rag-rerank (NOASSERTION)","code_sha256":"5d8d846d7eea6b45","code_sha256_prefix":"5d8d846d7eea6b45","mcp_get_code":{"code_sha256":"5d8d846d7eea6b45"}},{"arxiv_id":"2608.21365","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-21365","title":"KSE-Web: An Analysis of Hybrid Retrieval and LLM-Assisted Query Expansion for Low-Resource Khmer Semantic Search","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"back-kh/Khmer-Semantic-Search","path":"codes/evaluate_retrieval.py","file_url":"https://github.com/back-kh/Khmer-Semantic-Search/blob/HEAD/codes/evaluate_retrieval.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0b8da80a15fb112a","code_sha256_prefix":"0b8da80a15fb112a","mcp_get_code":{"code_sha256":"0b8da80a15fb112a"}},{"arxiv_id":"2412.07186","arxiv_id_is_arxiv":true,"paper":"/paper/monte-carlo-tree-search-based-space-transfer","title":"Monte Carlo Tree Search based Space Transfer for Black-box Optimization","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lamda-bbo/mcts-transfer","path":"mcts/MCTS.py","file_url":"https://github.com/lamda-bbo/mcts-transfer/blob/HEAD/mcts/MCTS.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lamda-bbo/mcts-transfer when it was checked","code_sha256":"a89769c364b31a64","code_sha256_prefix":"a89769c364b31a64","mcp_get_code":{"code_sha256":"a89769c364b31a64"}},{"arxiv_id":"2407.19547","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-feature-matters-a-framework-for","title":"Temporal Feature Matters: A Framework for Diffusion Model Quantization","date":"2024-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"modeltc/tfmq-dm","path":"quant/quant_layer.py","file_url":"https://github.com/modeltc/tfmq-dm/blob/HEAD/quant/quant_layer.py","status":"ran","verification_level":1,"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":"71aaede90c9c1031","code_sha256_prefix":"71aaede90c9c1031","mcp_get_code":{"code_sha256":"71aaede90c9c1031"}},{"arxiv_id":"2407.00002","arxiv_id_is_arxiv":true,"paper":"/paper/protein-property-prediction-with","title":"Kermut: Composite kernel regression for protein variant effects","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OATML-Markslab/ProteinGym","path":"proteingym/performance_DMS_benchmarks.py","file_url":"https://github.com/OATML-Markslab/ProteinGym/blob/HEAD/proteingym/performance_DMS_benchmarks.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1b86eba6fab689e0","code_sha256_prefix":"1b86eba6fab689e0","mcp_get_code":{"code_sha256":"1b86eba6fab689e0"}},{"arxiv_id":"2311.17916","arxiv_id_is_arxiv":true,"paper":"/paper/wycryst-wyckoff-inorganic-crystal-generator","title":"WyCryst: Wyckoff Inorganic Crystal Generator Framework","date":null,"month_inferred_from_arxiv_id":"2023-11","title_source":"archive","repo":"raymondzhurm/wycryst","path":"utils.py","file_url":"https://github.com/raymondzhurm/wycryst/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, raymondzhurm/wycryst when it was checked","code_sha256":"487948bdbf959f32","code_sha256_prefix":"487948bdbf959f32","mcp_get_code":{"code_sha256":"487948bdbf959f32"}},{"arxiv_id":"2308.08231","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2308.08231","date":null,"month_inferred_from_arxiv_id":"2023-08","title_source":null,"repo":"ZhangCYG/DDFHO","path":"datasets/base_data.py","file_url":"https://github.com/ZhangCYG/DDFHO/blob/HEAD/datasets/base_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ZhangCYG/DDFHO when it was checked","code_sha256":"870e2b49af036743","code_sha256_prefix":"870e2b49af036743","mcp_get_code":{"code_sha256":"870e2b49af036743"}},{"arxiv_id":"2005.07609","arxiv_id_is_arxiv":true,"paper":"/paper/inverse-design-of-crystals-using-generalized","title":"An invertible crystallographic representation for general inverse design of inorganic crystals with targeted properties","date":"2020-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PV-Lab/FTCP","path":"utils.py","file_url":"https://github.com/PV-Lab/FTCP/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6c557e4e71b36dba","code_sha256_prefix":"6c557e4e71b36dba","mcp_get_code":{"code_sha256":"6c557e4e71b36dba"}},{"arxiv_id":"1907.08268","arxiv_id_is_arxiv":true,"paper":"/paper/discrete-object-generation-with-reversible","title":"Discrete Object Generation with Reversible Inductive Construction","date":"2019-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PrincetonLIPS/reversible-inductive-construction","path":"code/genric/laman/joint_network.py","file_url":"https://github.com/PrincetonLIPS/reversible-inductive-construction/blob/HEAD/code/genric/laman/joint_network.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":"7f42965b0968e4e8","code_sha256_prefix":"7f42965b0968e4e8","mcp_get_code":{"code_sha256":"7f42965b0968e4e8"}},{"arxiv_id":"1702.05373","arxiv_id_is_arxiv":true,"paper":"/paper/emnist-an-extension-of-mnist-to-handwritten","title":"EMNIST: an extension of MNIST to handwritten letters","date":"2017-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Chizuchizu/amplify-hackathon","path":"src/utils.py","file_url":"https://github.com/Chizuchizu/amplify-hackathon/blob/HEAD/src/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":"49fda2edf096ba10","code_sha256_prefix":"49fda2edf096ba10","mcp_get_code":{"code_sha256":"49fda2edf096ba10"}},{"arxiv_id":"1506.02025","arxiv_id_is_arxiv":true,"paper":"/paper/spatial-transformer-networks","title":"Spatial Transformer Networks","date":"2015-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dabane-ghassan/int-lab-book","path":"src/what_where/display.py","file_url":"https://github.com/dabane-ghassan/int-lab-book/blob/HEAD/src/what_where/display.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":"55cf5bb59b4c12a8","code_sha256_prefix":"55cf5bb59b4c12a8","mcp_get_code":{"code_sha256":"55cf5bb59b4c12a8"}},{"arxiv_id":"Huang_TFMQ-DM_Temporal_Feature_Maintenance_Quantization_for_Diffusion_Models_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Huang_TFMQ-DM_Temporal_Feature_Maintenance_Quantization_for_Diffusion_Models_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ModelTC/TFMQ-DM","path":"quant/quant_layer.py","file_url":"https://github.com/ModelTC/TFMQ-DM/blob/HEAD/quant/quant_layer.py","status":"ran","verification_level":1,"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":"71aaede90c9c1031","code_sha256_prefix":"71aaede90c9c1031","mcp_get_code":{"code_sha256":"71aaede90c9c1031"}}],"record_sha256":"bfea822f013d7648e8dee65f31115b4335a56ae2c3ad5c0ff9ab6815732ca55e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}