{"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/batch","entry":"batch","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":31,"n_papers_ran":29,"n_papers_ran_no_instrument_failure":20,"n_papers_ran_instrument_only":9,"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":23,"n_samples_ran":20,"n_samples_constructed":0,"n_samples_ran_checked":15,"n_samples_instrument":5,"n_samples_unverified":3,"n_samples_fingerprinted":4,"n_places":32,"n_places_pointer_only":10,"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":4,"ran_fixture":1,"ran":13,"unverified":3},"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":"2608.30325","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-30325","title":"Sequential Trajectories and Simultaneous Blending: Multi-Emotion Modeling for Instruction-Following TTS","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"FunAudioLLM/CosyVoice","path":"cosyvoice/dataset/processor.py","file_url":"https://github.com/FunAudioLLM/CosyVoice/blob/HEAD/cosyvoice/dataset/processor.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":"35a0b064833a64ee","code_sha256_prefix":"35a0b064833a64ee","mcp_get_code":{"code_sha256":"35a0b064833a64ee"}},{"arxiv_id":"2607.26648","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-26648","title":"The Sparsity Ceiling: Where Spiking Networks Canand Cannot-Trade Activity for Energy","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"zeyuyuyu/sparsity-ceiling","path":"exp1_2d.py","file_url":"https://github.com/zeyuyuyu/sparsity-ceiling/blob/HEAD/exp1_2d.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":"8ff194927721d885","code_sha256_prefix":"8ff194927721d885","mcp_get_code":{"code_sha256":"8ff194927721d885"}},{"arxiv_id":"2505.13000","arxiv_id_is_arxiv":true,"paper":"/paper/dualcodec-a-low-frame-rate-semantically-1","title":"DualCodec: A Low-Frame-Rate, Semantically-Enhanced Neural Audio Codec for Speech Generation","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":"archive","repo":"jiaqili3/DualCodec","path":"dualcodec/dataset/processor.py","file_url":"https://github.com/jiaqili3/DualCodec/blob/HEAD/dualcodec/dataset/processor.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":"ceaa742d42b41c00","code_sha256_prefix":"ceaa742d42b41c00","mcp_get_code":{"code_sha256":"ceaa742d42b41c00"}},{"arxiv_id":"2412.16577","arxiv_id_is_arxiv":true,"paper":"/paper/a-meta-learning-approach-to-bayesian-causal","title":"A Meta-Learning Approach to Bayesian Causal Discovery","date":"2024-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Anish144/CausalStructureNeuralProcess","path":"ml2_meta_causal_discovery/utils/helpers.py","file_url":"https://github.com/Anish144/CausalStructureNeuralProcess/blob/HEAD/ml2_meta_causal_discovery/utils/helpers.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":"1a65e10e8d0a485b","code_sha256_prefix":"1a65e10e8d0a485b","mcp_get_code":{"code_sha256":"1a65e10e8d0a485b"}},{"arxiv_id":"2410.01432","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-teachers-for-amortized-samplers","title":"Adaptive teachers for amortized samplers","date":"2024-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alstn12088/adaptive-teacher","path":"discovery/gflownet/GFNs/teacher.py","file_url":"https://github.com/alstn12088/adaptive-teacher/blob/HEAD/discovery/gflownet/GFNs/teacher.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, alstn12088/adaptive-teacher when it was checked","code_sha256":"1a1ebe33ee0285e0","code_sha256_prefix":"1a1ebe33ee0285e0","mcp_get_code":{"code_sha256":"1a1ebe33ee0285e0"}},{"arxiv_id":"2410.01359","arxiv_id_is_arxiv":true,"paper":"/paper/flashmask-efficient-and-rich-mask-extension","title":"FlashMask: Efficient and Rich Mask Extension of FlashAttention","date":"2024-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PaddlePaddle/Paddle","path":"python/paddle/batch.py","file_url":"https://github.com/PaddlePaddle/Paddle/blob/HEAD/python/paddle/batch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8aef776e6a5e3e15","code_sha256_prefix":"8aef776e6a5e3e15","mcp_get_code":{"code_sha256":"8aef776e6a5e3e15"}},{"arxiv_id":"2404.05892","arxiv_id_is_arxiv":true,"paper":"/paper/eagle-and-finch-rwkv-with-matrix-valued","title":"Eagle and Finch: RWKV with Matrix-Valued States and Dynamic Recurrence","date":"2024-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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":"7e9cf65e078afda5","code_sha256_prefix":"7e9cf65e078afda5","mcp_get_code":{"code_sha256":"7e9cf65e078afda5"}},{"arxiv_id":"2311.08396","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-audio-captioning-with-audio","title":"Zero-shot audio captioning with audio-language model guidance and audio context keywords","date":"2023-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"explainableml/zeraucap","path":"audio_captioning/sound_obj_generator.py","file_url":"https://github.com/explainableml/zeraucap/blob/HEAD/audio_captioning/sound_obj_generator.py","status":"ran","verification_level":1,"contract_check":null,"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, explainableml/zeraucap when it was checked","code_sha256":"393efe21b22bf554","code_sha256_prefix":"393efe21b22bf554","mcp_get_code":{"code_sha256":"393efe21b22bf554"}},{"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":"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, neuralmmo/neurips2022nmmo-submission-pool when it was checked","code_sha256":"64b96c46e228ff68","code_sha256_prefix":"64b96c46e228ff68","mcp_get_code":{"code_sha256":"64b96c46e228ff68"}},{"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-RL/monobeast.py","file_url":"https://github.com/neuralmmo/neurips2022nmmo-submission-pool/blob/HEAD/submission_pool/baseline-RL/monobeast.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, neuralmmo/neurips2022nmmo-submission-pool when it was checked","code_sha256":"0deae43b60aa7c28","code_sha256_prefix":"0deae43b60aa7c28","mcp_get_code":{"code_sha256":"0deae43b60aa7c28"}},{"arxiv_id":"2310.02710","arxiv_id_is_arxiv":true,"paper":"/paper/local-search-gflownets","title":"Local Search GFlowNets","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dbsxodud-11/ls_gfn","path":"gflownet/utils.py","file_url":"https://github.com/dbsxodud-11/ls_gfn/blob/HEAD/gflownet/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, dbsxodud-11/ls_gfn when it was checked","code_sha256":"1a1ebe33ee0285e0","code_sha256_prefix":"1a1ebe33ee0285e0","mcp_get_code":{"code_sha256":"1a1ebe33ee0285e0"}},{"arxiv_id":"2310.00386","arxiv_id_is_arxiv":true,"paper":"/paper/order-preserving-gflownets","title":"Order-Preserving GFlowNets","date":"2023-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yhangchen/op-gfn","path":"single/GFN-Mole/gflownet/utils.py","file_url":"https://github.com/yhangchen/op-gfn/blob/HEAD/single/GFN-Mole/gflownet/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, yhangchen/op-gfn when it was checked","code_sha256":"1a1ebe33ee0285e0","code_sha256_prefix":"1a1ebe33ee0285e0","mcp_get_code":{"code_sha256":"1a1ebe33ee0285e0"}},{"arxiv_id":"2308.13418","arxiv_id_is_arxiv":true,"paper":"/paper/nougat-neural-optical-understanding-for","title":"Nougat: Neural Optical Understanding for Academic Documents","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/nougat","path":"nougat/model.py","file_url":"https://github.com/facebookresearch/nougat/blob/HEAD/nougat/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fea7d53593666bbe","code_sha256_prefix":"fea7d53593666bbe","mcp_get_code":{"code_sha256":"fea7d53593666bbe"}},{"arxiv_id":"2308.10888","arxiv_id_is_arxiv":true,"paper":"/paper/unlocking-accuracy-and-fairness-in","title":"Unlocking Accuracy and Fairness in Differentially Private Image Classification","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/jax_privacy","path":"jax_privacy/_validate.py","file_url":"https://github.com/deepmind/jax_privacy/blob/HEAD/jax_privacy/_validate.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":"2c02fa4677bd1e99","code_sha256_prefix":"2c02fa4677bd1e99","mcp_get_code":{"code_sha256":"2c02fa4677bd1e99"}},{"arxiv_id":"2305.15054","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-arithmetic-reasoning-in","title":"A Mechanistic Interpretation of Arithmetic Reasoning in Language Models using Causal Mediation Analysis","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alestolfo/lm-arithmetic","path":"intervention_models/intervention_model.py","file_url":"https://github.com/alestolfo/lm-arithmetic/blob/HEAD/intervention_models/intervention_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a3baae78dba11763","code_sha256_prefix":"a3baae78dba11763","mcp_get_code":{"code_sha256":"a3baae78dba11763"}},{"arxiv_id":"2305.13048","arxiv_id_is_arxiv":true,"paper":"/paper/rwkv-reinventing-rnns-for-the-transformer-era","title":"RWKV: Reinventing RNNs for the Transformer Era","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BlinkDL/RWKV-LM","path":"RWKV-v7/train_temp/rwkv7_train_simplified.py","file_url":"https://github.com/BlinkDL/RWKV-LM/blob/HEAD/RWKV-v7/train_temp/rwkv7_train_simplified.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7e9cf65e078afda5","code_sha256_prefix":"7e9cf65e078afda5","mcp_get_code":{"code_sha256":"7e9cf65e078afda5"}},{"arxiv_id":"2305.04684","arxiv_id_is_arxiv":true,"paper":"/paper/asdl-a-unified-interface-for-gradient","title":"ASDL: A Unified Interface for Gradient Preconditioning in PyTorch","date":"2023-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kazukiosawa/asdfghjkl","path":"asdl/kernel.py","file_url":"https://github.com/kazukiosawa/asdfghjkl/blob/HEAD/asdl/kernel.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":"5b6026671740e023","code_sha256_prefix":"5b6026671740e023","mcp_get_code":{"code_sha256":"5b6026671740e023"}},{"arxiv_id":"2203.15455","arxiv_id_is_arxiv":true,"paper":"/paper/wenet-2-0-more-productive-end-to-end-speech","title":"WeNet 2.0: More Productive End-to-End Speech Recognition Toolkit","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leonwlw/wenet","path":"wenet/dataset/processor.py","file_url":"https://github.com/leonwlw/wenet/blob/HEAD/wenet/dataset/processor.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":"f80d5ced1e019437","code_sha256_prefix":"f80d5ced1e019437","mcp_get_code":{"code_sha256":"f80d5ced1e019437"}},{"arxiv_id":"2203.14196","arxiv_id_is_arxiv":true,"paper":"/paper/hint-hierarchical-neuron-concept-explainer","title":"HINT: Hierarchical Neuron Concept Explainer","date":"2022-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AntonotnaWang/HINT","path":"func/concept_classifier.py","file_url":"https://github.com/AntonotnaWang/HINT/blob/HEAD/func/concept_classifier.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5028107bae80ca9d","code_sha256_prefix":"5028107bae80ca9d","mcp_get_code":{"code_sha256":"5028107bae80ca9d"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"778274b3fb463e7e","code_sha256_prefix":"778274b3fb463e7e","mcp_get_code":{"code_sha256":"778274b3fb463e7e"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"778274b3fb463e7e","code_sha256_prefix":"778274b3fb463e7e","mcp_get_code":{"code_sha256":"778274b3fb463e7e"}},{"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":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"851a75d666999e50","code_sha256_prefix":"851a75d666999e50","mcp_get_code":{"code_sha256":"851a75d666999e50"}},{"arxiv_id":"1809.05255","arxiv_id_is_arxiv":true,"paper":"/paper/sql-to-text-generation-with-graph-to-sequence","title":"SQL-to-Text Generation with Graph-to-Sequence Model","date":"2018-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/SQL-to-Text","path":"Graph2Seq-master/main/helpers.py","file_url":"https://github.com/IBM/SQL-to-Text/blob/HEAD/Graph2Seq-master/main/helpers.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":"fe5a62319b44915c","code_sha256_prefix":"fe5a62319b44915c","mcp_get_code":{"code_sha256":"fe5a62319b44915c"}},{"arxiv_id":"1808.07624","arxiv_id_is_arxiv":true,"paper":"/paper/exploiting-rich-syntactic-information-for","title":"Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model","date":"2018-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/Text-to-LogicForm","path":"Graph2Seq-master/main/helpers.py","file_url":"https://github.com/IBM/Text-to-LogicForm/blob/HEAD/Graph2Seq-master/main/helpers.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":"fe5a62319b44915c","code_sha256_prefix":"fe5a62319b44915c","mcp_get_code":{"code_sha256":"fe5a62319b44915c"}},{"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":"72dcc8b76ef3181d","code_sha256_prefix":"72dcc8b76ef3181d","mcp_get_code":{"code_sha256":"72dcc8b76ef3181d"}},{"arxiv_id":"1804.00823","arxiv_id_is_arxiv":true,"paper":"/paper/graph2seq-graph-to-sequence-learning-with","title":"Graph2Seq: Graph to Sequence Learning with Attention-based Neural Networks","date":"2018-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/Graph2Seq","path":"main/helpers.py","file_url":"https://github.com/IBM/Graph2Seq/blob/HEAD/main/helpers.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":"fe5a62319b44915c","code_sha256_prefix":"fe5a62319b44915c","mcp_get_code":{"code_sha256":"fe5a62319b44915c"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"778274b3fb463e7e","code_sha256_prefix":"778274b3fb463e7e","mcp_get_code":{"code_sha256":"778274b3fb463e7e"}},{"arxiv_id":"1702.00748","arxiv_id_is_arxiv":true,"paper":"/paper/qcd-aware-recursive-neural-networks-for-jet","title":"QCD-Aware Recursive Neural Networks for Jet Physics","date":"2017-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"glouppe/recnn","path":"recnn/recnn.py","file_url":"https://github.com/glouppe/recnn/blob/HEAD/recnn/recnn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c0889f46048db603","code_sha256_prefix":"c0889f46048db603","mcp_get_code":{"code_sha256":"c0889f46048db603"}},{"arxiv_id":"1506.03134","arxiv_id_is_arxiv":true,"paper":"/paper/pointer-networks","title":"Pointer Networks","date":"2015-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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":"796b2511367209ba","code_sha256_prefix":"796b2511367209ba","mcp_get_code":{"code_sha256":"796b2511367209ba"}},{"arxiv_id":"1409.3215","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-to-sequence-learning-with-neural","title":"Sequence to Sequence Learning with Neural Networks","date":"2014-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Guillem96/pointer-nn-pytorch","path":"data.py","file_url":"https://github.com/Guillem96/pointer-nn-pytorch/blob/HEAD/data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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, Guillem96/pointer-nn-pytorch, is not in the permissive set Syntology serves inline","code_sha256":"796b2511367209ba","code_sha256_prefix":"796b2511367209ba","mcp_get_code":{"code_sha256":"796b2511367209ba"}},{"arxiv_id":"1409.0473","arxiv_id_is_arxiv":true,"paper":"/paper/neural-machine-translation-by-jointly","title":"Neural Machine Translation by Jointly Learning to Align and Translate","date":"2014-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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":"796b2511367209ba","code_sha256_prefix":"796b2511367209ba","mcp_get_code":{"code_sha256":"796b2511367209ba"}},{"arxiv_id":"1406.2661","arxiv_id_is_arxiv":true,"paper":"/paper/generative-adversarial-networks","title":"Generative Adversarial Networks","date":"2014-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chandlersupple/GAN-in-Tensorflow","path":"vanilla_gan.py","file_url":"https://github.com/chandlersupple/GAN-in-Tensorflow/blob/HEAD/vanilla_gan.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":"b95161d9acac6b0e","code_sha256_prefix":"b95161d9acac6b0e","mcp_get_code":{"code_sha256":"b95161d9acac6b0e"}}],"record_sha256":"7125e800e75564b8fed38847c4f651dadd23221a3bda620c42ab9302a512a2b3","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}