{"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-data-dir","entry":"get_data_dir","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":9,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":3,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":1,"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":3,"ran_fixture":0,"ran":6,"unverified":0},"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":"2602.05830","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-05830","title":"Learning Compact Boolean Networks","date":"2026-02-05","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"eth-sri/CompactLogic","path":"experiments/experiment_script.py","file_url":"https://github.com/eth-sri/CompactLogic/blob/HEAD/experiments/experiment_script.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0803d9ef52f24c28","code_sha256_prefix":"0803d9ef52f24c28","mcp_get_code":{"code_sha256":"0803d9ef52f24c28"}},{"arxiv_id":"2307.08240","arxiv_id_is_arxiv":true,"paper":"/paper/mist-cf-chemical-formula-inference-from","title":"MIST-CF: Chemical formula inference from tandem mass spectra","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samgoldman97/mist-cf","path":"src/mist_cf/common/misc_utils.py","file_url":"https://github.com/samgoldman97/mist-cf/blob/HEAD/src/mist_cf/common/misc_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":"2b795c71fe9f09a2","code_sha256_prefix":"2b795c71fe9f09a2","mcp_get_code":{"code_sha256":"2b795c71fe9f09a2"}},{"arxiv_id":"2212.01574","arxiv_id_is_arxiv":true,"paper":"/paper/calibration-and-generalizability-of","title":"Calibration and generalizability of probabilistic models on low-data chemical datasets with DIONYSUS","date":"2022-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aspuru-guzik-group/dionysus","path":"dionysus/files.py","file_url":"https://github.com/aspuru-guzik-group/dionysus/blob/HEAD/dionysus/files.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":"e2697a9a987d74b3","code_sha256_prefix":"e2697a9a987d74b3","mcp_get_code":{"code_sha256":"e2697a9a987d74b3"}},{"arxiv_id":"2206.09144","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-real-world-benchmark-datasets-an","title":"Beyond Real-world Benchmark Datasets: An Empirical Study of Node Classification with GNNs","date":"2022-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seijimaekawa/empirical-study-of-gnns","path":"models/train_model.py","file_url":"https://github.com/seijimaekawa/empirical-study-of-gnns/blob/HEAD/models/train_model.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":"1188867287351db7","code_sha256_prefix":"1188867287351db7","mcp_get_code":{"code_sha256":"1188867287351db7"}},{"arxiv_id":"2206.04564","arxiv_id_is_arxiv":true,"paper":"/paper/twibot-22-towards-graph-based-twitter-bot","title":"TwiBot-22: Towards Graph-Based Twitter Bot Detection","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LuoUndergradXJTU/TwiBot-22","path":"src/BotRGCN/twibot_20/dataset_tool.py","file_url":"https://github.com/LuoUndergradXJTU/TwiBot-22/blob/HEAD/src/BotRGCN/twibot_20/dataset_tool.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":"6f8b62e684bbd442","code_sha256_prefix":"6f8b62e684bbd442","mcp_get_code":{"code_sha256":"6f8b62e684bbd442"}},{"arxiv_id":"1908.10028","arxiv_id_is_arxiv":true,"paper":"/paper/attention-based-dropout-layer-for-weakly-1","title":"Attention-based Dropout Layer for Weakly Supervised Object Localization","date":"2019-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junsukchoe/ADL","path":"config.py","file_url":"https://github.com/junsukchoe/ADL/blob/HEAD/config.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":"c86d54788bf53e56","code_sha256_prefix":"c86d54788bf53e56","mcp_get_code":{"code_sha256":"c86d54788bf53e56"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"louis-udm/ner-bert-crf","path":"NER_BERT_CRF.py","file_url":"https://github.com/louis-udm/ner-bert-crf/blob/HEAD/NER_BERT_CRF.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":"19a646c088e51dd7","code_sha256_prefix":"19a646c088e51dd7","mcp_get_code":{"code_sha256":"19a646c088e51dd7"}},{"arxiv_id":"1803.03376","arxiv_id_is_arxiv":true,"paper":"/paper/learning-approximate-inference-networks-for","title":"Learning Approximate Inference Networks for Structured Prediction","date":"2018-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tyliupku/Arbitrary-Order-Infnet","path":"BertInfNet.py","file_url":"https://github.com/tyliupku/Arbitrary-Order-Infnet/blob/HEAD/BertInfNet.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":"2e2c2e16ce858100","code_sha256_prefix":"2e2c2e16ce858100","mcp_get_code":{"code_sha256":"2e2c2e16ce858100"}},{"arxiv_id":"1602.05629","arxiv_id_is_arxiv":true,"paper":"/paper/communication-efficient-learning-of-deep","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","date":"2016-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuangdizhu/FedGen","path":"FLAlgorithms/servers/serverpFedGen.py","file_url":"https://github.com/zhuangdizhu/FedGen/blob/HEAD/FLAlgorithms/servers/serverpFedGen.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, zhuangdizhu/FedGen when it was checked","code_sha256":"f494d00eb5149c70","code_sha256_prefix":"f494d00eb5149c70","mcp_get_code":{"code_sha256":"f494d00eb5149c70"}}],"record_sha256":"b6d65c40d0220e1930a798daf8e1d03835c5c9122fb23597f461ecd445791d65","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}