{"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/load-args","entry":"load_args","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":25,"n_papers_ran":20,"n_papers_ran_no_instrument_failure":16,"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":20,"n_samples_ran":16,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":4,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":25,"n_places_pointer_only":3,"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":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":12,"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":"2407.13917","arxiv_id_is_arxiv":true,"paper":"/paper/linsatnet-the-positive-linear-satisfiability","title":"LinSATNet: The Positive Linear Satisfiability Neural Networks","date":"2024-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Thinklab-SJTU/LinSATNet","path":"TSP_exp/run_evaluate.py","file_url":"https://github.com/Thinklab-SJTU/LinSATNet/blob/HEAD/TSP_exp/run_evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"232d212380a938ff","code_sha256_prefix":"232d212380a938ff","mcp_get_code":{"code_sha256":"232d212380a938ff"}},{"arxiv_id":"2406.08473","arxiv_id_is_arxiv":true,"paper":"/paper/strategies-for-pretraining-neural-operators","title":"Strategies for Pretraining Neural Operators","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anthonyzhou-1/pretraining_pdes","path":"common/utils.py","file_url":"https://github.com/anthonyzhou-1/pretraining_pdes/blob/HEAD/common/utils.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":"82f3c79752f554e8","code_sha256_prefix":"82f3c79752f554e8","mcp_get_code":{"code_sha256":"82f3c79752f554e8"}},{"arxiv_id":"2401.16753","arxiv_id_is_arxiv":true,"paper":"/paper/musc-zero-shot-industrial-anomaly","title":"MuSc: Zero-Shot Industrial Anomaly Classification and Segmentation with Mutual Scoring of the Unlabeled Images","date":"2024-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xrli-U/MuSc","path":"examples/musc_main.py","file_url":"https://github.com/xrli-U/MuSc/blob/HEAD/examples/musc_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e588af766a4d39a1","code_sha256_prefix":"e588af766a4d39a1","mcp_get_code":{"code_sha256":"e588af766a4d39a1"}},{"arxiv_id":"2312.17346","arxiv_id_is_arxiv":true,"paper":"/paper/stanhop-sparse-tandem-hopfield-model-for","title":"STanHop: Sparse Tandem Hopfield Model for Memory-Enhanced Time Series Prediction","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"magics-lab/stanhop","path":"utils/tools.py","file_url":"https://github.com/magics-lab/stanhop/blob/HEAD/utils/tools.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":"0666812585a893cb","code_sha256_prefix":"0666812585a893cb","mcp_get_code":{"code_sha256":"0666812585a893cb"}},{"arxiv_id":"2312.01725","arxiv_id_is_arxiv":true,"paper":"/paper/stableviton-learning-semantic-correspondence","title":"StableVITON: Learning Semantic Correspondence with Latent Diffusion Model for Virtual Try-On","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rlawjdghek/stableviton","path":"utils.py","file_url":"https://github.com/rlawjdghek/stableviton/blob/HEAD/utils.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, rlawjdghek/stableviton when it was checked","code_sha256":"aa89e00bbdd4ea69","code_sha256_prefix":"aa89e00bbdd4ea69","mcp_get_code":{"code_sha256":"aa89e00bbdd4ea69"}},{"arxiv_id":"2311.11413","arxiv_id_is_arxiv":true,"paper":"/paper/large-pre-trained-time-series-models-for","title":"Large Pre-trained time series models for cross-domain Time series analysis tasks","date":"2023-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adityalab/samay","path":"src/samay/utils.py","file_url":"https://github.com/adityalab/samay/blob/HEAD/src/samay/utils.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":"b51cc76a36acc599","code_sha256_prefix":"b51cc76a36acc599","mcp_get_code":{"code_sha256":"b51cc76a36acc599"}},{"arxiv_id":"2308.11116","arxiv_id_is_arxiv":true,"paper":"/paper/lan-hdr-luminance-based-alignment-network-for","title":"LAN-HDR: Luminance-based Alignment Network for High Dynamic Range Video Reconstruction","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haesoochung/lan-hdr","path":"config.py","file_url":"https://github.com/haesoochung/lan-hdr/blob/HEAD/config.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, haesoochung/lan-hdr when it was checked","code_sha256":"881643cfd2f34bc0","code_sha256_prefix":"881643cfd2f34bc0","mcp_get_code":{"code_sha256":"881643cfd2f34bc0"}},{"arxiv_id":"2308.02565","arxiv_id_is_arxiv":true,"paper":"/paper/simteg-a-frustratingly-simple-approach","title":"SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning","date":"2023-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vermouthdky/simteg","path":"src/args.py","file_url":"https://github.com/vermouthdky/simteg/blob/HEAD/src/args.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":"9cc3593e6d666fb6","code_sha256_prefix":"9cc3593e6d666fb6","mcp_get_code":{"code_sha256":"9cc3593e6d666fb6"}},{"arxiv_id":"2302.13406","arxiv_id_is_arxiv":true,"paper":"/paper/gnndelete-a-general-strategy-for-unlearning","title":"GNNDelete: A General Strategy for Unlearning in Graph Neural Networks","date":"2023-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mims-harvard/gnndelete","path":"delete_gnn.py","file_url":"https://github.com/mims-harvard/gnndelete/blob/HEAD/delete_gnn.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":"3de8c8a7c355b7f5","code_sha256_prefix":"3de8c8a7c355b7f5","mcp_get_code":{"code_sha256":"3de8c8a7c355b7f5"}},{"arxiv_id":"2210.07242","arxiv_id_is_arxiv":true,"paper":"/paper/openood-benchmarking-generalized-out-of","title":"OpenOOD: Benchmarking Generalized Out-of-Distribution Detection","date":"2022-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adverml/advopenood","path":"openood/attacks/misc.py","file_url":"https://github.com/adverml/advopenood/blob/HEAD/openood/attacks/misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dbe36e80c469a4e2","code_sha256_prefix":"dbe36e80c469a4e2","mcp_get_code":{"code_sha256":"dbe36e80c469a4e2"}},{"arxiv_id":"2205.04022","arxiv_id_is_arxiv":true,"paper":"/paper/cocoa-mt-a-dataset-and-benchmark-for","title":"CoCoA-MT: A Dataset and Benchmark for Contrastive Controlled MT with Application to Formality","date":"2022-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awslabs/sockeye","path":"sockeye/arguments.py","file_url":"https://github.com/awslabs/sockeye/blob/HEAD/sockeye/arguments.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":"dbfe68e8c251c012","code_sha256_prefix":"dbfe68e8c251c012","mcp_get_code":{"code_sha256":"dbfe68e8c251c012"}},{"arxiv_id":"2204.11561","arxiv_id_is_arxiv":true,"paper":"/paper/goal-driven-self-attentive-recurrent-networks","title":"Goal-driven Self-Attentive Recurrent Networks for Trajectory Prediction","date":"2022-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luigifilippochiara/Goal-SAR","path":"src/parser.py","file_url":"https://github.com/luigifilippochiara/Goal-SAR/blob/HEAD/src/parser.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":"2a6d9ff5181be851","code_sha256_prefix":"2a6d9ff5181be851","mcp_get_code":{"code_sha256":"2a6d9ff5181be851"}},{"arxiv_id":"2107.12542","arxiv_id_is_arxiv":true,"paper":"/paper/energy-based-unknown-intent-detection-with","title":"Energy-based Unknown Intent Detection with Data Manipulation","date":"2021-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yawenouyang/GOT","path":"util/utils.py","file_url":"https://github.com/yawenouyang/GOT/blob/HEAD/util/utils.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":"af3edc318cde7d16","code_sha256_prefix":"af3edc318cde7d16","mcp_get_code":{"code_sha256":"af3edc318cde7d16"}},{"arxiv_id":"2107.07075","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-on-a-data-diet-finding","title":"Deep Learning on a Data Diet: Finding Important Examples Early in Training","date":"2021-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mansheej/data_diet","path":"data_diet/utils.py","file_url":"https://github.com/mansheej/data_diet/blob/HEAD/data_diet/utils.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":"28495435e5b289bd","code_sha256_prefix":"28495435e5b289bd","mcp_get_code":{"code_sha256":"28495435e5b289bd"}},{"arxiv_id":"2006.09790","arxiv_id_is_arxiv":true,"paper":"/paper/categorical-normalizing-flows-via-continuous","title":"Categorical Normalizing Flows via Continuous Transformations","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phlippe/CategoricalNF","path":"general/mutils.py","file_url":"https://github.com/phlippe/CategoricalNF/blob/HEAD/general/mutils.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":"54d6f181d75d8a50","code_sha256_prefix":"54d6f181d75d8a50","mcp_get_code":{"code_sha256":"54d6f181d75d8a50"}},{"arxiv_id":"2005.10036","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-quantification-using-neural","title":"Uncertainty Quantification Using Neural Networks for Molecular Property Prediction","date":"2020-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhirschfeld/ChempropUncertaintyQuantification","path":"chemprop/utils.py","file_url":"https://github.com/lhirschfeld/ChempropUncertaintyQuantification/blob/HEAD/chemprop/utils.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":"76e27ba5baa89e9f","code_sha256_prefix":"76e27ba5baa89e9f","mcp_get_code":{"code_sha256":"76e27ba5baa89e9f"}},{"arxiv_id":"2002.10113","arxiv_id_is_arxiv":true,"paper":"/paper/apac-net-alternating-the-population-and-agent","title":"Alternating the Population and Control Neural Networks to Solve High-Dimensional Stochastic Mean-Field Games","date":"2020-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atlin23/apac-net","path":"start_test.py","file_url":"https://github.com/atlin23/apac-net/blob/HEAD/start_test.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, atlin23/apac-net when it was checked","code_sha256":"c2cddf75c79ba209","code_sha256_prefix":"c2cddf75c79ba209","mcp_get_code":{"code_sha256":"c2cddf75c79ba209"}},{"arxiv_id":"1911.03109","arxiv_id_is_arxiv":true,"paper":"/paper/domain-robustness-in-neural-machine","title":"Domain Robustness in Neural Machine Translation","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZurichNLP/sockeye","path":"sockeye/arguments.py","file_url":"https://github.com/ZurichNLP/sockeye/blob/HEAD/sockeye/arguments.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":"dbfe68e8c251c012","code_sha256_prefix":"dbfe68e8c251c012","mcp_get_code":{"code_sha256":"dbfe68e8c251c012"}},{"arxiv_id":"1910.00294","arxiv_id_is_arxiv":true,"paper":"/paper/when-and-why-is-document-level-context-useful","title":"When and Why is Document-level Context Useful in Neural Machine Translation?","date":"2019-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ducthanhtran/sockeye_document_context","path":"sockeye/arguments.py","file_url":"https://github.com/ducthanhtran/sockeye_document_context/blob/HEAD/sockeye/arguments.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":"dbfe68e8c251c012","code_sha256_prefix":"dbfe68e8c251c012","mcp_get_code":{"code_sha256":"dbfe68e8c251c012"}},{"arxiv_id":"1909.00025","arxiv_id_is_arxiv":true,"paper":"/paper/meta-learning-with-warped-gradient-descent","title":"Meta-Learning with Warped Gradient Descent","date":"2019-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flennerhag/warpgrad","path":"src/omniglot/monitor.py","file_url":"https://github.com/flennerhag/warpgrad/blob/HEAD/src/omniglot/monitor.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":"b677d9dfa8aa5ea4","code_sha256_prefix":"b677d9dfa8aa5ea4","mcp_get_code":{"code_sha256":"b677d9dfa8aa5ea4"}},{"arxiv_id":"1906.02390","arxiv_id_is_arxiv":true,"paper":"/paper/multi-view-knowledge-graph-embedding-for","title":"Multi-view Knowledge Graph Embedding for Entity Alignment","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nju-websoft/MultiKE","path":"code/utils.py","file_url":"https://github.com/nju-websoft/MultiKE/blob/HEAD/code/utils.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":"b9a4445ee0055a9d","code_sha256_prefix":"b9a4445ee0055a9d","mcp_get_code":{"code_sha256":"b9a4445ee0055a9d"}},{"arxiv_id":"1904.01561","arxiv_id_is_arxiv":true,"paper":"/paper/are-learned-molecular-representations-ready","title":"Analyzing Learned Molecular Representations for Property Prediction","date":"2019-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tingweidaniel/chemprop_atomicfp_save_depth_final","path":"chemprop/utils.py","file_url":"https://github.com/tingweidaniel/chemprop_atomicfp_save_depth_final/blob/HEAD/chemprop/utils.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":"76e27ba5baa89e9f","code_sha256_prefix":"76e27ba5baa89e9f","mcp_get_code":{"code_sha256":"76e27ba5baa89e9f"}},{"arxiv_id":"1812.10025","arxiv_id_is_arxiv":true,"paper":"/paper/attention-branch-network-learning-of","title":"Attention Branch Network: Learning of Attention Mechanism for Visual Explanation","date":"2018-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"machine-perception-robotics-group/ABN_CelebA_PyTorch","path":"mtabn/utils.py","file_url":"https://github.com/machine-perception-robotics-group/ABN_CelebA_PyTorch/blob/HEAD/mtabn/utils.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":"65829cf2917b3558","code_sha256_prefix":"65829cf2917b3558","mcp_get_code":{"code_sha256":"65829cf2917b3558"}},{"arxiv_id":"1812.01054","arxiv_id_is_arxiv":true,"paper":"/paper/transferring-knowledge-across-learning","title":"Transferring Knowledge across Learning Processes","date":"2018-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amzn/metalearn-leap","path":"src/omniglot/monitor.py","file_url":"https://github.com/amzn/metalearn-leap/blob/HEAD/src/omniglot/monitor.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":"b677d9dfa8aa5ea4","code_sha256_prefix":"b677d9dfa8aa5ea4","mcp_get_code":{"code_sha256":"b677d9dfa8aa5ea4"}},{"arxiv_id":"1806.09835","arxiv_id_is_arxiv":true,"paper":"/paper/graph-to-sequence-learning-using-gated-graph","title":"Graph-to-Sequence Learning using Gated Graph Neural Networks","date":"2018-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Cartus/DCGCN","path":"sockeye/arguments.py","file_url":"https://github.com/Cartus/DCGCN/blob/HEAD/sockeye/arguments.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":"dbfe68e8c251c012","code_sha256_prefix":"dbfe68e8c251c012","mcp_get_code":{"code_sha256":"dbfe68e8c251c012"}}],"record_sha256":"4bfaf742fa0bde302433cff9932fc8599eb96c57a9ed2a0efdbcddd4065aea2e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}