{"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/str-to-bool","entry":"str_to_bool","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":32,"n_papers_ran":32,"n_papers_ran_no_instrument_failure":32,"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":22,"n_samples_ran":22,"n_samples_constructed":0,"n_samples_ran_checked":22,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":32,"n_places_pointer_only":13,"n_places_pointer_only_link_open":2,"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":11,"ran_draft_wrong":0,"ran_fixture":0,"ran":11,"unverified":0},"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":"2606.28831","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-28831","title":"HARD-KV: Head-Adaptive Regularization for Decoding-time KV Compression","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"SuDIS-ZJU/HARDInfer","path":"eval/baseline.py","file_url":"https://github.com/SuDIS-ZJU/HARDInfer/blob/HEAD/eval/baseline.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, SuDIS-ZJU/HARDInfer when it was checked","code_sha256":"60288e0371fe1b60","code_sha256_prefix":"60288e0371fe1b60","mcp_get_code":{"code_sha256":"60288e0371fe1b60"}},{"arxiv_id":"2606.19134","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-19134","title":"Pareto Q-Learning with Reward Machines","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"arnaudlequen/PQLRM","path":"baselines/common/morl_algorithm.py","file_url":"https://github.com/arnaudlequen/PQLRM/blob/HEAD/baselines/common/morl_algorithm.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, arnaudlequen/PQLRM when it was checked","code_sha256":"ff87a26db2880f69","code_sha256_prefix":"ff87a26db2880f69","mcp_get_code":{"code_sha256":"ff87a26db2880f69"}},{"arxiv_id":"2603.01421","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01421","title":"SciDER: Scientific Data-centric End-to-end Researcher","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"leonardodalinky/SciDER","path":"scider/core/constant.py","file_url":"https://github.com/leonardodalinky/SciDER/blob/HEAD/scider/core/constant.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4547b076015e1d60","code_sha256_prefix":"4547b076015e1d60","mcp_get_code":{"code_sha256":"4547b076015e1d60"}},{"arxiv_id":"2509.24088","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-24088","title":"CORRECT: Condensed Error Recognition via Knowledge Transfer in Multi-agent Systems","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"UIUC-MLSys/CORRECT","path":"src/inference_correct_error.py","file_url":"https://github.com/UIUC-MLSys/CORRECT/blob/HEAD/src/inference_correct_error.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, UIUC-MLSys/CORRECT (NOASSERTION)","code_sha256":"ba4052d14f6915b6","code_sha256_prefix":"ba4052d14f6915b6","mcp_get_code":{"code_sha256":"ba4052d14f6915b6"}},{"arxiv_id":"2506.14473","arxiv_id_is_arxiv":true,"paper":"/paper/foundation-model-insights-and-a-multi-model","title":"Foundation Model Insights and a Multi-Model Approach for Superior Fine-Grained One-shot Subset Selection","date":"2025-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhijingWan/RAM-APL","path":"utils.py","file_url":"https://github.com/ZhijingWan/RAM-APL/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4918e53fae09c808","code_sha256_prefix":"4918e53fae09c808","mcp_get_code":{"code_sha256":"4918e53fae09c808"}},{"arxiv_id":"2406.05427","arxiv_id_is_arxiv":true,"paper":"/paper/decision-mamba-a-multi-grained-state-space","title":"Decision Mamba: A Multi-Grained State Space Model with Self-Evolution Regularization for Offline RL","date":"2024-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aopolin-lv/DecisionMamba","path":"experiment-d4rl/utils.py","file_url":"https://github.com/aopolin-lv/DecisionMamba/blob/HEAD/experiment-d4rl/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7b11f2a122671aa8","code_sha256_prefix":"7b11f2a122671aa8","mcp_get_code":{"code_sha256":"7b11f2a122671aa8"}},{"arxiv_id":"2406.00816","arxiv_id_is_arxiv":true,"paper":"/paper/invisible-backdoor-attacks-on-diffusion","title":"Invisible Backdoor Attacks on Diffusion Models","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linweiii/backdoordm","path":"evaluation/main_eval.py","file_url":"https://github.com/linweiii/backdoordm/blob/HEAD/evaluation/main_eval.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":"8035fbe8d79fa731","code_sha256_prefix":"8035fbe8d79fa731","mcp_get_code":{"code_sha256":"8035fbe8d79fa731"}},{"arxiv_id":"2405.17507","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-sustainable-urban-mobility","title":"Enhancing Sustainable Urban Mobility Prediction with Telecom Data: A Spatio-Temporal Framework Approach","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cy07gn/TeltoMob","path":"Model/parameters.py","file_url":"https://github.com/cy07gn/TeltoMob/blob/HEAD/Model/parameters.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, cy07gn/TeltoMob when it was checked","code_sha256":"ece7c69991e1b54f","code_sha256_prefix":"ece7c69991e1b54f","mcp_get_code":{"code_sha256":"ece7c69991e1b54f"}},{"arxiv_id":"2403.20150","arxiv_id_is_arxiv":true,"paper":"/paper/tfb-towards-comprehensive-and-fair","title":"TFB: Towards Comprehensive and Fair Benchmarking of Time Series Forecasting Methods","date":"2024-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"decisionintelligence/tfb","path":"scripts/run_benchmark.py","file_url":"https://github.com/decisionintelligence/tfb/blob/HEAD/scripts/run_benchmark.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"06d2586e87139d81","code_sha256_prefix":"06d2586e87139d81","mcp_get_code":{"code_sha256":"06d2586e87139d81"}},{"arxiv_id":"2401.17548","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-channel-dependence-for","title":"Rethinking Channel Dependence for Multivariate Time Series Forecasting: Learning from Leading Indicators","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjtu-dmtai/lift","path":"run_longExp.py","file_url":"https://github.com/sjtu-dmtai/lift/blob/HEAD/run_longExp.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, sjtu-dmtai/lift when it was checked","code_sha256":"ece7c69991e1b54f","code_sha256_prefix":"ece7c69991e1b54f","mcp_get_code":{"code_sha256":"ece7c69991e1b54f"}},{"arxiv_id":"2401.03138","arxiv_id_is_arxiv":true,"paper":"/paper/teltrans-applying-multi-type-telecom-data-to","title":"TelTrans: Applying Multi-Type Telecom Data to Transportation Evaluation and Prediction via Multifaceted Graph Modeling","date":"2024-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cylin-cmlab/GCT-Prediction","path":"Model/parameters.py","file_url":"https://github.com/cylin-cmlab/GCT-Prediction/blob/HEAD/Model/parameters.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, cylin-cmlab/GCT-Prediction when it was checked","code_sha256":"ece7c69991e1b54f","code_sha256_prefix":"ece7c69991e1b54f","mcp_get_code":{"code_sha256":"ece7c69991e1b54f"}},{"arxiv_id":"2311.14056","arxiv_id_is_arxiv":true,"paper":"/paper/dpsur-accelerating-differentially-private","title":"DPSUR: Accelerating Differentially Private Stochastic Gradient Descent Using Selective Update and Release","date":"2023-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jefffffffu/dpsur","path":"membership_inference/Inference_attacks.py","file_url":"https://github.com/jefffffffu/dpsur/blob/HEAD/membership_inference/Inference_attacks.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, jefffffffu/dpsur when it was checked","code_sha256":"b0ca8217928440eb","code_sha256_prefix":"b0ca8217928440eb","mcp_get_code":{"code_sha256":"b0ca8217928440eb"}},{"arxiv_id":"2310.18844","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2310.18844","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"ThrunGroup/BanditPAM_plusplus_experiments","path":"experiments/create_configs.py","file_url":"https://github.com/ThrunGroup/BanditPAM_plusplus_experiments/blob/HEAD/experiments/create_configs.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":"aaacd1f961fbeeb7","code_sha256_prefix":"aaacd1f961fbeeb7","mcp_get_code":{"code_sha256":"aaacd1f961fbeeb7"}},{"arxiv_id":"2309.07525","arxiv_id_is_arxiv":true,"paper":"/paper/singfake-singing-voice-deepfake-detection","title":"SingFake: Singing Voice Deepfake Detection","date":"2023-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yongyizang/SingFake","path":"models/AASIST/utils.py","file_url":"https://github.com/yongyizang/SingFake/blob/HEAD/models/AASIST/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":"bc2ace1bc5b21488","code_sha256_prefix":"bc2ace1bc5b21488","mcp_get_code":{"code_sha256":"bc2ace1bc5b21488"}},{"arxiv_id":"2308.14191","arxiv_id_is_arxiv":true,"paper":"/paper/sketchdreamer-interactive-text-augmented","title":"SketchDreamer: Interactive Text-Augmented Creative Sketch Ideation","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"winkawaks/sketchdreamer","path":"config.py","file_url":"https://github.com/winkawaks/sketchdreamer/blob/HEAD/config.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"10ebc4ca56bae3c2","code_sha256_prefix":"10ebc4ca56bae3c2","mcp_get_code":{"code_sha256":"10ebc4ca56bae3c2"}},{"arxiv_id":"2308.07416","arxiv_id_is_arxiv":true,"paper":"/paper/diffhopp-a-graph-diffusion-model-for-novel","title":"DiffHopp: A Graph Diffusion Model for Novel Drug Design via Scaffold Hopping","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jostorge/diffusion-hopping","path":"train_model.py","file_url":"https://github.com/jostorge/diffusion-hopping/blob/HEAD/train_model.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"60288e0371fe1b60","code_sha256_prefix":"60288e0371fe1b60","mcp_get_code":{"code_sha256":"60288e0371fe1b60"}},{"arxiv_id":"2308.03060","arxiv_id_is_arxiv":true,"paper":"/paper/topiq-a-top-down-approach-from-semantics-to","title":"TOPIQ: A Top-down Approach from Semantics to Distortions for Image Quality Assessment","date":"2023-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaofengc/iqa-pytorch","path":"benchmark_results.py","file_url":"https://github.com/chaofengc/iqa-pytorch/blob/HEAD/benchmark_results.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, chaofengc/iqa-pytorch (NOASSERTION)","code_sha256":"06964fd66b132112","code_sha256_prefix":"06964fd66b132112","mcp_get_code":{"code_sha256":"06964fd66b132112"}},{"arxiv_id":"2306.07215","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-quantization-aware-training-with","title":"Efficient and Robust Quantization-aware Training via Adaptive Coreset Selection","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangowen/qat-acs","path":"utils.py","file_url":"https://github.com/huangowen/qat-acs/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4918e53fae09c808","code_sha256_prefix":"4918e53fae09c808","mcp_get_code":{"code_sha256":"4918e53fae09c808"}},{"arxiv_id":"2211.09233","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-tuning-for-parameter-efficient-medical","title":"Prompt Tuning for Parameter-efficient Medical Image Segmentation","date":"2022-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marcdcfischer/punetr","path":"src/utils/old_lightning_parsing.py","file_url":"https://github.com/marcdcfischer/punetr/blob/HEAD/src/utils/old_lightning_parsing.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":"e5cfe85a69313b6f","code_sha256_prefix":"e5cfe85a69313b6f","mcp_get_code":{"code_sha256":"e5cfe85a69313b6f"}},{"arxiv_id":"2202.08408","arxiv_id_is_arxiv":true,"paper":"/paper/multivariate-time-series-forecasting-with-1","title":"Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs","date":"2022-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grand-lab/mtgode","path":"run_multi_step.py","file_url":"https://github.com/grand-lab/mtgode/blob/HEAD/run_multi_step.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from sjtu-dmtai/lift, and GitHub detected no licence in that repository when it was checked","code_sha256":"ece7c69991e1b54f","code_sha256_prefix":"ece7c69991e1b54f","mcp_get_code":{"code_sha256":"ece7c69991e1b54f"}},{"arxiv_id":"2112.08654","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-prompt-for-continual-learning-1","title":"Learning to Prompt for Continual Learning","date":"2021-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gulzainali98/LGCL","path":"configs/cifar100_lgcl.py","file_url":"https://github.com/gulzainali98/LGCL/blob/HEAD/configs/cifar100_lgcl.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"10ebc4ca56bae3c2","code_sha256_prefix":"10ebc4ca56bae3c2","mcp_get_code":{"code_sha256":"10ebc4ca56bae3c2"}},{"arxiv_id":"2111.05458","arxiv_id_is_arxiv":true,"paper":"/paper/which-priors-matter-benchmarking-models-for","title":"Which priors matter? Benchmarking models for learning latent dynamics","date":"2021-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"westny/neural-stability","path":"arguments.py","file_url":"https://github.com/westny/neural-stability/blob/HEAD/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":"71d07db29119f009","code_sha256_prefix":"71d07db29119f009","mcp_get_code":{"code_sha256":"71d07db29119f009"}},{"arxiv_id":"2110.01200","arxiv_id_is_arxiv":true,"paper":"/paper/aasist-audio-anti-spoofing-using-integrated","title":"AASIST: Audio Anti-Spoofing using Integrated Spectro-Temporal Graph Attention Networks","date":"2021-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clovaai/aasist","path":"utils.py","file_url":"https://github.com/clovaai/aasist/blob/HEAD/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":"bc2ace1bc5b21488","code_sha256_prefix":"bc2ace1bc5b21488","mcp_get_code":{"code_sha256":"bc2ace1bc5b21488"}},{"arxiv_id":"2108.00298","arxiv_id_is_arxiv":true,"paper":"/paper/multivariate-time-series-imputation-by-graph","title":"Filling the G_ap_s: Multivariate Time Series Imputation by Graph Neural Networks","date":"2021-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-Machine-Learning-Group/grin","path":"lib/nn/models/grin.py","file_url":"https://github.com/Graph-Machine-Learning-Group/grin/blob/HEAD/lib/nn/models/grin.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, Graph-Machine-Learning-Group/grin when it was checked","code_sha256":"d870af5de5670ebb","code_sha256_prefix":"d870af5de5670ebb","mcp_get_code":{"code_sha256":"d870af5de5670ebb"}},{"arxiv_id":"2106.07447","arxiv_id_is_arxiv":true,"paper":"/paper/hubert-self-supervised-speech-representation","title":"HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BirgerMoell/tmh","path":"tmh/phonemes.py","file_url":"https://github.com/BirgerMoell/tmh/blob/HEAD/tmh/phonemes.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":"1b4f6d2b73c42a6b","code_sha256_prefix":"1b4f6d2b73c42a6b","mcp_get_code":{"code_sha256":"1b4f6d2b73c42a6b"}},{"arxiv_id":"2007.08728","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-human-object-interactions-with","title":"Detecting Human-Object Interactions with Action Co-occurrence Priors","date":"2020-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Dong-JinKim/ActionCooccurrencePriors","path":"utils/argparse_utils.py","file_url":"https://github.com/Dong-JinKim/ActionCooccurrencePriors/blob/HEAD/utils/argparse_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":"8d87f08966a2f30c","code_sha256_prefix":"8d87f08966a2f30c","mcp_get_code":{"code_sha256":"8d87f08966a2f30c"}},{"arxiv_id":"2005.11650","arxiv_id_is_arxiv":true,"paper":"/paper/connecting-the-dots-multivariate-time-series","title":"Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks","date":"2020-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","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":"ece7c69991e1b54f","code_sha256_prefix":"ece7c69991e1b54f","mcp_get_code":{"code_sha256":"ece7c69991e1b54f"}},{"arxiv_id":"1911.07602","arxiv_id_is_arxiv":true,"paper":"/paper/the-ind-dataset-a-drone-dataset-of","title":"The inD Dataset: A Drone Dataset of Naturalistic Road User Trajectories at German Intersections","date":"2019-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"westny/dronalize","path":"arguments.py","file_url":"https://github.com/westny/dronalize/blob/HEAD/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":"a36d43e3924bbde3","code_sha256_prefix":"a36d43e3924bbde3","mcp_get_code":{"code_sha256":"a36d43e3924bbde3"}},{"arxiv_id":"1808.00158","arxiv_id_is_arxiv":true,"paper":"/paper/speaker-recognition-from-raw-waveform-with","title":"Speaker Recognition from Raw Waveform with SincNet","date":"2018-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mravanelli/SincNet","path":"data_io.py","file_url":"https://github.com/mravanelli/SincNet/blob/HEAD/data_io.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":"fb6bced9440ef6c6","code_sha256_prefix":"fb6bced9440ef6c6","mcp_get_code":{"code_sha256":"fb6bced9440ef6c6"}},{"arxiv_id":"1703.05593","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-network-architecture-for","title":"Convolutional neural network architecture for geometric matching","date":"2017-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignacio-rocco/cnngeometric_pytorch","path":"util/torch_util.py","file_url":"https://github.com/ignacio-rocco/cnngeometric_pytorch/blob/HEAD/util/torch_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":"8d87f08966a2f30c","code_sha256_prefix":"8d87f08966a2f30c","mcp_get_code":{"code_sha256":"8d87f08966a2f30c"}},{"arxiv_id":"1509.08985","arxiv_id_is_arxiv":true,"paper":"/paper/generalizing-pooling-functions-in","title":"Generalizing Pooling Functions in Convolutional Neural Networks: Mixed, Gated, and Tree","date":"2015-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BeanGreen247/Python-AI-Arts","path":"INetwork.py","file_url":"https://github.com/BeanGreen247/Python-AI-Arts/blob/HEAD/INetwork.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from PARC/intricate-art-neural-transfer, and GitHub detected no licence in that repository when it was checked","code_sha256":"caa3066795ecd99b","code_sha256_prefix":"caa3066795ecd99b","mcp_get_code":{"code_sha256":"caa3066795ecd99b"}},{"arxiv_id":"1508.06576","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-algorithm-of-artistic-style","title":"A Neural Algorithm of Artistic Style","date":"2015-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PARC/intricate-art-neural-transfer","path":"intricate_style.py","file_url":"https://github.com/PARC/intricate-art-neural-transfer/blob/HEAD/intricate_style.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, PARC/intricate-art-neural-transfer when it was checked","code_sha256":"caa3066795ecd99b","code_sha256_prefix":"caa3066795ecd99b","mcp_get_code":{"code_sha256":"caa3066795ecd99b"}}],"record_sha256":"a937d2b62e0310107d343c4d56284549471f8a8b33cf28cf635f5fa68445deb0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}