{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/partition","entry":"partition","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":17,"n_papers_ran":7,"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":15,"n_samples_ran":6,"n_samples_fingerprinted":3,"n_places":17,"n_places_pointer_only":7,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":1,"unverified":9},"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":"2509.01624","paper":"/paper/arxiv-2509-01624","title":"Q-Sched: Pushing the Boundaries of Few-Step Diffusion Models with Quantization-Aware Scheduling","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"enyac-group/q-sched","path":"src/metrics/aqmap.py","file_url":"https://github.com/enyac-group/q-sched/blob/HEAD/src/metrics/aqmap.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"d60bfded080c331f","mcp_get_code":{"code_sha256":"d60bfded080c331f"}},{"arxiv_id":"2502.04322","paper":"/paper/speak-easy-eliciting-harmful-jailbreaks-from","title":"Speak Easy: Eliciting Harmful Jailbreaks from LLMs with Simple Interactions","date":"2025-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiksiu-chan/SpeakEasy","path":"src/speakeasy/utils.py","file_url":"https://github.com/yiksiu-chan/SpeakEasy/blob/HEAD/src/speakeasy/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fea42bdd29b34dfa","mcp_get_code":{"code_sha256":"fea42bdd29b34dfa"}},{"arxiv_id":"2410.19816","paper":"/paper/divshift-exploring-domain-specific","title":"DivShift: Exploring Domain-Specific Distribution Shifts in Large-Scale, Volunteer-Collected Biodiversity Datasets","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moiexpositoalonsolab/DivShift","path":"src/supervised_train.py","file_url":"https://github.com/moiexpositoalonsolab/DivShift/blob/HEAD/src/supervised_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"561a103ed3645a99","mcp_get_code":{"code_sha256":"561a103ed3645a99"}},{"arxiv_id":"2409.05122","paper":"/paper/pmt-progressive-mean-teacher-via-exploring","title":"PMT: Progressive Mean Teacher via Exploring Temporal Consistency for Semi-Supervised Medical Image Segmentation","date":"2024-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"axi404/pmt","path":"code/utils/opt_utils.py","file_url":"https://github.com/axi404/pmt/blob/HEAD/code/utils/opt_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0c1c3e53e5dcd325","mcp_get_code":{"code_sha256":"0c1c3e53e5dcd325"}},{"arxiv_id":"2306.12370","paper":"/paper/priorband-practical-hyperparameter-1","title":"PriorBand: Practical Hyperparameter Optimization in the Age of Deep Learning","date":"2023-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/mf-prior-exp","path":"prior_overlap_plots/plot.py","file_url":"https://github.com/automl/mf-prior-exp/blob/HEAD/prior_overlap_plots/plot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e0c43061f67298a","mcp_get_code":{"code_sha256":"3e0c43061f67298a"}},{"arxiv_id":"2203.12258","paper":"/paper/can-prompt-probe-pretrained-language-models","title":"Can Prompt Probe Pretrained Language Models? Understanding the Invisible Risks from a Causal View","date":"2022-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"c-box/causaleval","path":"pretrain_scripts/run_clm.py","file_url":"https://github.com/c-box/causaleval/blob/HEAD/pretrain_scripts/run_clm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"91c07f7c87383db5","mcp_get_code":{"code_sha256":"91c07f7c87383db5"}},{"arxiv_id":"2106.05786","paper":"/paper/cat-cross-attention-in-vision-transformer","title":"CAT: Cross Attention in Vision Transformer","date":"2021-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linhezheng19/CAT","path":"src/cat.py","file_url":"https://github.com/linhezheng19/CAT/blob/HEAD/src/cat.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a1a83893f9563bf8","mcp_get_code":{"code_sha256":"a1a83893f9563bf8"}},{"arxiv_id":"2102.04635","paper":"/paper/federated-deep-auc-maximization-for","title":"Federated Deep AUC Maximization for Heterogeneous Data with a Constant Communication Complexity","date":"2021-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optimization-ai/icml2021_feddeepauc_codasca","path":"main_codasca_cifar.py","file_url":"https://github.com/optimization-ai/icml2021_feddeepauc_codasca/blob/HEAD/main_codasca_cifar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"eb1f7eaaec1b33af","mcp_get_code":{"code_sha256":"eb1f7eaaec1b33af"}},{"arxiv_id":"2004.14939","paper":"/paper/peernomination-relaxing-exactness-for","title":"PeerNomination: Relaxing Exactness for Increased Accuracy in Peer Selection","date":"2020-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nmattei/peerselection","path":"peerselect/peerselect/impartial.py","file_url":"https://github.com/nmattei/peerselection/blob/HEAD/peerselect/peerselect/impartial.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"c485243a5bb5f155","mcp_get_code":{"code_sha256":"c485243a5bb5f155"}},{"arxiv_id":"1911.04448","paper":"/paper/real-time-reinforcement-learning","title":"Real-Time Reinforcement Learning","date":"2019-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rmst/rtrl","path":"rtrl/util.py","file_url":"https://github.com/rmst/rtrl/blob/HEAD/rtrl/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c0504dae0e2af9cc","mcp_get_code":{"code_sha256":"c0504dae0e2af9cc"}},{"arxiv_id":"1905.04943","paper":"/paper/universal-invariant-and-equivariant-graph","title":"Universal Invariant and Equivariant Graph Neural Networks","date":"2019-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nkeriven/univgnn","path":"univgnn.py","file_url":"https://github.com/nkeriven/univgnn/blob/HEAD/univgnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f2eb4bbe1d24d5b9","mcp_get_code":{"code_sha256":"f2eb4bbe1d24d5b9"}},{"arxiv_id":"1902.04094","paper":"/paper/bert-has-a-mouth-and-it-must-speak-bert-as-a","title":"BERT has a Mouth, and It Must Speak: BERT as a Markov Random Field Language Model","date":"2019-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seanrjohnson/protein_gibbs_sampler","path":"src/pgen/esm_msa_sampler.py","file_url":"https://github.com/seanrjohnson/protein_gibbs_sampler/blob/HEAD/src/pgen/esm_msa_sampler.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1ecf520984f04d3a","mcp_get_code":{"code_sha256":"1ecf520984f04d3a"}},{"arxiv_id":"1812.07108","paper":"/paper/learning-private-neural-language-modeling","title":"Learning Private Neural Language Modeling with Attentive Aggregation","date":"2018-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaoxiongji/fed-att","path":"src/utils/sampling.py","file_url":"https://github.com/shaoxiongji/fed-att/blob/HEAD/src/utils/sampling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bc9519946c0aea20","mcp_get_code":{"code_sha256":"bc9519946c0aea20"}},{"arxiv_id":"1604.03632","paper":"/paper/strategyproof-peer-selection-using","title":"Strategyproof Peer Selection using Randomization, Partitioning, and Apportionment","date":"2016-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nmattei/peerselection","path":"peerselect/peerselect/impartial.py","file_url":"https://github.com/nmattei/peerselection/blob/HEAD/peerselect/peerselect/impartial.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"d9f5f9eff4969b8c","mcp_get_code":{"code_sha256":"d9f5f9eff4969b8c"}},{"arxiv_id":"0711.0189","paper":"/paper/a-tutorial-on-spectral-clustering","title":"A Tutorial on Spectral Clustering","date":"2007-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qinyuenlp/communitydetection","path":"algorithm/SpectralClustering.py","file_url":"https://github.com/qinyuenlp/communitydetection/blob/HEAD/algorithm/SpectralClustering.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6cda740a215213cb","mcp_get_code":{"code_sha256":"6cda740a215213cb"}},{"arxiv_id":"Xu_Dual-Temporal_Exemplar_Representation_Network_for_Video_Semantic_Segmentation_ICCV_2025_paper","paper":null,"title":"arXiv:Xu_Dual-Temporal_Exemplar_Representation_Network_for_Video_Semantic_Segmentation_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zlxilo/DTERN","path":"mmseg/models/decode_heads/dtern.py","file_url":"https://github.com/zlxilo/DTERN/blob/HEAD/mmseg/models/decode_heads/dtern.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a1a83893f9563bf8","mcp_get_code":{"code_sha256":"a1a83893f9563bf8"}},{"arxiv_id":"Wang_MCF_Mutual_Correction_Framework_for_Semi-Supervised_Medical_Image_Segmentation_CVPR_2023_paper","paper":null,"title":"arXiv:Wang_MCF_Mutual_Correction_Framework_for_Semi-Supervised_Medical_Image_Segmentation_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"WYC-321/MCF","path":"code/utils/opt_utils.py","file_url":"https://github.com/WYC-321/MCF/blob/HEAD/code/utils/opt_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0c1c3e53e5dcd325","mcp_get_code":{"code_sha256":"0c1c3e53e5dcd325"}}]}