{"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-losses","entry":"get_losses","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":2,"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":0,"ran_fixture":0,"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":"2601.02031","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-02031","title":"Output Embedding Centering for Stable LLM Pretraining","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"flxst/output-embedding-centering","path":"nanoGPT/analysis/script_analyze.py","file_url":"https://github.com/flxst/output-embedding-centering/blob/HEAD/nanoGPT/analysis/script_analyze.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, flxst/output-embedding-centering when it was checked","code_sha256":"865e92f2beff05ab","code_sha256_prefix":"865e92f2beff05ab","mcp_get_code":{"code_sha256":"865e92f2beff05ab"}},{"arxiv_id":"2502.14616","arxiv_id_is_arxiv":true,"paper":"/paper/monocular-depth-estimation-and-segmentation","title":"Monocular Depth Estimation and Segmentation for Transparent Object with Iterative Semantic and Geometric Fusion","date":"2025-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"l-j-yuan/modest","path":"utils/builder.py","file_url":"https://github.com/l-j-yuan/modest/blob/HEAD/utils/builder.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":"0e8b2c2d2d81f5d1","code_sha256_prefix":"0e8b2c2d2d81f5d1","mcp_get_code":{"code_sha256":"0e8b2c2d2d81f5d1"}},{"arxiv_id":"2502.07707","arxiv_id_is_arxiv":true,"paper":"/paper/prvql-progressive-knowledge-guided-refinement","title":"PRVQL: Progressive Knowledge-guided Refinement for Robust Egocentric Visual Query Localization","date":"2025-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fb-reps/PRVQL","path":"utils/loss_utils.py","file_url":"https://github.com/fb-reps/PRVQL/blob/HEAD/utils/loss_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":"0e96da7c96574812","code_sha256_prefix":"0e96da7c96574812","mcp_get_code":{"code_sha256":"0e96da7c96574812"}},{"arxiv_id":"2310.01410","arxiv_id_is_arxiv":true,"paper":"/paper/leap-liberate-sparse-view-3d-modeling-from","title":"LEAP: Liberate Sparse-view 3D Modeling from Camera Poses","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwjiang1510/LEAP","path":"utils/loss_utils.py","file_url":"https://github.com/hwjiang1510/LEAP/blob/HEAD/utils/loss_utils.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, hwjiang1510/LEAP when it was checked","code_sha256":"845b7d8381933881","code_sha256_prefix":"845b7d8381933881","mcp_get_code":{"code_sha256":"845b7d8381933881"}},{"arxiv_id":"2309.14356","arxiv_id_is_arxiv":true,"paper":"/paper/coco-counterfactuals-automatically","title":"COCO-Counterfactuals: Automatically Constructed Counterfactual Examples for Image-Text Pairs","date":"2023-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/sentence-transformers","path":"sentence_transformers/base/model_card.py","file_url":"https://github.com/UKPLab/sentence-transformers/blob/HEAD/sentence_transformers/base/model_card.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":"2a68339364737323","code_sha256_prefix":"2a68339364737323","mcp_get_code":{"code_sha256":"2a68339364737323"}},{"arxiv_id":"2212.13824","arxiv_id_is_arxiv":true,"paper":"/paper/multi-realism-image-compression-with-a","title":"Multi-Realism Image Compression with a Conditional Generator","date":"2022-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nikolai10/MRIC","path":"src/compare_gan_tf2/loss_lib.py","file_url":"https://github.com/Nikolai10/MRIC/blob/HEAD/src/compare_gan_tf2/loss_lib.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":"9f7088e8fcc1f1d5","code_sha256_prefix":"9f7088e8fcc1f1d5","mcp_get_code":{"code_sha256":"9f7088e8fcc1f1d5"}},{"arxiv_id":"2212.01130","arxiv_id_is_arxiv":true,"paper":"/paper/improving-pareto-front-learning-via-multi","title":"Improving Pareto Front Learning via Multi-Sample Hypernetworks","date":"2022-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longhoangphi225/MultiSample-Hypernetworks","path":"Jura/trainer.py","file_url":"https://github.com/longhoangphi225/MultiSample-Hypernetworks/blob/HEAD/Jura/trainer.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":"f745c0a67e824256","code_sha256_prefix":"f745c0a67e824256","mcp_get_code":{"code_sha256":"f745c0a67e824256"}},{"arxiv_id":"1810.04650","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-learning-as-multi-objective","title":"Multi-Task Learning as Multi-Objective Optimization","date":"2018-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hav4ik/Hydra","path":"src/utils/losses.py","file_url":"https://github.com/hav4ik/Hydra/blob/HEAD/src/utils/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":"c500c5785882a8e8","code_sha256_prefix":"c500c5785882a8e8","mcp_get_code":{"code_sha256":"c500c5785882a8e8"}}],"record_sha256":"7e1a9ef285866f953b30f82b0cb35ac4b945268cb3c82cadea4aba2935465f0b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}