{"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/count-accuracy","entry":"count_accuracy","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":12,"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":8,"n_samples_ran":3,"n_samples_fingerprinted":2,"n_places":12,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":0,"unverified":5},"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":"2608.04930","paper":"/paper/arxiv-2608-04930","title":"SVI-DAG: A Structured Variational Inference Approach to Bayesian Causal Discovery","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"shrenikvz/SVI-DAG","path":"other_algorithms/codes_jax/bcd/dag_utils.py","file_url":"https://github.com/shrenikvz/SVI-DAG/blob/HEAD/other_algorithms/codes_jax/bcd/dag_utils.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":"3ca759c07395c735","mcp_get_code":{"code_sha256":"3ca759c07395c735"}},{"arxiv_id":"2602.23602","paper":"/paper/arxiv-2602-23602","title":"Moment Matters: Mean and Variance Causal Graph Discovery from Heteroscedastic Observational Data","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"naiyuyin/ICDH","path":"ICDH.py","file_url":"https://github.com/naiyuyin/ICDH/blob/HEAD/ICDH.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"462d024d9c7ee39f","mcp_get_code":{"code_sha256":"462d024d9c7ee39f"}},{"arxiv_id":"2602.17947","paper":"/paper/arxiv-2602-17947","title":"Understanding the Generalization of Bilevel Programming in Hyperparameter Optimization: A Tale of Bias-Variance Decomposition","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"kjunelee/MetaOptNet","path":"utils.py","file_url":"https://github.com/kjunelee/MetaOptNet/blob/HEAD/utils.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":"fb61241b42c06d73","mcp_get_code":{"code_sha256":"fb61241b42c06d73"}},{"arxiv_id":"2402.06380","paper":"/paper/optimal-estimation-of-gaussian-poly-trees","title":"Optimal estimation of Gaussian (poly)trees","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yohannawang/polytree","path":"evaluate.py","file_url":"https://github.com/yohannawang/polytree/blob/HEAD/evaluate.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":"86d7103f1e0e0801","mcp_get_code":{"code_sha256":"86d7103f1e0e0801"}},{"arxiv_id":"2211.14666","paper":"/paper/synergies-between-disentanglement-and","title":"Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learning","date":"2022-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tristandeleu/synergies-disentanglement-sparsity","path":"metaoptnet/utils.py","file_url":"https://github.com/tristandeleu/synergies-disentanglement-sparsity/blob/HEAD/metaoptnet/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fb61241b42c06d73","mcp_get_code":{"code_sha256":"fb61241b42c06d73"}},{"arxiv_id":"2209.08037","paper":"/paper/dagma-learning-dags-via-m-matrices-and-a-log","title":"DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterization","date":"2022-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samiatto/colide","path":"utils.py","file_url":"https://github.com/samiatto/colide/blob/HEAD/utils.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":"614ebb7febab6a64","mcp_get_code":{"code_sha256":"614ebb7febab6a64"}},{"arxiv_id":"2206.06354","paper":"/paper/differentiable-and-transportable-structure","title":"Differentiable and Transportable Structure Learning","date":"2022-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeroenbe/d-struct","path":"src/dstruct.py","file_url":"https://github.com/jeroenbe/d-struct/blob/HEAD/src/dstruct.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"755551459ccab6fd","mcp_get_code":{"code_sha256":"755551459ccab6fd"}},{"arxiv_id":"2111.04316","paper":"/paper/sega-semantic-guided-attention-on-visual","title":"SEGA: Semantic Guided Attention on Visual Prototype for Few-Shot Learning","date":"2021-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martayang/sega","path":"utils.py","file_url":"https://github.com/martayang/sega/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fb61241b42c06d73","mcp_get_code":{"code_sha256":"fb61241b42c06d73"}},{"arxiv_id":"2106.15563","paper":"/paper/learning-latent-causal-graphs-via-mixture","title":"Learning latent causal graphs via mixture oracles","date":"2021-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"30bohdan/latent-dag","path":"pipeline.py","file_url":"https://github.com/30bohdan/latent-dag/blob/HEAD/pipeline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"30c2aabe236eb642","mcp_get_code":{"code_sha256":"30c2aabe236eb642"}},{"arxiv_id":"2010.07092","paper":"/paper/data-augmentation-for-meta-learning-1","title":"Data Augmentation for Meta-Learning","date":"2020-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RenkunNi/MetaAug","path":"utils.py","file_url":"https://github.com/RenkunNi/MetaAug/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fb61241b42c06d73","mcp_get_code":{"code_sha256":"fb61241b42c06d73"}},{"arxiv_id":"2009.04960","paper":"/paper/prototype-completion-with-primitive-knowledge","title":"Prototype Completion with Primitive Knowledge for Few-Shot Learning","date":"2020-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangbq-research/Prototype_Completion_for_FSL","path":"utils.py","file_url":"https://github.com/zhangbq-research/Prototype_Completion_for_FSL/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fb61241b42c06d73","mcp_get_code":{"code_sha256":"fb61241b42c06d73"}},{"arxiv_id":"2006.10201","paper":"/paper/on-the-role-of-sparsity-and-dag-constraints","title":"On the Role of Sparsity and DAG Constraints for Learning Linear DAGs","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignavier/golem","path":"src/utils/utils.py","file_url":"https://github.com/ignavier/golem/blob/HEAD/src/utils/utils.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":"a6e9c529933a6c29","mcp_get_code":{"code_sha256":"a6e9c529933a6c29"}}]}