{"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/get-coordinates","entry":"get_coordinates","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":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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"2405.20132","arxiv_id_is_arxiv":true,"paper":"/paper/llamea-a-large-language-model-evolutionary","title":"LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristics","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XAI-liacs/BLADE","path":"iohblade/behaviour_metrics.py","file_url":"https://github.com/XAI-liacs/BLADE/blob/HEAD/iohblade/behaviour_metrics.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":"0685ce4ccba5952e","code_sha256_prefix":"0685ce4ccba5952e","mcp_get_code":{"code_sha256":"0685ce4ccba5952e"}},{"arxiv_id":"2312.03682","arxiv_id_is_arxiv":true,"paper":"/paper/what-planning-problems-can-a-relational-1","title":"What Planning Problems Can A Relational Neural Network Solve?","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"concepts-ai/goal-regression-width","path":"gregress_theory/envs/represent.py","file_url":"https://github.com/concepts-ai/goal-regression-width/blob/HEAD/gregress_theory/envs/represent.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":"d051b31002622cf5","code_sha256_prefix":"d051b31002622cf5","mcp_get_code":{"code_sha256":"d051b31002622cf5"}},{"arxiv_id":"2304.01294","arxiv_id_is_arxiv":true,"paper":"/paper/sparse-cholesky-factorization-for-solving","title":"Sparse Cholesky Factorization for Solving Nonlinear PDEs via Gaussian Processes","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifanc96/pdes-gp-koleskysolver","path":"kolesky/measurements.py","file_url":"https://github.com/yifanc96/pdes-gp-koleskysolver/blob/HEAD/kolesky/measurements.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":"7085dc411741ae9f","code_sha256_prefix":"7085dc411741ae9f","mcp_get_code":{"code_sha256":"7085dc411741ae9f"}},{"arxiv_id":"2303.17086","arxiv_id_is_arxiv":true,"paper":"/paper/modularized-control-synthesis-for-complex","title":"Modularized Control Synthesis for Complex Signal Temporal Logic Specifications","date":"2023-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhang-zengjie/modustl","path":"config.py","file_url":"https://github.com/zhang-zengjie/modustl/blob/HEAD/config.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"39c9a8c6194659c2","code_sha256_prefix":"39c9a8c6194659c2","mcp_get_code":{"code_sha256":"39c9a8c6194659c2"}},{"arxiv_id":"2303.05251","arxiv_id_is_arxiv":true,"paper":"/paper/masked-image-modeling-with-local-multi-scale","title":"Masked Image Modeling with Local Multi-Scale Reconstruction","date":"2023-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"f1e430fd7c285ebd","code_sha256_prefix":"f1e430fd7c285ebd","mcp_get_code":{"code_sha256":"f1e430fd7c285ebd"}},{"arxiv_id":"2205.13515","arxiv_id_is_arxiv":true,"paper":"/paper/green-hierarchical-vision-transformer-for","title":"Green Hierarchical Vision Transformer for Masked Image Modeling","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"layneh/greenmim","path":"modeling/group_window_attention.py","file_url":"https://github.com/layneh/greenmim/blob/HEAD/modeling/group_window_attention.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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, layneh/greenmim (NOASSERTION)","code_sha256":"f1e430fd7c285ebd","code_sha256_prefix":"f1e430fd7c285ebd","mcp_get_code":{"code_sha256":"f1e430fd7c285ebd"}}],"record_sha256":"b0a9077b9ef8c6a5576bb759cb60b1671b6ec8bfc9fa0117c07eb329f2ec72e5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}