{"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/to-sparse","entry":"to_sparse","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":13,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":8,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":13,"n_places_pointer_only":4,"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":0,"ran_fixture":2,"ran":4,"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":"2502.13995","arxiv_id_is_arxiv":true,"paper":"/paper/fantasyid-face-knowledge-enhanced-id","title":"FantasyID: Face Knowledge Enhanced ID-Preserving Video Generation","date":null,"month_inferred_from_arxiv_id":"2025-02","title_source":"archive","repo":"Fantasy-AMAP/fantasy-id","path":"models/vertex_encode.py","file_url":"https://github.com/Fantasy-AMAP/fantasy-id/blob/HEAD/models/vertex_encode.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"56a78bc81ef23be7","code_sha256_prefix":"56a78bc81ef23be7","mcp_get_code":{"code_sha256":"56a78bc81ef23be7"}},{"arxiv_id":"2412.00507","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2412.00507","date":null,"month_inferred_from_arxiv_id":"2024-12","title_source":null,"repo":"LLNL/DD-NM-ROM","path":"dd_nm_rom/backend.py","file_url":"https://github.com/LLNL/DD-NM-ROM/blob/HEAD/dd_nm_rom/backend.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2807f2037cd9103c","code_sha256_prefix":"2807f2037cd9103c","mcp_get_code":{"code_sha256":"2807f2037cd9103c"}},{"arxiv_id":"2410.06746","arxiv_id_is_arxiv":true,"paper":"/paper/cluster-wise-graph-transformer-with-dual","title":"Cluster-wise Graph Transformer with Dual-granularity Kernelized Attention","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUMIA-Group/Cluster-wise-Graph-Transformer","path":"graph_partition.py","file_url":"https://github.com/LUMIA-Group/Cluster-wise-Graph-Transformer/blob/HEAD/graph_partition.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, LUMIA-Group/Cluster-wise-Graph-Transformer when it was checked","code_sha256":"8039d4f24f678f0b","code_sha256_prefix":"8039d4f24f678f0b","mcp_get_code":{"code_sha256":"8039d4f24f678f0b"}},{"arxiv_id":"2312.04234","arxiv_id_is_arxiv":true,"paper":"/paper/graph-convolutions-enrich-the-self-attention","title":"Graph Convolutions Enrich the Self-Attention in Transformers!","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XiaoxinHe/Graph-ViT-MLPMixer","path":"core/transform.py","file_url":"https://github.com/XiaoxinHe/Graph-ViT-MLPMixer/blob/HEAD/core/transform.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8039d4f24f678f0b","code_sha256_prefix":"8039d4f24f678f0b","mcp_get_code":{"code_sha256":"8039d4f24f678f0b"}},{"arxiv_id":"2309.16014","arxiv_id_is_arxiv":true,"paper":"/paper/graph-level-representation-learning-with","title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","date":"2023-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"geriskenderi/graph-jepa","path":"core/transform.py","file_url":"https://github.com/geriskenderi/graph-jepa/blob/HEAD/core/transform.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8039d4f24f678f0b","code_sha256_prefix":"8039d4f24f678f0b","mcp_get_code":{"code_sha256":"8039d4f24f678f0b"}},{"arxiv_id":"2210.09521","arxiv_id_is_arxiv":true,"paper":"/paper/a-practical-progressively-expressive-gnn","title":"A Practical, Progressively-Expressive GNN","date":"2022-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LingxiaoShawn/KCSetGNN","path":"core/transform.py","file_url":"https://github.com/LingxiaoShawn/KCSetGNN/blob/HEAD/core/transform.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8039d4f24f678f0b","code_sha256_prefix":"8039d4f24f678f0b","mcp_get_code":{"code_sha256":"8039d4f24f678f0b"}},{"arxiv_id":"2202.02800","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-be-a-statistician-learned","title":"Learning to be a Statistician: Learned Estimator for Number of Distinct Values","date":"2022-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wurenzhi/learned_ndv_estimator","path":"src/estndv/estimate.py","file_url":"https://github.com/wurenzhi/learned_ndv_estimator/blob/HEAD/src/estndv/estimate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae677aa29e91ed69","code_sha256_prefix":"ae677aa29e91ed69","mcp_get_code":{"code_sha256":"ae677aa29e91ed69"}},{"arxiv_id":"2110.03753","arxiv_id_is_arxiv":true,"paper":"/paper/from-stars-to-subgraphs-uplifting-any-gnn","title":"From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness","date":"2021-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GNNAsKernel/GNNAsKernel","path":"core/transform.py","file_url":"https://github.com/GNNAsKernel/GNNAsKernel/blob/HEAD/core/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":"f930a8015a340687","code_sha256_prefix":"f930a8015a340687","mcp_get_code":{"code_sha256":"f930a8015a340687"}},{"arxiv_id":"2008.09768","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-deep-learning-of-multiscale","title":"Hierarchical Deep Learning of Multiscale Differential Equation Time-Steppers","date":"2020-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luckystarufo/multiscale_HiTS","path":"src/esn.py","file_url":"https://github.com/luckystarufo/multiscale_HiTS/blob/HEAD/src/esn.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":"bd1a2aeb7b63da7b","code_sha256_prefix":"bd1a2aeb7b63da7b","mcp_get_code":{"code_sha256":"bd1a2aeb7b63da7b"}},{"arxiv_id":"1912.05783","arxiv_id_is_arxiv":true,"paper":"/paper/closure-assessing-systematic-generalization","title":"CLOSURE: Assessing Systematic Generalization of CLEVR Models","date":"2019-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raeidsaqur/mgn","path":"mgn/models/graph_matcher.py","file_url":"https://github.com/raeidsaqur/mgn/blob/HEAD/mgn/models/graph_matcher.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":"2bf75d6c18b35a77","code_sha256_prefix":"2bf75d6c18b35a77","mcp_get_code":{"code_sha256":"2bf75d6c18b35a77"}},{"arxiv_id":"1803.08035","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-recognition-via-semantic-embeddings","title":"Zero-shot Recognition via Semantic Embeddings and Knowledge Graphs","date":"2018-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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":"6b6e39f4d8304640","code_sha256_prefix":"6b6e39f4d8304640","mcp_get_code":{"code_sha256":"6b6e39f4d8304640"}},{"arxiv_id":"1603.00550","arxiv_id_is_arxiv":true,"paper":"/paper/synthesized-classifiers-for-zero-shot","title":"Synthesized Classifiers for Zero-Shot Learning","date":"2016-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruotianluo/zsl-gcn-pth","path":"src/gcn/train_gcn.py","file_url":"https://github.com/ruotianluo/zsl-gcn-pth/blob/HEAD/src/gcn/train_gcn.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, ruotianluo/zsl-gcn-pth when it was checked","code_sha256":"6b6e39f4d8304640","code_sha256_prefix":"6b6e39f4d8304640","mcp_get_code":{"code_sha256":"6b6e39f4d8304640"}},{"arxiv_id":"1312.5650","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-learning-by-convex-combination-of","title":"Zero-Shot Learning by Convex Combination of Semantic Embeddings","date":"2013-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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":"6b6e39f4d8304640","code_sha256_prefix":"6b6e39f4d8304640","mcp_get_code":{"code_sha256":"6b6e39f4d8304640"}}],"record_sha256":"e2186d427d4602ae30a90251a9707ec7b004fd0c36ba3aa1371de32a7c3b1937","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}