{"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/actvn","entry":"actvn","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":7,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":11,"n_places_pointer_only":1,"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":1,"ran":2,"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":"2411.03097","arxiv_id_is_arxiv":true,"paper":"/paper/correlating-variational-autoencoders-natively","title":"Correlating Variational Autoencoders Natively For Multi-View Imputation","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eso28599/JPVAE","path":"networks/PolyMNIST.py","file_url":"https://github.com/eso28599/JPVAE/blob/HEAD/networks/PolyMNIST.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"634a1f51262e608f","code_sha256_prefix":"634a1f51262e608f","mcp_get_code":{"code_sha256":"634a1f51262e608f"}},{"arxiv_id":"2407.06124","arxiv_id_is_arxiv":true,"paper":"/paper/structured-generations-using-hierarchical","title":"Structured Generations: Using Hierarchical Clusters to guide Diffusion Models","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoGo175/diffuse-treevae","path":"models/model.py","file_url":"https://github.com/JoGo175/diffuse-treevae/blob/HEAD/models/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, JoGo175/diffuse-treevae when it was checked","code_sha256":"854367281a996fe3","code_sha256_prefix":"854367281a996fe3","mcp_get_code":{"code_sha256":"854367281a996fe3"}},{"arxiv_id":"2406.19300","arxiv_id_is_arxiv":true,"paper":"/paper/sctree-discovering-cellular-hierarchies-in","title":"scTree: Discovering Cellular Hierarchies in the Presence of Batch Effects in scRNA-seq Data","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mvandenhi/sctree-public","path":"src/sctree/models/networks.py","file_url":"https://github.com/mvandenhi/sctree-public/blob/HEAD/src/sctree/models/networks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aa82271694aa26fb","code_sha256_prefix":"aa82271694aa26fb","mcp_get_code":{"code_sha256":"aa82271694aa26fb"}},{"arxiv_id":"2403.05300","arxiv_id_is_arxiv":true,"paper":"/paper/unity-by-diversity-improved-representation","title":"Unity by Diversity: Improved Representation Learning in Multimodal VAEs","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thomassutter/mmvampvae","path":"networks/ConvNetworksPolyMNIST.py","file_url":"https://github.com/thomassutter/mmvampvae/blob/HEAD/networks/ConvNetworksPolyMNIST.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"634a1f51262e608f","code_sha256_prefix":"634a1f51262e608f","mcp_get_code":{"code_sha256":"634a1f51262e608f"}},{"arxiv_id":"2403.05300","arxiv_id_is_arxiv":true,"paper":"/paper/unity-by-diversity-improved-representation","title":"Unity by Diversity: Improved Representation Learning in Multimodal VAEs","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thomassutter/mmvampvae","path":"networks/ClfImgPolyMNIST.py","file_url":"https://github.com/thomassutter/mmvampvae/blob/HEAD/networks/ClfImgPolyMNIST.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"51e3b2175da36d6c","code_sha256_prefix":"51e3b2175da36d6c","mcp_get_code":{"code_sha256":"51e3b2175da36d6c"}},{"arxiv_id":"2305.19201","arxiv_id_is_arxiv":true,"paper":"/paper/darf-boosting-radiance-fields-from-sparse","title":"DaRF: Boosting Radiance Fields from Sparse Inputs with Monocular Depth Adaptation","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KU-CVLAB/DaRF","path":"plenoxels/models/discriminator.py","file_url":"https://github.com/KU-CVLAB/DaRF/blob/HEAD/plenoxels/models/discriminator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"51e3b2175da36d6c","code_sha256_prefix":"51e3b2175da36d6c","mcp_get_code":{"code_sha256":"51e3b2175da36d6c"}},{"arxiv_id":"2204.00928","arxiv_id_is_arxiv":true,"paper":"/paper/sinnerf-training-neural-radiance-fields-on","title":"SinNeRF: Training Neural Radiance Fields on Complex Scenes from a Single Image","date":"2022-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/SinNeRF","path":"models/discriminator.py","file_url":"https://github.com/VITA-Group/SinNeRF/blob/HEAD/models/discriminator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"51e3b2175da36d6c","code_sha256_prefix":"51e3b2175da36d6c","mcp_get_code":{"code_sha256":"51e3b2175da36d6c"}},{"arxiv_id":"2203.13572","arxiv_id_is_arxiv":true,"paper":"/paper/a-visual-navigation-perspective-for-category","title":"A Visual Navigation Perspective for Category-Level Object Pose Estimation","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wrld/visual_navigation_pose_estimation","path":"models/networks/networks.py","file_url":"https://github.com/wrld/visual_navigation_pose_estimation/blob/HEAD/models/networks/networks.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":"5bd96fb5938773d4","code_sha256_prefix":"5bd96fb5938773d4","mcp_get_code":{"code_sha256":"5bd96fb5938773d4"}},{"arxiv_id":"2002.11810","arxiv_id_is_arxiv":true,"paper":"/paper/on-leveraging-pretrained-gans-for-limited","title":"On Leveraging Pretrained GANs for Generation with Limited Data","date":"2020-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miaoyunzhao/gantransferlimiteddata","path":"gan_training/models/resnet2_AdaFM.py","file_url":"https://github.com/miaoyunzhao/gantransferlimiteddata/blob/HEAD/gan_training/models/resnet2_AdaFM.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":"528d68028ecbc5ce","code_sha256_prefix":"528d68028ecbc5ce","mcp_get_code":{"code_sha256":"528d68028ecbc5ce"}},{"arxiv_id":"1912.05237","arxiv_id_is_arxiv":true,"paper":"/paper/towards-unsupervised-learning-of-generative","title":"Towards Unsupervised Learning of Generative Models for 3D Controllable Image Synthesis","date":"2019-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/controllable_image_synthesis","path":"controllable_gan/models/generator_2d.py","file_url":"https://github.com/autonomousvision/controllable_image_synthesis/blob/HEAD/controllable_gan/models/generator_2d.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":"5bd96fb5938773d4","code_sha256_prefix":"5bd96fb5938773d4","mcp_get_code":{"code_sha256":"5bd96fb5938773d4"}},{"arxiv_id":"1810.00821","arxiv_id_is_arxiv":true,"paper":"/paper/variational-discriminator-bottleneck","title":"Variational Discriminator Bottleneck: Improving Imitation Learning, Inverse RL, and GANs by Constraining Information Flow","date":"2018-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akanimax/Variational_Discriminator_Bottleneck","path":"source/vdb/Gan_networks.py","file_url":"https://github.com/akanimax/Variational_Discriminator_Bottleneck/blob/HEAD/source/vdb/Gan_networks.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":"b065405787f332a5","code_sha256_prefix":"b065405787f332a5","mcp_get_code":{"code_sha256":"b065405787f332a5"}}],"record_sha256":"16e026d1770e2fd63b320c8696d76dfaabd7115ea046fb435493759b2c639621","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}