{"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/read-table","entry":"read_table","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":7,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":4,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":5,"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":4,"ran_fixture":0,"ran":3,"unverified":1},"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":"2609.12442","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-12442","title":"3D Digital Twin Visualization of Multiclass GRF-Based Gait Disorder Classification","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"nyoico/grf-gait-3d-visualization","path":"preprocessing.py","file_url":"https://github.com/nyoico/grf-gait-3d-visualization/blob/HEAD/preprocessing.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, nyoico/grf-gait-3d-visualization when it was checked","code_sha256":"5421554b3fa1e7b0","code_sha256_prefix":"5421554b3fa1e7b0","mcp_get_code":{"code_sha256":"5421554b3fa1e7b0"}},{"arxiv_id":"2608.24229","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24229","title":"A Theory of Finite-Noise Optima and Generalization in Quantum Machine Learning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"dongsnaq/Finite-Noise-Generalization-QML","path":"code/plot_figures.py","file_url":"https://github.com/dongsnaq/Finite-Noise-Generalization-QML/blob/HEAD/code/plot_figures.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":"4654b8eea9b271c2","code_sha256_prefix":"4654b8eea9b271c2","mcp_get_code":{"code_sha256":"4654b8eea9b271c2"}},{"arxiv_id":"2606.13507","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-13507","title":"Leveraging Audio-LLMs to Filter Speech-to-Speech Training Data","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"chin-alt/S2S-Filtering","path":"src/filtering/ranker.py","file_url":"https://github.com/chin-alt/S2S-Filtering/blob/HEAD/src/filtering/ranker.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, chin-alt/S2S-Filtering when it was checked","code_sha256":"fc5b9a728becc089","code_sha256_prefix":"fc5b9a728becc089","mcp_get_code":{"code_sha256":"fc5b9a728becc089"}},{"arxiv_id":"2605.26036","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-26036","title":"CITYREP: A Unified Benchmark for Urban Representations Across Cities, Tasks, and Modalities","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"inwind0212/CityRep","path":"urban_benchmark/io.py","file_url":"https://github.com/inwind0212/CityRep/blob/HEAD/urban_benchmark/io.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, inwind0212/CityRep when it was checked","code_sha256":"74a58b9bc1daec1b","code_sha256_prefix":"74a58b9bc1daec1b","mcp_get_code":{"code_sha256":"74a58b9bc1daec1b"}},{"arxiv_id":"2604.21238","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-21238","title":"Unlocking the Power of Large Language Models for Multi-Table Entity Matching","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Ymeki/LLM4MEM","path":"data.py","file_url":"https://github.com/Ymeki/LLM4MEM/blob/HEAD/data.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, Ymeki/LLM4MEM when it was checked","code_sha256":"613d9c1d7cca1ead","code_sha256_prefix":"613d9c1d7cca1ead","mcp_get_code":{"code_sha256":"613d9c1d7cca1ead"}},{"arxiv_id":"2310.15147","arxiv_id_is_arxiv":true,"paper":"/paper/s3eval-a-synthetic-scalable-systematic","title":"S3Eval: A Synthetic, Scalable, Systematic Evaluation Suite for Large Language Models","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lfy79001/s3eval","path":"s3eval/table_utils.py","file_url":"https://github.com/lfy79001/s3eval/blob/HEAD/s3eval/table_utils.py","status":"ran","verification_level":1,"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, lfy79001/s3eval when it was checked","code_sha256":"336256046b197a5f","code_sha256_prefix":"336256046b197a5f","mcp_get_code":{"code_sha256":"336256046b197a5f"}},{"arxiv_id":"2307.03067","arxiv_id_is_arxiv":true,"paper":"/paper/deeponto-a-python-package-for-ontology","title":"DeepOnto: A Python Package for Ontology Engineering with Deep Learning","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KRR-Oxford/DeepOnto","path":"src/deeponto/utils/file_utils.py","file_url":"https://github.com/KRR-Oxford/DeepOnto/blob/HEAD/src/deeponto/utils/file_utils.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":"8082b472eef3e092","code_sha256_prefix":"8082b472eef3e092","mcp_get_code":{"code_sha256":"8082b472eef3e092"}},{"arxiv_id":"2106.06103","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-variational-autoencoder-with","title":"Conditional Variational Autoencoder with Adversarial Learning for End-to-End Text-to-Speech","date":null,"month_inferred_from_arxiv_id":"2021-06","title_source":"archive","repo":"wenet-e2e/wetts","path":"wetts/frontend/utils.py","file_url":"https://github.com/wenet-e2e/wetts/blob/HEAD/wetts/frontend/utils.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":"eb2a1b4e5d25755d","code_sha256_prefix":"eb2a1b4e5d25755d","mcp_get_code":{"code_sha256":"eb2a1b4e5d25755d"}}],"record_sha256":"7adaa806cabe9f653880dca6ede36234ef1b18cd7b04568736069e2dd9e8ab8e","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}