{"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/calculate-loss","entry":"calculate_loss","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":20,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":7,"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":18,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":7,"n_samples_unverified":5,"n_samples_fingerprinted":5,"n_places":20,"n_places_pointer_only":8,"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":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":4,"ran":5,"unverified":5},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2606.19679","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-19679","title":"LOKI: Memory-Free Null-Space Constrained Lifelong Knowledge Editing","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"neu-spiral/LOKI","path":"easyeditor/models/loki/loki_main.py","file_url":"https://github.com/neu-spiral/LOKI/blob/HEAD/easyeditor/models/loki/loki_main.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":"6fdbca79d4d9c9f3","code_sha256_prefix":"6fdbca79d4d9c9f3","mcp_get_code":{"code_sha256":"6fdbca79d4d9c9f3"}},{"arxiv_id":"2602.02710","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02710","title":"Maximum Likelihood Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"tajwarfahim/maxrl","path":"verl/cifar10_experiments/sampling_based_rl_objective_experiments.py","file_url":"https://github.com/tajwarfahim/maxrl/blob/HEAD/verl/cifar10_experiments/sampling_based_rl_objective_experiments.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":"5e12cb99e95a5971","code_sha256_prefix":"5e12cb99e95a5971","mcp_get_code":{"code_sha256":"5e12cb99e95a5971"}},{"arxiv_id":"2510.07768","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-07768","title":"ToolLibGen: Scalable Automatic Tool Creation and Aggregation for LLM Reasoning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"SalesforceAIResearch/ToolLibGen","path":"backup/old_src/KTCE_baseline_implement.py","file_url":"https://github.com/SalesforceAIResearch/ToolLibGen/blob/HEAD/backup/old_src/KTCE_baseline_implement.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":"9821b52e07e3a011","code_sha256_prefix":"9821b52e07e3a011","mcp_get_code":{"code_sha256":"9821b52e07e3a011"}},{"arxiv_id":"2503.11429","arxiv_id_is_arxiv":true,"paper":"/paper/combining-causal-models-for-more-accurate","title":"Combining Causal Models for More Accurate Abstractions of Neural Networks","date":"2025-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marapislar/combining-causal-models-for-accurate-nn-abstractions","path":"src/run_das.py","file_url":"https://github.com/marapislar/combining-causal-models-for-accurate-nn-abstractions/blob/HEAD/src/run_das.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, marapislar/combining-causal-models-for-accurate-nn-abstractions when it was checked","code_sha256":"2b4933b9490061e4","code_sha256_prefix":"2b4933b9490061e4","mcp_get_code":{"code_sha256":"2b4933b9490061e4"}},{"arxiv_id":"2410.00271","arxiv_id_is_arxiv":true,"paper":"/paper/galaxiesml-a-dataset-of-galaxy-images","title":"GalaxiesML: a dataset of galaxy images, photometry, redshifts, and structural parameters for machine learning","date":"2024-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astrodatalab/galaxiesml_examples","path":"redshift_estimation/evaluate_nn.py","file_url":"https://github.com/astrodatalab/galaxiesml_examples/blob/HEAD/redshift_estimation/evaluate_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, astrodatalab/galaxiesml_examples when it was checked","code_sha256":"f1f56459c1c85591","code_sha256_prefix":"f1f56459c1c85591","mcp_get_code":{"code_sha256":"f1f56459c1c85591"}},{"arxiv_id":"2311.03714","arxiv_id_is_arxiv":true,"paper":"/paper/loss-balancing-for-fair-supervised-learning","title":"Loss Balancing for Fair Supervised Learning","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KhaliliMahdi/Loss_Balancing_ICML2023","path":"Algorithms/Algorithms.py","file_url":"https://github.com/KhaliliMahdi/Loss_Balancing_ICML2023/blob/HEAD/Algorithms/Algorithms.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, KhaliliMahdi/Loss_Balancing_ICML2023 when it was checked","code_sha256":"07b6f6c5a73177da","code_sha256_prefix":"07b6f6c5a73177da","mcp_get_code":{"code_sha256":"07b6f6c5a73177da"}},{"arxiv_id":"2304.00216","arxiv_id_is_arxiv":true,"paper":"/paper/cross-scale-multi-instance-learning-for","title":"Cross-scale Multi-instance Learning for Pathological Image Diagnosis","date":"2023-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hrlblab/cs-mil","path":"Train_Test_Code/MIL_global_Stage1_Training.py","file_url":"https://github.com/hrlblab/cs-mil/blob/HEAD/Train_Test_Code/MIL_global_Stage1_Training.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":"f1bac31030f44888","code_sha256_prefix":"f1bac31030f44888","mcp_get_code":{"code_sha256":"f1bac31030f44888"}},{"arxiv_id":"2301.13569","arxiv_id_is_arxiv":true,"paper":"/paper/np-match-towards-a-new-probabilistic-model","title":"NP-Match: Towards a New Probabilistic Model for Semi-Supervised Learning","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianf-wang/np-match","path":"models/npmatch/npmatch.py","file_url":"https://github.com/jianf-wang/np-match/blob/HEAD/models/npmatch/npmatch.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, jianf-wang/np-match when it was checked","code_sha256":"315d6e47f4ec920e","code_sha256_prefix":"315d6e47f4ec920e","mcp_get_code":{"code_sha256":"315d6e47f4ec920e"}},{"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":"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":"52537942ad763c95","code_sha256_prefix":"52537942ad763c95","mcp_get_code":{"code_sha256":"52537942ad763c95"}},{"arxiv_id":"2205.01841","arxiv_id_is_arxiv":true,"paper":"/paper/great-truths-are-always-simple-a-rather-1","title":"Great Truths are Always Simple: A Rather Simple Knowledge Encoder for Enhancing the Commonsense Reasoning Capacity of Pre-Trained Models","date":"2022-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/safe","path":"qagnn.py","file_url":"https://github.com/rucaibox/safe/blob/HEAD/qagnn.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":"8d4cd6c11b3d961f","code_sha256_prefix":"8d4cd6c11b3d961f","mcp_get_code":{"code_sha256":"8d4cd6c11b3d961f"}},{"arxiv_id":"2203.15556","arxiv_id_is_arxiv":true,"paper":"/paper/training-compute-optimal-large-language","title":"Training Compute-Optimal Large Language Models","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nkluge-correa/teenytinyllama","path":"Utilities/chinchilla-estimation.py","file_url":"https://github.com/nkluge-correa/teenytinyllama/blob/HEAD/Utilities/chinchilla-estimation.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9293e052d06482a7","code_sha256_prefix":"9293e052d06482a7","mcp_get_code":{"code_sha256":"9293e052d06482a7"}},{"arxiv_id":"2201.09724","arxiv_id_is_arxiv":true,"paper":"/paper/hot-refresh-model-upgrades-with-regression-1","title":"Hot-Refresh Model Upgrades with Regression-Alleviating Compatible Training in Image Retrieval","date":"2022-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"binjiezhang/RACT_ICLR2022","path":"model/loss.py","file_url":"https://github.com/binjiezhang/RACT_ICLR2022/blob/HEAD/model/loss.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, binjiezhang/RACT_ICLR2022 (NOASSERTION)","code_sha256":"5374b1e2fb86a416","code_sha256_prefix":"5374b1e2fb86a416","mcp_get_code":{"code_sha256":"5374b1e2fb86a416"}},{"arxiv_id":"2008.11459","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-graph-based-place-recognition-for-3d","title":"Semantic Graph Based Place Recognition for 3D Point Clouds","date":"2020-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kxhit/SG_PR","path":"utils.py","file_url":"https://github.com/kxhit/SG_PR/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":"9105fffe8484ccc6","code_sha256_prefix":"9105fffe8484ccc6","mcp_get_code":{"code_sha256":"9105fffe8484ccc6"}},{"arxiv_id":"1905.11946","arxiv_id_is_arxiv":true,"paper":"/paper/efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alililia/ms_extend","path":"ascend_ProtoNet/loss_for_infer.py","file_url":"https://github.com/alililia/ms_extend/blob/HEAD/ascend_ProtoNet/loss_for_infer.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":"d5c96845cfdedd0d","code_sha256_prefix":"d5c96845cfdedd0d","mcp_get_code":{"code_sha256":"d5c96845cfdedd0d"}},{"arxiv_id":"1803.07055","arxiv_id_is_arxiv":true,"paper":"/paper/simple-random-search-provides-a-competitive","title":"Simple random search provides a competitive approach to reinforcement learning","date":"2018-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kayuksel/pytorch-ars","path":"ars_dataparallel.py","file_url":"https://github.com/kayuksel/pytorch-ars/blob/HEAD/ars_dataparallel.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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, kayuksel/pytorch-ars, is not in the permissive set Syntology serves inline","code_sha256":"f34d83ec198f0b0c","code_sha256_prefix":"f34d83ec198f0b0c","mcp_get_code":{"code_sha256":"f34d83ec198f0b0c"}},{"arxiv_id":"1802.06516","arxiv_id_is_arxiv":true,"paper":"/paper/subspace-network-deep-multi-task-censored","title":"Subspace Network: Deep Multi-Task Censored Regression for Modeling Neurodegenerative Diseases","date":"2018-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"illidanlab/subspace-net","path":"code/Exp1/Algorithm1.py","file_url":"https://github.com/illidanlab/subspace-net/blob/HEAD/code/Exp1/Algorithm1.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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, illidanlab/subspace-net, is not in the permissive set Syntology serves inline","code_sha256":"ece079e3119e1a71","code_sha256_prefix":"ece079e3119e1a71","mcp_get_code":{"code_sha256":"ece079e3119e1a71"}},{"arxiv_id":"1512.03385","arxiv_id_is_arxiv":true,"paper":"/paper/deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alililia/ascend_SE-Net","path":"ascend_ProtoNet/loss_for_infer.py","file_url":"https://github.com/alililia/ascend_SE-Net/blob/HEAD/ascend_ProtoNet/loss_for_infer.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":"d5c96845cfdedd0d","code_sha256_prefix":"d5c96845cfdedd0d","mcp_get_code":{"code_sha256":"d5c96845cfdedd0d"}},{"arxiv_id":"1506.02640","arxiv_id_is_arxiv":true,"paper":"/paper/you-only-look-once-unified-real-time-object","title":"You Only Look Once: Unified, Real-Time Object Detection","date":"2015-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kiranrgupta26/ObjectDetection","path":"WheatHeadDetection.py","file_url":"https://github.com/kiranrgupta26/ObjectDetection/blob/HEAD/WheatHeadDetection.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, kiranrgupta26/ObjectDetection when it was checked","code_sha256":"10cfbec4f3be1ace","code_sha256_prefix":"10cfbec4f3be1ace","mcp_get_code":{"code_sha256":"10cfbec4f3be1ace"}},{"arxiv_id":"Yu_PCLs_Geometry-Aware_Neural_Reconstruction_of_3D_Pose_With_Perspective_Crop_CVPR_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Yu_PCLs_Geometry-Aware_Neural_Reconstruction_of_3D_Pose_With_Perspective_Crop_CVPR_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yu-frank/PerspectiveCropLayers","path":"src/runner_utils.py","file_url":"https://github.com/yu-frank/PerspectiveCropLayers/blob/HEAD/src/runner_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":"2285d41575825e61","code_sha256_prefix":"2285d41575825e61","mcp_get_code":{"code_sha256":"2285d41575825e61"}},{"arxiv_id":"2022.findings-naacl.131","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-naacl.131","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RUCAIBox/SAFE","path":"qagnn.py","file_url":"https://github.com/RUCAIBox/SAFE/blob/HEAD/qagnn.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":"8d4cd6c11b3d961f","code_sha256_prefix":"8d4cd6c11b3d961f","mcp_get_code":{"code_sha256":"8d4cd6c11b3d961f"}}],"record_sha256":"d2ebd69ab378888751ad7f582842cbd594a1634e693792f6782989d19c9faac8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}