{"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/loaddata","entry":"loadData","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":8,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":8,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":3},"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":"2412.09972","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-large-scale-traffic-forecasting","title":"Efficient Large-Scale Traffic Forecasting with Transformers: A Spatial Data Management Perspective","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmissher/stgnn","path":"utils.py","file_url":"https://github.com/lmissher/stgnn/blob/HEAD/utils.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":"78c234f574a9d6a2","code_sha256_prefix":"78c234f574a9d6a2","mcp_get_code":{"code_sha256":"78c234f574a9d6a2"}},{"arxiv_id":"2303.06582","arxiv_id_is_arxiv":true,"paper":"/paper/certifiably-correct-control-policies-for-safe","title":"Certifiably-correct Control Policies for Safe Learning and Adaptation in Assistive Robotics","date":null,"month_inferred_from_arxiv_id":"2023-03","title_source":"archive","repo":"k1majd/nnreplayer","path":"examples/global_constraint/00_net_train.py","file_url":"https://github.com/k1majd/nnreplayer/blob/HEAD/examples/global_constraint/00_net_train.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":"9578914dede7bd2d","code_sha256_prefix":"9578914dede7bd2d","mcp_get_code":{"code_sha256":"9578914dede7bd2d"}},{"arxiv_id":"2105.12807","arxiv_id_is_arxiv":true,"paper":"/paper/xomivae-an-interpretable-deep-learning-model","title":"XOmiVAE: an interpretable deep learning model for cancer classification using high-dimensional omics data","date":"2021-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangxiaoyu11/XOmiVAE","path":"generalHelperFunctions.py","file_url":"https://github.com/zhangxiaoyu11/XOmiVAE/blob/HEAD/generalHelperFunctions.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":"210c497043b3fceb","code_sha256_prefix":"210c497043b3fceb","mcp_get_code":{"code_sha256":"210c497043b3fceb"}},{"arxiv_id":"1911.08415","arxiv_id_is_arxiv":true,"paper":"/paper/gman-a-graph-multi-attention-network-for","title":"GMAN: A Graph Multi-Attention Network for Traffic Prediction","date":"2019-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengchuanpan/GMAN","path":"METR/utils.py","file_url":"https://github.com/zhengchuanpan/GMAN/blob/HEAD/METR/utils.py","status":"unverified","verification_level":0,"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":"78c234f574a9d6a2","code_sha256_prefix":"78c234f574a9d6a2","mcp_get_code":{"code_sha256":"78c234f574a9d6a2"}},{"arxiv_id":"1911.01840","arxiv_id_is_arxiv":true,"paper":"/paper/who-is-real-bob-adversarial-attacks-on","title":"Who is Real Bob? Adversarial Attacks on Speaker Recognition Systems","date":"2019-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FAKEBOB-adversarial-attack/FAKEBOB","path":"attackMain.py","file_url":"https://github.com/FAKEBOB-adversarial-attack/FAKEBOB/blob/HEAD/attackMain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"84d934427350bc0c","code_sha256_prefix":"84d934427350bc0c","mcp_get_code":{"code_sha256":"84d934427350bc0c"}},{"arxiv_id":"1812.04361","arxiv_id_is_arxiv":true,"paper":"/paper/reside-improving-distantly-supervised-neural","title":"RESIDE: Improving Distantly-Supervised Neural Relation Extraction using Side Information","date":"2018-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"malllabiisc/RESIDE","path":"plot_pr.py","file_url":"https://github.com/malllabiisc/RESIDE/blob/HEAD/plot_pr.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":"ac3496d141a15c60","code_sha256_prefix":"ac3496d141a15c60","mcp_get_code":{"code_sha256":"ac3496d141a15c60"}},{"arxiv_id":"1802.03916","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-and-correcting-for-label-shift-with","title":"Detecting and Correcting for Label Shift with Black Box Predictors","date":"2018-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bbwang1030/half-kfn","path":"utils/data_utils.py","file_url":"https://github.com/bbwang1030/half-kfn/blob/HEAD/utils/data_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, bbwang1030/half-kfn when it was checked","code_sha256":"ba24376d82f40ac8","code_sha256_prefix":"ba24376d82f40ac8","mcp_get_code":{"code_sha256":"ba24376d82f40ac8"}},{"arxiv_id":"1509.09292","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-networks-on-graphs-for-learning","title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","date":"2015-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SystemicCypher/Neural-Molecule-Fingerprints","path":"src/neuralPrint.py","file_url":"https://github.com/SystemicCypher/Neural-Molecule-Fingerprints/blob/HEAD/src/neuralPrint.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":"5d5b5d58823facc2","code_sha256_prefix":"5d5b5d58823facc2","mcp_get_code":{"code_sha256":"5d5b5d58823facc2"}}],"record_sha256":"8b3d32ee51175ca7cd5b1eae3ee63fab769ef8eab3da3ae52732c9db7e99631c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}