{"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/choose","entry":"choose","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":11,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":3,"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":10,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":4,"n_samples_fingerprinted":3,"n_places":11,"n_places_pointer_only":6,"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":2,"ran_violates":0,"ran_draft_wrong":3,"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":"2604.06559","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, niMgnoeSeeL/ExplainFuzz when it was checked","code_sha256":"31eb2ef0fa44a495","code_sha256_prefix":"31eb2ef0fa44a495","mcp_get_code":{"code_sha256":"31eb2ef0fa44a495"}},{"arxiv_id":"2402.06187","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, PremierTACO/premier-taco when it was checked","code_sha256":"93768277f8d3a9c3","code_sha256_prefix":"93768277f8d3a9c3","mcp_get_code":{"code_sha256":"93768277f8d3a9c3"}},{"arxiv_id":"2108.06098","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6942530568e5f4cc","code_sha256_prefix":"6942530568e5f4cc","mcp_get_code":{"code_sha256":"6942530568e5f4cc"}},{"arxiv_id":"2010.07518","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0a1bcea47f053d39","code_sha256_prefix":"0a1bcea47f053d39","mcp_get_code":{"code_sha256":"0a1bcea47f053d39"}},{"arxiv_id":"2006.09481","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"96c2d58d78728d79","code_sha256_prefix":"96c2d58d78728d79","mcp_get_code":{"code_sha256":"96c2d58d78728d79"}},{"arxiv_id":"2006.08381","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ellisk42/ec, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"4e57120be17c7bb3","code_sha256_prefix":"4e57120be17c7bb3","mcp_get_code":{"code_sha256":"4e57120be17c7bb3"}},{"arxiv_id":"1912.02771","arxiv_id_is_arxiv":true,"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":"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":"e10222ca74d607cb","code_sha256_prefix":"e10222ca74d607cb","mcp_get_code":{"code_sha256":"e10222ca74d607cb"}},{"arxiv_id":"1910.02182","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, UCLA-StarAI/mc2 when it was checked","code_sha256":"7c2345c530764f4e","code_sha256_prefix":"7c2345c530764f4e","mcp_get_code":{"code_sha256":"7c2345c530764f4e"}},{"arxiv_id":"1906.00425","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ykasten/Convergence-Rate-NN-Different-Frequencies when it was checked","code_sha256":"604b5e56170f4075","code_sha256_prefix":"604b5e56170f4075","mcp_get_code":{"code_sha256":"604b5e56170f4075"}},{"arxiv_id":"1803.08670","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c96f5f7297939735","code_sha256_prefix":"c96f5f7297939735","mcp_get_code":{"code_sha256":"c96f5f7297939735"}},{"arxiv_id":"1703.07469","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, insperatum/pinn when it was checked","code_sha256":"4e57120be17c7bb3","code_sha256_prefix":"4e57120be17c7bb3","mcp_get_code":{"code_sha256":"4e57120be17c7bb3"}}],"record_sha256":"163198d6e21efd56351a8ef1df72fcc16b2faa79da36528ee06d0c4b2e1520f8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}