{"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-gram-matrix","entry":"get_gram_matrix","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":8,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":4,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":8,"n_places_pointer_only_link_open":2,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":0,"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":"2511.03168","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-03168","title":"UnCLe: Towards Scalable Dynamic Causal Discovery in Non-linear Temporal Systems","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"cdt15/lingam","path":"lingam/hsic.py","file_url":"https://github.com/cdt15/lingam/blob/HEAD/lingam/hsic.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":"0d162d34aa4d7a1f","code_sha256_prefix":"0d162d34aa4d7a1f","mcp_get_code":{"code_sha256":"0d162d34aa4d7a1f"}},{"arxiv_id":"2409.19613","arxiv_id_is_arxiv":true,"paper":"/paper/hybrid-mamba-for-few-shot-segmentation","title":"Hybrid Mamba for Few-Shot Segmentation","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sam1224/hmnet","path":"model/HMNet.py","file_url":"https://github.com/sam1224/hmnet/blob/HEAD/model/HMNet.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sam1224/hmnet when it was checked","code_sha256":"7feaf1fceef927fe","code_sha256_prefix":"7feaf1fceef927fe","mcp_get_code":{"code_sha256":"7feaf1fceef927fe"}},{"arxiv_id":"2407.09842","arxiv_id_is_arxiv":true,"paper":"/paper/eliminating-feature-ambiguity-for-few-shot","title":"Eliminating Feature Ambiguity for Few-Shot Segmentation","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sam1224/aenet","path":"HDMNet/model/HDMNetPlus.py","file_url":"https://github.com/sam1224/aenet/blob/HEAD/HDMNet/model/HDMNetPlus.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sam1224/aenet when it was checked","code_sha256":"7feaf1fceef927fe","code_sha256_prefix":"7feaf1fceef927fe","mcp_get_code":{"code_sha256":"7feaf1fceef927fe"}},{"arxiv_id":"2402.13241","arxiv_id_is_arxiv":true,"paper":"/paper/federated-causal-discovery-from-heterogeneous","title":"Federated Causal Discovery from Heterogeneous Data","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lokali/fedcdh","path":"causallearn/search/FCMBased/lingam/multi_group_direct_lingam.py","file_url":"https://github.com/lokali/fedcdh/blob/HEAD/causallearn/search/FCMBased/lingam/multi_group_direct_lingam.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, lokali/fedcdh when it was checked","code_sha256":"1771651b948f9b7b","code_sha256_prefix":"1771651b948f9b7b","mcp_get_code":{"code_sha256":"1771651b948f9b7b"}},{"arxiv_id":"2311.17626","arxiv_id_is_arxiv":true,"paper":"/paper/focus-on-query-adversarial-mining-transformer-1","title":"Focus on Query: Adversarial Mining Transformer for Few-Shot Segmentation","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyxdm/amnet","path":"model/AMFormer.py","file_url":"https://github.com/wyxdm/amnet/blob/HEAD/model/AMFormer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wyxdm/amnet when it was checked","code_sha256":"7feaf1fceef927fe","code_sha256_prefix":"7feaf1fceef927fe","mcp_get_code":{"code_sha256":"7feaf1fceef927fe"}},{"arxiv_id":"2306.11734","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-rotation-invariant-aerial-image","title":"Few-Shot Rotation-Invariant Aerial Image Semantic Segmentation","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caoql98/frinet","path":"model/BAM.py","file_url":"https://github.com/caoql98/frinet/blob/HEAD/model/BAM.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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 wyxdm/amnet, and GitHub detected no licence in that repository when it was checked","code_sha256":"7feaf1fceef927fe","code_sha256_prefix":"7feaf1fceef927fe","mcp_get_code":{"code_sha256":"7feaf1fceef927fe"}},{"arxiv_id":"2206.09667","arxiv_id_is_arxiv":true,"paper":"/paper/msanet-multi-similarity-and-attention-1","title":"MSANet: Multi-Similarity and Attention Guidance for Boosting Few-Shot Segmentation","date":"2022-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"7feaf1fceef927fe","code_sha256_prefix":"7feaf1fceef927fe","mcp_get_code":{"code_sha256":"7feaf1fceef927fe"}},{"arxiv_id":"2203.07615","arxiv_id_is_arxiv":true,"paper":"/paper/learning-what-not-to-segment-a-new","title":"Learning What Not to Segment: A New Perspective on Few-Shot Segmentation","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chunbolang/BAM","path":"model/BAM.py","file_url":"https://github.com/chunbolang/BAM/blob/HEAD/model/BAM.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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 wyxdm/amnet, and GitHub detected no licence in that repository when it was checked","code_sha256":"7feaf1fceef927fe","code_sha256_prefix":"7feaf1fceef927fe","mcp_get_code":{"code_sha256":"7feaf1fceef927fe"}},{"arxiv_id":"1508.06576","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-algorithm-of-artistic-style","title":"A Neural Algorithm of Artistic Style","date":"2015-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tanjeffreyz/neural-algorithm-of-artistic-style","path":"models.py","file_url":"https://github.com/tanjeffreyz/neural-algorithm-of-artistic-style/blob/HEAD/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tanjeffreyz/neural-algorithm-of-artistic-style when it was checked","code_sha256":"eda9bf0e7f0f470b","code_sha256_prefix":"eda9bf0e7f0f470b","mcp_get_code":{"code_sha256":"eda9bf0e7f0f470b"}}],"record_sha256":"6f695cda99d1da6e6376d766077b19db2dea5632bcc2bebd2edd0a86a4427e31","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}