{"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-instance","entry":"get_instance","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":1,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":3,"unverified":2},"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":"2409.02882","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0552dc19a757339","code_sha256_prefix":"e0552dc19a757339","mcp_get_code":{"code_sha256":"e0552dc19a757339"}},{"arxiv_id":"2401.13979","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f01b73112057bfa","code_sha256_prefix":"7f01b73112057bfa","mcp_get_code":{"code_sha256":"7f01b73112057bfa"}},{"arxiv_id":"2205.13527","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lucpoisson/SubspaceClustering when it was checked","code_sha256":"d7d19f41999d4a69","code_sha256_prefix":"d7d19f41999d4a69","mcp_get_code":{"code_sha256":"d7d19f41999d4a69"}},{"arxiv_id":"2110.09131","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2537b384a6cfe551","code_sha256_prefix":"2537b384a6cfe551","mcp_get_code":{"code_sha256":"2537b384a6cfe551"}},{"arxiv_id":"2109.04898","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0552dc19a757339","code_sha256_prefix":"e0552dc19a757339","mcp_get_code":{"code_sha256":"e0552dc19a757339"}},{"arxiv_id":"1906.01227","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3e25b442a62074f4","code_sha256_prefix":"3e25b442a62074f4","mcp_get_code":{"code_sha256":"3e25b442a62074f4"}},{"arxiv_id":"1711.00937","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d21115129d752c6b","code_sha256_prefix":"d21115129d752c6b","mcp_get_code":{"code_sha256":"d21115129d752c6b"}},{"arxiv_id":"aaai_29965","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id 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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0552dc19a757339","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","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id 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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d4014c4b3ae7136","code_sha256_prefix":"1d4014c4b3ae7136","mcp_get_code":{"code_sha256":"1d4014c4b3ae7136"}}],"record_sha256":"f13830fd3cc12d86f869b24eb825d5b9fdaf51ce6e5d2bbfe0a54e064de7517e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}