{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/pma","entry":"PMA","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":5,"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_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":0},"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":"2606.11616","paper":"/paper/arxiv-2606-11616","title":"DeMix: Debugging Training Data with Mixed Data Error Types by Investigating Influence Vectors","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"SJTU-DMTai/DeMix","path":"demix/pipelines.py","file_url":"https://github.com/SJTU-DMTai/DeMix/blob/HEAD/demix/pipelines.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8a83ef4321a193b5","mcp_get_code":{"code_sha256":"8a83ef4321a193b5"}},{"arxiv_id":"2106.06427","paper":"/paper/neural-symbolic-regression-that-scales","title":"Neural Symbolic Regression that Scales","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deep-symbolic-mathematics/TPSR","path":"nesymres/src/nesymres/architectures/model.py","file_url":"https://github.com/deep-symbolic-mathematics/TPSR/blob/HEAD/nesymres/src/nesymres/architectures/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fcf17228bc421518","mcp_get_code":{"code_sha256":"fcf17228bc421518"}},{"arxiv_id":"2102.11533","paper":"/paper/accurate-learning-of-graph-representations-1","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","date":"2021-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JinheonBaek/GMT","path":"models/nets.py","file_url":"https://github.com/JinheonBaek/GMT/blob/HEAD/models/nets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"44973cac2b91988d","mcp_get_code":{"code_sha256":"44973cac2b91988d"}},{"arxiv_id":"2010.15727","paper":"/paper/attentive-clustering-processes","title":"Amortized Probabilistic Detection of Communities in Graphs","date":"2020-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aripakman/amortized_community_detection","path":"acp/models/acp_model.py","file_url":"https://github.com/aripakman/amortized_community_detection/blob/HEAD/acp/models/acp_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"adbf1620f21b495a","mcp_get_code":{"code_sha256":"adbf1620f21b495a"}},{"arxiv_id":"2008.02953","paper":"/paper/neural-complexity-measures","title":"Neural Complexity Measures","date":"2020-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yoonholee/neural-complexity","path":"1d_regression/model/neural_complexity.py","file_url":"https://github.com/yoonholee/neural-complexity/blob/HEAD/1d_regression/model/neural_complexity.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1f2d527805ae96de","mcp_get_code":{"code_sha256":"1f2d527805ae96de"}}]}