{"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-resume-file","entry":"get_resume_file","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":6,"n_places_pointer_only":2,"n_places_pointer_only_link_open":1,"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":1,"ran_fixture":0,"ran":3,"unverified":0},"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":"2403.00567","arxiv_id_is_arxiv":true,"paper":"/paper/flatten-long-range-loss-landscapes-for-cross","title":"Flatten Long-Range Loss Landscapes for Cross-Domain Few-Shot Learning","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zoilsen/flor","path":"options.py","file_url":"https://github.com/zoilsen/flor/blob/HEAD/options.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zoilsen/flor when it was checked","code_sha256":"7b02b06c5ac04f3d","code_sha256_prefix":"7b02b06c5ac04f3d","mcp_get_code":{"code_sha256":"7b02b06c5ac04f3d"}},{"arxiv_id":"2208.10930","arxiv_id_is_arxiv":true,"paper":"/paper/fs-ban-born-again-networks-for-domain","title":"FS-BAN: Born-Again Networks for Domain Generalization Few-Shot Classification","date":"2022-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/Born-Again-FS","path":"baseline_model/options.py","file_url":"https://github.com/yunqing-me/Born-Again-FS/blob/HEAD/baseline_model/options.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from zoilsen/flor, and GitHub detected no licence in that repository when it was checked","code_sha256":"7b02b06c5ac04f3d","code_sha256_prefix":"7b02b06c5ac04f3d","mcp_get_code":{"code_sha256":"7b02b06c5ac04f3d"}},{"arxiv_id":"2202.02471","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-learning-as-cluster-induced-voronoi","title":"Few-shot Learning as Cluster-induced Voronoi Diagrams: A Geometric Approach","date":"2022-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"horsepurve/deepvoro","path":"io_utils.py","file_url":"https://github.com/horsepurve/deepvoro/blob/HEAD/io_utils.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":"3f1d37e1fff407e2","code_sha256_prefix":"3f1d37e1fff407e2","mcp_get_code":{"code_sha256":"3f1d37e1fff407e2"}},{"arxiv_id":"1912.07200","arxiv_id_is_arxiv":true,"paper":"/paper/a-new-benchmark-for-evaluation-of-cross","title":"A Broader Study of Cross-Domain Few-Shot Learning","date":"2019-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/cdfsl-benchmark","path":"io_utils.py","file_url":"https://github.com/IBM/cdfsl-benchmark/blob/HEAD/io_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4bd64c34ba45e089","code_sha256_prefix":"4bd64c34ba45e089","mcp_get_code":{"code_sha256":"4bd64c34ba45e089"}},{"arxiv_id":"1905.13613","arxiv_id_is_arxiv":true,"paper":"/paper/subspace-networks-for-few-shot-classification","title":"Regression Networks for Meta-Learning Few-Shot Classification","date":"2019-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ArnoutDevos/RegressionNet","path":"io_utils.py","file_url":"https://github.com/ArnoutDevos/RegressionNet/blob/HEAD/io_utils.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":"4bd64c34ba45e089","code_sha256_prefix":"4bd64c34ba45e089","mcp_get_code":{"code_sha256":"4bd64c34ba45e089"}},{"arxiv_id":"Lazarou_Iterative_Label_Cleaning_for_Transductive_and_Semi-Supervised_Few-Shot_Learning_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Lazarou_Iterative_Label_Cleaning_for_Transductive_and_Semi-Supervised_Few-Shot_Learning_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MichalisLazarou/iLPC","path":"semi_resnet12.py","file_url":"https://github.com/MichalisLazarou/iLPC/blob/HEAD/semi_resnet12.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":"ccf5738842acc5ec","code_sha256_prefix":"ccf5738842acc5ec","mcp_get_code":{"code_sha256":"ccf5738842acc5ec"}}],"record_sha256":"a05859345ae3d86367e57dddc30a828f8017ed09bfb39aadcbcb263bda63fd24","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}