{"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/run-model","entry":"run_model","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":27,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":5,"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":31,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":6,"n_samples_unverified":18,"n_samples_fingerprinted":0,"n_places":33,"n_places_pointer_only":19,"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":6,"ran_fixture":0,"ran":7,"unverified":18},"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":"2602.18406","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-18406","title":"GRaM workshop at ICLR 2026 Tiny Paper Track LATENT EQUIVARIANT OPERATORS FOR ROBUST OBJECT RECOGNITION: PROMISES AND CHALLENGES","date":"2026-02-20","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"BRAIN-Aalto/equivariant_operator","path":"training/rotate.py","file_url":"https://github.com/BRAIN-Aalto/equivariant_operator/blob/HEAD/training/rotate.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, BRAIN-Aalto/equivariant_operator when it was checked","code_sha256":"e1c64c7e77d13ba6","code_sha256_prefix":"e1c64c7e77d13ba6","mcp_get_code":{"code_sha256":"e1c64c7e77d13ba6"}},{"arxiv_id":"2602.18406","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-18406","title":"GRaM workshop at ICLR 2026 Tiny Paper Track LATENT EQUIVARIANT OPERATORS FOR ROBUST OBJECT RECOGNITION: PROMISES AND CHALLENGES","date":"2026-02-20","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"BRAIN-Aalto/equivariant_operator","path":"training/xshift.py","file_url":"https://github.com/BRAIN-Aalto/equivariant_operator/blob/HEAD/training/xshift.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, BRAIN-Aalto/equivariant_operator when it was checked","code_sha256":"e1eb59520a55014d","code_sha256_prefix":"e1eb59520a55014d","mcp_get_code":{"code_sha256":"e1eb59520a55014d"}},{"arxiv_id":"2503.00675","arxiv_id_is_arxiv":true,"paper":"/paper/dur360bev-a-real-world-single-360-degree","title":"Dur360BEV: A Real-world 360-degree Single Camera Dataset and Benchmark for Bird-Eye View Mapping in Autonomous Driving","date":"2025-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tom-E-Durham/Dur360BEV","path":"coarse_fine/src/eval_coarse_fine.py","file_url":"https://github.com/Tom-E-Durham/Dur360BEV/blob/HEAD/coarse_fine/src/eval_coarse_fine.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":"2d69af58f027a511","code_sha256_prefix":"2d69af58f027a511","mcp_get_code":{"code_sha256":"2d69af58f027a511"}},{"arxiv_id":"2503.00675","arxiv_id_is_arxiv":true,"paper":"/paper/dur360bev-a-real-world-single-360-degree","title":"Dur360BEV: A Real-world 360-degree Single Camera Dataset and Benchmark for Bird-Eye View Mapping in Autonomous Driving","date":"2025-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tom-E-Durham/Dur360BEV","path":"coarse_fine/src/train_coarse_fine.py","file_url":"https://github.com/Tom-E-Durham/Dur360BEV/blob/HEAD/coarse_fine/src/train_coarse_fine.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":"efcb4ed47d88ef91","code_sha256_prefix":"efcb4ed47d88ef91","mcp_get_code":{"code_sha256":"efcb4ed47d88ef91"}},{"arxiv_id":"2502.19765","arxiv_id_is_arxiv":true,"paper":"/paper/editext-controllable-coarse-to-fine-text","title":"EdiText: Controllable Coarse-to-Fine Text Editing with Diffusion Language Models","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zacharyhorvitz/ParaGuide","path":"inference/diffusion_utils.py","file_url":"https://github.com/zacharyhorvitz/ParaGuide/blob/HEAD/inference/diffusion_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zacharyhorvitz/ParaGuide when it was checked","code_sha256":"ebaece4b6551890a","code_sha256_prefix":"ebaece4b6551890a","mcp_get_code":{"code_sha256":"ebaece4b6551890a"}},{"arxiv_id":"2502.00698","arxiv_id_is_arxiv":true,"paper":"/paper/mm-iq-benchmarking-human-like-abstraction-and-1","title":"MM-IQ: Benchmarking Human-Like Abstraction and Reasoning in Multimodal Models","date":"2025-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AceCHQ/MMIQ","path":"mmiq/run_llava.py","file_url":"https://github.com/AceCHQ/MMIQ/blob/HEAD/mmiq/run_llava.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":"fdb3e1f2061eee8e","code_sha256_prefix":"fdb3e1f2061eee8e","mcp_get_code":{"code_sha256":"fdb3e1f2061eee8e"}},{"arxiv_id":"2501.04678","arxiv_id_is_arxiv":true,"paper":"/paper/radgpt-constructing-3d-image-text-tumor","title":"RadGPT: Constructing 3D Image-Text Tumor Datasets","date":"2025-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MrGiovanni/RadGPT","path":"evaluate_reports/RadGPT.py","file_url":"https://github.com/MrGiovanni/RadGPT/blob/HEAD/evaluate_reports/RadGPT.py","status":"unverified","verification_level":0,"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, MrGiovanni/RadGPT (NOASSERTION)","code_sha256":"279bac808402a3e0","code_sha256_prefix":"279bac808402a3e0","mcp_get_code":{"code_sha256":"279bac808402a3e0"}},{"arxiv_id":"2411.15315","arxiv_id_is_arxiv":true,"paper":"/paper/lie-equivariant-quantum-graph-neural-networks","title":"Lie-Equivariant Quantum Graph Neural Networks","date":"2024-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml4sci/qmlhep","path":"Lie_EQGNN_for_HEP_Jogi_Suda_Neto/notebooks/sym_utils.py","file_url":"https://github.com/ml4sci/qmlhep/blob/HEAD/Lie_EQGNN_for_HEP_Jogi_Suda_Neto/notebooks/sym_utils.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, ml4sci/qmlhep when it was checked","code_sha256":"1426a8480f6b8e62","code_sha256_prefix":"1426a8480f6b8e62","mcp_get_code":{"code_sha256":"1426a8480f6b8e62"}},{"arxiv_id":"2410.06802","arxiv_id_is_arxiv":true,"paper":"/paper/seg2act-global-context-aware-action","title":"Seg2Act: Global Context-aware Action Generation for Document Logical Structuring","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cascip/seg2act","path":"seg2act/eval/ChCatExt/seg2act_eval.py","file_url":"https://github.com/cascip/seg2act/blob/HEAD/seg2act/eval/ChCatExt/seg2act_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cascip/seg2act when it was checked","code_sha256":"28d8d6c8f0a42448","code_sha256_prefix":"28d8d6c8f0a42448","mcp_get_code":{"code_sha256":"28d8d6c8f0a42448"}},{"arxiv_id":"2409.03757","arxiv_id_is_arxiv":true,"paper":"/paper/lexicon3d-probing-visual-foundation-models","title":"Lexicon3D: Probing Visual Foundation Models for Complex 3D Scene Understanding","date":"2024-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunzeman/lexicon3d","path":"lexicon3d/evaluate_complexity.py","file_url":"https://github.com/yunzeman/lexicon3d/blob/HEAD/lexicon3d/evaluate_complexity.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":"0781f631b94b8147","code_sha256_prefix":"0781f631b94b8147","mcp_get_code":{"code_sha256":"0781f631b94b8147"}},{"arxiv_id":"2408.04667","arxiv_id_is_arxiv":true,"paper":"/paper/llm-stability-a-detailed-analysis-with-some","title":"Non-Determinism of \"Deterministic\" LLM Settings","date":"2024-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"breckbaldwin/llm-stability","path":"run_experiment.py","file_url":"https://github.com/breckbaldwin/llm-stability/blob/HEAD/run_experiment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"48505ee862750c1e","code_sha256_prefix":"48505ee862750c1e","mcp_get_code":{"code_sha256":"48505ee862750c1e"}},{"arxiv_id":"2408.04154","arxiv_id_is_arxiv":true,"paper":"/paper/the-data-addition-dilemma","title":"The Data Addition Dilemma","date":"2024-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"the-chen-lab/data-addition-dilemma","path":"Yelp-MIMIC/run_mixture.py","file_url":"https://github.com/the-chen-lab/data-addition-dilemma/blob/HEAD/Yelp-MIMIC/run_mixture.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, the-chen-lab/data-addition-dilemma when it was checked","code_sha256":"b3ee0f411e006d36","code_sha256_prefix":"b3ee0f411e006d36","mcp_get_code":{"code_sha256":"b3ee0f411e006d36"}},{"arxiv_id":"2401.12954","arxiv_id_is_arxiv":true,"paper":"/paper/meta-prompting-enhancing-language-models-with","title":"Meta-Prompting: Enhancing Language Models with Task-Agnostic Scaffolding","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"suzgunmirac/meta-prompting","path":"run_experiments.py","file_url":"https://github.com/suzgunmirac/meta-prompting/blob/HEAD/run_experiments.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":"933a16fa4bc8a082","code_sha256_prefix":"933a16fa4bc8a082","mcp_get_code":{"code_sha256":"933a16fa4bc8a082"}},{"arxiv_id":"2306.13802","arxiv_id_is_arxiv":true,"paper":"/paper/using-persistent-homology-to-understand","title":"Comparing representations of high-dimensional data with persistent homology: a case study in neuroimaging","date":null,"month_inferred_from_arxiv_id":"2023-06","title_source":"archive","repo":"tyo8/interval-matching-precomp_metric","path":"visualization/toy_models.py","file_url":"https://github.com/tyo8/interval-matching-precomp_metric/blob/HEAD/visualization/toy_models.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":"2fb0eddb37453028","code_sha256_prefix":"2fb0eddb37453028","mcp_get_code":{"code_sha256":"2fb0eddb37453028"}},{"arxiv_id":"2305.17826","arxiv_id_is_arxiv":true,"paper":"/paper/notable-transferable-backdoor-attacks-against","title":"NOTABLE: Transferable Backdoor Attacks Against Prompt-based NLP Models","date":"2023-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RU-System-Software-and-Security/Notable","path":"autoprompt/create_trigger.py","file_url":"https://github.com/RU-System-Software-and-Security/Notable/blob/HEAD/autoprompt/create_trigger.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, RU-System-Software-and-Security/Notable when it was checked","code_sha256":"4ef0bced0d8f70ee","code_sha256_prefix":"4ef0bced0d8f70ee","mcp_get_code":{"code_sha256":"4ef0bced0d8f70ee"}},{"arxiv_id":"2302.09155","arxiv_id_is_arxiv":true,"paper":"/paper/med-easi-finely-annotated-dataset-and-models","title":"Med-EASi: Finely Annotated Dataset and Models for Controllable Simplification of Medical Texts","date":"2023-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chandrayee/ctrl-simp","path":"model.py","file_url":"https://github.com/chandrayee/ctrl-simp/blob/HEAD/model.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":"bdc621951fd03651","code_sha256_prefix":"bdc621951fd03651","mcp_get_code":{"code_sha256":"bdc621951fd03651"}},{"arxiv_id":"2301.11578","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-unlearn-instance-wise-unlearning","title":"Learning to Unlearn: Instance-wise Unlearning for Pre-trained Classifiers","date":"2023-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csm9493/L2UL","path":"main_pretrain_utkface_resnet18.py","file_url":"https://github.com/csm9493/L2UL/blob/HEAD/main_pretrain_utkface_resnet18.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":"07b209bccaefb962","code_sha256_prefix":"07b209bccaefb962","mcp_get_code":{"code_sha256":"07b209bccaefb962"}},{"arxiv_id":"2209.12054","arxiv_id_is_arxiv":true,"paper":"/paper/from-local-to-global-spectral-inspired-graph","title":"From Local to Global: Spectral-Inspired Graph Neural Networks","date":"2022-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nhuang37/spectral-inspired-gnn","path":"power.py","file_url":"https://github.com/nhuang37/spectral-inspired-gnn/blob/HEAD/power.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nhuang37/spectral-inspired-gnn when it was checked","code_sha256":"a08291d45482049d","code_sha256_prefix":"a08291d45482049d","mcp_get_code":{"code_sha256":"a08291d45482049d"}},{"arxiv_id":"2209.12054","arxiv_id_is_arxiv":true,"paper":"/paper/from-local-to-global-spectral-inspired-graph","title":"From Local to Global: Spectral-Inspired Graph Neural Networks","date":"2022-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nhuang37/spectral-inspired-gnn","path":"baseline/gcn_variants_real_graph.py","file_url":"https://github.com/nhuang37/spectral-inspired-gnn/blob/HEAD/baseline/gcn_variants_real_graph.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nhuang37/spectral-inspired-gnn when it was checked","code_sha256":"e4adcb63e82c82e0","code_sha256_prefix":"e4adcb63e82c82e0","mcp_get_code":{"code_sha256":"e4adcb63e82c82e0"}},{"arxiv_id":"2209.01018","arxiv_id_is_arxiv":true,"paper":"/paper/normalization-effects-on-deep-neural-networks","title":"Normalization effects on deep neural networks","date":"2022-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kspiliopoulos/NENN_Deep","path":"functions.py","file_url":"https://github.com/kspiliopoulos/NENN_Deep/blob/HEAD/functions.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":"d9b4cdcd24c77672","code_sha256_prefix":"d9b4cdcd24c77672","mcp_get_code":{"code_sha256":"d9b4cdcd24c77672"}},{"arxiv_id":"2203.07540","arxiv_id_is_arxiv":true,"paper":"/paper/scienceworld-is-your-agent-smarter-than-a-5th","title":"ScienceWorld: Is your Agent Smarter than a 5th Grader?","date":"2022-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/macaw","path":"macaw/utils.py","file_url":"https://github.com/allenai/macaw/blob/HEAD/macaw/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":"0ff0cabbc0770012","code_sha256_prefix":"0ff0cabbc0770012","mcp_get_code":{"code_sha256":"0ff0cabbc0770012"}},{"arxiv_id":"2107.08976","arxiv_id_is_arxiv":true,"paper":"/paper/oodformer-out-of-distribution-detection","title":"OODformer: Out-Of-Distribution Detection Transformer","date":"2021-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rajatkoner08/oodformer","path":"OOD_Distance.py","file_url":"https://github.com/rajatkoner08/oodformer/blob/HEAD/OOD_Distance.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, rajatkoner08/oodformer when it was checked","code_sha256":"6b5fa576beaaf644","code_sha256_prefix":"6b5fa576beaaf644","mcp_get_code":{"code_sha256":"6b5fa576beaaf644"}},{"arxiv_id":"2106.09685","arxiv_id_is_arxiv":true,"paper":"/paper/lora-low-rank-adaptation-of-large-language","title":"LoRA: Low-Rank Adaptation of Large Language Models","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ikergarcia1996/sequence-labeling-llms","path":"constrained_generation.py","file_url":"https://github.com/ikergarcia1996/sequence-labeling-llms/blob/HEAD/constrained_generation.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":"6704486d6cc51ef0","code_sha256_prefix":"6704486d6cc51ef0","mcp_get_code":{"code_sha256":"6704486d6cc51ef0"}},{"arxiv_id":"2106.09300","arxiv_id_is_arxiv":true,"paper":"/paper/multi-level-motion-attention-for-human-motion","title":"Multi-level Motion Attention for Human Motion Prediction","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"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":"8bf369966c574e2a","code_sha256_prefix":"8bf369966c574e2a","mcp_get_code":{"code_sha256":"8bf369966c574e2a"}},{"arxiv_id":"2106.09300","arxiv_id_is_arxiv":true,"paper":"/paper/multi-level-motion-attention-for-human-motion","title":"Multi-level Motion Attention for Human Motion Prediction","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"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":"1a02930e1173179c","code_sha256_prefix":"1a02930e1173179c","mcp_get_code":{"code_sha256":"1a02930e1173179c"}},{"arxiv_id":"2106.01751","arxiv_id_is_arxiv":true,"paper":"/paper/reordering-examples-helps-during-priming","title":"Reordering Examples Helps during Priming-based Few-Shot Learning","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucinlp/autoprompt","path":"autoprompt/create_trigger.py","file_url":"https://github.com/ucinlp/autoprompt/blob/HEAD/autoprompt/create_trigger.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":"de4d142f8cd18f36","code_sha256_prefix":"de4d142f8cd18f36","mcp_get_code":{"code_sha256":"de4d142f8cd18f36"}},{"arxiv_id":"2105.06462","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-collision-handling-via","title":"Self-Supervised Collision Handling via Generative 3D Garment Models for Virtual Try-On","date":"2021-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isantesteban/vto-garment-collisions","path":"src/model.py","file_url":"https://github.com/isantesteban/vto-garment-collisions/blob/HEAD/src/model.py","status":"unverified","verification_level":0,"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, isantesteban/vto-garment-collisions (NOASSERTION)","code_sha256":"617db22bfb718c9c","code_sha256_prefix":"617db22bfb718c9c","mcp_get_code":{"code_sha256":"617db22bfb718c9c"}},{"arxiv_id":"2007.11755","arxiv_id_is_arxiv":true,"paper":"/paper/history-repeats-itself-human-motion","title":"History Repeats Itself: Human Motion Prediction via Motion Attention","date":"2020-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wei-mao-2019/HisRepItself","path":"main_h36m_3d.py","file_url":"https://github.com/wei-mao-2019/HisRepItself/blob/HEAD/main_h36m_3d.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, wei-mao-2019/HisRepItself when it was checked","code_sha256":"8bf369966c574e2a","code_sha256_prefix":"8bf369966c574e2a","mcp_get_code":{"code_sha256":"8bf369966c574e2a"}},{"arxiv_id":"2007.11755","arxiv_id_is_arxiv":true,"paper":"/paper/history-repeats-itself-human-motion","title":"History Repeats Itself: Human Motion Prediction via Motion Attention","date":"2020-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wei-mao-2019/HisRepItself","path":"main_amass_3d.py","file_url":"https://github.com/wei-mao-2019/HisRepItself/blob/HEAD/main_amass_3d.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, wei-mao-2019/HisRepItself when it was checked","code_sha256":"1a02930e1173179c","code_sha256_prefix":"1a02930e1173179c","mcp_get_code":{"code_sha256":"1a02930e1173179c"}},{"arxiv_id":"1903.03260","arxiv_id_is_arxiv":true,"paper":"/paper/neural-language-models-as-psycholinguistic","title":"Neural Language Models as Psycholinguistic Subjects: Representations of Syntactic State","date":"2019-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"langprocgroup/nn_syntactic_state","path":"scripts/run_models.py","file_url":"https://github.com/langprocgroup/nn_syntactic_state/blob/HEAD/scripts/run_models.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, langprocgroup/nn_syntactic_state when it was checked","code_sha256":"b1e4710556059603","code_sha256_prefix":"b1e4710556059603","mcp_get_code":{"code_sha256":"b1e4710556059603"}},{"arxiv_id":"1710.10547","arxiv_id_is_arxiv":true,"paper":"/paper/interpretation-of-neural-networks-is-fragile","title":"Interpretation of Neural Networks is Fragile","date":"2017-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amiratag/InterpretationFragility","path":"utils.py","file_url":"https://github.com/amiratag/InterpretationFragility/blob/HEAD/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":"3694bffc9033dca4","code_sha256_prefix":"3694bffc9033dca4","mcp_get_code":{"code_sha256":"3694bffc9033dca4"}},{"arxiv_id":"1606.01781","arxiv_id_is_arxiv":true,"paper":"/paper/very-deep-convolutional-networks-for-text","title":"Very Deep Convolutional Networks for Text Classification","date":"2016-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"threelittlemonkeys/vdcnn-pytorch","path":"predict.py","file_url":"https://github.com/threelittlemonkeys/vdcnn-pytorch/blob/HEAD/predict.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, threelittlemonkeys/vdcnn-pytorch when it was checked","code_sha256":"0cbe318afccd6df9","code_sha256_prefix":"0cbe318afccd6df9","mcp_get_code":{"code_sha256":"0cbe318afccd6df9"}},{"arxiv_id":"1606.01781","arxiv_id_is_arxiv":true,"paper":"/paper/very-deep-convolutional-networks-for-text","title":"Very Deep Convolutional Networks for Text Classification","date":"2016-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"threelittlemonkeys/vdcnn-pytorch","path":"evaluate.py","file_url":"https://github.com/threelittlemonkeys/vdcnn-pytorch/blob/HEAD/evaluate.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, threelittlemonkeys/vdcnn-pytorch when it was checked","code_sha256":"61c6a755683d6c6e","code_sha256_prefix":"61c6a755683d6c6e","mcp_get_code":{"code_sha256":"61c6a755683d6c6e"}}],"record_sha256":"8567e3f58d7e9acf388b782af254e17ee1c26e1ce323f60667f6577ade3fe5e8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}