{"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/computegrammatrix","entry":"computeGramMatrix","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":4,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":8,"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":0,"ran_fixture":1,"ran":1,"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":"2602.17947","arxiv_id_is_arxiv":true,"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":"models/classification_heads.py","file_url":"https://github.com/kjunelee/MetaOptNet/blob/HEAD/models/classification_heads.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6134727f9d286287","code_sha256_prefix":"6134727f9d286287","mcp_get_code":{"code_sha256":"6134727f9d286287"}},{"arxiv_id":"2310.10207","arxiv_id_is_arxiv":true,"paper":"/paper/bongard-openworld-few-shot-reasoning-for-free","title":"Bongard-OpenWorld: Few-Shot Reasoning for Free-form Visual Concepts in the Real World","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joyjayng/Bongard-OpenWorld","path":"models/head/metaoptnet.py","file_url":"https://github.com/joyjayng/Bongard-OpenWorld/blob/HEAD/models/head/metaoptnet.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":"691b2fde39c5dae5","code_sha256_prefix":"691b2fde39c5dae5","mcp_get_code":{"code_sha256":"691b2fde39c5dae5"}},{"arxiv_id":"2211.14666","arxiv_id_is_arxiv":true,"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/models/classification_heads.py","file_url":"https://github.com/tristandeleu/synergies-disentanglement-sparsity/blob/HEAD/metaoptnet/models/classification_heads.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":"691b2fde39c5dae5","code_sha256_prefix":"691b2fde39c5dae5","mcp_get_code":{"code_sha256":"691b2fde39c5dae5"}},{"arxiv_id":"2111.04316","arxiv_id_is_arxiv":true,"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":"models/classification_heads.py","file_url":"https://github.com/martayang/sega/blob/HEAD/models/classification_heads.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6134727f9d286287","code_sha256_prefix":"6134727f9d286287","mcp_get_code":{"code_sha256":"6134727f9d286287"}},{"arxiv_id":"2010.07092","arxiv_id_is_arxiv":true,"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":"models/classification_heads.py","file_url":"https://github.com/RenkunNi/MetaAug/blob/HEAD/models/classification_heads.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6134727f9d286287","code_sha256_prefix":"6134727f9d286287","mcp_get_code":{"code_sha256":"6134727f9d286287"}},{"arxiv_id":"2010.00763","arxiv_id_is_arxiv":true,"paper":"/paper/bongard-logo-a-new-benchmark-for-human-level","title":"Bongard-LOGO: A New Benchmark for Human-Level Concept Learning and Reasoning","date":"2020-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/Bongard-LOGO","path":"Bongard-LOGO_Baselines/models/metaOptNet.py","file_url":"https://github.com/NVlabs/Bongard-LOGO/blob/HEAD/Bongard-LOGO_Baselines/models/metaOptNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, NVlabs/Bongard-LOGO, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"691b2fde39c5dae5","code_sha256_prefix":"691b2fde39c5dae5","mcp_get_code":{"code_sha256":"691b2fde39c5dae5"}},{"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":"andrewbo29/mtm-meta-learning-sa","path":"protonet/models/classification_heads.py","file_url":"https://github.com/andrewbo29/mtm-meta-learning-sa/blob/HEAD/protonet/models/classification_heads.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6134727f9d286287","code_sha256_prefix":"6134727f9d286287","mcp_get_code":{"code_sha256":"6134727f9d286287"}},{"arxiv_id":"ijcai2020_0377","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2020_0377","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"P1nzhuo/Consistent-MetaReg","path":"models/bilevel_head.py","file_url":"https://github.com/P1nzhuo/Consistent-MetaReg/blob/HEAD/models/bilevel_head.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":"691b2fde39c5dae5","code_sha256_prefix":"691b2fde39c5dae5","mcp_get_code":{"code_sha256":"691b2fde39c5dae5"}}],"record_sha256":"99e4fed858393202efd74a9d1db506a85d5e18490dff00e4c205e8c9c2c7c89d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}