{"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/gp","entry":"GP","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":3,"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_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":3,"unverified":2},"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":"2602.06771","paper":"/paper/arxiv-2602-06771","title":"AEGIS: Adversarial Target-Guided Retention-Data-Free Robust Concept Erasure from Diffusion Models","date":"2026-02-06","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"Feng-peng-Li/AEGIS","path":"train-scripts/AEGIS.py","file_url":"https://github.com/Feng-peng-Li/AEGIS/blob/HEAD/train-scripts/AEGIS.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC-BY-4.0","inline_ok":false,"code_sha256_prefix":"ea33a36bf5182425","mcp_get_code":{"code_sha256":"ea33a36bf5182425"}},{"arxiv_id":"2601.16332","paper":"/paper/arxiv-2601-16332","title":"Efficient Gaussian process learning via subspace projections","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"felipe-tobar/projected-likelihood","path":"gp.py","file_url":"https://github.com/felipe-tobar/projected-likelihood/blob/HEAD/gp.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bd48bd7398827b72","mcp_get_code":{"code_sha256":"bd48bd7398827b72"}},{"arxiv_id":"2505.16481","paper":"/paper/neighbour-driven-gaussian-process-variational","title":"Neighbour-Driven Gaussian Process Variational Autoencoders for Scalable Structured Latent Modelling","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shixinxing/nngpvae-official","path":"models/gpvae_base.py","file_url":"https://github.com/shixinxing/nngpvae-official/blob/HEAD/models/gpvae_base.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b9848a37a227a02","mcp_get_code":{"code_sha256":"1b9848a37a227a02"}},{"arxiv_id":"2303.17342","paper":"/paper/pmatch-paired-masked-image-modeling-for-dense","title":"PMatch: Paired Masked Image Modeling for Dense Geometric Matching","date":"2023-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShngJZ/PMatch","path":"PMatch/PMatch/models/pmatch.py","file_url":"https://github.com/ShngJZ/PMatch/blob/HEAD/PMatch/PMatch/models/pmatch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b36fd6d3ea325a2b","mcp_get_code":{"code_sha256":"b36fd6d3ea325a2b"}},{"arxiv_id":"2207.05543","paper":"/paper/markovian-gaussian-process-variational","title":"Markovian Gaussian Process Variational Autoencoders","date":"2022-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shixinxing/nngpvae-official","path":"baselines/mgpvae/models/mgpvae_base.py","file_url":"https://github.com/shixinxing/nngpvae-official/blob/HEAD/baselines/mgpvae/models/mgpvae_base.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"551f76f9b575e2b5","mcp_get_code":{"code_sha256":"551f76f9b575e2b5"}}]}