{"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/baseline","entry":"Baseline","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":6,"n_samples_ran":4,"n_samples_constructed":4,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":6,"n_places_pointer_only":2,"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":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":"2601.00225","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-00225","title":"Towards Syn-to-Real IQA: A Novel Perspective on Reshaping Synthetic Data Distributions","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Li-aobo/SynDR-IQA","path":"BaseIQASolver.py","file_url":"https://github.com/Li-aobo/SynDR-IQA/blob/HEAD/BaseIQASolver.py","status":"ran","verification_level":1,"contract_check":null,"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, Li-aobo/SynDR-IQA when it was checked","code_sha256":"5fa0f763a753217c","code_sha256_prefix":"5fa0f763a753217c","mcp_get_code":{"code_sha256":"5fa0f763a753217c"}},{"arxiv_id":"2305.14642","arxiv_id_is_arxiv":true,"paper":"/paper/2305-14642","title":"Newton-Cotes Graph Neural Networks: On the Time Evolution of Dynamic Systems","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjukg/ncgnn","path":"spatial_graph/models/ncgnn.py","file_url":"https://github.com/zjukg/ncgnn/blob/HEAD/spatial_graph/models/ncgnn.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":"54596a980158eb3c","code_sha256_prefix":"54596a980158eb3c","mcp_get_code":{"code_sha256":"54596a980158eb3c"}},{"arxiv_id":"2204.04676","arxiv_id_is_arxiv":true,"paper":"/paper/simple-baselines-for-image-restoration","title":"Simple Baselines for Image Restoration","date":"2022-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhryougit/afm","path":"basicsr/models/archs/Baseline_arch.py","file_url":"https://github.com/dhryougit/afm/blob/HEAD/basicsr/models/archs/Baseline_arch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, dhryougit/afm (NOASSERTION)","code_sha256":"6ce5b700c75ef796","code_sha256_prefix":"6ce5b700c75ef796","mcp_get_code":{"code_sha256":"6ce5b700c75ef796"}},{"arxiv_id":"2108.09976","arxiv_id_is_arxiv":true,"paper":"/paper/revealing-distributional-vulnerability-of","title":"Revealing the Distributional Vulnerability of Discriminators by Implicit Generators","date":"2021-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lawliet-zzl/fig","path":"code_FIG/main_FIG.py","file_url":"https://github.com/lawliet-zzl/fig/blob/HEAD/code_FIG/main_FIG.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":"e9f1f5ec51871efb","code_sha256_prefix":"e9f1f5ec51871efb","mcp_get_code":{"code_sha256":"e9f1f5ec51871efb"}},{"arxiv_id":"2106.05304","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-point-cloud-shape-classification","title":"Revisiting Point Cloud Shape Classification with a Simple and Effective Baseline","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"axeber01/point-tnt","path":"model.py","file_url":"https://github.com/axeber01/point-tnt/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fe12c37bc8cebc08","code_sha256_prefix":"fe12c37bc8cebc08","mcp_get_code":{"code_sha256":"fe12c37bc8cebc08"}},{"arxiv_id":"1908.02735","arxiv_id_is_arxiv":true,"paper":"/paper/metric-learning-with-horde-high-order","title":"Metric Learning With HORDE: High-Order Regularizer for Deep Embeddings","date":"2019-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pierre-jacob/ICCV2019-Horde","path":"kerastools/models/dml_models.py","file_url":"https://github.com/pierre-jacob/ICCV2019-Horde/blob/HEAD/kerastools/models/dml_models.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":"4082f06b7564e711","code_sha256_prefix":"4082f06b7564e711","mcp_get_code":{"code_sha256":"4082f06b7564e711"}}],"record_sha256":"fa34ebfeff482facefa25c2a1ca8f602b8c136daccfd96b7620b06ecab305982","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}