{"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-instance","entry":"get_instance","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":9,"n_papers_ran":6,"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":7,"n_samples_ran":4,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"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":"2409.02882","paper":"/paper/benchmarking-spurious-bias-in-few-shot-image","title":"Benchmarking Spurious Bias in Few-Shot Image Classifiers","date":"2024-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gtzheng/fewstab","path":"core/utils/utils.py","file_url":"https://github.com/gtzheng/fewstab/blob/HEAD/core/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e0552dc19a757339","mcp_get_code":{"code_sha256":"e0552dc19a757339"}},{"arxiv_id":"2401.13979","paper":"/paper/leeroo-orchestrator-elevating-llms","title":"Routoo: Learning to Route to Large Language Models Effectively","date":"2024-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leeroo-ai/leeroo_orchestrator","path":"app/utils/aws_ec2_utils.py","file_url":"https://github.com/leeroo-ai/leeroo_orchestrator/blob/HEAD/app/utils/aws_ec2_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7f01b73112057bfa","mcp_get_code":{"code_sha256":"7f01b73112057bfa"}},{"arxiv_id":"2205.13527","paper":"/paper/subspace-clustering-in-high-dimensions-phase","title":"Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucpoisson/SubspaceClustering","path":"Miscellaneous/Mix_functions.py","file_url":"https://github.com/lucpoisson/SubspaceClustering/blob/HEAD/Miscellaneous/Mix_functions.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":"d7d19f41999d4a69","mcp_get_code":{"code_sha256":"d7d19f41999d4a69"}},{"arxiv_id":"2110.09131","paper":"/paper/ensembling-graph-predictions-for-amr-parsing","title":"Ensembling Graph Predictions for AMR Parsing","date":"2021-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/graph_ensemble_learning","path":"ensemble/graphene.py","file_url":"https://github.com/ibm/graph_ensemble_learning/blob/HEAD/ensemble/graphene.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":"2537b384a6cfe551","mcp_get_code":{"code_sha256":"2537b384a6cfe551"}},{"arxiv_id":"2109.04898","paper":"/paper/libfewshot-a-comprehensive-library-for-few","title":"LibFewShot: A Comprehensive Library for Few-shot Learning","date":"2021-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rl-vig/libfewshot","path":"core/utils/utils.py","file_url":"https://github.com/rl-vig/libfewshot/blob/HEAD/core/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e0552dc19a757339","mcp_get_code":{"code_sha256":"e0552dc19a757339"}},{"arxiv_id":"1906.01227","paper":"/paper/an-efficient-graph-convolutional-network","title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LorenzoSciandra/GraphConvolutionalBranchandBound","path":"src/HybridSolver/1tree/main/HybridSolver.py","file_url":"https://github.com/LorenzoSciandra/GraphConvolutionalBranchandBound/blob/HEAD/src/HybridSolver/1tree/main/HybridSolver.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3e25b442a62074f4","mcp_get_code":{"code_sha256":"3e25b442a62074f4"}},{"arxiv_id":"1711.00937","paper":"/paper/neural-discrete-representation-learning","title":"Neural Discrete Representation Learning","date":"2017-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yjlolo/vae-audio","path":"dataset/audio_transform.py","file_url":"https://github.com/yjlolo/vae-audio/blob/HEAD/dataset/audio_transform.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d21115129d752c6b","mcp_get_code":{"code_sha256":"d21115129d752c6b"}},{"arxiv_id":"aaai_29965","paper":null,"title":"arXiv:aaai_29965","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RL-VIG/LibFewShot","path":"core/utils/utils.py","file_url":"https://github.com/RL-VIG/LibFewShot/blob/HEAD/core/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e0552dc19a757339","mcp_get_code":{"code_sha256":"e0552dc19a757339"}},{"arxiv_id":"Liu_Perturbed_and_Strict_Mean_Teachers_for_Semi-Supervised_Semantic_Segmentation_CVPR_2022_paper","paper":null,"title":"arXiv:Liu_Perturbed_and_Strict_Mean_Teachers_for_Semi-Supervised_Semantic_Segmentation_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yyliu01/PS-MT","path":"CityCode/Base/base_trainer.py","file_url":"https://github.com/yyliu01/PS-MT/blob/HEAD/CityCode/Base/base_trainer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1d4014c4b3ae7136","mcp_get_code":{"code_sha256":"1d4014c4b3ae7136"}}]}