{"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/debug","entry":"debug","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":2,"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":8,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":0,"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":2,"ran_fixture":0,"ran":2,"unverified":4},"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":"2604.02344","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-02344","title":"Characterizing WebGPU Dispatch Overhead for LLM Inference Across Four GPU Vendors, Three Backends, and Three Browsers","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"jmaczan/torch-webgpu","path":"python/torch_webgpu/compiler/lowering.py","file_url":"https://github.com/jmaczan/torch-webgpu/blob/HEAD/python/torch_webgpu/compiler/lowering.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":"780c4d46a0614bb8","code_sha256_prefix":"780c4d46a0614bb8","mcp_get_code":{"code_sha256":"780c4d46a0614bb8"}},{"arxiv_id":"2507.02843","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.02843","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"AliciaCurth/CATENets","path":"catenets/models/jax/disentangled_nets.py","file_url":"https://github.com/AliciaCurth/CATENets/blob/HEAD/catenets/models/jax/disentangled_nets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ca831414e115b946","code_sha256_prefix":"ca831414e115b946","mcp_get_code":{"code_sha256":"ca831414e115b946"}},{"arxiv_id":"2410.14066","arxiv_id_is_arxiv":true,"paper":"/paper/lightweight-correlation-aware-table","title":"Lightweight Correlation-Aware Table Compression","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utndatasystems/virtual","path":"virtual/expr_parser.py","file_url":"https://github.com/utndatasystems/virtual/blob/HEAD/virtual/expr_parser.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":"7b5dcb4a12862adc","code_sha256_prefix":"7b5dcb4a12862adc","mcp_get_code":{"code_sha256":"7b5dcb4a12862adc"}},{"arxiv_id":"2402.16315","arxiv_id_is_arxiv":true,"paper":"/paper/finer-investigating-and-enhancing-fine","title":"Finer: Investigating and Enhancing Fine-Grained Visual Concept Recognition in Large Vision Language Models","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goldsmith/Wikipedia","path":"wikipedia/util.py","file_url":"https://github.com/goldsmith/Wikipedia/blob/HEAD/wikipedia/util.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":"75593632005faa52","code_sha256_prefix":"75593632005faa52","mcp_get_code":{"code_sha256":"75593632005faa52"}},{"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/decorators.py","file_url":"https://github.com/KRR-Oxford/DeepOnto/blob/HEAD/src/deeponto/utils/decorators.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":"01e6eb3a49981088","code_sha256_prefix":"01e6eb3a49981088","mcp_get_code":{"code_sha256":"01e6eb3a49981088"}},{"arxiv_id":"2210.11298","arxiv_id_is_arxiv":true,"paper":"/paper/tele-knowledge-pre-training-for-fault","title":"Tele-Knowledge Pre-training for Fault Analysis","date":"2022-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hackerchenzhuo/ktelebert","path":"KTeleBERT/model/HWBert.py","file_url":"https://github.com/hackerchenzhuo/ktelebert/blob/HEAD/KTeleBERT/model/HWBert.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":"82954c7f58e9d215","code_sha256_prefix":"82954c7f58e9d215","mcp_get_code":{"code_sha256":"82954c7f58e9d215"}},{"arxiv_id":"2108.13679","arxiv_id_is_arxiv":true,"paper":"/paper/task-oriented-dialogue-system-as-natural","title":"Task-Oriented Dialogue System as Natural Language Generation","date":"2021-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"victorwz/tod_as_nlg","path":"Convlab/convlab/lib/logger.py","file_url":"https://github.com/victorwz/tod_as_nlg/blob/HEAD/Convlab/convlab/lib/logger.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":"fa12706c86824fb1","code_sha256_prefix":"fa12706c86824fb1","mcp_get_code":{"code_sha256":"fa12706c86824fb1"}},{"arxiv_id":"1912.12482","arxiv_id_is_arxiv":true,"paper":"/paper/slm-lab-a-comprehensive-benchmark-and-modular-1","title":"SLM Lab: A Comprehensive Benchmark and Modular Software Framework for Reproducible Deep Reinforcement Learning","date":"2019-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kengz/SLM-Lab","path":"slm_lab/lib/logger.py","file_url":"https://github.com/kengz/SLM-Lab/blob/HEAD/slm_lab/lib/logger.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":"b5c2a41c3a816ab2","code_sha256_prefix":"b5c2a41c3a816ab2","mcp_get_code":{"code_sha256":"b5c2a41c3a816ab2"}}],"record_sha256":"a4a7d188a9228294ee5b81d75d7e4fdb964a8ecdfd80f44855d8fac110f9fc34","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}