{"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-loss-function","entry":"get_loss_function","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":11,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":3,"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":11,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":6,"unverified":2},"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":"2607.26887","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-26887","title":"Conformalized Rate-Adaptive Sensing","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"jiawei-yang05/Conformalized_Rate_Adaptive_Sensing","path":"src/loss.py","file_url":"https://github.com/jiawei-yang05/Conformalized_Rate_Adaptive_Sensing/blob/HEAD/src/loss.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":"09504493ce28502c","code_sha256_prefix":"09504493ce28502c","mcp_get_code":{"code_sha256":"09504493ce28502c"}},{"arxiv_id":"2509.26455","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-26455","title":"Stylos: Multi-View 3D Stylization with Single-Forward Gaussian Splatting","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"HanzhouLiu/Stylos","path":"ArtScore/models.py","file_url":"https://github.com/HanzhouLiu/Stylos/blob/HEAD/ArtScore/models.py","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ecce8ef2499e342","code_sha256_prefix":"3ecce8ef2499e342","mcp_get_code":{"code_sha256":"3ecce8ef2499e342"}},{"arxiv_id":"2411.10173","arxiv_id_is_arxiv":true,"paper":"/paper/semantics-and-spatiality-of-emergent","title":"Semantics and Spatiality of Emergent Communication","date":"2024-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Rotem-BZ/SemanticConsistency","path":"game_parts/loss.py","file_url":"https://github.com/Rotem-BZ/SemanticConsistency/blob/HEAD/game_parts/loss.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, Rotem-BZ/SemanticConsistency when it was checked","code_sha256":"81cb88f7fd4bc04a","code_sha256_prefix":"81cb88f7fd4bc04a","mcp_get_code":{"code_sha256":"81cb88f7fd4bc04a"}},{"arxiv_id":"2409.19899","arxiv_id_is_arxiv":true,"paper":"/paper/openkd-opening-prompt-diversity-for-zero-and","title":"OpenKD: Opening Prompt Diversity for Zero- and Few-shot Keypoint Detection","date":"2024-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlanLuSun/OpenKD","path":"core/loss_lw.py","file_url":"https://github.com/AlanLuSun/OpenKD/blob/HEAD/core/loss_lw.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AlanLuSun/OpenKD when it was checked","code_sha256":"5bbf1fcd58116e75","code_sha256_prefix":"5bbf1fcd58116e75","mcp_get_code":{"code_sha256":"5bbf1fcd58116e75"}},{"arxiv_id":"2308.05037","arxiv_id_is_arxiv":true,"paper":"/paper/separate-anything-you-describe","title":"Separate Anything You Describe","date":"2023-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"audio-agi/audiosep","path":"losses.py","file_url":"https://github.com/audio-agi/audiosep/blob/HEAD/losses.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":"619a481adfa3ce11","code_sha256_prefix":"619a481adfa3ce11","mcp_get_code":{"code_sha256":"619a481adfa3ce11"}},{"arxiv_id":"2110.10232","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-adaptation-through-perturbation","title":"Test time Adaptation through Perturbation Robustness","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prabhuteja12/pest","path":"utils/loss.py","file_url":"https://github.com/prabhuteja12/pest/blob/HEAD/utils/loss.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":"855f88e3868b6d5d","code_sha256_prefix":"855f88e3868b6d5d","mcp_get_code":{"code_sha256":"855f88e3868b6d5d"}},{"arxiv_id":"2106.11959","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-deep-learning-models-for-tabular","title":"Revisiting Deep Learning Models for Tabular Data","date":"2021-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XavierSpycy/tabtransformers","path":"tabtransformers/config.py","file_url":"https://github.com/XavierSpycy/tabtransformers/blob/HEAD/tabtransformers/config.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":"516fa25431b82747","code_sha256_prefix":"516fa25431b82747","mcp_get_code":{"code_sha256":"516fa25431b82747"}},{"arxiv_id":"2006.06574","arxiv_id_is_arxiv":true,"paper":"/paper/dynamically-stable-infinite-width-limits-of","title":"Dynamically Stable Infinite-Width Limits of Neural Classifiers","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmipt/research","path":"Infinite_Width_Limits_of_Neural_Classifiers/utils/perform_epoch.py","file_url":"https://github.com/deepmipt/research/blob/HEAD/Infinite_Width_Limits_of_Neural_Classifiers/utils/perform_epoch.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":"8bdd1d87adf242ec","code_sha256_prefix":"8bdd1d87adf242ec","mcp_get_code":{"code_sha256":"8bdd1d87adf242ec"}},{"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/losses.py","file_url":"https://github.com/tlatkowski/multihead-siamese-nets/blob/HEAD/layers/losses.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":"3224e808f865784b","code_sha256_prefix":"3224e808f865784b","mcp_get_code":{"code_sha256":"3224e808f865784b"}},{"arxiv_id":"1902.04335","arxiv_id_is_arxiv":true,"paper":"/paper/hyperbolic-disk-embeddings-for-directed","title":"Hyperbolic Disk Embeddings for Directed Acyclic Graphs","date":"2019-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lapras-inc/disk-embedding","path":"models/loss_function.py","file_url":"https://github.com/lapras-inc/disk-embedding/blob/HEAD/models/loss_function.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":"c8a39f8e99092d49","code_sha256_prefix":"c8a39f8e99092d49","mcp_get_code":{"code_sha256":"c8a39f8e99092d49"}},{"arxiv_id":"1901.10802","arxiv_id_is_arxiv":true,"paper":"/paper/automated-skin-lesion-classification-using","title":"Automated Skin Lesion Classification Using Ensemble of Deep Neural Networks in ISIC 2018: Skin Lesion Analysis Towards Melanoma Detection Challenge","date":"2019-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miltonbd/ISIC_2018_classification","path":"main_0.py","file_url":"https://github.com/miltonbd/ISIC_2018_classification/blob/HEAD/main_0.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, miltonbd/ISIC_2018_classification when it was checked","code_sha256":"d63ff4dda6e9d31a","code_sha256_prefix":"d63ff4dda6e9d31a","mcp_get_code":{"code_sha256":"d63ff4dda6e9d31a"}}],"record_sha256":"a12905c9d7235b05327cafde82aee709f88bfefb714ef24de02b4552723db66d","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}