{"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/fcblock","entry":"FCBlock","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":8,"n_samples_ran":8,"n_samples_constructed":6,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":8,"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":0,"ran_fixture":0,"ran":8,"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":"2407.03300","arxiv_id_is_arxiv":true,"paper":"/paper/disco-diff-enhancing-continuous-diffusion","title":"DisCo-Diff: Enhancing Continuous Diffusion Models with Discrete Latents","date":"2024-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gcorso/disco-diffdock","path":"models/layers.py","file_url":"https://github.com/gcorso/disco-diffdock/blob/HEAD/models/layers.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":"1c0b14628ac6030e","code_sha256_prefix":"1c0b14628ac6030e","mcp_get_code":{"code_sha256":"1c0b14628ac6030e"}},{"arxiv_id":"2402.18396","arxiv_id_is_arxiv":true,"paper":"/paper/deep-confident-steps-to-new-pockets","title":"Deep Confident Steps to New Pockets: Strategies for Docking Generalization","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ldeng0205/confidence-bootstrapping","path":"models/layers.py","file_url":"https://github.com/ldeng0205/confidence-bootstrapping/blob/HEAD/models/layers.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":"a5fe117e9ae4d679","code_sha256_prefix":"a5fe117e9ae4d679","mcp_get_code":{"code_sha256":"a5fe117e9ae4d679"}},{"arxiv_id":"2207.13820","arxiv_id_is_arxiv":true,"paper":"/paper/cross-attention-of-disentangled-modalities","title":"Cross-Attention of Disentangled Modalities for 3D Human Mesh Recovery with Transformers","date":"2022-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"postech-ami/fastmetro","path":"src/modeling/model/modeling_fastmetro.py","file_url":"https://github.com/postech-ami/fastmetro/blob/HEAD/src/modeling/model/modeling_fastmetro.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"562c62242b4e4a11","code_sha256_prefix":"562c62242b4e4a11","mcp_get_code":{"code_sha256":"562c62242b4e4a11"}},{"arxiv_id":"2207.03691","arxiv_id_is_arxiv":true,"paper":"/paper/neural-implicit-dictionary-via-mixture-of","title":"Neural Implicit Dictionary via Mixture-of-Expert Training","date":"2022-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/neural-implicit-dict","path":"models.py","file_url":"https://github.com/vita-group/neural-implicit-dict/blob/HEAD/models.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":"f756e1bf1683ec39","code_sha256_prefix":"f756e1bf1683ec39","mcp_get_code":{"code_sha256":"f756e1bf1683ec39"}},{"arxiv_id":"2203.11471","arxiv_id_is_arxiv":true,"paper":"/paper/ray3d-ray-based-3d-human-pose-estimation-for","title":"Ray3D: ray-based 3D human pose estimation for monocular absolute 3D localization","date":"2022-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YxZhxn/Ray3D","path":"lib/model/rie.py","file_url":"https://github.com/YxZhxn/Ray3D/blob/HEAD/lib/model/rie.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8a7e38c8dcc50fe8","code_sha256_prefix":"8a7e38c8dcc50fe8","mcp_get_code":{"code_sha256":"8a7e38c8dcc50fe8"}},{"arxiv_id":"2203.07628","arxiv_id_is_arxiv":true,"paper":"/paper/p-stmo-pre-trained-spatial-temporal-many-to","title":"P-STMO: Pre-Trained Spatial Temporal Many-to-One Model for 3D Human Pose Estimation","date":"2022-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paTRICK-swk/P-STMO","path":"model/stmo_pretrain.py","file_url":"https://github.com/paTRICK-swk/P-STMO/blob/HEAD/model/stmo_pretrain.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3dd75f638909b681","code_sha256_prefix":"3dd75f638909b681","mcp_get_code":{"code_sha256":"3dd75f638909b681"}},{"arxiv_id":"2006.09661","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-neural-representations-with-periodic","title":"Implicit Neural Representations with Periodic Activation Functions","date":"2020-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TalFurman/Implict_neural_representation_of_images","path":"modules.py","file_url":"https://github.com/TalFurman/Implict_neural_representation_of_images/blob/HEAD/modules.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":"8ede319230f3b9c5","code_sha256_prefix":"8ede319230f3b9c5","mcp_get_code":{"code_sha256":"8ede319230f3b9c5"}},{"arxiv_id":"1612.00593","arxiv_id_is_arxiv":true,"paper":"/paper/pointnet-deep-learning-on-point-sets-for-3d","title":"PointNet: Deep Learning on Point Sets for 3D Classification and Segmentation","date":"2016-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"debajyotid2/pointnet_pl","path":"src/model.py","file_url":"https://github.com/debajyotid2/pointnet_pl/blob/HEAD/src/model.py","status":"ran","verification_level":1,"contract_check":null,"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, debajyotid2/pointnet_pl when it was checked","code_sha256":"c0998ae0e66ae44b","code_sha256_prefix":"c0998ae0e66ae44b","mcp_get_code":{"code_sha256":"c0998ae0e66ae44b"}}],"record_sha256":"fa0f8052682b2090e7fd503b3aa142412d2b1beb0b9cb717510c1f56efb16c26","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}