{"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/get-accuracy","entry":"get_accuracy","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":52,"n_papers_ran":34,"n_papers_ran_no_instrument_failure":20,"n_papers_ran_instrument_only":14,"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":46,"n_samples_ran":35,"n_samples_constructed":0,"n_samples_ran_checked":23,"n_samples_instrument":12,"n_samples_unverified":11,"n_samples_fingerprinted":14,"n_places":56,"n_places_pointer_only":26,"n_places_pointer_only_link_open":1,"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":5,"ran_violates":2,"ran_draft_wrong":7,"ran_fixture":5,"ran":16,"unverified":11},"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":"2604.22562","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-22562","title":"Data-Free Contribution Estimation in Federated Learning using Gradient von Neumann Entropy","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"asimukaye/spectralfuse","path":"trainutils.py","file_url":"https://github.com/asimukaye/spectralfuse/blob/HEAD/trainutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2402e9b3ec5e41df","code_sha256_prefix":"2402e9b3ec5e41df","mcp_get_code":{"code_sha256":"2402e9b3ec5e41df"}},{"arxiv_id":"2601.16376","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-16376","title":"Polymer-Agent: Large Language Model Agent for Polymer Design","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"TheJacksonLab/OpenMacromolecularGenome","path":"molecule_chef/module/utils.py","file_url":"https://github.com/TheJacksonLab/OpenMacromolecularGenome/blob/HEAD/molecule_chef/module/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, TheJacksonLab/OpenMacromolecularGenome, is not in the permissive set Syntology serves inline","code_sha256":"5b10a683231ece11","code_sha256_prefix":"5b10a683231ece11","mcp_get_code":{"code_sha256":"5b10a683231ece11"}},{"arxiv_id":"2507.12075","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.12075","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"booknlp/booknlp","path":"booknlp/common/sequence_eval.py","file_url":"https://github.com/booknlp/booknlp/blob/HEAD/booknlp/common/sequence_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":"6db9b749b1cf20d3","code_sha256_prefix":"6db9b749b1cf20d3","mcp_get_code":{"code_sha256":"6db9b749b1cf20d3"}},{"arxiv_id":"2507.11688","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.11688","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"vsingh-group/ComposingLinearLayers","path":"evaluate.py","file_url":"https://github.com/vsingh-group/ComposingLinearLayers/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, vsingh-group/ComposingLinearLayers when it was checked","code_sha256":"ad7f827da570381f","code_sha256_prefix":"ad7f827da570381f","mcp_get_code":{"code_sha256":"ad7f827da570381f"}},{"arxiv_id":"2412.11521","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-ability-of-deep-networks-to-learn","title":"On the Ability of Deep Networks to Learn Symmetries from Data: A Neural Kernel Theory","date":"2024-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrea-perin/gpsymm","path":"fig1_data.py","file_url":"https://github.com/andrea-perin/gpsymm/blob/HEAD/fig1_data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, andrea-perin/gpsymm when it was checked","code_sha256":"6a332e60f9de2df6","code_sha256_prefix":"6a332e60f9de2df6","mcp_get_code":{"code_sha256":"6a332e60f9de2df6"}},{"arxiv_id":"2411.04466","arxiv_id_is_arxiv":true,"paper":"/paper/enabling-adaptive-agent-training-in-open","title":"Enabling Adaptive Agent Training in Open-Ended Simulators by Targeting Diversity","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AMLab-Amsterdam/DIVA","path":"paper_experiments/rotated_mnist/supervised/experiment_only_sup_diva.py","file_url":"https://github.com/AMLab-Amsterdam/DIVA/blob/HEAD/paper_experiments/rotated_mnist/supervised/experiment_only_sup_diva.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":"836e4fec26e79ed7","code_sha256_prefix":"836e4fec26e79ed7","mcp_get_code":{"code_sha256":"836e4fec26e79ed7"}},{"arxiv_id":"2410.14872","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-evaluate-reward-models-for-rlhf","title":"How to Evaluate Reward Models for RLHF","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmarena/ppe","path":"utils/scorers.py","file_url":"https://github.com/lmarena/ppe/blob/HEAD/utils/scorers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, lmarena/ppe when it was checked","code_sha256":"d59fa2d0990791a0","code_sha256_prefix":"d59fa2d0990791a0","mcp_get_code":{"code_sha256":"d59fa2d0990791a0"}},{"arxiv_id":"2410.02760","arxiv_id_is_arxiv":true,"paper":"/paper/erasing-conceptual-knowledge-from-language","title":"Erasing Conceptual Knowledge from Language Models","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rohitgandikota/erasing-llm","path":"utils/metrics.py","file_url":"https://github.com/rohitgandikota/erasing-llm/blob/HEAD/utils/metrics.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, rohitgandikota/erasing-llm when it was checked","code_sha256":"c1aaeda27d027041","code_sha256_prefix":"c1aaeda27d027041","mcp_get_code":{"code_sha256":"c1aaeda27d027041"}},{"arxiv_id":"2407.15527","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-concept-based-memory-reasoning","title":"Interpretable Concept-Based Memory Reasoning","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daviddebot/CMR","path":"experiments/cebab/models.py","file_url":"https://github.com/daviddebot/CMR/blob/HEAD/experiments/cebab/models.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":"b45172fecb8d6720","code_sha256_prefix":"b45172fecb8d6720","mcp_get_code":{"code_sha256":"b45172fecb8d6720"}},{"arxiv_id":"2407.15527","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-concept-based-memory-reasoning","title":"Interpretable Concept-Based Memory Reasoning","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daviddebot/CMR","path":"experiments/cub/models.py","file_url":"https://github.com/daviddebot/CMR/blob/HEAD/experiments/cub/models.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":"17adc58c54e10b59","code_sha256_prefix":"17adc58c54e10b59","mcp_get_code":{"code_sha256":"17adc58c54e10b59"}},{"arxiv_id":"2407.15527","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-concept-based-memory-reasoning","title":"Interpretable Concept-Based Memory Reasoning","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daviddebot/CMR","path":"experiments/mnist/models_copy.py","file_url":"https://github.com/daviddebot/CMR/blob/HEAD/experiments/mnist/models_copy.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":"328e02ae2ef2610b","code_sha256_prefix":"328e02ae2ef2610b","mcp_get_code":{"code_sha256":"328e02ae2ef2610b"}},{"arxiv_id":"2407.11730","arxiv_id_is_arxiv":true,"paper":"/paper/monocular-occupancy-prediction-for-scalable","title":"Monocular Occupancy Prediction for Scalable Indoor Scenes","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hongxiaoy/ISO","path":"iso/loss/sscMetrics.py","file_url":"https://github.com/hongxiaoy/ISO/blob/HEAD/iso/loss/sscMetrics.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":"40d8d0dfd5686afe","code_sha256_prefix":"40d8d0dfd5686afe","mcp_get_code":{"code_sha256":"40d8d0dfd5686afe"}},{"arxiv_id":"2407.08762","arxiv_id_is_arxiv":true,"paper":"/paper/commute-time-optimised-graphs-for-gnns","title":"Commute-Time-Optimised Graphs for GNNs","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"igorsterner/commute-opt-gnn","path":"src/train_arxiv_gin.py","file_url":"https://github.com/igorsterner/commute-opt-gnn/blob/HEAD/src/train_arxiv_gin.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, igorsterner/commute-opt-gnn when it was checked","code_sha256":"ea038ba8ef273fee","code_sha256_prefix":"ea038ba8ef273fee","mcp_get_code":{"code_sha256":"ea038ba8ef273fee"}},{"arxiv_id":"2406.03143","arxiv_id_is_arxiv":true,"paper":"/paper/zeropur-succinct-training-free-adversarial","title":"ZeroPur: Succinct Training-Free Adversarial Purification","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erhul/ZeroPur","path":"utils.py","file_url":"https://github.com/erhul/ZeroPur/blob/HEAD/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, erhul/ZeroPur when it was checked","code_sha256":"fa9947c95b2f3518","code_sha256_prefix":"fa9947c95b2f3518","mcp_get_code":{"code_sha256":"fa9947c95b2f3518"}},{"arxiv_id":"2405.14840","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-annealed-importance-sampling-1","title":"Differentiable Annealed Importance Sampling Minimizes The Symmetrized Kullback-Leibler Divergence Between Initial and Target Distribution","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jzenn/dais0","path":"train_logistic_regression.py","file_url":"https://github.com/jzenn/dais0/blob/HEAD/train_logistic_regression.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4368a9d6070d9b1a","code_sha256_prefix":"4368a9d6070d9b1a","mcp_get_code":{"code_sha256":"4368a9d6070d9b1a"}},{"arxiv_id":"2405.00732","arxiv_id_is_arxiv":true,"paper":"/paper/lora-land-310-fine-tuned-llms-that-rival-gpt","title":"LoRA Land: 310 Fine-tuned LLMs that Rival GPT-4, A Technical Report","date":"2024-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"predibase/lora_bakeoff","path":"utils/metric_fns.py","file_url":"https://github.com/predibase/lora_bakeoff/blob/HEAD/utils/metric_fns.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, predibase/lora_bakeoff when it was checked","code_sha256":"e99446edd24636a6","code_sha256_prefix":"e99446edd24636a6","mcp_get_code":{"code_sha256":"e99446edd24636a6"}},{"arxiv_id":"2404.02697","arxiv_id_is_arxiv":true,"paper":"/paper/model-agnostic-origin-attribution-of","title":"Which Model Generated This Image? A Model-Agnostic Approach for Origin Attribution","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uwFengyuan/OCC-CLIP","path":"utils.py","file_url":"https://github.com/uwFengyuan/OCC-CLIP/blob/HEAD/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":"5af17a7a31474613","code_sha256_prefix":"5af17a7a31474613","mcp_get_code":{"code_sha256":"5af17a7a31474613"}},{"arxiv_id":"2403.07309","arxiv_id_is_arxiv":true,"paper":"/paper/reinforced-sequential-decision-making-for","title":"Reinforced Sequential Decision-Making for Sepsis Treatment: The POSNEGDM Framework with Mortality Classifier and Transformer","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dipeshtamboli/posnegdm-reinforced-sequential-decision-making-for-sepsis-treatment","path":"utils.py","file_url":"https://github.com/dipeshtamboli/posnegdm-reinforced-sequential-decision-making-for-sepsis-treatment/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ffe73c36fbe2646f","code_sha256_prefix":"ffe73c36fbe2646f","mcp_get_code":{"code_sha256":"ffe73c36fbe2646f"}},{"arxiv_id":"2402.15853","arxiv_id_is_arxiv":true,"paper":"/paper/rauca-a-novel-physical-adversarial-attack-on","title":"RAUCA: A Novel Physical Adversarial Attack on Vehicle Detectors via Robust and Accurate Camouflage Generation","date":"2024-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SeRAlab/Robust-and-Accurate-UV-map-based-Camouflage-Attack","path":"src/Image_Segmentation/evaluation.py","file_url":"https://github.com/SeRAlab/Robust-and-Accurate-UV-map-based-Camouflage-Attack/blob/HEAD/src/Image_Segmentation/evaluation.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, SeRAlab/Robust-and-Accurate-UV-map-based-Camouflage-Attack when it was checked","code_sha256":"95bb69a36b70e931","code_sha256_prefix":"95bb69a36b70e931","mcp_get_code":{"code_sha256":"95bb69a36b70e931"}},{"arxiv_id":"2402.08946","arxiv_id_is_arxiv":true,"paper":"/paper/measuring-sharpness-in-grokking","title":"Measuring Sharpness in Grokking","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jackmiller2003/tiny-gen","path":"src/common.py","file_url":"https://github.com/jackmiller2003/tiny-gen/blob/HEAD/src/common.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, jackmiller2003/tiny-gen when it was checked","code_sha256":"4ddde33fb0d7122b","code_sha256_prefix":"4ddde33fb0d7122b","mcp_get_code":{"code_sha256":"4ddde33fb0d7122b"}},{"arxiv_id":"2401.12794","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-llms-via-uncertainty","title":"Benchmarking LLMs via Uncertainty Quantification","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smartyfh/llm-uncertainty-bench","path":"uncertainty_quantification_via_cp.py","file_url":"https://github.com/smartyfh/llm-uncertainty-bench/blob/HEAD/uncertainty_quantification_via_cp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7027200b9089953e","code_sha256_prefix":"7027200b9089953e","mcp_get_code":{"code_sha256":"7027200b9089953e"}},{"arxiv_id":"2311.11762","arxiv_id_is_arxiv":true,"paper":"/paper/muvo-a-multimodal-generative-world-model-for","title":"MUVO: A Multimodal World Model with Spatial Representations for Autonomous Driving","date":"2023-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fzi-forschungszentrum-informatik/muvo","path":"muvo/metrics.py","file_url":"https://github.com/fzi-forschungszentrum-informatik/muvo/blob/HEAD/muvo/metrics.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, fzi-forschungszentrum-informatik/muvo when it was checked","code_sha256":"019b2c84dd83f0bd","code_sha256_prefix":"019b2c84dd83f0bd","mcp_get_code":{"code_sha256":"019b2c84dd83f0bd"}},{"arxiv_id":"2311.02805","arxiv_id_is_arxiv":true,"paper":"/paper/tailoring-self-rationalizers-with-multi","title":"Tailoring Self-Rationalizers with Multi-Reward Distillation","date":"2023-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ink-usc/rationalemultirewarddistillation","path":"mario/eval_n.py","file_url":"https://github.com/ink-usc/rationalemultirewarddistillation/blob/HEAD/mario/eval_n.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, ink-usc/rationalemultirewarddistillation when it was checked","code_sha256":"6b1269ddfa3e825b","code_sha256_prefix":"6b1269ddfa3e825b","mcp_get_code":{"code_sha256":"6b1269ddfa3e825b"}},{"arxiv_id":"2311.02805","arxiv_id_is_arxiv":true,"paper":"/paper/tailoring-self-rationalizers-with-multi","title":"Tailoring Self-Rationalizers with Multi-Reward Distillation","date":"2023-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ink-usc/rationalemultirewarddistillation","path":"mario/eval_other_rationales.py","file_url":"https://github.com/ink-usc/rationalemultirewarddistillation/blob/HEAD/mario/eval_other_rationales.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, ink-usc/rationalemultirewarddistillation when it was checked","code_sha256":"016f3dd6b689a3e6","code_sha256_prefix":"016f3dd6b689a3e6","mcp_get_code":{"code_sha256":"016f3dd6b689a3e6"}},{"arxiv_id":"2310.15061","arxiv_id_is_arxiv":true,"paper":"/paper/the-bla-benchmark-investigating-basic","title":"The BLA Benchmark: Investigating Basic Language Abilities of Pre-Trained Multimodal Models","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shin-ee-chen/BLA","path":"evaluation_models/clip/utils.py","file_url":"https://github.com/shin-ee-chen/BLA/blob/HEAD/evaluation_models/clip/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":"574b247caf8962a7","code_sha256_prefix":"574b247caf8962a7","mcp_get_code":{"code_sha256":"574b247caf8962a7"}},{"arxiv_id":"2310.10944","arxiv_id_is_arxiv":true,"paper":"/paper/teq-trainable-equivalent-transformation-for","title":"TEQ: Trainable Equivalent Transformation for Quantization of LLMs","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intel/neural-compressor","path":"examples/pytorch/nlp/huggingface_models/language-modeling/quantization/auto_round/llama3/quantize.py","file_url":"https://github.com/intel/neural-compressor/blob/HEAD/examples/pytorch/nlp/huggingface_models/language-modeling/quantization/auto_round/llama3/quantize.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":"7f7d585fdda8fcee","code_sha256_prefix":"7f7d585fdda8fcee","mcp_get_code":{"code_sha256":"7f7d585fdda8fcee"}},{"arxiv_id":"2309.14616","arxiv_id_is_arxiv":true,"paper":"/paper/ndc-scene-boost-monocular-3d-semantic-scene","title":"NDC-Scene: Boost Monocular 3D Semantic Scene Completion in Normalized Device Coordinates Space","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jiawei-Yao0812/NDCScene","path":"ndcscene/loss/sscMetrics.py","file_url":"https://github.com/Jiawei-Yao0812/NDCScene/blob/HEAD/ndcscene/loss/sscMetrics.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, Jiawei-Yao0812/NDCScene when it was checked","code_sha256":"40d8d0dfd5686afe","code_sha256_prefix":"40d8d0dfd5686afe","mcp_get_code":{"code_sha256":"40d8d0dfd5686afe"}},{"arxiv_id":"2305.16133","arxiv_id_is_arxiv":true,"paper":"/paper/ovo-open-vocabulary-occupancy","title":"OVO: Open-Vocabulary Occupancy","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dzcgaara/OVO","path":"ovo/loss/sscMetrics.py","file_url":"https://github.com/dzcgaara/OVO/blob/HEAD/ovo/loss/sscMetrics.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":"40d8d0dfd5686afe","code_sha256_prefix":"40d8d0dfd5686afe","mcp_get_code":{"code_sha256":"40d8d0dfd5686afe"}},{"arxiv_id":"2304.11015","arxiv_id_is_arxiv":true,"paper":"/paper/din-sql-decomposed-in-context-learning-of-1","title":"DIN-SQL: Decomposed In-Context Learning of Text-to-SQL with Self-Correction","date":"2023-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mohammadrezapourreza/few-shot-nl2sql-with-prompting","path":"AnalysisResults.py","file_url":"https://github.com/mohammadrezapourreza/few-shot-nl2sql-with-prompting/blob/HEAD/AnalysisResults.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":"66f0572c036abde3","code_sha256_prefix":"66f0572c036abde3","mcp_get_code":{"code_sha256":"66f0572c036abde3"}},{"arxiv_id":"2304.01552","arxiv_id_is_arxiv":true,"paper":"/paper/meta-learning-with-a-geometry-adaptive","title":"Meta-Learning with a Geometry-Adaptive Preconditioner","date":"2023-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Suhyun777/CVPR23-GAP","path":"utils.py","file_url":"https://github.com/Suhyun777/CVPR23-GAP/blob/HEAD/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":"dad49dad06992a06","code_sha256_prefix":"dad49dad06992a06","mcp_get_code":{"code_sha256":"dad49dad06992a06"}},{"arxiv_id":"2302.13540","arxiv_id_is_arxiv":true,"paper":"/paper/occdepth-a-depth-aware-method-for-3d-semantic","title":"OccDepth: A Depth-Aware Method for 3D Semantic Scene Completion","date":"2023-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megvii-research/occdepth","path":"occdepth/loss/sscMetrics.py","file_url":"https://github.com/megvii-research/occdepth/blob/HEAD/occdepth/loss/sscMetrics.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":"40d8d0dfd5686afe","code_sha256_prefix":"40d8d0dfd5686afe","mcp_get_code":{"code_sha256":"40d8d0dfd5686afe"}},{"arxiv_id":"2302.07867","arxiv_id_is_arxiv":true,"paper":"/paper/learning-performance-improving-code-edits","title":"Learning Performance-Improving Code Edits","date":"2023-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"madaan/pie-perf","path":"src/codenet_eval/run_eval.py","file_url":"https://github.com/madaan/pie-perf/blob/HEAD/src/codenet_eval/run_eval.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, madaan/pie-perf when it was checked","code_sha256":"1f09a6f0ad0d135a","code_sha256_prefix":"1f09a6f0ad0d135a","mcp_get_code":{"code_sha256":"1f09a6f0ad0d135a"}},{"arxiv_id":"2212.09095","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-role-of-scale-for-in-context","title":"Rethinking the Role of Scale for In-Context Learning: An Interpretability-based Case Study at 66 Billion Scale","date":"2022-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/llm-interpret","path":"scripts/plotting/fc_importance.py","file_url":"https://github.com/amazon-science/llm-interpret/blob/HEAD/scripts/plotting/fc_importance.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4097a7bd8f7a0c6b","code_sha256_prefix":"4097a7bd8f7a0c6b","mcp_get_code":{"code_sha256":"4097a7bd8f7a0c6b"}},{"arxiv_id":"2210.13012","arxiv_id_is_arxiv":true,"paper":"/paper/cmu-net-a-strong-convmixer-based-medical","title":"CMU-Net: A Strong ConvMixer-based Medical Ultrasound Image Segmentation Network","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fenghetan9/cmu-net","path":"src/metrics.py","file_url":"https://github.com/fenghetan9/cmu-net/blob/HEAD/src/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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 wjcheon/MedicalImageSegmentation_Pytorch, and GitHub detected no licence in that repository when it was checked","code_sha256":"95bb69a36b70e931","code_sha256_prefix":"95bb69a36b70e931","mcp_get_code":{"code_sha256":"95bb69a36b70e931"}},{"arxiv_id":"2210.12624","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-gradient-bias-in-multi-objective","title":"Mitigating Gradient Bias in Multi-objective Learning: A Provably Convergent Stochastic Approach","date":"2022-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heshandevaka/Trade-Off-MOL","path":"Toy-MNIST/toy_loss.py","file_url":"https://github.com/heshandevaka/Trade-Off-MOL/blob/HEAD/Toy-MNIST/toy_loss.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":"35f6ead8f9037bad","code_sha256_prefix":"35f6ead8f9037bad","mcp_get_code":{"code_sha256":"35f6ead8f9037bad"}},{"arxiv_id":"2208.08307","arxiv_id_is_arxiv":true,"paper":"/paper/incremental-3d-scene-completion-for-safe-and","title":"SC-Explorer: Incremental 3D Scene Completion for Safe and Efficient Exploration Mapping and Planning","date":"2022-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethz-asl/ssc_exploration","path":"ssc_network/utils/ssc_metrics.py","file_url":"https://github.com/ethz-asl/ssc_exploration/blob/HEAD/ssc_network/utils/ssc_metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"40d8d0dfd5686afe","code_sha256_prefix":"40d8d0dfd5686afe","mcp_get_code":{"code_sha256":"40d8d0dfd5686afe"}},{"arxiv_id":"2206.12839","arxiv_id_is_arxiv":true,"paper":"/paper/repository-level-prompt-generation-for-large","title":"Repository-Level Prompt Generation for Large Language Models of Code","date":"2022-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shrivastavadisha/repo_level_prompt_generation","path":"rule_classifier_preprocessed_data.py","file_url":"https://github.com/shrivastavadisha/repo_level_prompt_generation/blob/HEAD/rule_classifier_preprocessed_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"177a8218c0d26146","code_sha256_prefix":"177a8218c0d26146","mcp_get_code":{"code_sha256":"177a8218c0d26146"}},{"arxiv_id":"2203.00357","arxiv_id_is_arxiv":true,"paper":"/paper/merit-meta-path-guided-contrastive-learning","title":"MERIt: Meta-Path Guided Contrastive Learning for Logical Reasoning","date":"2022-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sparkjiao/merit","path":"models/roberta_sent_att_sup.py","file_url":"https://github.com/sparkjiao/merit/blob/HEAD/models/roberta_sent_att_sup.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"15b69fa520a0583e","code_sha256_prefix":"15b69fa520a0583e","mcp_get_code":{"code_sha256":"15b69fa520a0583e"}},{"arxiv_id":"2112.00726","arxiv_id_is_arxiv":true,"paper":"/paper/monoscene-monocular-3d-semantic-scene","title":"MonoScene: Monocular 3D Semantic Scene Completion","date":"2021-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astra-vision/monoscene","path":"monoscene/loss/sscMetrics.py","file_url":"https://github.com/astra-vision/monoscene/blob/HEAD/monoscene/loss/sscMetrics.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":"40d8d0dfd5686afe","code_sha256_prefix":"40d8d0dfd5686afe","mcp_get_code":{"code_sha256":"40d8d0dfd5686afe"}},{"arxiv_id":"2109.14120","arxiv_id_is_arxiv":true,"paper":"/paper/meta-learning-on-a-sequence-of-imbalanced","title":"Meta Learning on a Sequence of Imbalanced Domains with Difficulty Awareness","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joey-wang123/imbalancemeta","path":"utils.py","file_url":"https://github.com/joey-wang123/imbalancemeta/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":"3368a0b09ca316c2","code_sha256_prefix":"3368a0b09ca316c2","mcp_get_code":{"code_sha256":"3368a0b09ca316c2"}},{"arxiv_id":"2106.07175","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-combine-per-example-solutions-for","title":"Learning to Combine Per-Example Solutions for Neural Program Synthesis","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shrivastavadisha/n-peps","path":"scripts/train_aggregator.py","file_url":"https://github.com/shrivastavadisha/n-peps/blob/HEAD/scripts/train_aggregator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, shrivastavadisha/n-peps (NOASSERTION)","code_sha256":"50a69db7a1caf80f","code_sha256_prefix":"50a69db7a1caf80f","mcp_get_code":{"code_sha256":"50a69db7a1caf80f"}},{"arxiv_id":"2106.02796","arxiv_id_is_arxiv":true,"paper":"/paper/principle-bit-analysis-autoencoding-with","title":"Principal Bit Analysis: Autoencoding with Schur-Concave Loss","date":"2021-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SourbhBh/PBA","path":"train_nn.py","file_url":"https://github.com/SourbhBh/PBA/blob/HEAD/train_nn.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, SourbhBh/PBA when it was checked","code_sha256":"9de15047a2bb67f0","code_sha256_prefix":"9de15047a2bb67f0","mcp_get_code":{"code_sha256":"9de15047a2bb67f0"}},{"arxiv_id":"2103.00453","arxiv_id_is_arxiv":true,"paper":"/paper/self-diagnosis-and-self-debiasing-a-proposal","title":"Self-Diagnosis and Self-Debiasing: A Proposal for Reducing Corpus-Based Bias in NLP","date":"2021-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"timoschick/self-debiasing","path":"self_diagnosis.py","file_url":"https://github.com/timoschick/self-debiasing/blob/HEAD/self_diagnosis.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8afdbc78a7c0edb2","code_sha256_prefix":"8afdbc78a7c0edb2","mcp_get_code":{"code_sha256":"8afdbc78a7c0edb2"}},{"arxiv_id":"2008.06448","arxiv_id_is_arxiv":true,"paper":"/paper/loghub-a-large-collection-of-system-log","title":"Loghub: A Large Collection of System Log Datasets for AI-driven Log Analytics","date":null,"month_inferred_from_arxiv_id":"2020-08","title_source":"archive","repo":"logpai/loghub-2.0","path":"benchmark/LogPPT/logppt/evaluation/evaluator.py","file_url":"https://github.com/logpai/loghub-2.0/blob/HEAD/benchmark/LogPPT/logppt/evaluation/evaluator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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, logpai/loghub-2.0 (NOASSERTION)","code_sha256":"04e9124a19f95d56","code_sha256_prefix":"04e9124a19f95d56","mcp_get_code":{"code_sha256":"04e9124a19f95d56"}},{"arxiv_id":"2004.05150","arxiv_id_is_arxiv":true,"paper":"/paper/longformer-the-long-document-transformer","title":"Longformer: The Long-Document Transformer","date":"2020-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaketae/pytorch-malware-detection","path":"src/deep_malware_detection/utils.py","file_url":"https://github.com/jaketae/pytorch-malware-detection/blob/HEAD/src/deep_malware_detection/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":"e910798b9dfc1967","code_sha256_prefix":"e910798b9dfc1967","mcp_get_code":{"code_sha256":"e910798b9dfc1967"}},{"arxiv_id":"2003.01227","arxiv_id_is_arxiv":true,"paper":"/paper/fast-predictive-uncertainty-for","title":"Fast Predictive Uncertainty for Classification with Bayesian Deep Networks","date":"2020-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mariushobbhahn/LB_for_BNNs_official","path":"utils/LB_utils.py","file_url":"https://github.com/mariushobbhahn/LB_for_BNNs_official/blob/HEAD/utils/LB_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, mariushobbhahn/LB_for_BNNs_official when it was checked","code_sha256":"c4d57576c429b674","code_sha256_prefix":"c4d57576c429b674","mcp_get_code":{"code_sha256":"c4d57576c429b674"}},{"arxiv_id":"1910.00359","arxiv_id_is_arxiv":true,"paper":"/paper/truth-or-backpropaganda-an-empirical-1","title":"Truth or Backpropaganda? An Empirical Investigation of Deep Learning Theory","date":"2019-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goldblum/TruthOrBackpropaganda","path":"NTK_and_local_optima/dl_myths/routines/training.py","file_url":"https://github.com/goldblum/TruthOrBackpropaganda/blob/HEAD/NTK_and_local_optima/dl_myths/routines/training.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"99b9941a10b98ac9","code_sha256_prefix":"99b9941a10b98ac9","mcp_get_code":{"code_sha256":"99b9941a10b98ac9"}},{"arxiv_id":"1906.06059","arxiv_id_is_arxiv":true,"paper":"/paper/monoloco-monocular-3d-pedestrian-localization","title":"MonoLoco: Monocular 3D Pedestrian Localization and Uncertainty Estimation","date":"2019-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-epfl/monstereo","path":"monstereo/train/trainer.py","file_url":"https://github.com/vita-epfl/monstereo/blob/HEAD/monstereo/train/trainer.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, vita-epfl/monstereo (NOASSERTION)","code_sha256":"1ef541745795a586","code_sha256_prefix":"1ef541745795a586","mcp_get_code":{"code_sha256":"1ef541745795a586"}},{"arxiv_id":"1905.10427","arxiv_id_is_arxiv":true,"paper":"/paper/diva-domain-invariant-variational","title":"DIVA: Domain Invariant Variational Autoencoders","date":"2019-05-24","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":"836e4fec26e79ed7","code_sha256_prefix":"836e4fec26e79ed7","mcp_get_code":{"code_sha256":"836e4fec26e79ed7"}},{"arxiv_id":"1804.03999","arxiv_id_is_arxiv":true,"paper":"/paper/attention-u-net-learning-where-to-look-for","title":"Attention U-Net: Learning Where to Look for the Pancreas","date":"2018-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wjcheon/MedicalImageSegmentation_Pytorch","path":"evaluation.py","file_url":"https://github.com/wjcheon/MedicalImageSegmentation_Pytorch/blob/HEAD/evaluation.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, wjcheon/MedicalImageSegmentation_Pytorch when it was checked","code_sha256":"95bb69a36b70e931","code_sha256_prefix":"95bb69a36b70e931","mcp_get_code":{"code_sha256":"95bb69a36b70e931"}},{"arxiv_id":"1804.03999","arxiv_id_is_arxiv":true,"paper":"/paper/attention-u-net-learning-where-to-look-for","title":"Attention U-Net: Learning Where to Look for the Pancreas","date":"2018-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Spider-scnu/Instance-Segmentation-For-Cancer","path":"code/evaluation.py","file_url":"https://github.com/Spider-scnu/Instance-Segmentation-For-Cancer/blob/HEAD/code/evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1eceaf04d569126f","code_sha256_prefix":"1eceaf04d569126f","mcp_get_code":{"code_sha256":"1eceaf04d569126f"}},{"arxiv_id":"1802.06955","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-residual-convolutional-neural","title":"Recurrent Residual Convolutional Neural Network based on U-Net (R2U-Net) for Medical Image Segmentation","date":"2018-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"95bb69a36b70e931","code_sha256_prefix":"95bb69a36b70e931","mcp_get_code":{"code_sha256":"95bb69a36b70e931"}},{"arxiv_id":"1710.09435","arxiv_id_is_arxiv":true,"paper":"/paper/malware-detection-by-eating-a-whole-exe","title":"Malware Detection by Eating a Whole EXE","date":"2017-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaketae/deep-malware-detection","path":"src/deep_malware_detection/utils.py","file_url":"https://github.com/jaketae/deep-malware-detection/blob/HEAD/src/deep_malware_detection/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":"e910798b9dfc1967","code_sha256_prefix":"e910798b9dfc1967","mcp_get_code":{"code_sha256":"e910798b9dfc1967"}},{"arxiv_id":"1602.05629","arxiv_id_is_arxiv":true,"paper":"/paper/communication-efficient-learning-of-deep","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","date":"2016-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vaseline555/superfed","path":"src/algorithm.py","file_url":"https://github.com/vaseline555/superfed/blob/HEAD/src/algorithm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, vaseline555/superfed when it was checked","code_sha256":"a8ce655aa6965797","code_sha256_prefix":"a8ce655aa6965797","mcp_get_code":{"code_sha256":"a8ce655aa6965797"}},{"arxiv_id":"1511.06085","arxiv_id_is_arxiv":true,"paper":"/paper/variable-rate-image-compression-with","title":"Variable Rate Image Compression with Recurrent Neural Networks","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eyalfish/artoveq","path":"ResidualVQVAE.py","file_url":"https://github.com/eyalfish/artoveq/blob/HEAD/ResidualVQVAE.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, eyalfish/artoveq when it was checked","code_sha256":"8e31b020598d799c","code_sha256_prefix":"8e31b020598d799c","mcp_get_code":{"code_sha256":"8e31b020598d799c"}},{"arxiv_id":"aaai_16110","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16110","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IIT-ML/AAAI21-relational-cell-classification","path":"CRC/pytorch_func.py","file_url":"https://github.com/IIT-ML/AAAI21-relational-cell-classification/blob/HEAD/CRC/pytorch_func.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":"64431a056459e4fc","code_sha256_prefix":"64431a056459e4fc","mcp_get_code":{"code_sha256":"64431a056459e4fc"}}],"record_sha256":"47ec7facfcb810a696b0712a764eccb786948c5154609105bf186d0a474438ba","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}