{"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/custom-loss","entry":"custom_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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":7,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":3},"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":"2410.17389","arxiv_id_is_arxiv":true,"paper":"/paper/navigating-noisy-feedback-enhancing","title":"Navigating Noisy Feedback: Enhancing Reinforcement Learning with Error-Prone Language Models","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sy-shi/RLAIF_ScoreDiff","path":"train_rm.py","file_url":"https://github.com/sy-shi/RLAIF_ScoreDiff/blob/HEAD/train_rm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, sy-shi/RLAIF_ScoreDiff when it was checked","code_sha256":"fc93bc090f3a63c7","code_sha256_prefix":"fc93bc090f3a63c7","mcp_get_code":{"code_sha256":"fc93bc090f3a63c7"}},{"arxiv_id":"2310.10651","arxiv_id_is_arxiv":true,"paper":"/paper/hairclipv2-unifying-hair-editing-via-proxy-1","title":"HairCLIPv2: Unifying Hair Editing via Proxy Feature Blending","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wty-ustc/HairCLIPv2","path":"criteria/style/custom_loss.py","file_url":"https://github.com/wty-ustc/HairCLIPv2/blob/HEAD/criteria/style/custom_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, wty-ustc/HairCLIPv2 when it was checked","code_sha256":"2c2f1331898f4592","code_sha256_prefix":"2c2f1331898f4592","mcp_get_code":{"code_sha256":"2c2f1331898f4592"}},{"arxiv_id":"1910.00617","arxiv_id_is_arxiv":true,"paper":"/paper/predicting-materials-properties-without","title":"Predicting materials properties without crystal structure: Deep representation learning from stoichiometry","date":"2019-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-a-malik/inorg-synth-graph","path":"train_reaction_graph.py","file_url":"https://github.com/s-a-malik/inorg-synth-graph/blob/HEAD/train_reaction_graph.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":"c0173ef184ffa2fe","code_sha256_prefix":"c0173ef184ffa2fe","mcp_get_code":{"code_sha256":"c0173ef184ffa2fe"}},{"arxiv_id":"1910.00617","arxiv_id_is_arxiv":true,"paper":"/paper/predicting-materials-properties-without","title":"Predicting materials properties without crystal structure: Deep representation learning from stoichiometry","date":"2019-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-a-malik/inorg-synth-graph","path":"train_baseline.py","file_url":"https://github.com/s-a-malik/inorg-synth-graph/blob/HEAD/train_baseline.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":"942b56efbb23ab14","code_sha256_prefix":"942b56efbb23ab14","mcp_get_code":{"code_sha256":"942b56efbb23ab14"}},{"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":"makatx/YOLO_ResNet","path":"model_continue_train.py","file_url":"https://github.com/makatx/YOLO_ResNet/blob/HEAD/model_continue_train.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, makatx/YOLO_ResNet when it was checked","code_sha256":"da6cbf7c20be2c2f","code_sha256_prefix":"da6cbf7c20be2c2f","mcp_get_code":{"code_sha256":"da6cbf7c20be2c2f"}},{"arxiv_id":"1504.06993","arxiv_id_is_arxiv":true,"paper":"/paper/compression-artifacts-reduction-by-a-deep","title":"Compression Artifacts Reduction by a Deep Convolutional Network","date":"2015-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinayak19th/ARCNN-keras","path":"fine_tune.py","file_url":"https://github.com/vinayak19th/ARCNN-keras/blob/HEAD/fine_tune.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":"211ee3f7bb5d1a67","code_sha256_prefix":"211ee3f7bb5d1a67","mcp_get_code":{"code_sha256":"211ee3f7bb5d1a67"}},{"arxiv_id":"aaai_26664","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26664","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ai-spatial/PG-AN","path":"PG-AN.py","file_url":"https://github.com/ai-spatial/PG-AN/blob/HEAD/PG-AN.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":"97bace614ef16118","code_sha256_prefix":"97bace614ef16118","mcp_get_code":{"code_sha256":"97bace614ef16118"}}],"record_sha256":"e5fc08c7a356f75dfa969ea64d96132d5eee214bdc026431ecdf2c8084a8d810","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}