{"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/normal","entry":"Normal","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":11,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":0,"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":12,"n_samples_ran":10,"n_samples_constructed":4,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":12,"n_places_pointer_only":6,"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":0,"ran_fixture":0,"ran":10,"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":"2505.05192","arxiv_id_is_arxiv":true,"paper":"/paper/long-term-individual-causal-effect-estimation","title":"Long-Term Individual Causal Effect Estimation via Identifiable Latent Representation Learning","date":"2025-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"learnwjj/ICEVAE","path":"model/ICEVAE.py","file_url":"https://github.com/learnwjj/ICEVAE/blob/HEAD/model/ICEVAE.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, learnwjj/ICEVAE when it was checked","code_sha256":"9e90670aae48f212","code_sha256_prefix":"9e90670aae48f212","mcp_get_code":{"code_sha256":"9e90670aae48f212"}},{"arxiv_id":"2404.11599","arxiv_id_is_arxiv":true,"paper":"/paper/variational-bayesian-last-layers","title":"Variational Bayesian Last Layers","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vectorinstitute/vbll","path":"vbll/layers/classification.py","file_url":"https://github.com/vectorinstitute/vbll/blob/HEAD/vbll/layers/classification.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d7de14910f5c0aef","code_sha256_prefix":"d7de14910f5c0aef","mcp_get_code":{"code_sha256":"d7de14910f5c0aef"}},{"arxiv_id":"2312.02019","arxiv_id_is_arxiv":true,"paper":"/paper/action-inference-by-maximising-evidence-zero-1","title":"Action Inference by Maximising Evidence: Zero-Shot Imitation from Observation with World Models","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"argmax-ai/aime","path":"aime/models/ssm.py","file_url":"https://github.com/argmax-ai/aime/blob/HEAD/aime/models/ssm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","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, argmax-ai/aime (NOASSERTION)","code_sha256":"828f62980511fb44","code_sha256_prefix":"828f62980511fb44","mcp_get_code":{"code_sha256":"828f62980511fb44"}},{"arxiv_id":"2207.10050","arxiv_id_is_arxiv":true,"paper":"/paper/discriminator-weighted-offline-imitation-1","title":"Discriminator-Weighted Offline Imitation Learning from Suboptimal Demonstrations","date":"2022-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zexusun/oilca-neurips23","path":"algos/augment_DWBC.py","file_url":"https://github.com/zexusun/oilca-neurips23/blob/HEAD/algos/augment_DWBC.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zexusun/oilca-neurips23 when it was checked","code_sha256":"ecd60efaf01af515","code_sha256_prefix":"ecd60efaf01af515","mcp_get_code":{"code_sha256":"ecd60efaf01af515"}},{"arxiv_id":"2204.08770","arxiv_id_is_arxiv":true,"paper":"/paper/groupnet-multiscale-hypergraph-neural","title":"GroupNet: Multiscale Hypergraph Neural Networks for Trajectory Prediction with Relational Reasoning","date":"2022-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/groupnet","path":"model/GroupNet_nba.py","file_url":"https://github.com/mediabrain-sjtu/groupnet/blob/HEAD/model/GroupNet_nba.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":"f14cfe7a9278509d","code_sha256_prefix":"f14cfe7a9278509d","mcp_get_code":{"code_sha256":"f14cfe7a9278509d"}},{"arxiv_id":"2106.05241","arxiv_id_is_arxiv":true,"paper":"/paper/multi-facet-clustering-variational","title":"Multi-Facet Clustering Variational Autoencoders","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhiyuan1991/proVLAE","path":"model_ladder_pro_celbA.py","file_url":"https://github.com/Zhiyuan1991/proVLAE/blob/HEAD/model_ladder_pro_celbA.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"well_formed","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, Zhiyuan1991/proVLAE (NOASSERTION)","code_sha256":"211690ea3f81115d","code_sha256_prefix":"211690ea3f81115d","mcp_get_code":{"code_sha256":"211690ea3f81115d"}},{"arxiv_id":"2106.03904","arxiv_id_is_arxiv":true,"paper":"/paper/when-in-doubt-neural-non-parametric","title":"When in Doubt: Neural Non-Parametric Uncertainty Quantification for Epidemic Forecasting","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AdityaLab/EpiFNP","path":"models/fnpmodels.py","file_url":"https://github.com/AdityaLab/EpiFNP/blob/HEAD/models/fnpmodels.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d6d10a4f1222f2b0","code_sha256_prefix":"d6d10a4f1222f2b0","mcp_get_code":{"code_sha256":"d6d10a4f1222f2b0"}},{"arxiv_id":"2008.00249","arxiv_id_is_arxiv":true,"paper":"/paper/review-on-ranking-and-selection-a-new","title":"Review on Ranking and Selection: A New Perspective","date":null,"month_inferred_from_arxiv_id":"2020-08","title_source":"archive","repo":"SimOpt-FDU/PySOBA","path":"Sampler.py","file_url":"https://github.com/SimOpt-FDU/PySOBA/blob/HEAD/Sampler.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":"62c3ff6c14363447","code_sha256_prefix":"62c3ff6c14363447","mcp_get_code":{"code_sha256":"62c3ff6c14363447"}},{"arxiv_id":"2007.03898","arxiv_id_is_arxiv":true,"paper":"/paper/nvae-a-deep-hierarchical-variational","title":"NVAE: A Deep Hierarchical Variational Autoencoder","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SerezD/NVAE-from-scratch","path":"src/model.py","file_url":"https://github.com/SerezD/NVAE-from-scratch/blob/HEAD/src/model.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":"c9ab03bfda9403fb","code_sha256_prefix":"c9ab03bfda9403fb","mcp_get_code":{"code_sha256":"c9ab03bfda9403fb"}},{"arxiv_id":"2007.03898","arxiv_id_is_arxiv":true,"paper":"/paper/nvae-a-deep-hierarchical-variational","title":"NVAE: A Deep Hierarchical Variational Autoencoder","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/NVAE","path":"model.py","file_url":"https://github.com/NVlabs/NVAE/blob/HEAD/model.py","status":"unverified","verification_level":0,"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, NVlabs/NVAE (NOASSERTION)","code_sha256":"277ed0e40f07a938","code_sha256_prefix":"277ed0e40f07a938","mcp_get_code":{"code_sha256":"277ed0e40f07a938"}},{"arxiv_id":"2006.03531","arxiv_id_is_arxiv":true,"paper":"/paper/a-meta-bayesian-model-of-intentional-visual","title":"A Meta-Bayesian Model of Intentional Visual Search","date":"2020-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"v2c08/m-bmvs","path":"mnist_vae.py","file_url":"https://github.com/v2c08/m-bmvs/blob/HEAD/mnist_vae.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-2.0, as GitHub detects it on this paper's repository, v2c08/m-bmvs, is not in the permissive set Syntology serves inline","code_sha256":"aa4523f4232f8940","code_sha256_prefix":"aa4523f4232f8940","mcp_get_code":{"code_sha256":"aa4523f4232f8940"}},{"arxiv_id":"1809.10341","arxiv_id_is_arxiv":true,"paper":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SpaceLearner/DisenGraphRep","path":"models/infomax.py","file_url":"https://github.com/SpaceLearner/DisenGraphRep/blob/HEAD/models/infomax.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7af5f07d76374e95","code_sha256_prefix":"7af5f07d76374e95","mcp_get_code":{"code_sha256":"7af5f07d76374e95"}}],"record_sha256":"8e40dbec9caae1a8cda165b57a34b93384f364ac46239779bbf647840f8f8062","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}