{"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/get-phi","entry":"get_phi","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":6,"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":6,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":4},"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":"2603.18066","paper":"/paper/arxiv-2603-18066","title":"A Synthesizable RTL Implementation of Predictive Coding Networks","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"alskaf1293/neuralcomputer","path":"python_rtl/pc_network.py","file_url":"https://github.com/alskaf1293/neuralcomputer/blob/HEAD/python_rtl/pc_network.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6af1ff6973e22a66","mcp_get_code":{"code_sha256":"6af1ff6973e22a66"}},{"arxiv_id":"2410.19750","paper":"/paper/the-geometry-of-concepts-sparse-autoencoder","title":"The Geometry of Concepts: Sparse Autoencoder Feature Structure","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejmichaud/feature-geometry","path":"brain/experiments/all-occurrences0/cluster_phi.py","file_url":"https://github.com/ejmichaud/feature-geometry/blob/HEAD/brain/experiments/all-occurrences0/cluster_phi.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9e316f40a6344d09","mcp_get_code":{"code_sha256":"9e316f40a6344d09"}},{"arxiv_id":"2406.04984","paper":"/paper/meft-memory-efficient-fine-tuning-through","title":"MEFT: Memory-Efficient Fine-Tuning through Sparse Adapter","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"currentf/meft","path":"modeling/faiss_vector_database.py","file_url":"https://github.com/currentf/meft/blob/HEAD/modeling/faiss_vector_database.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"684008276c2e318f","mcp_get_code":{"code_sha256":"684008276c2e318f"}},{"arxiv_id":"2210.07702","paper":"/paper/theory-and-approximate-solvers-for-branched","title":"Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hci-unihd/BranchedOT","path":"src/angular_stress_heuristic.py","file_url":"https://github.com/hci-unihd/BranchedOT/blob/HEAD/src/angular_stress_heuristic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c1adb979ae3016bf","mcp_get_code":{"code_sha256":"c1adb979ae3016bf"}},{"arxiv_id":"2007.13970","paper":"/paper/weakly-supervised-3d-object-detection-from-1","title":"Weakly Supervised 3D Object Detection from Point Clouds","date":"2020-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zengyi-Qin/Weakly-Supervised-3D-Object-Detection","path":"preprocess/sphere_map.py","file_url":"https://github.com/Zengyi-Qin/Weakly-Supervised-3D-Object-Detection/blob/HEAD/preprocess/sphere_map.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"324dcc7099f96bc9","mcp_get_code":{"code_sha256":"324dcc7099f96bc9"}},{"arxiv_id":"cond-mat/9909130","paper":"/paper/new-algebraic-formulation-of-density","title":"New Algebraic Formulation of Density Functional Calculation","date":null,"month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangenau/eminus","path":"eminus/dft.py","file_url":"https://github.com/wangenau/eminus/blob/HEAD/eminus/dft.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"da73498616cdcb69","mcp_get_code":{"code_sha256":"da73498616cdcb69"}}]}