{"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-phi","entry":"get_phi","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":6,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":1,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":6,"n_places_pointer_only":3,"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":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"unverified":0},"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":"2603.18066","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, alskaf1293/neuralcomputer when it was checked","code_sha256":"6af1ff6973e22a66","code_sha256_prefix":"6af1ff6973e22a66","mcp_get_code":{"code_sha256":"6af1ff6973e22a66"}},{"arxiv_id":"2410.19750","arxiv_id_is_arxiv":true,"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ejmichaud/feature-geometry when it was checked","code_sha256":"9e316f40a6344d09","code_sha256_prefix":"9e316f40a6344d09","mcp_get_code":{"code_sha256":"9e316f40a6344d09"}},{"arxiv_id":"2406.04984","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, currentf/meft when it was checked","code_sha256":"684008276c2e318f","code_sha256_prefix":"684008276c2e318f","mcp_get_code":{"code_sha256":"684008276c2e318f"}},{"arxiv_id":"2210.07702","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c1adb979ae3016bf","code_sha256_prefix":"c1adb979ae3016bf","mcp_get_code":{"code_sha256":"c1adb979ae3016bf"}},{"arxiv_id":"2007.13970","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"324dcc7099f96bc9","code_sha256_prefix":"324dcc7099f96bc9","mcp_get_code":{"code_sha256":"324dcc7099f96bc9"}},{"arxiv_id":"cond-mat/9909130","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"da73498616cdcb69","code_sha256_prefix":"da73498616cdcb69","mcp_get_code":{"code_sha256":"da73498616cdcb69"}}],"record_sha256":"d499dd98aa4b8b6008e320deffd7f481b905c10611032f2a669914c5c251f3ec","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}