{"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/create-masks","entry":"create_masks","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":17,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":9,"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":11,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":3,"n_places":17,"n_places_pointer_only":10,"n_places_pointer_only_link_open":4,"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":1,"ran_violates":1,"ran_draft_wrong":3,"ran_fixture":0,"ran":3,"unverified":3},"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.10288","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10288","title":"Power law graph attention: exact generalization of scaled dot-product attention, empirical collapse at inference","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"burcgokden/lm-evaluation-harness-with-PLDR-LLM","path":"lm_eval/models/pldrllm.py","file_url":"https://github.com/burcgokden/lm-evaluation-harness-with-PLDR-LLM/blob/HEAD/lm_eval/models/pldrllm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6112a5d2c9d3e7b4","code_sha256_prefix":"6112a5d2c9d3e7b4","mcp_get_code":{"code_sha256":"6112a5d2c9d3e7b4"}},{"arxiv_id":"2603.03328","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-03328","title":"StructLens: A Structural Lens for Language Models via Maximum Spanning Trees","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"naist-nlp/structlens","path":"src/structlens/masking.py","file_url":"https://github.com/naist-nlp/structlens/blob/HEAD/src/structlens/masking.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, naist-nlp/structlens when it was checked","code_sha256":"98938b9ad4dc6e3f","code_sha256_prefix":"98938b9ad4dc6e3f","mcp_get_code":{"code_sha256":"98938b9ad4dc6e3f"}},{"arxiv_id":"2410.17005","arxiv_id_is_arxiv":true,"paper":"/paper/hybrid-generative-ai-for-de-novo-design-of-co","title":"Hybrid Generative AI for De Novo Design of Co-Crystals with Enhanced Tabletability","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai-chem/GEMCODE","path":"generative_models/TVAE/Batch.py","file_url":"https://github.com/ai-chem/GEMCODE/blob/HEAD/generative_models/TVAE/Batch.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":"978ebdafdd719af8","code_sha256_prefix":"978ebdafdd719af8","mcp_get_code":{"code_sha256":"978ebdafdd719af8"}},{"arxiv_id":"2410.08877","arxiv_id_is_arxiv":true,"paper":"/paper/interdependency-matters-graph-alignment-for","title":"Interdependency Matters: Graph Alignment for Multivariate Time Series Anomaly Detection","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyy-code/MADGA","path":"models/NF.py","file_url":"https://github.com/wyy-code/MADGA/blob/HEAD/models/NF.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wyy-code/MADGA when it was checked","code_sha256":"e1243b39051334f9","code_sha256_prefix":"e1243b39051334f9","mcp_get_code":{"code_sha256":"e1243b39051334f9"}},{"arxiv_id":"2402.12238","arxiv_id_is_arxiv":true,"paper":"/paper/mixed-gaussian-flow-for-diverse-trajectory","title":"MGF: Mixed Gaussian Flow for Diverse Trajectory Prediction","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mulplue/MGF","path":"src/models/TP/TFCondARFlow.py","file_url":"https://github.com/mulplue/MGF/blob/HEAD/src/models/TP/TFCondARFlow.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 kamenbliznashki/normalizing_flows, and GitHub detected no licence in that repository when it was checked","code_sha256":"5a2e1cee97642f25","code_sha256_prefix":"5a2e1cee97642f25","mcp_get_code":{"code_sha256":"5a2e1cee97642f25"}},{"arxiv_id":"2402.11837","arxiv_id_is_arxiv":true,"paper":"/paper/self-guided-robust-graph-structure-refinement","title":"Self-Guided Robust Graph Structure Refinement","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yeonjun-in/torch-sg-gsr","path":"utils/data.py","file_url":"https://github.com/yeonjun-in/torch-sg-gsr/blob/HEAD/utils/data.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, yeonjun-in/torch-sg-gsr when it was checked","code_sha256":"690c4d1bae178c4f","code_sha256_prefix":"690c4d1bae178c4f","mcp_get_code":{"code_sha256":"690c4d1bae178c4f"}},{"arxiv_id":"2308.08824","arxiv_id_is_arxiv":true,"paper":"/paper/fast-inference-and-update-of-probabilistic","title":"Fast Inference and Update of Probabilistic Density Estimation on Trajectory Prediction","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meaten/flowchain-iccv2023","path":"src/models/TP/TFCondARFlow.py","file_url":"https://github.com/meaten/flowchain-iccv2023/blob/HEAD/src/models/TP/TFCondARFlow.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, meaten/flowchain-iccv2023 when it was checked","code_sha256":"5a2e1cee97642f25","code_sha256_prefix":"5a2e1cee97642f25","mcp_get_code":{"code_sha256":"5a2e1cee97642f25"}},{"arxiv_id":"2305.00303","arxiv_id_is_arxiv":true,"paper":"/paper/a-coupled-flow-approach-to-imitation-learning","title":"A Coupled Flow Approach to Imitation Learning","date":"2023-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kamenbliznashki/normalizing_flows","path":"maf.py","file_url":"https://github.com/kamenbliznashki/normalizing_flows/blob/HEAD/maf.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, kamenbliznashki/normalizing_flows when it was checked","code_sha256":"5a2e1cee97642f25","code_sha256_prefix":"5a2e1cee97642f25","mcp_get_code":{"code_sha256":"5a2e1cee97642f25"}},{"arxiv_id":"2302.13971","arxiv_id_is_arxiv":true,"paper":"/paper/llama-open-and-efficient-foundation-language-1","title":"LLaMA: Open and Efficient Foundation Language Models","date":"2023-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akanyaani/miniLLAMA","path":"model.py","file_url":"https://github.com/akanyaani/miniLLAMA/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31c156187744eaa5","code_sha256_prefix":"31c156187744eaa5","mcp_get_code":{"code_sha256":"31c156187744eaa5"}},{"arxiv_id":"2202.07857","arxiv_id_is_arxiv":true,"paper":"/paper/graph-augmented-normalizing-flows-for-anomaly-1","title":"Graph-Augmented Normalizing Flows for Anomaly Detection of Multiple Time Series","date":"2022-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"enyandai/ganf","path":"models/GANF.py","file_url":"https://github.com/enyandai/ganf/blob/HEAD/models/GANF.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, enyandai/ganf when it was checked","code_sha256":"e1243b39051334f9","code_sha256_prefix":"e1243b39051334f9","mcp_get_code":{"code_sha256":"e1243b39051334f9"}},{"arxiv_id":"2003.12908","arxiv_id_is_arxiv":true,"paper":"/paper/coping-with-simulators-that-don-t-always","title":"Coping With Simulators That Don't Always Return","date":"2020-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plai-group/stdr","path":"src/maf.py","file_url":"https://github.com/plai-group/stdr/blob/HEAD/src/maf.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 kamenbliznashki/normalizing_flows, and GitHub detected no licence in that repository when it was checked","code_sha256":"5a2e1cee97642f25","code_sha256_prefix":"5a2e1cee97642f25","mcp_get_code":{"code_sha256":"5a2e1cee97642f25"}},{"arxiv_id":"2003.05033","arxiv_id_is_arxiv":true,"paper":"/paper/kale-when-energy-based-learning-meets","title":"Generalized Energy Based Models","date":"2020-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichaelArbel/GeneralizedEBM","path":"models/mog_maf_model.py","file_url":"https://github.com/MichaelArbel/GeneralizedEBM/blob/HEAD/models/mog_maf_model.py","status":"ran","verification_level":1,"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":"3d73aadb98e568a1","code_sha256_prefix":"3d73aadb98e568a1","mcp_get_code":{"code_sha256":"3d73aadb98e568a1"}},{"arxiv_id":"1906.02771","arxiv_id_is_arxiv":true,"paper":"/paper/improving-exploration-in-soft-actor-critic","title":"Improving Exploration in Soft-Actor-Critic with Normalizing Flows Policies","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joeybose/FloRL","path":"pytorch-soft-actor-critic/flow_helpers.py","file_url":"https://github.com/joeybose/FloRL/blob/HEAD/pytorch-soft-actor-critic/flow_helpers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 kamenbliznashki/normalizing_flows, and GitHub detected no licence in that repository when it was checked","code_sha256":"5a2e1cee97642f25","code_sha256_prefix":"5a2e1cee97642f25","mcp_get_code":{"code_sha256":"5a2e1cee97642f25"}},{"arxiv_id":"1606.04934","arxiv_id_is_arxiv":true,"paper":"/paper/improving-variational-inference-with-inverse","title":"Improving Variational Inference with Inverse Autoregressive Flow","date":"2016-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"altosaar/variational-autoencoder","path":"flow.py","file_url":"https://github.com/altosaar/variational-autoencoder/blob/HEAD/flow.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a66337f8e2cf39a3","code_sha256_prefix":"a66337f8e2cf39a3","mcp_get_code":{"code_sha256":"a66337f8e2cf39a3"}},{"arxiv_id":"aaai_27987","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_27987","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ajevnisek/optimize-and-reduce","path":"models/decomp.py","file_url":"https://github.com/ajevnisek/optimize-and-reduce/blob/HEAD/models/decomp.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":"0a12a2a9fa34d3bd","code_sha256_prefix":"0a12a2a9fa34d3bd","mcp_get_code":{"code_sha256":"0a12a2a9fa34d3bd"}},{"arxiv_id":"aaai_25623","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25623","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zqhang/MTGFLOW","path":"models/NF.py","file_url":"https://github.com/zqhang/MTGFLOW/blob/HEAD/models/NF.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"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 enyandai/ganf, and GitHub detected no licence in that repository when it was checked","code_sha256":"e1243b39051334f9","code_sha256_prefix":"e1243b39051334f9","mcp_get_code":{"code_sha256":"e1243b39051334f9"}},{"arxiv_id":"2023.findings-emnlp.228","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.228","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"victor7246/TransJect","path":"models/utils.py","file_url":"https://github.com/victor7246/TransJect/blob/HEAD/models/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":"b0c737fa6acb69fc","code_sha256_prefix":"b0c737fa6acb69fc","mcp_get_code":{"code_sha256":"b0c737fa6acb69fc"}}],"record_sha256":"5b708ce4165ee438801f3a74c76964f2321b9eaaed4f7c4e00409ff4206040fd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}