{"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/load-yaml-file","entry":"load_yaml_file","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":7,"n_papers_ran_no_instrument_failure":4,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":4,"unverified":2},"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.10891","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10891","title":"Benchmarking Synthetic Time Series Generation Methods for Privacy-Preserving Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Amorim009/Grasynda","path":"src/timevae/data_utils.py","file_url":"https://github.com/Amorim009/Grasynda/blob/HEAD/src/timevae/data_utils.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, Amorim009/Grasynda when it was checked","code_sha256":"55cbda5ae15d39e5","code_sha256_prefix":"55cbda5ae15d39e5","mcp_get_code":{"code_sha256":"55cbda5ae15d39e5"}},{"arxiv_id":"2410.12032","arxiv_id_is_arxiv":true,"paper":"/paper/mlperf-power-benchmarking-the-energy","title":"MLPerf Power: Benchmarking the Energy Efficiency of Machine Learning Systems from Microwatts to Megawatts for Sustainable AI","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ctuning/ck","path":"ck/ck/files.py","file_url":"https://github.com/ctuning/ck/blob/HEAD/ck/ck/files.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":"4c31947026face45","code_sha256_prefix":"4c31947026face45","mcp_get_code":{"code_sha256":"4c31947026face45"}},{"arxiv_id":"2405.16405","arxiv_id_is_arxiv":true,"paper":"/paper/intruding-with-words-towards-understanding","title":"Intruding with Words: Towards Understanding Graph Injection Attacks at the Text Level","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Leirunlin/Text-level-Graph-Attack","path":"api.py","file_url":"https://github.com/Leirunlin/Text-level-Graph-Attack/blob/HEAD/api.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, Leirunlin/Text-level-Graph-Attack when it was checked","code_sha256":"2c594a3c725da903","code_sha256_prefix":"2c594a3c725da903","mcp_get_code":{"code_sha256":"2c594a3c725da903"}},{"arxiv_id":"2310.08585","arxiv_id_is_arxiv":true,"paper":"/paper/im4d-high-fidelity-and-real-time-novel-view","title":"Im4D: High-Fidelity and Real-Time Novel View Synthesis for Dynamic Scenes","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zju3dv/im4d","path":"lib/config/config.py","file_url":"https://github.com/zju3dv/im4d/blob/HEAD/lib/config/config.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, zju3dv/im4d (NOASSERTION)","code_sha256":"411a24e38dae9a0d","code_sha256_prefix":"411a24e38dae9a0d","mcp_get_code":{"code_sha256":"411a24e38dae9a0d"}},{"arxiv_id":"2310.04870","arxiv_id_is_arxiv":true,"paper":"/paper/lemur-integrating-large-language-models-in","title":"Lemur: Integrating Large Language Models in Automated Program Verification","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wu-haoze/lemur-program-verification","path":"lemur/src/verifier.py","file_url":"https://github.com/wu-haoze/lemur-program-verification/blob/HEAD/lemur/src/verifier.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, wu-haoze/lemur-program-verification when it was checked","code_sha256":"68adc1be6882b87c","code_sha256_prefix":"68adc1be6882b87c","mcp_get_code":{"code_sha256":"68adc1be6882b87c"}},{"arxiv_id":"2309.16595","arxiv_id_is_arxiv":true,"paper":"/paper/can-llms-effectively-leverage-structural","title":"Can LLMs Effectively Leverage Graph Structural Information through Prompts, and Why?","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CurryTang/Graph-LLM","path":"api.py","file_url":"https://github.com/CurryTang/Graph-LLM/blob/HEAD/api.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":"14306190576e01d0","code_sha256_prefix":"14306190576e01d0","mcp_get_code":{"code_sha256":"14306190576e01d0"}},{"arxiv_id":"2212.14518","arxiv_id_is_arxiv":true,"paper":"/paper/resgrad-residual-denoising-diffusion","title":"ResGrad: Residual Denoising Diffusion Probabilistic Models for Text to Speech","date":"2022-12-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"majidAdibian77/ResGrad","path":"utils.py","file_url":"https://github.com/majidAdibian77/ResGrad/blob/HEAD/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":"8db92bb5bc44496b","code_sha256_prefix":"8db92bb5bc44496b","mcp_get_code":{"code_sha256":"8db92bb5bc44496b"}},{"arxiv_id":"2212.10496","arxiv_id_is_arxiv":true,"paper":"/paper/precise-zero-shot-dense-retrieval-without","title":"Precise Zero-Shot Dense Retrieval without Relevance Labels","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snexus/llm-search","path":"src/llmsearch/config.py","file_url":"https://github.com/snexus/llm-search/blob/HEAD/src/llmsearch/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":"cb568e26896d5126","code_sha256_prefix":"cb568e26896d5126","mcp_get_code":{"code_sha256":"cb568e26896d5126"}},{"arxiv_id":"2111.08095","arxiv_id_is_arxiv":true,"paper":"/paper/timevae-a-variational-auto-encoder-for-1","title":"TimeVAE: A Variational Auto-Encoder for Multivariate Time Series Generation","date":"2021-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abudesai/timeVAE","path":"src/data_utils.py","file_url":"https://github.com/abudesai/timeVAE/blob/HEAD/src/data_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Amorim009/Grasynda, and GitHub detected no licence in that repository when it was checked","code_sha256":"55cbda5ae15d39e5","code_sha256_prefix":"55cbda5ae15d39e5","mcp_get_code":{"code_sha256":"55cbda5ae15d39e5"}}],"record_sha256":"a4d3754fc42335476782ea06a0d36f8cb184acbb68a39f0ad543f7ca1b010353","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}