{"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/eval-epoch","entry":"eval_epoch","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":9,"n_papers_ran_no_instrument_failure":7,"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":12,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":8,"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":4,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":5},"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.08958","arxiv_id_is_arxiv":true,"paper":"/paper/biologically-plausible-brain-graph","title":"Biologically Plausible Brain Graph Transformer","date":"2025-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pcyyyy/biobgt","path":"experiments/train_ADHD.py","file_url":"https://github.com/pcyyyy/biobgt/blob/HEAD/experiments/train_ADHD.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, pcyyyy/biobgt when it was checked","code_sha256":"05d8b561b1e35282","code_sha256_prefix":"05d8b561b1e35282","mcp_get_code":{"code_sha256":"05d8b561b1e35282"}},{"arxiv_id":"2403.06495","arxiv_id_is_arxiv":true,"paper":"/paper/toward-generalist-anomaly-detection-via-in","title":"Toward Generalist Anomaly Detection via In-context Residual Learning with Few-shot Sample Prompts","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mala-lab/inctrl","path":"engine_IC.py","file_url":"https://github.com/mala-lab/inctrl/blob/HEAD/engine_IC.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":"4405aae96cb9935e","code_sha256_prefix":"4405aae96cb9935e","mcp_get_code":{"code_sha256":"4405aae96cb9935e"}},{"arxiv_id":"2401.11174","arxiv_id_is_arxiv":true,"paper":"/paper/pixel-wise-recognition-for-holistic-surgical","title":"Pixel-Wise Recognition for Holistic Surgical Scene Understanding","date":"2024-01-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bcv-uniandes/matis","path":"tools/train_net.py","file_url":"https://github.com/bcv-uniandes/matis/blob/HEAD/tools/train_net.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, bcv-uniandes/matis when it was checked","code_sha256":"e1aeddec06db2326","code_sha256_prefix":"e1aeddec06db2326","mcp_get_code":{"code_sha256":"e1aeddec06db2326"}},{"arxiv_id":"2306.09368","arxiv_id_is_arxiv":true,"paper":"/paper/warpformer-a-multi-scale-modeling-approach","title":"Warpformer: A Multi-scale Modeling Approach for Irregular Clinical Time Series","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"imjiawen/warpformer","path":"Main_warp.py","file_url":"https://github.com/imjiawen/warpformer/blob/HEAD/Main_warp.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":"479885353ad48e2d","code_sha256_prefix":"479885353ad48e2d","mcp_get_code":{"code_sha256":"479885353ad48e2d"}},{"arxiv_id":"2303.09514","arxiv_id_is_arxiv":true,"paper":"/paper/matis-masked-attention-transformers-for","title":"MATIS: Masked-Attention Transformers for Surgical Instrument Segmentation","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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":"e1aeddec06db2326","code_sha256_prefix":"e1aeddec06db2326","mcp_get_code":{"code_sha256":"e1aeddec06db2326"}},{"arxiv_id":"2303.01028","arxiv_id_is_arxiv":true,"paper":"/paper/specformer-spectral-graph-neural-networks","title":"Specformer: Spectral Graph Neural Networks Meet Transformers","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DSL-Lab/Specformer","path":"Graph/dgl_main.py","file_url":"https://github.com/DSL-Lab/Specformer/blob/HEAD/Graph/dgl_main.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"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, DSL-Lab/Specformer, is not in the permissive set Syntology serves inline","code_sha256":"09db41041e34432f","code_sha256_prefix":"09db41041e34432f","mcp_get_code":{"code_sha256":"09db41041e34432f"}},{"arxiv_id":"2202.03036","arxiv_id_is_arxiv":true,"paper":"/paper/structure-aware-transformer-for-graph","title":"Structure-Aware Transformer for Graph Representation Learning","date":"2022-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"borgwardtlab/sat","path":"experiments/train_zinc.py","file_url":"https://github.com/borgwardtlab/sat/blob/HEAD/experiments/train_zinc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"324691a9739115fa","code_sha256_prefix":"324691a9739115fa","mcp_get_code":{"code_sha256":"324691a9739115fa"}},{"arxiv_id":"2201.01212","arxiv_id_is_arxiv":true,"paper":"/paper/autobalance-optimized-loss-functions-for-1","title":"AutoBalance: Optimized Loss Functions for Imbalanced Data","date":"2022-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucr-optml/autobalance","path":"core/trainer.py","file_url":"https://github.com/ucr-optml/autobalance/blob/HEAD/core/trainer.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":"41d10ece707b44af","code_sha256_prefix":"41d10ece707b44af","mcp_get_code":{"code_sha256":"41d10ece707b44af"}},{"arxiv_id":"1911.08655","arxiv_id_is_arxiv":true,"paper":"/paper/towards-physics-informed-deep-learning-for-1","title":"Towards Physics-informed Deep Learning for Turbulent Flow Prediction","date":"2019-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Rose-STL-Lab/Turbulent-Flow-Net","path":"utils/train_utils.py","file_url":"https://github.com/Rose-STL-Lab/Turbulent-Flow-Net/blob/HEAD/utils/train_utils.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, Rose-STL-Lab/Turbulent-Flow-Net when it was checked","code_sha256":"669c40a8f674ab74","code_sha256_prefix":"669c40a8f674ab74","mcp_get_code":{"code_sha256":"669c40a8f674ab74"}},{"arxiv_id":"1812.01819","arxiv_id_is_arxiv":true,"paper":"/paper/feature-matters-a-stage-by-stage-approach-for","title":"An Embarrassingly Simple Approach for Knowledge Distillation","date":"2018-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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":"7308ca9b35a3b212","code_sha256_prefix":"7308ca9b35a3b212","mcp_get_code":{"code_sha256":"7308ca9b35a3b212"}},{"arxiv_id":"1804.07729","arxiv_id_is_arxiv":true,"paper":"/paper/adef-an-iterative-algorithm-to-construct","title":"ADef: an Iterative Algorithm to Construct Adversarial Deformations","date":"2018-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MashmallowWoR/AdversarialDeformation","path":"train_mnist.py","file_url":"https://github.com/MashmallowWoR/AdversarialDeformation/blob/HEAD/train_mnist.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c0b68da7a768055c","code_sha256_prefix":"c0b68da7a768055c","mcp_get_code":{"code_sha256":"c0b68da7a768055c"}},{"arxiv_id":"1609.05473","arxiv_id_is_arxiv":true,"paper":"/paper/seqgan-sequence-generative-adversarial-nets","title":"SeqGAN: Sequence Generative Adversarial Nets with Policy Gradient","date":"2016-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"medtray/SeqGAN-vs-MLE-vs-PG-BLEU-vs-ScheduleSampling","path":"seq_gan_different_disc.py","file_url":"https://github.com/medtray/SeqGAN-vs-MLE-vs-PG-BLEU-vs-ScheduleSampling/blob/HEAD/seq_gan_different_disc.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, medtray/SeqGAN-vs-MLE-vs-PG-BLEU-vs-ScheduleSampling when it was checked","code_sha256":"b3ce81cc1e76607b","code_sha256_prefix":"b3ce81cc1e76607b","mcp_get_code":{"code_sha256":"b3ce81cc1e76607b"}},{"arxiv_id":"1609.05473","arxiv_id_is_arxiv":true,"paper":"/paper/seqgan-sequence-generative-adversarial-nets","title":"SeqGAN: Sequence Generative Adversarial Nets with Policy Gradient","date":"2016-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"medtray/SeqGAN-vs-MLE-vs-PG-BLEU-vs-ScheduleSampling","path":"seq_gan_real_data.py","file_url":"https://github.com/medtray/SeqGAN-vs-MLE-vs-PG-BLEU-vs-ScheduleSampling/blob/HEAD/seq_gan_real_data.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, medtray/SeqGAN-vs-MLE-vs-PG-BLEU-vs-ScheduleSampling when it was checked","code_sha256":"f677dc5ff6c9c370","code_sha256_prefix":"f677dc5ff6c9c370","mcp_get_code":{"code_sha256":"f677dc5ff6c9c370"}},{"arxiv_id":"1503.02531","arxiv_id_is_arxiv":true,"paper":"/paper/distilling-the-knowledge-in-a-neural-network","title":"Distilling the Knowledge in a Neural Network","date":"2015-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stdereka/knowledge-distillation","path":"training.py","file_url":"https://github.com/stdereka/knowledge-distillation/blob/HEAD/training.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":"7308ca9b35a3b212","code_sha256_prefix":"7308ca9b35a3b212","mcp_get_code":{"code_sha256":"7308ca9b35a3b212"}}],"record_sha256":"03e0fab119004968a55a9f808ac421bc6953d8371ff877ece96e06ea69a912e7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}