{"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-predictor","entry":"get_predictor","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":19,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"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":5,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":19,"n_places_pointer_only":12,"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":0,"ran_fixture":0,"ran":1,"unverified":4},"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":"2601.11444","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-11444","title":"When Are Two Scores Better Than One? Investigating Ensembles of Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"rarazafin/score_diffusion_ensemble","path":"score_based_cifar10/sampling.py","file_url":"https://github.com/rarazafin/score_diffusion_ensemble/blob/HEAD/score_based_cifar10/sampling.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, rarazafin/score_diffusion_ensemble when it was checked","code_sha256":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2509.12019","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-12019","title":"AMQ: Enabling AutoML for Mixed-precision Weight-Only Quantization of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"dlwns147/amq","path":"amq/predictor/factory.py","file_url":"https://github.com/dlwns147/amq/blob/HEAD/amq/predictor/factory.py","status":"unverified","verification_level":0,"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":"ff52072d4ccb84f3","code_sha256_prefix":"ff52072d4ccb84f3","mcp_get_code":{"code_sha256":"ff52072d4ccb84f3"}},{"arxiv_id":"2503.01161","arxiv_id_is_arxiv":true,"paper":"/paper/split-gibbs-discrete-diffusion-posterior","title":"Split Gibbs Discrete Diffusion Posterior Sampling","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2410.10587","arxiv_id_is_arxiv":true,"paper":"/paper/topofr-a-closer-look-at-topology-alignment-on","title":"TopoFR: A Closer Look at Topology Alignment on Face Recognition","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2410.03655","arxiv_id_is_arxiv":true,"paper":"/paper/geometric-representation-condition-improves","title":"Geometric Representation Condition Improves Equivariant Molecule Generation","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GraphPKU/GeoRCG","path":"EDM_based/models_GeoRCG/sde/sde_sampling.py","file_url":"https://github.com/GraphPKU/GeoRCG/blob/HEAD/EDM_based/models_GeoRCG/sde/sde_sampling.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, GraphPKU/GeoRCG when it was checked","code_sha256":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2408.08502","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-image-to-image-diffusion-classifier","title":"Efficient Image-to-Image Diffusion Classifier for Adversarial Robustness","date":"2024-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hfmei/idc","path":"IDC-BPDA/score_sde/sampling.py","file_url":"https://github.com/hfmei/idc/blob/HEAD/IDC-BPDA/score_sde/sampling.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, hfmei/idc when it was checked","code_sha256":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2405.00287","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-sampling-for-contrastive-views-and","title":"SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendation","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeongwhanchoi/scone","path":"sampling_sgm.py","file_url":"https://github.com/jeongwhanchoi/scone/blob/HEAD/sampling_sgm.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":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2311.16124","arxiv_id_is_arxiv":true,"paper":"/paper/diffattack-evasion-attacks-against-diffusion-1","title":"DiffAttack: Evasion Attacks Against Diffusion-Based Adversarial Purification","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kangmintong/DiffAttack","path":"DiffAttack_DDPM_Based/score_sde/sampling.py","file_url":"https://github.com/kangmintong/DiffAttack/blob/HEAD/DiffAttack_DDPM_Based/score_sde/sampling.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, kangmintong/DiffAttack when it was checked","code_sha256":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2309.01949","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-bayesian-computational-imaging-with","title":"Variational Bayesian Imaging with an Efficient Surrogate Score-based Prior","date":"2023-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"berthyf96/score_prior","path":"score_flow/sampling.py","file_url":"https://github.com/berthyf96/score_prior/blob/HEAD/score_flow/sampling.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, berthyf96/score_prior when it was checked","code_sha256":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2303.08133","arxiv_id_is_arxiv":true,"paper":"/paper/meshdiffusion-score-based-generative-3d-mesh","title":"MeshDiffusion: Score-based Generative 3D Mesh Modeling","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lzzcd001/MeshDiffusion","path":"lib/diffusion/sampling.py","file_url":"https://github.com/lzzcd001/MeshDiffusion/blob/HEAD/lib/diffusion/sampling.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":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2303.01469","arxiv_id_is_arxiv":true,"paper":"/paper/consistency-models","title":"Consistency Models","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2302.05290","arxiv_id_is_arxiv":true,"paper":"/paper/removing-structured-noise-with-diffusion","title":"Removing Structured Noise with Diffusion Models","date":"2023-01-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tristan-deep/joint-diffusion","path":"generators/SGM/sampling.py","file_url":"https://github.com/tristan-deep/joint-diffusion/blob/HEAD/generators/SGM/sampling.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, tristan-deep/joint-diffusion when it was checked","code_sha256":"1f2515a4dedd4e58","code_sha256_prefix":"1f2515a4dedd4e58","mcp_get_code":{"code_sha256":"1f2515a4dedd4e58"}},{"arxiv_id":"2212.01842","arxiv_id_is_arxiv":true,"paper":"/paper/graphgdp-generative-diffusion-processes-for","title":"GraphGDP: Generative Diffusion Processes for Permutation Invariant Graph Generation","date":"2022-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graph-0/graphgdp","path":"sampling.py","file_url":"https://github.com/graph-0/graphgdp/blob/HEAD/sampling.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":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2211.16116","arxiv_id_is_arxiv":true,"paper":"/paper/machine-learning-emulation-of-a-local-scale","title":"Machine learning emulation of a local-scale UK climate model","date":"2022-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"henryaddison/score_sde_pytorch","path":"src/ml_downscaling_emulator/sampling.py","file_url":"https://github.com/henryaddison/score_sde_pytorch/blob/HEAD/src/ml_downscaling_emulator/sampling.py","status":"unverified","verification_level":0,"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":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2112.07068","arxiv_id_is_arxiv":true,"paper":"/paper/score-based-generative-modeling-with-1","title":"Score-Based Generative Modeling with Critically-Damped Langevin Diffusion","date":"2021-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yang-song/score_sde_pytorch","path":"sampling.py","file_url":"https://github.com/yang-song/score_sde_pytorch/blob/HEAD/sampling.py","status":"unverified","verification_level":0,"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":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2105.14080","arxiv_id_is_arxiv":true,"paper":"/paper/gotta-go-fast-when-generating-data-with-score","title":"Gotta Go Fast When Generating Data with Score-Based Models","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlexiaJM/score_sde_fast_sampling","path":"sde_sampling_torch.py","file_url":"https://github.com/AlexiaJM/score_sde_fast_sampling/blob/HEAD/sde_sampling_torch.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, AlexiaJM/score_sde_fast_sampling when it was checked","code_sha256":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"2006.09011","arxiv_id_is_arxiv":true,"paper":"/paper/improved-techniques-for-training-score-based","title":"Improved Techniques for Training Score-Based Generative Models","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a58facb8fe71823a","code_sha256_prefix":"a58facb8fe71823a","mcp_get_code":{"code_sha256":"a58facb8fe71823a"}},{"arxiv_id":"1704.03155","arxiv_id_is_arxiv":true,"paper":"/paper/east-an-efficient-and-accurate-scene-text","title":"EAST: An Efficient and Accurate Scene Text Detector","date":"2017-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"argman/EAST","path":"run_demo_server.py","file_url":"https://github.com/argman/EAST/blob/HEAD/run_demo_server.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, argman/EAST, is not in the permissive set Syntology serves inline","code_sha256":"85d1fadaaf9cb100","code_sha256_prefix":"85d1fadaaf9cb100","mcp_get_code":{"code_sha256":"85d1fadaaf9cb100"}},{"arxiv_id":"ijcai2024_0675","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0675","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HongxinXiang/IEM","path":"model/base/base_utils.py","file_url":"https://github.com/HongxinXiang/IEM/blob/HEAD/model/base/base_utils.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":"85ba691b5052ea34","code_sha256_prefix":"85ba691b5052ea34","mcp_get_code":{"code_sha256":"85ba691b5052ea34"}}],"record_sha256":"f17665e3696c22133cedb4b1b92bf610b0e08f0f6418ceacf4625d11ee44e028","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}