{"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/compute-num-params","entry":"compute_num_params","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":4,"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":5,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"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":"2506.22624","arxiv_id_is_arxiv":true,"paper":"/paper/seg-r1-segmentation-can-be-surprisingly","title":"Seg-R1: Segmentation Can Be Surprisingly Simple with Reinforcement Learning","date":"2025-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"geshang777/FOCUS","path":"focus/evaluation/utils.py","file_url":"https://github.com/geshang777/FOCUS/blob/HEAD/focus/evaluation/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8b40bb3f5347ccd5","code_sha256_prefix":"8b40bb3f5347ccd5","mcp_get_code":{"code_sha256":"8b40bb3f5347ccd5"}},{"arxiv_id":"2408.07507","arxiv_id_is_arxiv":true,"paper":"/paper/decoder-ensembling-for-learned-latent","title":"Decoder ensembling for learned latent geometries","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mustass/ensertainty","path":"src/ensertainty/utils/utils.py","file_url":"https://github.com/mustass/ensertainty/blob/HEAD/src/ensertainty/utils/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, mustass/ensertainty (NOASSERTION)","code_sha256":"e142eddcee629226","code_sha256_prefix":"e142eddcee629226","mcp_get_code":{"code_sha256":"e142eddcee629226"}},{"arxiv_id":"2407.21448","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-image-super-resolution-networks","title":"Accelerating Image Super-Resolution Networks with Pixel-Level Classification","date":"2024-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"3587jjh/PCSR","path":"flops.py","file_url":"https://github.com/3587jjh/PCSR/blob/HEAD/flops.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, 3587jjh/PCSR when it was checked","code_sha256":"70dc72d693e731b8","code_sha256_prefix":"70dc72d693e731b8","mcp_get_code":{"code_sha256":"70dc72d693e731b8"}},{"arxiv_id":"2312.07374","arxiv_id_is_arxiv":true,"paper":"/paper/relax-image-specific-prompt-requirement-in","title":"Relax Image-Specific Prompt Requirement in SAM: A Single Generic Prompt for Segmenting Camouflaged Objects","date":"2023-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jyLin8100/GenSAM","path":"utils.py","file_url":"https://github.com/jyLin8100/GenSAM/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8b40bb3f5347ccd5","code_sha256_prefix":"8b40bb3f5347ccd5","mcp_get_code":{"code_sha256":"8b40bb3f5347ccd5"}},{"arxiv_id":"2305.13084","arxiv_id_is_arxiv":true,"paper":"/paper/a-fractional-graph-laplacian-approach-to-1","title":"A Fractional Graph Laplacian Approach to Oversmoothing","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rpaolino/flode","path":"lib/models.py","file_url":"https://github.com/rpaolino/flode/blob/HEAD/lib/models.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, rpaolino/flode when it was checked","code_sha256":"1472d7291749b734","code_sha256_prefix":"1472d7291749b734","mcp_get_code":{"code_sha256":"1472d7291749b734"}},{"arxiv_id":"2111.08918","arxiv_id_is_arxiv":true,"paper":"/paper/local-texture-estimator-for-implicit","title":"Local Texture Estimator for Implicit Representation Function","date":"2021-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaewon-lee-b/lte","path":"utils.py","file_url":"https://github.com/jaewon-lee-b/lte/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8b40bb3f5347ccd5","code_sha256_prefix":"8b40bb3f5347ccd5","mcp_get_code":{"code_sha256":"8b40bb3f5347ccd5"}},{"arxiv_id":"2110.12425","arxiv_id_is_arxiv":true,"paper":"/paper/kernelized-heterogeneous-risk-minimization","title":"Kernelized Heterogeneous Risk Minimization","date":"2021-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljsthu/kernelized-hrm","path":"KernelHRM_sim1.py","file_url":"https://github.com/ljsthu/kernelized-hrm/blob/HEAD/KernelHRM_sim1.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ljsthu/kernelized-hrm when it was checked","code_sha256":"19807066944b363c","code_sha256_prefix":"19807066944b363c","mcp_get_code":{"code_sha256":"19807066944b363c"}},{"arxiv_id":"Pak_B-Spline_Texture_Coefficients_Estimator_for_Screen_Content_Image_Super-Resolution_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Pak_B-Spline_Texture_Coefficients_Estimator_for_Screen_Content_Image_Super-Resolution_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ByeongHyunPak/btc","path":"utils.py","file_url":"https://github.com/ByeongHyunPak/btc/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8b40bb3f5347ccd5","code_sha256_prefix":"8b40bb3f5347ccd5","mcp_get_code":{"code_sha256":"8b40bb3f5347ccd5"}},{"arxiv_id":"Han_ABCD_Arbitrary_Bitwise_Coefficient_for_De-Quantization_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Han_ABCD_Arbitrary_Bitwise_Coefficient_for_De-Quantization_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"WooKyoungHan/ABCD","path":"utils.py","file_url":"https://github.com/WooKyoungHan/ABCD/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8b40bb3f5347ccd5","code_sha256_prefix":"8b40bb3f5347ccd5","mcp_get_code":{"code_sha256":"8b40bb3f5347ccd5"}}],"record_sha256":"692b20d2ed9399a4fffbcc6c8d09c936688f0ffa4f89ebec9dfbeb774b193edd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}