{"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/choose","entry":"choose","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":11,"n_papers_ran":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":10,"n_samples_ran":4,"n_samples_fingerprinted":3,"n_places":11,"n_places_pointer_only":6,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":6},"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":"2604.06559","paper":"/paper/arxiv-2604-06559","title":"ExplainFuzz: Explainable and Constraint-Conditioned Test Generation with Probabilistic Circuits","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"niMgnoeSeeL/ExplainFuzz","path":"xml_concretizer/xml_concretizer.py","file_url":"https://github.com/niMgnoeSeeL/ExplainFuzz/blob/HEAD/xml_concretizer/xml_concretizer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"31eb2ef0fa44a495","mcp_get_code":{"code_sha256":"31eb2ef0fa44a495"}},{"arxiv_id":"2402.06187","paper":"/paper/premier-taco-pretraining-multitask","title":"Premier-TACO is a Few-Shot Policy Learner: Pretraining Multitask Representation via Temporal Action-Driven Contrastive Loss","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PremierTACO/premier-taco","path":"replay_buffer.py","file_url":"https://github.com/PremierTACO/premier-taco/blob/HEAD/replay_buffer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"93768277f8d3a9c3","mcp_get_code":{"code_sha256":"93768277f8d3a9c3"}},{"arxiv_id":"2108.06098","paper":"/paper/fedpara-low-rank-hadamard-product","title":"FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learning","date":"2021-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kohakublueleaf/lycoris","path":"lycoris/functional/loha.py","file_url":"https://github.com/kohakublueleaf/lycoris/blob/HEAD/lycoris/functional/loha.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6942530568e5f4cc","mcp_get_code":{"code_sha256":"6942530568e5f4cc"}},{"arxiv_id":"2010.07518","paper":"/paper/automatic-analysis-and-influence-of","title":"Automatic Analysis and Influence of Hierarchical Structure on Melody, Rhythm and Harmony in Popular Music","date":null,"month_inferred_from_arxiv_id":"2020-10","title_source":"archive","repo":"Dsqvival/hierarchical-structure-analysis","path":"preprocessing/finalize_chord.py","file_url":"https://github.com/Dsqvival/hierarchical-structure-analysis/blob/HEAD/preprocessing/finalize_chord.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0a1bcea47f053d39","mcp_get_code":{"code_sha256":"0a1bcea47f053d39"}},{"arxiv_id":"2006.09481","paper":"/paper/efficient-nonparametric-statistical-inference","title":"Efficient nonparametric statistical inference on population feature importance using Shapley values","date":"2020-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bdwilliamson/vimpy","path":"vimpy/spvim.py","file_url":"https://github.com/bdwilliamson/vimpy/blob/HEAD/vimpy/spvim.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"96c2d58d78728d79","mcp_get_code":{"code_sha256":"96c2d58d78728d79"}},{"arxiv_id":"2006.08381","paper":"/paper/dreamcoder-growing-generalizable","title":"DreamCoder: Growing generalizable, interpretable knowledge with wake-sleep Bayesian program learning","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ellisk42/ec","path":"bin/image_robustfill.py","file_url":"https://github.com/ellisk42/ec/blob/HEAD/bin/image_robustfill.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"4e57120be17c7bb3","mcp_get_code":{"code_sha256":"4e57120be17c7bb3"}},{"arxiv_id":"1912.02771","paper":"/paper/label-consistent-backdoor-attacks","title":"Label-Consistent Backdoor Attacks","date":"2019-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MadryLab/label-consistent-backdoor-code","path":"resnet_model.py","file_url":"https://github.com/MadryLab/label-consistent-backdoor-code/blob/HEAD/resnet_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e10222ca74d607cb","mcp_get_code":{"code_sha256":"e10222ca74d607cb"}},{"arxiv_id":"1910.02182","paper":"/paper/on-tractable-computation-of-expected","title":"On Tractable Computation of Expected Predictions","date":"2019-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UCLA-StarAI/mc2","path":"circuit_expect.py","file_url":"https://github.com/UCLA-StarAI/mc2/blob/HEAD/circuit_expect.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7c2345c530764f4e","mcp_get_code":{"code_sha256":"7c2345c530764f4e"}},{"arxiv_id":"1906.00425","paper":"/paper/190600425","title":"The Convergence Rate of Neural Networks for Learned Functions of Different Frequencies","date":"2019-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ykasten/Convergence-Rate-NN-Different-Frequencies","path":"Asymptotics/mainAndPlot.py","file_url":"https://github.com/ykasten/Convergence-Rate-NN-Different-Frequencies/blob/HEAD/Asymptotics/mainAndPlot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"604b5e56170f4075","mcp_get_code":{"code_sha256":"604b5e56170f4075"}},{"arxiv_id":"1803.08670","paper":"/paper/object-detection-for-comics-using-manga109","title":"Object Detection for Comics using Manga109 Annotations","date":"2018-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aasimsani/artificial_manga_panel_dataset","path":"preprocesing/layout_engine/helpers.py","file_url":"https://github.com/aasimsani/artificial_manga_panel_dataset/blob/HEAD/preprocesing/layout_engine/helpers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c96f5f7297939735","mcp_get_code":{"code_sha256":"c96f5f7297939735"}},{"arxiv_id":"1703.07469","paper":"/paper/robustfill-neural-program-learning-under","title":"RobustFill: Neural Program Learning under Noisy I/O","date":"2017-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"insperatum/pinn","path":"robustfill.py","file_url":"https://github.com/insperatum/pinn/blob/HEAD/robustfill.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4e57120be17c7bb3","mcp_get_code":{"code_sha256":"4e57120be17c7bb3"}}]}