{"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/phi-3","entry":"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":10,"n_papers_ran":7,"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":10,"n_samples_ran":7,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":4,"by_status":{"ran_honours":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":3},"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":"2605.01242","paper":"/paper/arxiv-2605-01242","title":"Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"shelowize/lvrep-rl","path":"agent/ctrlsac/ctrlsac_agent.py","file_url":"https://github.com/shelowize/lvrep-rl/blob/HEAD/agent/ctrlsac/ctrlsac_agent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"168142fbabb5f5d9","mcp_get_code":{"code_sha256":"168142fbabb5f5d9"}},{"arxiv_id":"2603.27488","paper":"/paper/arxiv-2603-27488","title":"Variational Learning of Fractional Posteriors","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"EmoryMLIP/DeepGenerativeModelingIntro","path":"Phi.py","file_url":"https://github.com/EmoryMLIP/DeepGenerativeModelingIntro/blob/HEAD/Phi.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3be1d261034bbbe1","mcp_get_code":{"code_sha256":"3be1d261034bbbe1"}},{"arxiv_id":"2406.01345","paper":"/paper/bmrs-bayesian-model-reduction-for-structured","title":"BMRS: Bayesian Model Reduction for Structured Pruning","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saintslab/bmrs-structured-pruning","path":"modules/layers.py","file_url":"https://github.com/saintslab/bmrs-structured-pruning/blob/HEAD/modules/layers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4b2929f719750d8a","mcp_get_code":{"code_sha256":"4b2929f719750d8a"}},{"arxiv_id":"2207.05837","paper":"/paper/learning-bellman-complete-representations-for","title":"Learning Bellman Complete Representations for Offline Policy Evaluation","date":"2022-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"causalml/bcrl","path":"bcrl/agent.py","file_url":"https://github.com/causalml/bcrl/blob/HEAD/bcrl/agent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"720a41a0b42e13ae","mcp_get_code":{"code_sha256":"720a41a0b42e13ae"}},{"arxiv_id":"2204.04853","paper":"/paper/neural-lagrangian-schrodinger-bridge","title":"Neural Lagrangian Schrödinger Bridge: Diffusion Modeling for Population Dynamics","date":"2022-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"take-koshizuka/nlsb","path":"models/ot_sde.py","file_url":"https://github.com/take-koshizuka/nlsb/blob/HEAD/models/ot_sde.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bd8374b0faec9f9f","mcp_get_code":{"code_sha256":"bd8374b0faec9f9f"}},{"arxiv_id":"2109.08090","paper":"/paper/disunknown-distilling-unknown-factors-for","title":"DisUnknown: Distilling Unknown Factors for Disentanglement Learning","date":"2021-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stormraiser/disunknown","path":"modules/WNPReLU.py","file_url":"https://github.com/stormraiser/disunknown/blob/HEAD/modules/WNPReLU.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6261db28cac2bccd","mcp_get_code":{"code_sha256":"6261db28cac2bccd"}},{"arxiv_id":"2108.01496","paper":"/paper/a-neural-database-for-differentially-private","title":"A Neural Database for Differentially Private Spatial Range Queries","date":null,"month_inferred_from_arxiv_id":"2021-08","title_source":"archive","repo":"szeighami/snh","path":"jax_model.py","file_url":"https://github.com/szeighami/snh/blob/HEAD/jax_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"68623d783cf43718","mcp_get_code":{"code_sha256":"68623d783cf43718"}},{"arxiv_id":"2107.00643","paper":"/paper/mandoline-model-evaluation-under-distribution","title":"Mandoline: Model Evaluation under Distribution Shift","date":"2021-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/mandoline","path":"mandoline.py","file_url":"https://github.com/HazyResearch/mandoline/blob/HEAD/mandoline.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9244f2b360b12414","mcp_get_code":{"code_sha256":"9244f2b360b12414"}},{"arxiv_id":"2006.11267","paper":"/paper/fast-matrix-square-roots-with-applications-to","title":"Fast Matrix Square Roots with Applications to Gaussian Processes and Bayesian Optimization","date":"2020-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gpleiss/ciq_experiments","path":"svgp/crps.py","file_url":"https://github.com/gpleiss/ciq_experiments/blob/HEAD/svgp/crps.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":"af00b91406dbc454","mcp_get_code":{"code_sha256":"af00b91406dbc454"}},{"arxiv_id":"1906.00816","paper":"/paper/190600816","title":"Bayesian Evidential Deep Learning with PAC Regularization","date":"2019-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manuelhaussmann/bedl","path":"utils.py","file_url":"https://github.com/manuelhaussmann/bedl/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9e25c6359e0dd580","mcp_get_code":{"code_sha256":"9e25c6359e0dd580"}}]}