{"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/sqrt","entry":"sqrt","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":7,"n_papers_ran_no_instrument_failure":6,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":8,"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":6,"unverified":1},"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":"2304.04555","arxiv_id_is_arxiv":true,"paper":"/paper/neural-diffeomorphic-non-uniform-b-spline","title":"Neural Diffeomorphic Non-uniform B-spline Flows","date":"2023-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smhongok/Non-uniform-B-spline-Flow","path":"bgflow/bgflow/nn/flow/transformer/bspline.py","file_url":"https://github.com/smhongok/Non-uniform-B-spline-Flow/blob/HEAD/bgflow/bgflow/nn/flow/transformer/bspline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, smhongok/Non-uniform-B-spline-Flow when it was checked","code_sha256":"0b58d01a29ee581a","code_sha256_prefix":"0b58d01a29ee581a","mcp_get_code":{"code_sha256":"0b58d01a29ee581a"}},{"arxiv_id":"2207.09453","arxiv_id_is_arxiv":true,"paper":"/paper/e3nn-euclidean-neural-networks","title":"e3nn: Euclidean Neural Networks","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atomicarchitects/phonax","path":"phonax/gradio.py","file_url":"https://github.com/atomicarchitects/phonax/blob/HEAD/phonax/gradio.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":"1c715fe36ed81d4d","code_sha256_prefix":"1c715fe36ed81d4d","mcp_get_code":{"code_sha256":"1c715fe36ed81d4d"}},{"arxiv_id":"2203.08958","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-usefulness-of-the-fit-on-the-test-view","title":"On the Usefulness of the Fit-on-the-Test View on Evaluating Calibration of Classifiers","date":"2022-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markus93/fit-on-the-test","path":"Experiments_Pseudo/calibration_functions.py","file_url":"https://github.com/markus93/fit-on-the-test/blob/HEAD/Experiments_Pseudo/calibration_functions.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":"645602835255b5f9","code_sha256_prefix":"645602835255b5f9","mcp_get_code":{"code_sha256":"645602835255b5f9"}},{"arxiv_id":"2107.14351","arxiv_id_is_arxiv":true,"paper":"/paper/contemporary-symbolic-regression-methods-and","title":"Contemporary Symbolic Regression Methods and their Relative Performance","date":"2021-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"philipp238/parfam","path":"src/parfam/utils.py","file_url":"https://github.com/philipp238/parfam/blob/HEAD/src/parfam/utils.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":"6623611f6314bd65","code_sha256_prefix":"6623611f6314bd65","mcp_get_code":{"code_sha256":"6623611f6314bd65"}},{"arxiv_id":"2107.12436","arxiv_id_is_arxiv":true,"paper":"/paper/feature-synergy-redundancy-and-independence","title":"Feature Synergy, Redundancy, and Independence in Global Model Explanations using SHAP Vector Decomposition","date":"2021-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BCG-Gamma/facet","path":"src/facet/inspection/_shap_context.py","file_url":"https://github.com/BCG-Gamma/facet/blob/HEAD/src/facet/inspection/_shap_context.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":"1a8b5ab61024ac45","code_sha256_prefix":"1a8b5ab61024ac45","mcp_get_code":{"code_sha256":"1a8b5ab61024ac45"}},{"arxiv_id":"1912.00965","arxiv_id_is_arxiv":true,"paper":"/paper/ap-perf-incorporating-generic-performance","title":"AP-Perf: Incorporating Generic Performance Metrics in Differentiable Learning","date":"2019-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rizalzaf/ap_perf","path":"ap_perf/expression.py","file_url":"https://github.com/rizalzaf/ap_perf/blob/HEAD/ap_perf/expression.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":"bee26ca4d596099b","code_sha256_prefix":"bee26ca4d596099b","mcp_get_code":{"code_sha256":"bee26ca4d596099b"}},{"arxiv_id":"1906.01549","arxiv_id_is_arxiv":true,"paper":"/paper/streaming-variational-monte-carlo","title":"Streaming Variational Monte Carlo","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"catniplab/svmc","path":"svmc/operation.py","file_url":"https://github.com/catniplab/svmc/blob/HEAD/svmc/operation.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":"c44d1481a7bc874c","code_sha256_prefix":"c44d1481a7bc874c","mcp_get_code":{"code_sha256":"c44d1481a7bc874c"}},{"arxiv_id":"Ma_ReMP-AD_Retrieval-enhanced_Multi-modal_Prompt_Fusion_for_Few-Shot_Industrial_Visual_Anomaly_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ma_ReMP-AD_Retrieval-enhanced_Multi-modal_Prompt_Fusion_for_Few-Shot_Industrial_Visual_Anomaly_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cshcma/ReMP-AD","path":"modules/scoring.py","file_url":"https://github.com/cshcma/ReMP-AD/blob/HEAD/modules/scoring.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":"f65912ae9a8e79f0","code_sha256_prefix":"f65912ae9a8e79f0","mcp_get_code":{"code_sha256":"f65912ae9a8e79f0"}}],"record_sha256":"9e87a847e02d3d8b0a5031948d3b750293213bbaf67d3f2d9ff9780d70fe94f7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}