{"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/complexity","entry":"complexity","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":5,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"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":"2410.13681","arxiv_id_is_arxiv":true,"paper":"/paper/ab-initio-nonparametric-variable-selection","title":"Ab Initio Nonparametric Variable Selection for Scalable Symbolic Regression with Large $p$","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mattsheng/PAN_SR","path":"experiment/assess_symbolic_model.py","file_url":"https://github.com/mattsheng/PAN_SR/blob/HEAD/experiment/assess_symbolic_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, mattsheng/PAN_SR, is not in the permissive set Syntology serves inline","code_sha256":"5778069a13196214","code_sha256_prefix":"5778069a13196214","mcp_get_code":{"code_sha256":"5778069a13196214"}},{"arxiv_id":"2312.03612","arxiv_id_is_arxiv":true,"paper":"/paper/physical-symbolic-optimization","title":"Physical Symbolic Optimization","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cavalab/srbench","path":"algorithms/tir/regressor.py","file_url":"https://github.com/cavalab/srbench/blob/HEAD/algorithms/tir/regressor.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, cavalab/srbench, is not in the permissive set Syntology serves inline","code_sha256":"d8b6135479420b0a","code_sha256_prefix":"d8b6135479420b0a","mcp_get_code":{"code_sha256":"d8b6135479420b0a"}},{"arxiv_id":"2106.06804","arxiv_id_is_arxiv":true,"paper":"/paper/entropy-based-logic-explanations-of-neural","title":"Entropy-based Logic Explanations of Neural Networks","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pietrobarbiero/entropy-lens","path":"entropy_lens/logic/metrics.py","file_url":"https://github.com/pietrobarbiero/entropy-lens/blob/HEAD/entropy_lens/logic/metrics.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":"173b52c029b4bfa3","code_sha256_prefix":"173b52c029b4bfa3","mcp_get_code":{"code_sha256":"173b52c029b4bfa3"}},{"arxiv_id":"2101.06459","arxiv_id_is_arxiv":true,"paper":"/paper/robustness-to-augmentations-as-a","title":"Robustness to Augmentations as a Generalization metric","date":"2021-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sumukhaithal6/pgdl","path":"runner_up_solution/complexity.py","file_url":"https://github.com/sumukhaithal6/pgdl/blob/HEAD/runner_up_solution/complexity.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":"295a07e9f6df5500","code_sha256_prefix":"295a07e9f6df5500","mcp_get_code":{"code_sha256":"295a07e9f6df5500"}},{"arxiv_id":"2012.02775","arxiv_id_is_arxiv":true,"paper":"/paper/representation-based-complexity-measures-for","title":"Representation Based Complexity Measures for Predicting Generalization in Deep Learning","date":"2020-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parthnatekar/pgdl","path":"complexity.py","file_url":"https://github.com/parthnatekar/pgdl/blob/HEAD/complexity.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, parthnatekar/pgdl when it was checked","code_sha256":"d00a90604ab800f0","code_sha256_prefix":"d00a90604ab800f0","mcp_get_code":{"code_sha256":"d00a90604ab800f0"}}],"record_sha256":"06c540453b9574d29ef136f6d696c86d43af2775dcb16701b8b878ec02b7f79e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}