{"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/draw","entry":"draw","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":10,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":6,"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":10,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":5,"n_places":10,"n_places_pointer_only":3,"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":1,"ran":6,"unverified":2},"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":"2606.11098","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-11098","title":"Do Transformers Actually Help Intrusion Detection? A Temporal Sequence Evaluation on CIC-IDS2017","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"zachmocz/temporal-ids-bench","path":"figures/regen_perclass_recall.py","file_url":"https://github.com/zachmocz/temporal-ids-bench/blob/HEAD/figures/regen_perclass_recall.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, zachmocz/temporal-ids-bench when it was checked","code_sha256":"dd584b4bbd1977d5","code_sha256_prefix":"dd584b4bbd1977d5","mcp_get_code":{"code_sha256":"dd584b4bbd1977d5"}},{"arxiv_id":"2606.10781","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10781","title":"Recovering the Zipfian Distribution in Unsupervised Term Discovery","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"adendorffy/zipf-clus","path":"bayes_gmm/fbgmm.py","file_url":"https://github.com/adendorffy/zipf-clus/blob/HEAD/bayes_gmm/fbgmm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, adendorffy/zipf-clus when it was checked","code_sha256":"e7c64745ca79a222","code_sha256_prefix":"e7c64745ca79a222","mcp_get_code":{"code_sha256":"e7c64745ca79a222"}},{"arxiv_id":"2303.09079","arxiv_id_is_arxiv":true,"paper":"/paper/ssl-cleanse-trojan-detection-and-mitigation","title":"SSL-Cleanse: Trojan Detection and Mitigation in Self-Supervised Learning","date":"2023-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucf-ml-research/ssl-cleanse","path":"detector/core/utils.py","file_url":"https://github.com/ucf-ml-research/ssl-cleanse/blob/HEAD/detector/core/utils.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":"68cda5db67f7fd9b","code_sha256_prefix":"68cda5db67f7fd9b","mcp_get_code":{"code_sha256":"68cda5db67f7fd9b"}},{"arxiv_id":"2203.11931","arxiv_id_is_arxiv":true,"paper":"/paper/metamorph-learning-universal-controllers-with-1","title":"MetaMorph: Learning Universal Controllers with Transformers","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyf1530588058/HeteroMorpheus","path":"evogym/utils.py","file_url":"https://github.com/hyf1530588058/HeteroMorpheus/blob/HEAD/evogym/utils.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":"732322b44ab8c283","code_sha256_prefix":"732322b44ab8c283","mcp_get_code":{"code_sha256":"732322b44ab8c283"}},{"arxiv_id":"2104.07908","arxiv_id_is_arxiv":true,"paper":"/paper/metaxl-meta-representation-transformation-for","title":"MetaXL: Meta Representation Transformation for Low-resource Cross-lingual Learning","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liatb282/metaxlr","path":"mtrain.py","file_url":"https://github.com/liatb282/metaxlr/blob/HEAD/mtrain.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, liatb282/metaxlr, 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":"ea581ea3f25dd281","code_sha256_prefix":"ea581ea3f25dd281","mcp_get_code":{"code_sha256":"ea581ea3f25dd281"}},{"arxiv_id":"2005.08392","arxiv_id_is_arxiv":true,"paper":"/paper/vector-quantized-autoregressive-predictive","title":"Vector-Quantized Autoregressive Predictive Coding","date":"2020-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alexander-H-Liu/NPC","path":"src/util.py","file_url":"https://github.com/Alexander-H-Liu/NPC/blob/HEAD/src/util.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":"db0929d572d1fd1c","code_sha256_prefix":"db0929d572d1fd1c","mcp_get_code":{"code_sha256":"db0929d572d1fd1c"}},{"arxiv_id":"1906.08878","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-optimisation-over-multiple","title":"Bayesian Optimisation over Multiple Continuous and Categorical Inputs","date":"2019-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rubinxin/CoCaBO_code","path":"utils/probability.py","file_url":"https://github.com/rubinxin/CoCaBO_code/blob/HEAD/utils/probability.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":"c075d558bd7d9550","code_sha256_prefix":"c075d558bd7d9550","mcp_get_code":{"code_sha256":"c075d558bd7d9550"}},{"arxiv_id":"1808.09442","arxiv_id_is_arxiv":true,"paper":"/paper/discriminative-deep-dyna-q-robust-planning","title":"Discriminative Deep Dyna-Q: Robust Planning for Dialogue Policy Learning","date":"2018-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yuqing2018/D3Q_Python3","path":"D3Q/src/draw_figure.py","file_url":"https://github.com/Yuqing2018/D3Q_Python3/blob/HEAD/D3Q/src/draw_figure.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":"a97a8e0856ccb2bc","code_sha256_prefix":"a97a8e0856ccb2bc","mcp_get_code":{"code_sha256":"a97a8e0856ccb2bc"}},{"arxiv_id":"1504.06375","arxiv_id_is_arxiv":true,"paper":"/paper/holistically-nested-edge-detection","title":"Holistically-Nested Edge Detection","date":"2015-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alessandrozamberletti/docdetect","path":"docdetect/processor.py","file_url":"https://github.com/alessandrozamberletti/docdetect/blob/HEAD/docdetect/processor.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":"628f3b8a5f4d8e08","code_sha256_prefix":"628f3b8a5f4d8e08","mcp_get_code":{"code_sha256":"628f3b8a5f4d8e08"}},{"arxiv_id":"1412.4869","arxiv_id_is_arxiv":true,"paper":"/paper/expectation-propagation-as-a-way-of-life-a","title":"Expectation propagation as a way of life: A framework for Bayesian inference on partitioned data","date":"2014-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rhayes777/PyAutoFit","path":"autofit/model_figure/render.py","file_url":"https://github.com/rhayes777/PyAutoFit/blob/HEAD/autofit/model_figure/render.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":"f843adaaba33480c","code_sha256_prefix":"f843adaaba33480c","mcp_get_code":{"code_sha256":"f843adaaba33480c"}}],"record_sha256":"9a1627d3b48ae54246c7a1c8793c37cdd1dd10113807f2eee590e334f2422f1b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}