{"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/get-fname","entry":"get_fname","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":1,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":5,"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":1,"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":"2405.20543","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-general-gnn-framework-for","title":"Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenkelf/copt","path":"graphgym/configs_gen.py","file_url":"https://github.com/wenkelf/copt/blob/HEAD/graphgym/configs_gen.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, wenkelf/copt when it was checked","code_sha256":"f22df9b4f0f5f694","code_sha256_prefix":"f22df9b4f0f5f694","mcp_get_code":{"code_sha256":"f22df9b4f0f5f694"}},{"arxiv_id":"2402.11821","arxiv_id_is_arxiv":true,"paper":"/paper/microstructures-and-accuracy-of-graph-recall","title":"Microstructures and Accuracy of Graph Recall by Large Language Models","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abel0828/llm-graph-recall","path":"network_recall.py","file_url":"https://github.com/abel0828/llm-graph-recall/blob/HEAD/network_recall.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, abel0828/llm-graph-recall when it was checked","code_sha256":"11cba458079c4ef0","code_sha256_prefix":"11cba458079c4ef0","mcp_get_code":{"code_sha256":"11cba458079c4ef0"}},{"arxiv_id":"2312.04693","arxiv_id_is_arxiv":true,"paper":"/paper/graphmetro-mitigating-complex-distribution","title":"GraphMETRO: Mitigating Complex Graph Distribution Shifts via Mixture of Aligned Experts","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wuyxin/graphmetro","path":"graphmetro/config.py","file_url":"https://github.com/wuyxin/graphmetro/blob/HEAD/graphmetro/config.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, wuyxin/graphmetro when it was checked","code_sha256":"00c77e7f9cc8177c","code_sha256_prefix":"00c77e7f9cc8177c","mcp_get_code":{"code_sha256":"00c77e7f9cc8177c"}},{"arxiv_id":"2312.01537","arxiv_id_is_arxiv":true,"paper":"/paper/unlocking-the-potential-of-federated-learning-1","title":"Unlocking the Potential of Federated Learning: The Symphony of Dataset Distillation via Deep Generative Latents","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"feddg23/feddg-main","path":"fed_main.py","file_url":"https://github.com/feddg23/feddg-main/blob/HEAD/fed_main.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, feddg23/feddg-main when it was checked","code_sha256":"c82bc162f7258c96","code_sha256_prefix":"c82bc162f7258c96","mcp_get_code":{"code_sha256":"c82bc162f7258c96"}},{"arxiv_id":"2309.06642","arxiv_id_is_arxiv":true,"paper":"/paper/adapt-and-diffuse-sample-adaptive","title":"Adapt and Diffuse: Sample-adaptive Reconstruction via Latent Diffusion Models","date":"2023-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"z-fabian/flash-diffusion","path":"data_utils/image_data.py","file_url":"https://github.com/z-fabian/flash-diffusion/blob/HEAD/data_utils/image_data.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, z-fabian/flash-diffusion when it was checked","code_sha256":"f8dee44cef535c69","code_sha256_prefix":"f8dee44cef535c69","mcp_get_code":{"code_sha256":"f8dee44cef535c69"}}],"record_sha256":"65741e72d6a80608058a32ba778bd642cee74453ab6da9d3d71ad34786056135","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}