{"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/layer","entry":"Layer","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":20,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":1,"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":20,"n_samples_ran":12,"n_samples_constructed":9,"n_samples_ran_checked":11,"n_samples_instrument":1,"n_samples_unverified":8,"n_samples_fingerprinted":3,"n_places":20,"n_places_pointer_only":14,"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":1,"ran_fixture":0,"ran":11,"unverified":8},"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.18066","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-18066","title":"A Synthesizable RTL Implementation of Predictive Coding Networks","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"alskaf1293/neuralcomputer","path":"python_rtl/pc_network.py","file_url":"https://github.com/alskaf1293/neuralcomputer/blob/HEAD/python_rtl/pc_network.py","status":"ran","verification_level":1,"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, alskaf1293/neuralcomputer when it was checked","code_sha256":"9f46ae9d4c95a3ca","code_sha256_prefix":"9f46ae9d4c95a3ca","mcp_get_code":{"code_sha256":"9f46ae9d4c95a3ca"}},{"arxiv_id":"2505.11483","arxiv_id_is_arxiv":true,"paper":"/paper/2505-11483","title":"msf-CNN: Patch-based Multi-Stage Fusion with Convolutional Neural Networks for TinyML","date":"2025-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tinypart/msf-cnn","path":"analysis/building_blocks.py","file_url":"https://github.com/tinypart/msf-cnn/blob/HEAD/analysis/building_blocks.py","status":"ran","verification_level":1,"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, tinypart/msf-cnn when it was checked","code_sha256":"e61985ffd70a72a8","code_sha256_prefix":"e61985ffd70a72a8","mcp_get_code":{"code_sha256":"e61985ffd70a72a8"}},{"arxiv_id":"2504.18591","arxiv_id_is_arxiv":true,"paper":"/paper/geometry-aware-inference-of-steady-state-pdes","title":"Geometry aware inference of steady state PDEs using Equivariant Neural Fields representations","date":"2025-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"giovannicatalani/enf2enf","path":"enf/models/equivariant_cross_attention_nef.py","file_url":"https://github.com/giovannicatalani/enf2enf/blob/HEAD/enf/models/equivariant_cross_attention_nef.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, giovannicatalani/enf2enf when it was checked","code_sha256":"3ac0ff2b5cc925f8","code_sha256_prefix":"3ac0ff2b5cc925f8","mcp_get_code":{"code_sha256":"3ac0ff2b5cc925f8"}},{"arxiv_id":"2406.15079","arxiv_id_is_arxiv":true,"paper":"/paper/goal-a-generalist-combinatorial-optimization","title":"GOAL: A Generalist Combinatorial Optimization Agent Learning","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver/goal-co","path":"model/goal.py","file_url":"https://github.com/naver/goal-co/blob/HEAD/model/goal.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, naver/goal-co (NOASSERTION)","code_sha256":"e25d388b98c8e3f0","code_sha256_prefix":"e25d388b98c8e3f0","mcp_get_code":{"code_sha256":"e25d388b98c8e3f0"}},{"arxiv_id":"2405.11198","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-stabilization-based-on-machine","title":"Adaptive Stabilization Based on Machine Learning for Column Generation","date":"2024-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunzhuangshen/ml-based-adaptive-stabilization","path":"ml/models/models.py","file_url":"https://github.com/yunzhuangshen/ml-based-adaptive-stabilization/blob/HEAD/ml/models/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, yunzhuangshen/ml-based-adaptive-stabilization when it was checked","code_sha256":"f102ca4867968d09","code_sha256_prefix":"f102ca4867968d09","mcp_get_code":{"code_sha256":"f102ca4867968d09"}},{"arxiv_id":"2402.03412","arxiv_id_is_arxiv":true,"paper":"/paper/see-more-details-efficient-image-super","title":"See More Details: Efficient Image Super-Resolution by Experts Mining","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhoushen1/MEASNet","path":"MEASNet/net/FD_MEE.py","file_url":"https://github.com/zhoushen1/MEASNet/blob/HEAD/MEASNet/net/FD_MEE.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhoushen1/MEASNet when it was checked","code_sha256":"9146fec2223e3a45","code_sha256_prefix":"9146fec2223e3a45","mcp_get_code":{"code_sha256":"9146fec2223e3a45"}},{"arxiv_id":"2401.06633","arxiv_id_is_arxiv":true,"paper":"/paper/ada-retrieval-an-adaptive-multi-round","title":"Ada-Retrieval: An Adaptive Multi-Round Retrieval Paradigm for Sequential Recommendations","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ll0ruc/Ada-Retrieval","path":"src/model/sequential/fmlprec.py","file_url":"https://github.com/ll0ruc/Ada-Retrieval/blob/HEAD/src/model/sequential/fmlprec.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ll0ruc/Ada-Retrieval when it was checked","code_sha256":"50813189315e4448","code_sha256_prefix":"50813189315e4448","mcp_get_code":{"code_sha256":"50813189315e4448"}},{"arxiv_id":"2210.04123","arxiv_id_is_arxiv":true,"paper":"/paper/dimes-a-differentiable-meta-solver-for","title":"DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems","date":"2022-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dimesteam/dimes","path":"MIS/solvers/intel_treesearch/NPHard/gcn/models.py","file_url":"https://github.com/dimesteam/dimes/blob/HEAD/MIS/solvers/intel_treesearch/NPHard/gcn/models.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":"8d9ecc956fcf5e40","code_sha256_prefix":"8d9ecc956fcf5e40","mcp_get_code":{"code_sha256":"8d9ecc956fcf5e40"}},{"arxiv_id":"2106.02248","arxiv_id_is_arxiv":true,"paper":"/paper/knowing-the-no-match-entity-alignment-with","title":"Knowing the No-match: Entity Alignment with Dangling Cases","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nju-websoft/OpenEA","path":"src/openea/approaches/gmnn.py","file_url":"https://github.com/nju-websoft/OpenEA/blob/HEAD/src/openea/approaches/gmnn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, nju-websoft/OpenEA, is not in the permissive set Syntology serves inline","code_sha256":"3c0ff4f06ef8b321","code_sha256_prefix":"3c0ff4f06ef8b321","mcp_get_code":{"code_sha256":"3c0ff4f06ef8b321"}},{"arxiv_id":"2012.09243","arxiv_id_is_arxiv":true,"paper":"/paper/neural-pruning-via-growing-regularization-1","title":"Neural Pruning via Growing Regularization","date":"2020-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingsun-tse/regularization-pruning","path":"pruner/reg_pruner.py","file_url":"https://github.com/mingsun-tse/regularization-pruning/blob/HEAD/pruner/reg_pruner.py","status":"ran","verification_level":1,"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, mingsun-tse/regularization-pruning when it was checked","code_sha256":"d54cd5c9b293f300","code_sha256_prefix":"d54cd5c9b293f300","mcp_get_code":{"code_sha256":"d54cd5c9b293f300"}},{"arxiv_id":"2011.03856","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-model-and-ignore-dataset-bias","title":"Learning to Model and Ignore Dataset Bias with Mixed Capacity Ensembles","date":"2020-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chrisc36/autobias","path":"autobias/modules/classifier_ensembles.py","file_url":"https://github.com/chrisc36/autobias/blob/HEAD/autobias/modules/classifier_ensembles.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1788407f38a54f42","code_sha256_prefix":"1788407f38a54f42","mcp_get_code":{"code_sha256":"1788407f38a54f42"}},{"arxiv_id":"2007.13197","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-generation-of-structured-objects-1","title":"Efficient Generation of Structured Objects with Constrained Adversarial Networks","date":"2020-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"unitn-sml/CAN","path":"src/fuzzy/losses.py","file_url":"https://github.com/unitn-sml/CAN/blob/HEAD/src/fuzzy/losses.py","status":"ran","verification_level":1,"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, unitn-sml/CAN when it was checked","code_sha256":"7b0a3995addade31","code_sha256_prefix":"7b0a3995addade31","mcp_get_code":{"code_sha256":"7b0a3995addade31"}},{"arxiv_id":"2006.11468","arxiv_id_is_arxiv":true,"paper":"/paper/generalizing-graph-neural-networks-beyond","title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","date":"2020-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GemsLab/H2GCN","path":"h2gcn/models/H2GCN.py","file_url":"https://github.com/GemsLab/H2GCN/blob/HEAD/h2gcn/models/H2GCN.py","status":"ran","verification_level":1,"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, GemsLab/H2GCN when it was checked","code_sha256":"bdae8b092f8e8c19","code_sha256_prefix":"bdae8b092f8e8c19","mcp_get_code":{"code_sha256":"bdae8b092f8e8c19"}},{"arxiv_id":"2001.05313","arxiv_id_is_arxiv":true,"paper":"/paper/tensor-graph-convolutional-networks-for-text","title":"Tensor Graph Convolutional Networks for Text Classification","date":"2020-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thumlp/tensorgcn","path":"TGCN_2layers/layers.py","file_url":"https://github.com/thumlp/tensorgcn/blob/HEAD/TGCN_2layers/layers.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, thumlp/tensorgcn when it was checked","code_sha256":"a4c7bb0cc7c409af","code_sha256_prefix":"a4c7bb0cc7c409af","mcp_get_code":{"code_sha256":"a4c7bb0cc7c409af"}},{"arxiv_id":"1711.08576","arxiv_id_is_arxiv":true,"paper":"/paper/variational-encoding-of-complex-dynamics","title":"Variational Encoding of Complex Dynamics","date":"2017-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"msmbuilder/vde","path":"vde/vde.py","file_url":"https://github.com/msmbuilder/vde/blob/HEAD/vde/vde.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cc2e752e1e144cf6","code_sha256_prefix":"cc2e752e1e144cf6","mcp_get_code":{"code_sha256":"cc2e752e1e144cf6"}},{"arxiv_id":"1703.06103","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tkipf/gae","path":"gae/layers.py","file_url":"https://github.com/tkipf/gae/blob/HEAD/gae/layers.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":"c101076233bfcdee","code_sha256_prefix":"c101076233bfcdee","mcp_get_code":{"code_sha256":"c101076233bfcdee"}},{"arxiv_id":"1609.02907","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abi-kothapalli/minimumdominatingsets","path":"gcn/layers.py","file_url":"https://github.com/abi-kothapalli/minimumdominatingsets/blob/HEAD/gcn/layers.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":"69193fc7101cf090","code_sha256_prefix":"69193fc7101cf090","mcp_get_code":{"code_sha256":"69193fc7101cf090"}},{"arxiv_id":"1606.09375","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-networks-on-graphs-with","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","date":"2016-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ajbisberg/gcn","path":"gcn/layers.py","file_url":"https://github.com/ajbisberg/gcn/blob/HEAD/gcn/layers.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":"e643d1f9db59f99c","code_sha256_prefix":"e643d1f9db59f99c","mcp_get_code":{"code_sha256":"e643d1f9db59f99c"}},{"arxiv_id":"1605.08803","arxiv_id_is_arxiv":true,"paper":"/paper/density-estimation-using-real-nvp","title":"Density estimation using Real NVP","date":"2016-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taesung89/real-nvp","path":"real_nvp/nn.py","file_url":"https://github.com/taesung89/real-nvp/blob/HEAD/real_nvp/nn.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, taesung89/real-nvp when it was checked","code_sha256":"0e7224db7dc1693f","code_sha256_prefix":"0e7224db7dc1693f","mcp_get_code":{"code_sha256":"0e7224db7dc1693f"}},{"arxiv_id":"1312.5602","arxiv_id_is_arxiv":true,"paper":"/paper/playing-atari-with-deep-reinforcement","title":"Playing Atari with Deep Reinforcement Learning","date":"2013-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parilo/rl-server","path":"tf_rl/conv_model.py","file_url":"https://github.com/parilo/rl-server/blob/HEAD/tf_rl/conv_model.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, parilo/rl-server when it was checked","code_sha256":"13f78b113956d77f","code_sha256_prefix":"13f78b113956d77f","mcp_get_code":{"code_sha256":"13f78b113956d77f"}}],"record_sha256":"ff589bfe4e7503f08b1158a8da83605e13b8f06f32df8c6d25d8f6300997048c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}