{"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-init","entry":"normal_init","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":2,"n_papers_ran_no_instrument_failure":2,"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":11,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":9,"n_samples_fingerprinted":1,"n_places":11,"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":0,"ran_fixture":0,"ran":2,"unverified":9},"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":"2406.12378","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-mapping-of-phase-diagrams-with","title":"Efficient mapping of phase diagrams with conditional Boltzmann Generators","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxschebek/flow_diagrams","path":"flow_diagrams/utils/weights.py","file_url":"https://github.com/maxschebek/flow_diagrams/blob/HEAD/flow_diagrams/utils/weights.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, maxschebek/flow_diagrams when it was checked","code_sha256":"9a4f700a41ee309a","code_sha256_prefix":"9a4f700a41ee309a","mcp_get_code":{"code_sha256":"9a4f700a41ee309a"}},{"arxiv_id":"2305.08164","arxiv_id_is_arxiv":true,"paper":"/paper/latent-processes-identification-from-multi","title":"Latent Processes Identification From Multi-View Time Series","date":"2023-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lccurious/MuLTI","path":"multi/models/multi.py","file_url":"https://github.com/lccurious/MuLTI/blob/HEAD/multi/models/multi.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, lccurious/MuLTI when it was checked","code_sha256":"61decb02540393b5","code_sha256_prefix":"61decb02540393b5","mcp_get_code":{"code_sha256":"61decb02540393b5"}},{"arxiv_id":"2305.00666","arxiv_id_is_arxiv":true,"paper":"/paper/part-aware-contrastive-learning-for-self","title":"Part Aware Contrastive Learning for Self-Supervised Action Recognition","date":"2023-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GitHubOfHyl97/SkeAttnCLR","path":"net/SkeAttnCLR.py","file_url":"https://github.com/GitHubOfHyl97/SkeAttnCLR/blob/HEAD/net/SkeAttnCLR.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, GitHubOfHyl97/SkeAttnCLR when it was checked","code_sha256":"3b6116d0b1e96fce","code_sha256_prefix":"3b6116d0b1e96fce","mcp_get_code":{"code_sha256":"3b6116d0b1e96fce"}},{"arxiv_id":"2208.03792","arxiv_id_is_arxiv":true,"paper":"/paper/domain-randomization-enhanced-depth","title":"Domain Randomization-Enhanced Depth Simulation and Restoration for Perceiving and Grasping Specular and Transparent Objects","date":"2022-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PKU-EPIC/DREDS","path":"CatePoseEstimation/networks/SwinDRNet.py","file_url":"https://github.com/PKU-EPIC/DREDS/blob/HEAD/CatePoseEstimation/networks/SwinDRNet.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, PKU-EPIC/DREDS when it was checked","code_sha256":"591c7c5cab0628b2","code_sha256_prefix":"591c7c5cab0628b2","mcp_get_code":{"code_sha256":"591c7c5cab0628b2"}},{"arxiv_id":"2204.12484","arxiv_id_is_arxiv":true,"paper":"/paper/vitpose-simple-vision-transformer-baselines","title":"ViTPose: Simple Vision Transformer Baselines for Human Pose Estimation","date":"2022-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JunkyByte/easy_ViTPose","path":"easy_ViTPose/vit_models/model.py","file_url":"https://github.com/JunkyByte/easy_ViTPose/blob/HEAD/easy_ViTPose/vit_models/model.py","status":"unverified","verification_level":0,"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":"fb206aa7be7aa229","code_sha256_prefix":"fb206aa7be7aa229","mcp_get_code":{"code_sha256":"fb206aa7be7aa229"}},{"arxiv_id":"2004.04795","arxiv_id_is_arxiv":true,"paper":"/paper/exemplar-vaes-for-exemplar-based-generation","title":"Exemplar VAE: Linking Generative Models, Nearest Neighbor Retrieval, and Data Augmentation","date":"2020-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sajadn/Exemplar-VAE","path":"models/AbsHModel.py","file_url":"https://github.com/sajadn/Exemplar-VAE/blob/HEAD/models/AbsHModel.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":"62618079bb543102","code_sha256_prefix":"62618079bb543102","mcp_get_code":{"code_sha256":"62618079bb543102"}},{"arxiv_id":"2003.10152","arxiv_id_is_arxiv":true,"paper":"/paper/solov2-dynamic-faster-and-stronger","title":"SOLOv2: Dynamic and Fast Instance Segmentation","date":"2020-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenFirework/pytorch_solov2","path":"modules/solov2.py","file_url":"https://github.com/OpenFirework/pytorch_solov2/blob/HEAD/modules/solov2.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, OpenFirework/pytorch_solov2 when it was checked","code_sha256":"83bf75829d256b70","code_sha256_prefix":"83bf75829d256b70","mcp_get_code":{"code_sha256":"83bf75829d256b70"}},{"arxiv_id":"1806.05413","arxiv_id_is_arxiv":true,"paper":"/paper/learning-dynamics-of-linear-denoising","title":"Learning Dynamics of Linear Denoising Autoencoders","date":"2018-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arnupretorius/lindaedynamics_icml2018","path":"src/scalar_net/initialisers.py","file_url":"https://github.com/arnupretorius/lindaedynamics_icml2018/blob/HEAD/src/scalar_net/initialisers.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":"de719648984aa476","code_sha256_prefix":"de719648984aa476","mcp_get_code":{"code_sha256":"de719648984aa476"}},{"arxiv_id":"1802.05983","arxiv_id_is_arxiv":true,"paper":"/paper/disentangling-by-factorising","title":"Disentangling by Factorising","date":"2018-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Guiliang/FactorVAE","path":"model.py","file_url":"https://github.com/Guiliang/FactorVAE/blob/HEAD/model.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":"aed5880c62317c0e","code_sha256_prefix":"aed5880c62317c0e","mcp_get_code":{"code_sha256":"aed5880c62317c0e"}},{"arxiv_id":"1511.06434","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-representation-learning-with-1","title":"Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prodillo/GAN_project","path":"gan.py","file_url":"https://github.com/prodillo/GAN_project/blob/HEAD/gan.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, prodillo/GAN_project when it was checked","code_sha256":"cedcda9379a0dc00","code_sha256_prefix":"cedcda9379a0dc00","mcp_get_code":{"code_sha256":"cedcda9379a0dc00"}},{"arxiv_id":"1506.01497","arxiv_id_is_arxiv":true,"paper":"/paper/faster-r-cnn-towards-real-time-object","title":"Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks","date":"2015-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shkim960520/faster-rcnn-for-studying","path":"model/region_proposal_network.py","file_url":"https://github.com/shkim960520/faster-rcnn-for-studying/blob/HEAD/model/region_proposal_network.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, shkim960520/faster-rcnn-for-studying when it was checked","code_sha256":"f1c71fc2ea63fd48","code_sha256_prefix":"f1c71fc2ea63fd48","mcp_get_code":{"code_sha256":"f1c71fc2ea63fd48"}}],"record_sha256":"6ed60697f1cd8ab370f67e9295e80e27e62ba61dfe8c4bb1023add9fa4ce14ae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}