{"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/compute-pca","entry":"compute_pca","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":2,"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":4,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":0,"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":"2601.21291","paper":"/paper/arxiv-2601-21291","title":"Gaussian Belief Propagation Network for Depth Completion","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"kakaxi314/GBPN","path":"augs.py","file_url":"https://github.com/kakaxi314/GBPN/blob/HEAD/augs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ccda8aad864983b8","mcp_get_code":{"code_sha256":"ccda8aad864983b8"}},{"arxiv_id":"2406.02542","paper":"/paper/loki-low-rank-keys-for-efficient-sparse","title":"Loki: Low-rank Keys for Efficient Sparse Attention","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hpcgroup/loki","path":"pca_analysis/pca.py","file_url":"https://github.com/hpcgroup/loki/blob/HEAD/pca_analysis/pca.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cb1d3b37c411f9f2","mcp_get_code":{"code_sha256":"cb1d3b37c411f9f2"}},{"arxiv_id":"2403.11270","paper":"/paper/bilateral-propagation-network-for-depth","title":"Bilateral Propagation Network for Depth Completion","date":"2024-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kakaxi314/BP-Net","path":"augs.py","file_url":"https://github.com/kakaxi314/BP-Net/blob/HEAD/augs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ccda8aad864983b8","mcp_get_code":{"code_sha256":"ccda8aad864983b8"}},{"arxiv_id":"2104.00298","paper":"/paper/efficientnetv2-smaller-models-and-faster","title":"EfficientNetV2: Smaller Models and Faster Training","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JohnnyHopp/PaDiM-EfficientNetV2","path":"utils.py","file_url":"https://github.com/JohnnyHopp/PaDiM-EfficientNetV2/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4b11257d79964d87","mcp_get_code":{"code_sha256":"4b11257d79964d87"}},{"arxiv_id":"2003.11036","paper":"/paper/detecting-multiple-dlas-per-spectrum-in-sdss","title":"Detecting Multiple DLAs per Spectrum in SDSS DR12 with Gaussian Processes","date":null,"month_inferred_from_arxiv_id":"2020-03","title_source":"archive","repo":"jibanCat/desi_gpy_dla_detection","path":"gpy_dla_detection/learn_qso_model.py","file_url":"https://github.com/jibanCat/desi_gpy_dla_detection/blob/HEAD/gpy_dla_detection/learn_qso_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2ac30eb42d1d6c6a","mcp_get_code":{"code_sha256":"2ac30eb42d1d6c6a"}}]}