{"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/layer-2","entry":"layer","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":12,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":12,"n_places_pointer_only":0,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"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":"2305.02164","arxiv_id_is_arxiv":true,"paper":"/paper/nonparametric-generative-modeling-with","title":"Nonparametric Generative Modeling with Conditional Sliced-Wasserstein Flows","date":"2023-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"duchao0726/conditional-swf","path":"models.py","file_url":"https://github.com/duchao0726/conditional-swf/blob/HEAD/models.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":"e316ded1bfbdf90c","code_sha256_prefix":"e316ded1bfbdf90c","mcp_get_code":{"code_sha256":"e316ded1bfbdf90c"}},{"arxiv_id":"2209.11588","arxiv_id_is_arxiv":true,"paper":"/paper/learning-rigid-body-dynamics-with-lagrangian","title":"Learning Articulated Rigid Body Dynamics with Lagrangian Graph Neural Network","date":"2022-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m3rg-iitd/rigid_body_dynamics_graph","path":"src/lnn.py","file_url":"https://github.com/m3rg-iitd/rigid_body_dynamics_graph/blob/HEAD/src/lnn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"218440470f3ee0d8","code_sha256_prefix":"218440470f3ee0d8","mcp_get_code":{"code_sha256":"218440470f3ee0d8"}},{"arxiv_id":"2104.13963","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-learning-of-visual-features","title":"Semi-Supervised Learning of Visual Features by Non-Parametrically Predicting View Assignments with Support Samples","date":"2021-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sayakpaul/PAWS-TF","path":"models/wide_resnet.py","file_url":"https://github.com/sayakpaul/PAWS-TF/blob/HEAD/models/wide_resnet.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":"05d7d78714b9de1b","code_sha256_prefix":"05d7d78714b9de1b","mcp_get_code":{"code_sha256":"05d7d78714b9de1b"}},{"arxiv_id":"2007.10872","arxiv_id_is_arxiv":true,"paper":"/paper/dense-hybrid-recurrent-multi-view-stereo-net","title":"Dense Hybrid Recurrent Multi-view Stereo Net with Dynamic Consistency Checking","date":"2020-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haibao637/D2HC-RMVSNet","path":"cnn_wrapper/network.py","file_url":"https://github.com/haibao637/D2HC-RMVSNet/blob/HEAD/cnn_wrapper/network.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":"664f1649e11743ea","code_sha256_prefix":"664f1649e11743ea","mcp_get_code":{"code_sha256":"664f1649e11743ea"}},{"arxiv_id":"2007.04118","arxiv_id_is_arxiv":true,"paper":"/paper/delving-into-the-adversarial-robustness-on","title":"RobFR: Benchmarking Adversarial Robustness on Face Recognition","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShawnXYang/Face-Robustness-Benchmark","path":"preprocess/align_methods/detect_face.py","file_url":"https://github.com/ShawnXYang/Face-Robustness-Benchmark/blob/HEAD/preprocess/align_methods/detect_face.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":"fab32b621c712604","code_sha256_prefix":"fab32b621c712604","mcp_get_code":{"code_sha256":"fab32b621c712604"}},{"arxiv_id":"2006.06803","arxiv_id_is_arxiv":true,"paper":"/paper/query-training-learning-and-inference-for","title":"Query Training: Learning a Worse Model to Infer Better Marginals in Undirected Graphical Models with Hidden Variables","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vicariousinc/query_training","path":"query_training/rbm_dbm/rbm.py","file_url":"https://github.com/vicariousinc/query_training/blob/HEAD/query_training/rbm_dbm/rbm.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":"ef38d2b517533bfc","code_sha256_prefix":"ef38d2b517533bfc","mcp_get_code":{"code_sha256":"ef38d2b517533bfc"}},{"arxiv_id":"2003.06814","arxiv_id_is_arxiv":true,"paper":"/paper/towards-privacy-protection-by-generating","title":"Towards Face Encryption by Generating Adversarial Identity Masks","date":"2020-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shawnxyang/tip-im","path":"align_methods/detect_face.py","file_url":"https://github.com/shawnxyang/tip-im/blob/HEAD/align_methods/detect_face.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":"fab32b621c712604","code_sha256_prefix":"fab32b621c712604","mcp_get_code":{"code_sha256":"fab32b621c712604"}},{"arxiv_id":"1903.08527","arxiv_id_is_arxiv":true,"paper":"/paper/accurate-3d-face-reconstruction-with-weakly","title":"Accurate 3D Face Reconstruction with Weakly-Supervised Learning: From Single Image to Image Set","date":"2019-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/at3d","path":"AT3D/align_methods/detect_face.py","file_url":"https://github.com/thu-ml/at3d/blob/HEAD/AT3D/align_methods/detect_face.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":"fab32b621c712604","code_sha256_prefix":"fab32b621c712604","mcp_get_code":{"code_sha256":"fab32b621c712604"}},{"arxiv_id":"1902.10556","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-mvsnet-for-high-resolution-multi","title":"Recurrent MVSNet for High-resolution Multi-view Stereo Depth Inference","date":"2019-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YoYo000/MVSNet","path":"cnn_wrapper/network.py","file_url":"https://github.com/YoYo000/MVSNet/blob/HEAD/cnn_wrapper/network.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":"664f1649e11743ea","code_sha256_prefix":"664f1649e11743ea","mcp_get_code":{"code_sha256":"664f1649e11743ea"}},{"arxiv_id":"1808.00157","arxiv_id_is_arxiv":true,"paper":"/paper/instance-level-human-parsing-via-part","title":"Instance-level Human Parsing via Part Grouping Network","date":"2018-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Engineering-Course/CIHP_PGN","path":"kaffe/tensorflow/network.py","file_url":"https://github.com/Engineering-Course/CIHP_PGN/blob/HEAD/kaffe/tensorflow/network.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":"fab32b621c712604","code_sha256_prefix":"fab32b621c712604","mcp_get_code":{"code_sha256":"fab32b621c712604"}},{"arxiv_id":"1611.08050","arxiv_id_is_arxiv":true,"paper":"/paper/realtime-multi-person-2d-pose-estimation","title":"Realtime Multi-Person 2D Pose Estimation using Part Affinity Fields","date":"2016-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/max-human-pose-estimator","path":"core/tf_pose/tensblur/smoother.py","file_url":"https://github.com/ibm/max-human-pose-estimator/blob/HEAD/core/tf_pose/tensblur/smoother.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":"1fb38eb9d6522fb0","code_sha256_prefix":"1fb38eb9d6522fb0","mcp_get_code":{"code_sha256":"1fb38eb9d6522fb0"}},{"arxiv_id":"1606.00373","arxiv_id_is_arxiv":true,"paper":"/paper/deeper-depth-prediction-with-fully","title":"Deeper Depth Prediction with Fully Convolutional Residual Networks","date":"2016-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iro-cp/FCRN-DepthPrediction","path":"tensorflow/models/network.py","file_url":"https://github.com/iro-cp/FCRN-DepthPrediction/blob/HEAD/tensorflow/models/network.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fab32b621c712604","code_sha256_prefix":"fab32b621c712604","mcp_get_code":{"code_sha256":"fab32b621c712604"}}],"record_sha256":"712e37d6134b79f8df2a570b69343e77edf38c19f38f6f431d2a3f733ab77d78","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}