{"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/unbatch","entry":"unbatch","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":1,"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":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":1},"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":"2311.03707","arxiv_id_is_arxiv":true,"paper":"/paper/the-neurips-2022-neural-mmo-challenge-a","title":"The NeurIPS 2022 Neural MMO Challenge: A Massively Multiagent Competition with Specialization and Trade","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neuralmmo/neurips2022nmmo-submission-pool","path":"submission_pool/baseline-IL/submission.py","file_url":"https://github.com/neuralmmo/neurips2022nmmo-submission-pool/blob/HEAD/submission_pool/baseline-IL/submission.py","status":"ran","verification_level":1,"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, neuralmmo/neurips2022nmmo-submission-pool when it was checked","code_sha256":"5b96aec2fc5ff59e","code_sha256_prefix":"5b96aec2fc5ff59e","mcp_get_code":{"code_sha256":"5b96aec2fc5ff59e"}},{"arxiv_id":"2112.01640","arxiv_id_is_arxiv":true,"paper":"/paper/longchecker-improving-scientific-claim","title":"MultiVerS: Improving scientific claim verification with weak supervision and full-document context","date":"2021-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dwadden/longchecker","path":"multivers/util.py","file_url":"https://github.com/dwadden/longchecker/blob/HEAD/multivers/util.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":"89a74da47ab6bbe4","code_sha256_prefix":"89a74da47ab6bbe4","mcp_get_code":{"code_sha256":"89a74da47ab6bbe4"}},{"arxiv_id":"2002.12920","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-perturbation-analysis-on-general","title":"Automatic Perturbation Analysis for Scalable Certified Robustness and Beyond","date":"2020-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huanzhang12/CROWN-IBP","path":"convex_adversarial/dual_layers.py","file_url":"https://github.com/huanzhang12/CROWN-IBP/blob/HEAD/convex_adversarial/dual_layers.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9efb427bc4cdf3df","code_sha256_prefix":"9efb427bc4cdf3df","mcp_get_code":{"code_sha256":"9efb427bc4cdf3df"}},{"arxiv_id":"1912.01329","arxiv_id_is_arxiv":true,"paper":"/paper/neural-network-branching-for-neural-network-1","title":"Neural Network Branching for Neural Network Verification","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oval-group/GNN_branching","path":"convex_adversarial/convex_adversarial/dual_layers.py","file_url":"https://github.com/oval-group/GNN_branching/blob/HEAD/convex_adversarial/convex_adversarial/dual_layers.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9efb427bc4cdf3df","code_sha256_prefix":"9efb427bc4cdf3df","mcp_get_code":{"code_sha256":"9efb427bc4cdf3df"}},{"arxiv_id":"1909.01315","arxiv_id_is_arxiv":true,"paper":"/paper/deep-graph-library-towards-efficient-and","title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","date":"2019-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mengyangniu/dgl","path":"python/dgl/batch.py","file_url":"https://github.com/mengyangniu/dgl/blob/HEAD/python/dgl/batch.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":"73f17bd169feeaab","code_sha256_prefix":"73f17bd169feeaab","mcp_get_code":{"code_sha256":"73f17bd169feeaab"}},{"arxiv_id":"1904.02632","arxiv_id_is_arxiv":true,"paper":"/paper/a-learned-representation-for-scalable-vector","title":"A Learned Representation for Scalable Vector Graphics","date":"2019-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tensorflow/magenta","path":"magenta/common/state_util.py","file_url":"https://github.com/tensorflow/magenta/blob/HEAD/magenta/common/state_util.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":"d64893e1f8ad90cf","code_sha256_prefix":"d64893e1f8ad90cf","mcp_get_code":{"code_sha256":"d64893e1f8ad90cf"}},{"arxiv_id":"1804.09399","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-generative-adversarial-networks","title":"Convolutional Generative Adversarial Networks with Binary Neurons for Polyphonic Music Generation","date":"2018-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucylow/Stochastic_SoundCloud","path":"common/state_util.py","file_url":"https://github.com/lucylow/Stochastic_SoundCloud/blob/HEAD/common/state_util.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":"d64893e1f8ad90cf","code_sha256_prefix":"d64893e1f8ad90cf","mcp_get_code":{"code_sha256":"d64893e1f8ad90cf"}},{"arxiv_id":"1711.00851","arxiv_id_is_arxiv":true,"paper":"/paper/provable-defenses-against-adversarial","title":"Provable defenses against adversarial examples via the convex outer adversarial polytope","date":"2017-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fra31/mmr-universal","path":"kolter_wong/convex_adversarial/dual_network.py","file_url":"https://github.com/fra31/mmr-universal/blob/HEAD/kolter_wong/convex_adversarial/dual_network.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9efb427bc4cdf3df","code_sha256_prefix":"9efb427bc4cdf3df","mcp_get_code":{"code_sha256":"9efb427bc4cdf3df"}}],"record_sha256":"b844b30b516b697973b533d879915b1c980e50547614d6763f5fec3751bc9853","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}