{"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/euclidean-distance","entry":"euclidean_distance","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":29,"n_papers_ran":28,"n_papers_ran_no_instrument_failure":21,"n_papers_ran_instrument_only":7,"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":26,"n_samples_ran":25,"n_samples_constructed":0,"n_samples_ran_checked":19,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":21,"n_places":31,"n_places_pointer_only":12,"n_places_pointer_only_link_open":3,"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":4,"ran_violates":0,"ran_draft_wrong":6,"ran_fixture":0,"ran":15,"unverified":1},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2603.24150","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-24150","title":"A visual observation on the geometry of UMAP projections of the difference vectors of antonym and synonym word pair embeddings","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ramiluisto/CuriousSwirl","path":"semsim/stats.py","file_url":"https://github.com/ramiluisto/CuriousSwirl/blob/HEAD/semsim/stats.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"45e2b883e4e52baa","code_sha256_prefix":"45e2b883e4e52baa","mcp_get_code":{"code_sha256":"45e2b883e4e52baa"}},{"arxiv_id":"2602.19788","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-19788","title":"Bayesian Meta-Learning with Expert Feedback for Task-Shift Adaptation through Causal Embeddings","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"lottamakinen/causal-meta-learning","path":"expert_model/expert_inference.py","file_url":"https://github.com/lottamakinen/causal-meta-learning/blob/HEAD/expert_model/expert_inference.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"381e3729de2de5d9","code_sha256_prefix":"381e3729de2de5d9","mcp_get_code":{"code_sha256":"381e3729de2de5d9"}},{"arxiv_id":"2601.18188","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-18188","title":"NaVIDA: Vision-Language Navigation with Inverse Dynamics Augmentation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"waynechu1021/NAVIDA","path":"habitat_extensions/measures.py","file_url":"https://github.com/waynechu1021/NAVIDA/blob/HEAD/habitat_extensions/measures.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, waynechu1021/NAVIDA when it was checked","code_sha256":"685ac41003942ff9","code_sha256_prefix":"685ac41003942ff9","mcp_get_code":{"code_sha256":"685ac41003942ff9"}},{"arxiv_id":"2510.22897","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-22897","title":"Charting the Design Space of Neural Graph Representations for Subgraph Matching","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"structlearning/neural-subm-design-space","path":"GMN/loss.py","file_url":"https://github.com/structlearning/neural-subm-design-space/blob/HEAD/GMN/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, structlearning/neural-subm-design-space when it was checked","code_sha256":"69e7dcdc10127913","code_sha256_prefix":"69e7dcdc10127913","mcp_get_code":{"code_sha256":"69e7dcdc10127913"}},{"arxiv_id":"2502.10436","arxiv_id_is_arxiv":true,"paper":"/paper/merge-3-efficient-evolutionary-merging-on","title":"MERGE$^3$: Efficient Evolutionary Merging on Consumer-grade GPUs","date":"2025-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tommasomncttn/merge3","path":"src/mergenetic/analysis/utils.py","file_url":"https://github.com/tommasomncttn/merge3/blob/HEAD/src/mergenetic/analysis/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":"322193f8e999747b","code_sha256_prefix":"322193f8e999747b","mcp_get_code":{"code_sha256":"322193f8e999747b"}},{"arxiv_id":"2411.02391","arxiv_id_is_arxiv":true,"paper":"/paper/attacking-vision-language-computer-agents-via","title":"Attacking Vision-Language Computer Agents via Pop-ups","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SALT-NLP/PopupAttack","path":"OSWorld/general_attack_utils.py","file_url":"https://github.com/SALT-NLP/PopupAttack/blob/HEAD/OSWorld/general_attack_utils.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, SALT-NLP/PopupAttack when it was checked","code_sha256":"491874927ca0052c","code_sha256_prefix":"491874927ca0052c","mcp_get_code":{"code_sha256":"491874927ca0052c"}},{"arxiv_id":"2410.12971","arxiv_id_is_arxiv":true,"paper":"/paper/self-pluralising-culture-alignment-for-large","title":"Self-Pluralising Culture Alignment for Large Language Models","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaoyangxu/culturespa","path":"result_analysis_run_3.py","file_url":"https://github.com/shaoyangxu/culturespa/blob/HEAD/result_analysis_run_3.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, shaoyangxu/culturespa when it was checked","code_sha256":"8ad790872167b26a","code_sha256_prefix":"8ad790872167b26a","mcp_get_code":{"code_sha256":"8ad790872167b26a"}},{"arxiv_id":"2409.17687","arxiv_id_is_arxiv":true,"paper":"/paper/graph-edit-distance-with-general-costs-using","title":"Graph Edit Distance with General Costs Using Neural Set Divergence","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"structlearning/GraphEdX","path":"GMN/loss.py","file_url":"https://github.com/structlearning/GraphEdX/blob/HEAD/GMN/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 structlearning/neural-subm-design-space, and GitHub detected no licence in that repository when it was checked","code_sha256":"69e7dcdc10127913","code_sha256_prefix":"69e7dcdc10127913","mcp_get_code":{"code_sha256":"69e7dcdc10127913"}},{"arxiv_id":"2407.15847","arxiv_id_is_arxiv":true,"paper":"/paper/llmmap-fingerprinting-for-large-language","title":"LLMmap: Fingerprinting For Large Language Models","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pasquini-dario/LLMmap","path":"LLMmap/inference_model_archs.py","file_url":"https://github.com/pasquini-dario/LLMmap/blob/HEAD/LLMmap/inference_model_archs.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":"47203ac597d1cdaa","code_sha256_prefix":"47203ac597d1cdaa","mcp_get_code":{"code_sha256":"47203ac597d1cdaa"}},{"arxiv_id":"2404.11290","arxiv_id_is_arxiv":true,"paper":"/paper/inductive-cognitive-diagnosis-for-fast","title":"Inductive Cognitive Diagnosis for Fast Student Learning in Web-Based Online Intelligent Education Systems","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lswhim/icdm","path":"metrics/MLS.py","file_url":"https://github.com/lswhim/icdm/blob/HEAD/metrics/MLS.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, lswhim/icdm when it was checked","code_sha256":"921a40f3d066ac23","code_sha256_prefix":"921a40f3d066ac23","mcp_get_code":{"code_sha256":"921a40f3d066ac23"}},{"arxiv_id":"2401.09953","arxiv_id_is_arxiv":true,"paper":"/paper/through-the-dual-prism-a-spectral-perspective","title":"Through the Dual-Prism: A Spectral Perspective on Graph Data Augmentation for Graph Classification","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yu-rp/dualprism","path":"DIG/dig/auggraph/method/DualPrism/utils/utils.py","file_url":"https://github.com/yu-rp/dualprism/blob/HEAD/DIG/dig/auggraph/method/DualPrism/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, yu-rp/dualprism when it was checked","code_sha256":"69e7dcdc10127913","code_sha256_prefix":"69e7dcdc10127913","mcp_get_code":{"code_sha256":"69e7dcdc10127913"}},{"arxiv_id":"2310.07433","arxiv_id_is_arxiv":true,"paper":"/paper/imitation-learning-from-observation-with","title":"Imitation Learning from Observation with Automatic Discount Scheduling","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dwjshift/IL_ADS","path":"IL/modules/ads.py","file_url":"https://github.com/dwjshift/IL_ADS/blob/HEAD/IL/modules/ads.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, dwjshift/IL_ADS when it was checked","code_sha256":"5ddff5153e2b8494","code_sha256_prefix":"5ddff5153e2b8494","mcp_get_code":{"code_sha256":"5ddff5153e2b8494"}},{"arxiv_id":"2306.15142","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-and-accurate-scene-text-detection","title":"LRANet: Towards Accurate and Efficient Scene Text Detection with Low-Rank Approximation Network","date":"2023-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ernestchenchen/sg-lra","path":"Engine_data/chen_lra_to_COCO.py","file_url":"https://github.com/ernestchenchen/sg-lra/blob/HEAD/Engine_data/chen_lra_to_COCO.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":"c2110b21810fb6e8","code_sha256_prefix":"c2110b21810fb6e8","mcp_get_code":{"code_sha256":"c2110b21810fb6e8"}},{"arxiv_id":"2306.15142","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-and-accurate-scene-text-detection","title":"LRANet: Towards Accurate and Efficient Scene Text Detection with Low-Rank Approximation Network","date":"2023-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ernestchenchen/sg-lra","path":"Engine_data/Cobb_eval.py","file_url":"https://github.com/ernestchenchen/sg-lra/blob/HEAD/Engine_data/Cobb_eval.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":"ad4926183260cac8","code_sha256_prefix":"ad4926183260cac8","mcp_get_code":{"code_sha256":"ad4926183260cac8"}},{"arxiv_id":"2303.01497","arxiv_id_is_arxiv":true,"paper":"/paper/teach-a-robot-to-fish-versatile-imitation","title":"Teach a Robot to FISH: Versatile Imitation from One Minute of Demonstrations","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siddhanthaldar/FISH","path":"FISH/rewarder.py","file_url":"https://github.com/siddhanthaldar/FISH/blob/HEAD/FISH/rewarder.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 dwjshift/IL_ADS, and GitHub detected no licence in that repository when it was checked","code_sha256":"5ddff5153e2b8494","code_sha256_prefix":"5ddff5153e2b8494","mcp_get_code":{"code_sha256":"5ddff5153e2b8494"}},{"arxiv_id":"2302.03202","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-the-benefits-of-training-expert","title":"Exploring the Benefits of Training Expert Language Models over Instruction Tuning","date":"2023-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joeljang/elm","path":"retrieval/run_retrieval.py","file_url":"https://github.com/joeljang/elm/blob/HEAD/retrieval/run_retrieval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, joeljang/elm when it was checked","code_sha256":"d77e7ade95e0c350","code_sha256_prefix":"d77e7ade95e0c350","mcp_get_code":{"code_sha256":"d77e7ade95e0c350"}},{"arxiv_id":"2302.00965","arxiv_id_is_arxiv":true,"paper":"/paper/visual-imitation-learning-with-patch-rewards","title":"Visual Imitation Learning with Patch Rewards","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sail-sg/PatchAIL","path":"PatchAIL/rewarder.py","file_url":"https://github.com/sail-sg/PatchAIL/blob/HEAD/PatchAIL/rewarder.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 dwjshift/IL_ADS, and GitHub detected no licence in that repository when it was checked","code_sha256":"5ddff5153e2b8494","code_sha256_prefix":"5ddff5153e2b8494","mcp_get_code":{"code_sha256":"5ddff5153e2b8494"}},{"arxiv_id":"2210.16822","arxiv_id_is_arxiv":true,"paper":"/paper/towards-versatile-embodied-navigation","title":"Towards Versatile Embodied Navigation","date":"2022-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanqingwangai/vxn","path":"habitat_extensions/measures.py","file_url":"https://github.com/hanqingwangai/vxn/blob/HEAD/habitat_extensions/measures.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":"35967088b93afc46","code_sha256_prefix":"35967088b93afc46","mcp_get_code":{"code_sha256":"35967088b93afc46"}},{"arxiv_id":"2110.02207","arxiv_id_is_arxiv":true,"paper":"/paper/waypoint-models-for-instruction-guided-1","title":"Waypoint Models for Instruction-guided Navigation in Continuous Environments","date":"2021-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jacobkrantz/VLN-CE","path":"habitat_extensions/measures.py","file_url":"https://github.com/jacobkrantz/VLN-CE/blob/HEAD/habitat_extensions/measures.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":"35967088b93afc46","code_sha256_prefix":"35967088b93afc46","mcp_get_code":{"code_sha256":"35967088b93afc46"}},{"arxiv_id":"2109.09740","arxiv_id_is_arxiv":true,"paper":"/paper/neural-distance-embeddings-for-biological","title":"Neural Distance Embeddings for Biological Sequences","date":"2021-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gcorso/neuroseed","path":"edit_distance/models/pair_encoder.py","file_url":"https://github.com/gcorso/neuroseed/blob/HEAD/edit_distance/models/pair_encoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e067dd756c18ab7","code_sha256_prefix":"2e067dd756c18ab7","mcp_get_code":{"code_sha256":"2e067dd756c18ab7"}},{"arxiv_id":"2109.07589","arxiv_id_is_arxiv":true,"paper":"/paper/container-few-shot-named-entity-recognition","title":"CONTaiNER: Few-Shot Named Entity Recognition via Contrastive Learning","date":"2021-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psunlpgroup/container","path":"src/utils.py","file_url":"https://github.com/psunlpgroup/container/blob/HEAD/src/utils.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":"5c8c4a2b8ca7176f","code_sha256_prefix":"5c8c4a2b8ca7176f","mcp_get_code":{"code_sha256":"5c8c4a2b8ca7176f"}},{"arxiv_id":"2108.11945","arxiv_id_is_arxiv":true,"paper":"/paper/sasra-semantically-aware-spatio-temporal","title":"SASRA: Semantically-aware Spatio-temporal Reasoning Agent for Vision-and-Language Navigation in Continuous Environments","date":"2021-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-RIPL/robo-vln","path":"robo_vln_baselines/nonlearning_agents.py","file_url":"https://github.com/GT-RIPL/robo-vln/blob/HEAD/robo_vln_baselines/nonlearning_agents.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":"f0bf68e831df0859","code_sha256_prefix":"f0bf68e831df0859","mcp_get_code":{"code_sha256":"f0bf68e831df0859"}},{"arxiv_id":"2108.01662","arxiv_id_is_arxiv":true,"paper":"/paper/uniform-sampling-over-episode-difficulty","title":"Uniform Sampling over Episode Difficulty","date":"2021-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/uniform-episodic-sampling","path":"utils.py","file_url":"https://github.com/amazon-research/uniform-episodic-sampling/blob/HEAD/utils.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":"201f6b2829446b5d","code_sha256_prefix":"201f6b2829446b5d","mcp_get_code":{"code_sha256":"201f6b2829446b5d"}},{"arxiv_id":"2007.05270","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-plan-with-uncertain-topological","title":"Learning to plan with uncertain topological maps","date":"2020-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edbeeching/learning_to_plan","path":"graph_dataset.py","file_url":"https://github.com/edbeeching/learning_to_plan/blob/HEAD/graph_dataset.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":"0c0109b529918c57","code_sha256_prefix":"0c0109b529918c57","mcp_get_code":{"code_sha256":"0c0109b529918c57"}},{"arxiv_id":"2006.11325","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-prototypical-transfer","title":"Self-Supervised Prototypical Transfer Learning for Few-Shot Classification","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ojss/samptransfer","path":"utils/proto_utils.py","file_url":"https://github.com/ojss/samptransfer/blob/HEAD/utils/proto_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ojss/samptransfer when it was checked","code_sha256":"083427faad799a4d","code_sha256_prefix":"083427faad799a4d","mcp_get_code":{"code_sha256":"083427faad799a4d"}},{"arxiv_id":"2006.11325","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-prototypical-transfer","title":"Self-Supervised Prototypical Transfer Learning for Few-Shot Classification","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"indy-lab/ProtoTransfer","path":"omni-mini/prototransfer/protonet.py","file_url":"https://github.com/indy-lab/ProtoTransfer/blob/HEAD/omni-mini/prototransfer/protonet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4cff643601aa1b0c","code_sha256_prefix":"4cff643601aa1b0c","mcp_get_code":{"code_sha256":"4cff643601aa1b0c"}},{"arxiv_id":"2005.14165","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asahi417/relbert","path":"relbert/evaluation/analogy_questions.py","file_url":"https://github.com/asahi417/relbert/blob/HEAD/relbert/evaluation/analogy_questions.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":"3866cbd2c9f5fd58","code_sha256_prefix":"3866cbd2c9f5fd58","mcp_get_code":{"code_sha256":"3866cbd2c9f5fd58"}},{"arxiv_id":"1910.14599","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-nli-a-new-benchmark-for-natural","title":"Adversarial NLI: A New Benchmark for Natural Language Understanding","date":"2019-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tlatkowski/multihead-siamese-nets","path":"layers/similarity.py","file_url":"https://github.com/tlatkowski/multihead-siamese-nets/blob/HEAD/layers/similarity.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":"e0ff356ea7d11efb","code_sha256_prefix":"e0ff356ea7d11efb","mcp_get_code":{"code_sha256":"e0ff356ea7d11efb"}},{"arxiv_id":"1812.03584","arxiv_id_is_arxiv":true,"paper":"/paper/q-means-a-quantum-algorithm-for-unsupervised","title":"q-means: A quantum algorithm for unsupervised machine learning","date":"2018-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Morcu/q-means","path":"time_benchmarks.py","file_url":"https://github.com/Morcu/q-means/blob/HEAD/time_benchmarks.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":"57c67ea68b2e1170","code_sha256_prefix":"57c67ea68b2e1170","mcp_get_code":{"code_sha256":"57c67ea68b2e1170"}},{"arxiv_id":"1804.01438","arxiv_id_is_arxiv":true,"paper":"/paper/learning-discriminative-features-with","title":"Learning Discriminative Features with Multiple Granularities for Person Re-Identification","date":"2018-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WangTaoAs/MGN_ReID","path":"utils/metrics.py","file_url":"https://github.com/WangTaoAs/MGN_ReID/blob/HEAD/utils/metrics.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":"93f3ef4f748bb19f","code_sha256_prefix":"93f3ef4f748bb19f","mcp_get_code":{"code_sha256":"93f3ef4f748bb19f"}},{"arxiv_id":"1703.06870","arxiv_id_is_arxiv":true,"paper":"/paper/mask-r-cnn","title":"Mask R-CNN","date":"2017-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxfrei750/FibeR-CNN","path":"fibercnn/modeling/losses.py","file_url":"https://github.com/maxfrei750/FibeR-CNN/blob/HEAD/fibercnn/modeling/losses.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":"4ec42dd9d2a8b00f","code_sha256_prefix":"4ec42dd9d2a8b00f","mcp_get_code":{"code_sha256":"4ec42dd9d2a8b00f"}}],"record_sha256":"e306a1c51d505db54224634de042507d1f10d119bb37e5ac1ce63122b8923692","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}