{"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/unflatten","entry":"unflatten","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":15,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":5,"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":15,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":16,"n_places_pointer_only":7,"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":8,"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":"2510.19934","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-19934","title":"Mitigating Privacy-Utility Trade-off in Decentralized Federated Learning via f -Differential Privacy","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"lx10077/PN-f-DP","path":"corelated_noises/misc.py","file_url":"https://github.com/lx10077/PN-f-DP/blob/HEAD/corelated_noises/misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, lx10077/PN-f-DP when it was checked","code_sha256":"e706424e4a18d7dd","code_sha256_prefix":"e706424e4a18d7dd","mcp_get_code":{"code_sha256":"e706424e4a18d7dd"}},{"arxiv_id":"2410.10683","arxiv_id_is_arxiv":true,"paper":"/paper/sampa-sharpness-aware-minimization","title":"SAMPa: Sharpness-aware Minimization Parallelized","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LIONS-EPFL/SAMPa","path":"utility.py","file_url":"https://github.com/LIONS-EPFL/SAMPa/blob/HEAD/utility.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, LIONS-EPFL/SAMPa when it was checked","code_sha256":"c1ad6496b7bd2b05","code_sha256_prefix":"c1ad6496b7bd2b05","mcp_get_code":{"code_sha256":"c1ad6496b7bd2b05"}},{"arxiv_id":"2405.16002","arxiv_id_is_arxiv":true,"paper":"/paper/does-sgd-really-happen-in-tiny-subspaces","title":"Does SGD really happen in tiny subspaces?","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/edge-of-stability","path":"src/data.py","file_url":"https://github.com/locuslab/edge-of-stability/blob/HEAD/src/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, locuslab/edge-of-stability when it was checked","code_sha256":"6e1ce477ef41fc78","code_sha256_prefix":"6e1ce477ef41fc78","mcp_get_code":{"code_sha256":"6e1ce477ef41fc78"}},{"arxiv_id":"2405.13712","arxiv_id_is_arxiv":true,"paper":"/paper/learning-diffusion-priors-from-observations","title":"Learning Diffusion Priors from Observations by Expectation Maximization","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"francois-rozet/diffusion-priors","path":"diem/image.py","file_url":"https://github.com/francois-rozet/diffusion-priors/blob/HEAD/diem/image.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":"d253b2b50caf68a2","code_sha256_prefix":"d253b2b50caf68a2","mcp_get_code":{"code_sha256":"d253b2b50caf68a2"}},{"arxiv_id":"2403.00791","arxiv_id_is_arxiv":true,"paper":"/paper/textit-l-m-24-building-a-dataset-for-language","title":"L+M-24: Building a Dataset for Language + Molecules @ ACL 2024","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"language-plus-molecules/lpm-24-dataset","path":"evaluation/create_heldout_file.py","file_url":"https://github.com/language-plus-molecules/lpm-24-dataset/blob/HEAD/evaluation/create_heldout_file.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, language-plus-molecules/lpm-24-dataset when it was checked","code_sha256":"276d317054148ab7","code_sha256_prefix":"276d317054148ab7","mcp_get_code":{"code_sha256":"276d317054148ab7"}},{"arxiv_id":"2402.18668","arxiv_id_is_arxiv":true,"paper":"/paper/simple-linear-attention-language-models","title":"Simple linear attention language models balance the recall-throughput tradeoff","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hazyresearch/zoology","path":"zoology/utils.py","file_url":"https://github.com/hazyresearch/zoology/blob/HEAD/zoology/utils.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":"fa6e454f96200975","code_sha256_prefix":"fa6e454f96200975","mcp_get_code":{"code_sha256":"fa6e454f96200975"}},{"arxiv_id":"2402.18668","arxiv_id_is_arxiv":true,"paper":"/paper/simple-linear-attention-language-models","title":"Simple linear attention language models balance the recall-throughput tradeoff","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hazyresearch/zoology","path":"zoology/analysis/utils.py","file_url":"https://github.com/hazyresearch/zoology/blob/HEAD/zoology/analysis/utils.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":"50615df14da6c8bb","code_sha256_prefix":"50615df14da6c8bb","mcp_get_code":{"code_sha256":"50615df14da6c8bb"}},{"arxiv_id":"2402.10835","arxiv_id_is_arxiv":true,"paper":"/paper/time-series-forecasting-with-llms","title":"Time Series Forecasting with LLMs: Understanding and Enhancing Model Capabilities","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingyuj666/time-series-forecasting-with-llms","path":"models/utils.py","file_url":"https://github.com/mingyuj666/time-series-forecasting-with-llms/blob/HEAD/models/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, mingyuj666/time-series-forecasting-with-llms when it was checked","code_sha256":"fbf4f5f91d7ae546","code_sha256_prefix":"fbf4f5f91d7ae546","mcp_get_code":{"code_sha256":"fbf4f5f91d7ae546"}},{"arxiv_id":"2311.03734","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-structured-information-for","title":"Leveraging Structured Information for Explainable Multi-hop Question Answering and Reasoning","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bcdnlp/structure-qa","path":"src/knowledge_graph_generation.py","file_url":"https://github.com/bcdnlp/structure-qa/blob/HEAD/src/knowledge_graph_generation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, bcdnlp/structure-qa, is not in the permissive set Syntology serves inline","code_sha256":"083a29a2790d4467","code_sha256_prefix":"083a29a2790d4467","mcp_get_code":{"code_sha256":"083a29a2790d4467"}},{"arxiv_id":"2309.14597","arxiv_id_is_arxiv":true,"paper":"/paper/policy-optimization-in-a-noisy-neighborhood-1","title":"Policy Optimization in a Noisy Neighborhood: On Return Landscapes in Continuous Control","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nathanrahn/return-landscapes","path":"run_algorithm/util/dict_util.py","file_url":"https://github.com/nathanrahn/return-landscapes/blob/HEAD/run_algorithm/util/dict_util.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, nathanrahn/return-landscapes when it was checked","code_sha256":"6167c00d6c136928","code_sha256_prefix":"6167c00d6c136928","mcp_get_code":{"code_sha256":"6167c00d6c136928"}},{"arxiv_id":"2303.01903","arxiv_id_is_arxiv":true,"paper":"/paper/prompting-large-language-models-with-answer","title":"Prophet: Prompting Large Language Models with Complementary Answer Heuristics for Knowledge-based Visual Question Answering","date":"2023-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milvlg/prophet","path":"prophet/stage1/model/net_utils.py","file_url":"https://github.com/milvlg/prophet/blob/HEAD/prophet/stage1/model/net_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":"bde236b337b5013f","code_sha256_prefix":"bde236b337b5013f","mcp_get_code":{"code_sha256":"bde236b337b5013f"}},{"arxiv_id":"2211.00262","arxiv_id_is_arxiv":true,"paper":"/paper/training-vision-language-models-with-less","title":"Training Vision-Language Models with Less Bimodal Supervision","date":"2022-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eladsegal/less-bimodal-sup","path":"utils/jsonnet.py","file_url":"https://github.com/eladsegal/less-bimodal-sup/blob/HEAD/utils/jsonnet.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":"225dafec388f7a2f","code_sha256_prefix":"225dafec388f7a2f","mcp_get_code":{"code_sha256":"225dafec388f7a2f"}},{"arxiv_id":"2201.03533","arxiv_id_is_arxiv":true,"paper":"/paper/scrolls-standardized-comparison-over-long","title":"SCROLLS: Standardized CompaRison Over Long Language Sequences","date":"2022-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tau-nlp/scrolls","path":"baselines/src/utils/config.py","file_url":"https://github.com/tau-nlp/scrolls/blob/HEAD/baselines/src/utils/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":"225dafec388f7a2f","code_sha256_prefix":"225dafec388f7a2f","mcp_get_code":{"code_sha256":"225dafec388f7a2f"}},{"arxiv_id":"2110.08499","arxiv_id_is_arxiv":true,"paper":"/paper/primer-pyramid-based-masked-sentence-pre","title":"PRIMERA: Pyramid-based Masked Sentence Pre-training for Multi-document Summarization","date":"2021-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/open-mds","path":"src/open_mds/common/util.py","file_url":"https://github.com/allenai/open-mds/blob/HEAD/src/open_mds/common/util.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":"bd497b6193ae78a7","code_sha256_prefix":"bd497b6193ae78a7","mcp_get_code":{"code_sha256":"bd497b6193ae78a7"}},{"arxiv_id":"2008.02275","arxiv_id_is_arxiv":true,"paper":"/paper/aligning-ai-with-shared-human-values","title":"Aligning AI With Shared Human Values","date":"2020-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hendrycks/ethics","path":"utilitarianism/tune.py","file_url":"https://github.com/hendrycks/ethics/blob/HEAD/utilitarianism/tune.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":"2244585c0f7fdef2","code_sha256_prefix":"2244585c0f7fdef2","mcp_get_code":{"code_sha256":"2244585c0f7fdef2"}},{"arxiv_id":"1509.00519","arxiv_id_is_arxiv":true,"paper":"/paper/importance-weighted-autoencoders","title":"Importance Weighted Autoencoders","date":"2015-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jurgisp/pydreamer","path":"pydreamer/models/functions.py","file_url":"https://github.com/jurgisp/pydreamer/blob/HEAD/pydreamer/models/functions.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":"b26ca1623f8bfc99","code_sha256_prefix":"b26ca1623f8bfc99","mcp_get_code":{"code_sha256":"b26ca1623f8bfc99"}}],"record_sha256":"13d8ad4a0c3bba444af342ba4d99d88a87cacdc57176ba8f44023c9813f9d968","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}