{"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/register-loss","entry":"register_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":7,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":1,"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":1,"ran_fixture":0,"ran":4,"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":"2605.28420","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-28420","title":"Conveyance: A Versatile Framework for Learning in Structured Class Spaces","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ZKI-PH-ImageAnalysis/Conveyance","path":"MIL/src/conveyance/registry.py","file_url":"https://github.com/ZKI-PH-ImageAnalysis/Conveyance/blob/HEAD/MIL/src/conveyance/registry.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":"315169c9a68af6f1","code_sha256_prefix":"315169c9a68af6f1","mcp_get_code":{"code_sha256":"315169c9a68af6f1"}},{"arxiv_id":"2602.16590","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-16590","title":"A Contrastive Learning Framework Empowered by Attention-based Feature Adaptation for Street-View Image Classification","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"SpaceTimeLab/CLIP-MHAdapter","path":"utils/loss.py","file_url":"https://github.com/SpaceTimeLab/CLIP-MHAdapter/blob/HEAD/utils/loss.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, SpaceTimeLab/CLIP-MHAdapter when it was checked","code_sha256":"eb92283c77539ef1","code_sha256_prefix":"eb92283c77539ef1","mcp_get_code":{"code_sha256":"eb92283c77539ef1"}},{"arxiv_id":"2505.08622","arxiv_id_is_arxiv":true,"paper":"/paper/visually-guided-decoding-gradient-free-hard","title":"Visually Guided Decoding: Gradient-Free Hard Prompt Inversion with Language Models","date":"2025-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DonghoonKim-1938/VGD","path":"bluestar/losses/base_loss.py","file_url":"https://github.com/DonghoonKim-1938/VGD/blob/HEAD/bluestar/losses/base_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":"f8acb38fe3548525","code_sha256_prefix":"f8acb38fe3548525","mcp_get_code":{"code_sha256":"f8acb38fe3548525"}},{"arxiv_id":"2302.03791","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-trust-your-diffusion-model-a-convex","title":"How to Trust Your Diffusion Model: A Convex Optimization Approach to Conformal Risk Control","date":"2023-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sulam-group/k-rcps","path":"krcps/losses.py","file_url":"https://github.com/sulam-group/k-rcps/blob/HEAD/krcps/losses.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":"513062d1c2db19df","code_sha256_prefix":"513062d1c2db19df","mcp_get_code":{"code_sha256":"513062d1c2db19df"}},{"arxiv_id":"2209.06681","arxiv_id_is_arxiv":true,"paper":"/paper/a-benchmark-and-a-baseline-for-robust-multi","title":"A Benchmark and a Baseline for Robust Multi-view Depth Estimation","date":"2022-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmb-freiburg/robustmvd","path":"rmvd/loss/registry.py","file_url":"https://github.com/lmb-freiburg/robustmvd/blob/HEAD/rmvd/loss/registry.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":"63b07cfaf639b4f9","code_sha256_prefix":"63b07cfaf639b4f9","mcp_get_code":{"code_sha256":"63b07cfaf639b4f9"}},{"arxiv_id":"2105.08683","arxiv_id_is_arxiv":true,"paper":"/paper/learning-embeddings-from-knowledge-graphs","title":"Learning Embeddings from Knowledge Graphs With Numeric Edge Attributes","date":"2021-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Accenture/AmpliGraph","path":"ampligraph/latent_features/loss_functions.py","file_url":"https://github.com/Accenture/AmpliGraph/blob/HEAD/ampligraph/latent_features/loss_functions.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":"74d4214ef4c6a401","code_sha256_prefix":"74d4214ef4c6a401","mcp_get_code":{"code_sha256":"74d4214ef4c6a401"}},{"arxiv_id":"Nguyen_BoxeR_Box-Attention_for_2D_and_3D_Transformers_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Nguyen_BoxeR_Box-Attention_for_2D_and_3D_Transformers_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"kienduynguyen/BoxeR","path":"e2edet/criterion/losses.py","file_url":"https://github.com/kienduynguyen/BoxeR/blob/HEAD/e2edet/criterion/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":"2fb1e63cf1174d14","code_sha256_prefix":"2fb1e63cf1174d14","mcp_get_code":{"code_sha256":"2fb1e63cf1174d14"}}],"record_sha256":"59e34f985bb33b754b063483e4860ab591bd2774f097f0e1a1c6fec3d1898735","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}