{"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/reg-loss","entry":"reg_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":5,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":2,"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":0,"ran_fixture":0,"ran":5,"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":"2402.13973","arxiv_id_is_arxiv":true,"paper":"/paper/linear-time-graph-neural-networks-for","title":"Linear-Time Graph Neural Networks for Scalable Recommendations","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qwq2000/thewebconf24-ltgnn-pytorch","path":"code/utils/loss.py","file_url":"https://github.com/qwq2000/thewebconf24-ltgnn-pytorch/blob/HEAD/code/utils/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"13f5ea11381b753f","code_sha256_prefix":"13f5ea11381b753f","mcp_get_code":{"code_sha256":"13f5ea11381b753f"}},{"arxiv_id":"2401.11004","arxiv_id_is_arxiv":true,"paper":"/paper/predictive-power-of-a-bayesian-effective","title":"Predictive power of a Bayesian effective action for fully-connected one hidden layer neural networks in the proportional limit","date":null,"month_inferred_from_arxiv_id":"2024-01","title_source":"archive","repo":"paolo-baglioni/bayesian_fcn_prop","path":"functions.py","file_url":"https://github.com/paolo-baglioni/bayesian_fcn_prop/blob/HEAD/functions.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, paolo-baglioni/bayesian_fcn_prop when it was checked","code_sha256":"be550a764140cb3e","code_sha256_prefix":"be550a764140cb3e","mcp_get_code":{"code_sha256":"be550a764140cb3e"}},{"arxiv_id":"2305.15873","arxiv_id_is_arxiv":true,"paper":"/paper/confronting-ambiguity-in-6d-object-pose","title":"Confronting Ambiguity in 6D Object Pose Estimation via Score-Based Diffusion on SE(3)","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ending2015a/liepose-diffusion","path":"src/liepose/utils/jnpfn.py","file_url":"https://github.com/Ending2015a/liepose-diffusion/blob/HEAD/src/liepose/utils/jnpfn.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":"2e59e3f44b689980","code_sha256_prefix":"2e59e3f44b689980","mcp_get_code":{"code_sha256":"2e59e3f44b689980"}},{"arxiv_id":"2210.11034","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-out-of-distribution-detection-in","title":"Enhancing Out-of-Distribution Detection in Natural Language Understanding via Implicit Layer Ensemble","date":"2022-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyunsoocho77/lacl-official","path":"loss.py","file_url":"https://github.com/hyunsoocho77/lacl-official/blob/HEAD/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":"bdbebc60e2bde280","code_sha256_prefix":"bdbebc60e2bde280","mcp_get_code":{"code_sha256":"bdbebc60e2bde280"}},{"arxiv_id":"2208.02541","arxiv_id_is_arxiv":true,"paper":"/paper/mvsformer-learning-robust-image","title":"MVSFormer: Multi-View Stereo by Learning Robust Image Features and Temperature-based Depth","date":"2022-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ewrfcas/mvsformer","path":"models/losses.py","file_url":"https://github.com/ewrfcas/mvsformer/blob/HEAD/models/losses.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":"d9f8f54e0803bc1d","code_sha256_prefix":"d9f8f54e0803bc1d","mcp_get_code":{"code_sha256":"d9f8f54e0803bc1d"}},{"arxiv_id":"1904.09406","arxiv_id_is_arxiv":true,"paper":"/paper/190409406","title":"DeepMoD: Deep learning for Model Discovery in noisy data","date":"2019-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PhIMaL/DeePyMoD_torch","path":"src/deepymod_torch/losses.py","file_url":"https://github.com/PhIMaL/DeePyMoD_torch/blob/HEAD/src/deepymod_torch/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":"692997db787ace60","code_sha256_prefix":"692997db787ace60","mcp_get_code":{"code_sha256":"692997db787ace60"}},{"arxiv_id":"ijcai2022_0301","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2022_0301","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ljaiverson/pFL-APPLE","path":"utils/losses.py","file_url":"https://github.com/ljaiverson/pFL-APPLE/blob/HEAD/utils/losses.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":"59484e3311554a3c","code_sha256_prefix":"59484e3311554a3c","mcp_get_code":{"code_sha256":"59484e3311554a3c"}}],"record_sha256":"e32e27f558e3ca597ca9bc782bf405b2eb26d4037ffc89df498d095db211bf87","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}