{"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/compute-prototypes","entry":"compute_prototypes","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":4,"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":9,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":7,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":10,"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":1,"ran_violates":0,"ran_draft_wrong":7,"ran_fixture":0,"ran":1,"unverified":1},"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.00478","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-00478","title":"Benchmarking Few-shot Transferability of Pre-trained Models with Improved Evaluation Protocols","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Frankluox/FewTrans","path":"architectures/classifier/finetune.py","file_url":"https://github.com/Frankluox/FewTrans/blob/HEAD/architectures/classifier/finetune.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"49c7656c86e98689","code_sha256_prefix":"49c7656c86e98689","mcp_get_code":{"code_sha256":"49c7656c86e98689"}},{"arxiv_id":"2303.06315","arxiv_id_is_arxiv":true,"paper":"/paper/deta-denoised-task-adaptation-for-few-shot","title":"DETA: Denoised Task Adaptation for Few-Shot Learning","date":"2023-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JimZAI/DETA","path":"models/ta.py","file_url":"https://github.com/JimZAI/DETA/blob/HEAD/models/ta.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a4c757e9b96b1bd8","code_sha256_prefix":"a4c757e9b96b1bd8","mcp_get_code":{"code_sha256":"a4c757e9b96b1bd8"}},{"arxiv_id":"2103.13841","arxiv_id_is_arxiv":true,"paper":"/paper/universal-representation-learning-from","title":"Universal Representation Learning from Multiple Domains for Few-shot Classification","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/mokd","path":"hsic_loss.py","file_url":"https://github.com/tmlr-group/mokd/blob/HEAD/hsic_loss.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":"fad178676f5c5101","code_sha256_prefix":"fad178676f5c5101","mcp_get_code":{"code_sha256":"fad178676f5c5101"}},{"arxiv_id":"2008.11297","arxiv_id_is_arxiv":true,"paper":"/paper/transductive-information-maximization-for-few","title":"Transductive Information Maximization For Few-Shot Learning","date":"2020-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sicara/easy-few-shot-learning","path":"easyfsl/methods/tim.py","file_url":"https://github.com/sicara/easy-few-shot-learning/blob/HEAD/easyfsl/methods/tim.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31e41d7e676cb492","code_sha256_prefix":"31e41d7e676cb492","mcp_get_code":{"code_sha256":"31e41d7e676cb492"}},{"arxiv_id":"2006.15486","arxiv_id_is_arxiv":true,"paper":"/paper/laplacian-regularized-few-shot-learning-1","title":"Laplacian Regularized Few-Shot Learning","date":"2020-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sicara/easy-few-shot-learning","path":"easyfsl/methods/laplacian_shot.py","file_url":"https://github.com/sicara/easy-few-shot-learning/blob/HEAD/easyfsl/methods/laplacian_shot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"02aec2b511f4f3a6","code_sha256_prefix":"02aec2b511f4f3a6","mcp_get_code":{"code_sha256":"02aec2b511f4f3a6"}},{"arxiv_id":"2003.09338","arxiv_id_is_arxiv":true,"paper":"/paper/selecting-relevant-features-from-a-universal","title":"Selecting Relevant Features from a Multi-domain Representation for Few-shot Classification","date":"2020-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvornikita/SUR","path":"models/losses.py","file_url":"https://github.com/dvornikita/SUR/blob/HEAD/models/losses.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":"8650e070578a3658","code_sha256_prefix":"8650e070578a3658","mcp_get_code":{"code_sha256":"8650e070578a3658"}},{"arxiv_id":"1703.05175","arxiv_id_is_arxiv":true,"paper":"/paper/prototypical-networks-for-few-shot-learning","title":"Prototypical Networks for Few-shot Learning","date":"2017-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akshatgarg99/FewShotLearning","path":"Utils/protonet_calculations.py","file_url":"https://github.com/akshatgarg99/FewShotLearning/blob/HEAD/Utils/protonet_calculations.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, akshatgarg99/FewShotLearning when it was checked","code_sha256":"4de656fa284263c4","code_sha256_prefix":"4de656fa284263c4","mcp_get_code":{"code_sha256":"4de656fa284263c4"}},{"arxiv_id":"1703.05175","arxiv_id_is_arxiv":true,"paper":"/paper/prototypical-networks-for-few-shot-learning","title":"Prototypical Networks for Few-shot Learning","date":"2017-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"learnables/learn2learn","path":"learn2learn/nn/protonet.py","file_url":"https://github.com/learnables/learn2learn/blob/HEAD/learn2learn/nn/protonet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b737a25e6c29ebc7","code_sha256_prefix":"b737a25e6c29ebc7","mcp_get_code":{"code_sha256":"b737a25e6c29ebc7"}},{"arxiv_id":"1703.05175","arxiv_id_is_arxiv":true,"paper":"/paper/prototypical-networks-for-few-shot-learning","title":"Prototypical Networks for Few-shot Learning","date":"2017-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oscarknagg/few-shot","path":"few_shot/proto.py","file_url":"https://github.com/oscarknagg/few-shot/blob/HEAD/few_shot/proto.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c442feb515d4d8f3","code_sha256_prefix":"c442feb515d4d8f3","mcp_get_code":{"code_sha256":"c442feb515d4d8f3"}},{"arxiv_id":"1703.05175","arxiv_id_is_arxiv":true,"paper":"/paper/prototypical-networks-for-few-shot-learning","title":"Prototypical Networks for Few-shot Learning","date":"2017-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sicara/easy-few-shot-learning","path":"easyfsl/methods/prototypical_networks.py","file_url":"https://github.com/sicara/easy-few-shot-learning/blob/HEAD/easyfsl/methods/prototypical_networks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9b846f6eab1ad481","code_sha256_prefix":"9b846f6eab1ad481","mcp_get_code":{"code_sha256":"9b846f6eab1ad481"}}],"record_sha256":"1515b17975cf617f8a82ff9095575f4aa1a847fbe43fc5ea8a1814d62149dd10","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}