{"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/run-cmd","entry":"run_cmd","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":10,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":6,"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":10,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":4,"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":6,"ran_fixture":0,"ran":4,"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":"2608.10349","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10349","title":"Beyond Detection Accuracy: Measuring Explanation Cost, Stability, and Utility for Resource-Aware IoT Intrusion Detection","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"AbdurrahmanTolay/resource-aware-iot-xai","path":"src/final_empirical_completeness_audit.py","file_url":"https://github.com/AbdurrahmanTolay/resource-aware-iot-xai/blob/HEAD/src/final_empirical_completeness_audit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, AbdurrahmanTolay/resource-aware-iot-xai when it was checked","code_sha256":"0936286bc7b2f2dc","code_sha256_prefix":"0936286bc7b2f2dc","mcp_get_code":{"code_sha256":"0936286bc7b2f2dc"}},{"arxiv_id":"2608.00909","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-00909","title":"FinHardBench: Can LLMs Generate Latency-Aware Hardware for Financial Computing?","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"owenfucell/FinHardBench","path":"system/experiment_driver.py","file_url":"https://github.com/owenfucell/FinHardBench/blob/HEAD/system/experiment_driver.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9f13417811c6ffad","code_sha256_prefix":"9f13417811c6ffad","mcp_get_code":{"code_sha256":"9f13417811c6ffad"}},{"arxiv_id":"2606.23870","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-23870","title":"ESBMC-PLC+: A Unified IEC 61131-3 Formal Verification Framework as a PLCverif Successor","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"pierredantas/esbmc-plcplus-artifact","path":"experiments/nuxmv_comparison/run_remaining.py","file_url":"https://github.com/pierredantas/esbmc-plcplus-artifact/blob/HEAD/experiments/nuxmv_comparison/run_remaining.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, pierredantas/esbmc-plcplus-artifact when it was checked","code_sha256":"f9a03ecfdee197e5","code_sha256_prefix":"f9a03ecfdee197e5","mcp_get_code":{"code_sha256":"f9a03ecfdee197e5"}},{"arxiv_id":"2606.05400","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-05400","title":"LeanMarathon: Toward Reliable AI Co-Mathematicians through Long-Horizon Lean Autoformalization","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"YuanheZ/LeanMarathon","path":".scripts/per_node_worker_loop.py","file_url":"https://github.com/YuanheZ/LeanMarathon/blob/HEAD/.scripts/per_node_worker_loop.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"28c4e0f933f99ae5","code_sha256_prefix":"28c4e0f933f99ae5","mcp_get_code":{"code_sha256":"28c4e0f933f99ae5"}},{"arxiv_id":"2606.05067","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-05067","title":"FLAGG: Flexible Autoregressive Graph Generation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"CognacS/flagg-graphgen","path":"auto_script.py","file_url":"https://github.com/CognacS/flagg-graphgen/blob/HEAD/auto_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":"af53f7d96fa64b66","code_sha256_prefix":"af53f7d96fa64b66","mcp_get_code":{"code_sha256":"af53f7d96fa64b66"}},{"arxiv_id":"2604.23466","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-23466","title":"Evaluating CUDA Tile for AI Workloads on Hopper and Blackwell GPUs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"uwm-se/CuTile","path":"code_B200/collect_hw_spec.py","file_url":"https://github.com/uwm-se/CuTile/blob/HEAD/code_B200/collect_hw_spec.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, uwm-se/CuTile when it was checked","code_sha256":"f1ce28c4e976e504","code_sha256_prefix":"f1ce28c4e976e504","mcp_get_code":{"code_sha256":"f1ce28c4e976e504"}},{"arxiv_id":"2312.00191","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-ligand-pose-sampling-for-molecular","title":"Enhancing Ligand Pose Sampling for Molecular Docking","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drorlab/GLOW_IVES","path":"glow_ives/utils/utils.py","file_url":"https://github.com/drorlab/GLOW_IVES/blob/HEAD/glow_ives/utils/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":"0bac86fcc851f6b7","code_sha256_prefix":"0bac86fcc851f6b7","mcp_get_code":{"code_sha256":"0bac86fcc851f6b7"}},{"arxiv_id":"2008.13583","arxiv_id_is_arxiv":true,"paper":"/paper/mapping-new-informal-settlements-using","title":"Mapping New Informal Settlements using Machine Learning and Time Series Satellite Images: An Application in the Venezuelan Migration Crisis","date":null,"month_inferred_from_arxiv_id":"2020-08","title_source":"archive","repo":"thinkingmachines/geoai-immap","path":"utils/geoutils.py","file_url":"https://github.com/thinkingmachines/geoai-immap/blob/HEAD/utils/geoutils.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":"7ef83003ed4630fb","code_sha256_prefix":"7ef83003ed4630fb","mcp_get_code":{"code_sha256":"7ef83003ed4630fb"}},{"arxiv_id":"2004.08532","arxiv_id_is_arxiv":true,"paper":"/paper/dgl-ke-training-knowledge-graph-embeddings-at","title":"DGL-KE: Training Knowledge Graph Embeddings at Scale","date":null,"month_inferred_from_arxiv_id":"2020-04","title_source":"archive","repo":"awslabs/dgl-ke","path":"python/dglke/dist_train.py","file_url":"https://github.com/awslabs/dgl-ke/blob/HEAD/python/dglke/dist_train.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":"13997ea0dc0416ad","code_sha256_prefix":"13997ea0dc0416ad","mcp_get_code":{"code_sha256":"13997ea0dc0416ad"}},{"arxiv_id":"1910.04540","arxiv_id_is_arxiv":true,"paper":"/paper/qpytorch-a-low-precision-arithmetic","title":"QPyTorch: A Low-Precision Arithmetic Simulation Framework","date":"2019-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robust-systems-group/illusion_system","path":"illusion_paper_sim/util.py","file_url":"https://github.com/robust-systems-group/illusion_system/blob/HEAD/illusion_paper_sim/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d10217a422916a6e","code_sha256_prefix":"d10217a422916a6e","mcp_get_code":{"code_sha256":"d10217a422916a6e"}}],"record_sha256":"5aef4e82d7fc99d14e4dfc3128736494128e01684be17e97ca5022232db6d8c5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}