{"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/embedder","entry":"Embedder","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":18,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":16,"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":18,"n_samples_ran":16,"n_samples_constructed":14,"n_samples_ran_checked":16,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":5,"n_places":18,"n_places_pointer_only":10,"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":16,"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":"2608.02508","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-02508","title":"RoMeRL: Balancing Feedback Coverage and the Memory-Reward Trap in Self-Evolving Agent Memory via Reduced-Order Utility States","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"YOUNG-fnxm/RoMeRL","path":"romerl/task_slot.py","file_url":"https://github.com/YOUNG-fnxm/RoMeRL/blob/HEAD/romerl/task_slot.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":"88faef11ed4ee679","code_sha256_prefix":"88faef11ed4ee679","mcp_get_code":{"code_sha256":"88faef11ed4ee679"}},{"arxiv_id":"2604.11427","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-11427","title":"METRO: Towards Strategy Induction from Expert Dialogue Transcripts for Non-collaborative Dialogues","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Humphrey-0125/METRO","path":"src/runtime/metro_p4g.py","file_url":"https://github.com/Humphrey-0125/METRO/blob/HEAD/src/runtime/metro_p4g.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, Humphrey-0125/METRO when it was checked","code_sha256":"82b6177a7c5ecbf7","code_sha256_prefix":"82b6177a7c5ecbf7","mcp_get_code":{"code_sha256":"82b6177a7c5ecbf7"}},{"arxiv_id":"2503.13110","arxiv_id_is_arxiv":true,"paper":"/paper/dtgbrepgen-a-novel-b-rep-generative-model","title":"DTGBrepGen: A Novel B-rep Generative Model through Decoupling Topology and Geometry","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinli99/DTGBrepGen","path":"model.py","file_url":"https://github.com/jinli99/DTGBrepGen/blob/HEAD/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, jinli99/DTGBrepGen when it was checked","code_sha256":"5e14520196637973","code_sha256_prefix":"5e14520196637973","mcp_get_code":{"code_sha256":"5e14520196637973"}},{"arxiv_id":"2411.07231","arxiv_id_is_arxiv":true,"paper":"/paper/watermark-anything-with-localized-messages","title":"Watermark Anything with Localized Messages","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/watermark-anything","path":"watermark_anything/models/wam.py","file_url":"https://github.com/facebookresearch/watermark-anything/blob/HEAD/watermark_anything/models/wam.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":"219f742447bb98ef","code_sha256_prefix":"219f742447bb98ef","mcp_get_code":{"code_sha256":"219f742447bb98ef"}},{"arxiv_id":"2409.11211","arxiv_id_is_arxiv":true,"paper":"/paper/splatfields-neural-gaussian-splats-for-sparse","title":"SplatFields: Neural Gaussian Splats for Sparse 3D and 4D Reconstruction","date":"2024-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"markomih/splatfields","path":"scene/deform_model.py","file_url":"https://github.com/markomih/splatfields/blob/HEAD/scene/deform_model.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, markomih/splatfields when it was checked","code_sha256":"e61cc7bddc7d86e5","code_sha256_prefix":"e61cc7bddc7d86e5","mcp_get_code":{"code_sha256":"e61cc7bddc7d86e5"}},{"arxiv_id":"2403.19495","arxiv_id_is_arxiv":true,"paper":"/paper/coherentgs-sparse-novel-view-synthesis-with","title":"CoherentGS: Sparse Novel View Synthesis with Coherent 3D Gaussians","date":"2024-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"avinashpaliwal/coherentgs","path":"scene/gaussian_model.py","file_url":"https://github.com/avinashpaliwal/coherentgs/blob/HEAD/scene/gaussian_model.py","status":"ran","verification_level":1,"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, avinashpaliwal/coherentgs (NOASSERTION)","code_sha256":"9df2407dd5c165a9","code_sha256_prefix":"9df2407dd5c165a9","mcp_get_code":{"code_sha256":"9df2407dd5c165a9"}},{"arxiv_id":"2309.04814","arxiv_id_is_arxiv":true,"paper":"/paper/speech2lip-high-fidelity-speech-to-lip","title":"Speech2Lip: High-fidelity Speech to Lip Generation by Learning from a Short Video","date":"2023-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CVMI-Lab/Speech2Lip","path":"src/face_simple/models/tf_nerf.py","file_url":"https://github.com/CVMI-Lab/Speech2Lip/blob/HEAD/src/face_simple/models/tf_nerf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CVMI-Lab/Speech2Lip when it was checked","code_sha256":"db678981cfa67937","code_sha256_prefix":"db678981cfa67937","mcp_get_code":{"code_sha256":"db678981cfa67937"}},{"arxiv_id":"2308.13897","arxiv_id_is_arxiv":true,"paper":"/paper/insertnerf-instilling-generalizability-into","title":"InsertNeRF: Instilling Generalizability into NeRF with HyperNet Modules","date":"2023-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bbbbby-99/insertnerf","path":"network/ibrnet.py","file_url":"https://github.com/bbbbby-99/insertnerf/blob/HEAD/network/ibrnet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, bbbbby-99/insertnerf, is not in the permissive set Syntology serves inline","code_sha256":"7a2d10dd0059dafb","code_sha256_prefix":"7a2d10dd0059dafb","mcp_get_code":{"code_sha256":"7a2d10dd0059dafb"}},{"arxiv_id":"2308.11441","arxiv_id_is_arxiv":true,"paper":"/paper/learning-a-more-continuous-zero-level-set-in","title":"Learning a More Continuous Zero Level Set in Unsigned Distance Fields through Level Set Projection","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junshengzhou/LevelSetUDF","path":"models/fields.py","file_url":"https://github.com/junshengzhou/LevelSetUDF/blob/HEAD/models/fields.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":"0e3f22da22264bde","code_sha256_prefix":"0e3f22da22264bde","mcp_get_code":{"code_sha256":"0e3f22da22264bde"}},{"arxiv_id":"2303.10371","arxiv_id_is_arxiv":true,"paper":"/paper/unreal-unlabeled-nodes-retrieval-and-labeling","title":"UNREAL:Unlabeled Nodes Retrieval and Labeling for Heavily-imbalanced Node Classification","date":"2023-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanliang3612/UNREAL","path":"models/Summer.py","file_url":"https://github.com/yanliang3612/UNREAL/blob/HEAD/models/Summer.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":"68c3a90607b726f4","code_sha256_prefix":"68c3a90607b726f4","mcp_get_code":{"code_sha256":"68c3a90607b726f4"}},{"arxiv_id":"2209.00588","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-are-sample-efficient-world","title":"Transformers are Sample-Efficient World Models","date":"2022-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eloialonso/iris","path":"src/models/world_model.py","file_url":"https://github.com/eloialonso/iris/blob/HEAD/src/models/world_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, eloialonso/iris, is not in the permissive set Syntology serves inline","code_sha256":"2def3130991aaf3c","code_sha256_prefix":"2def3130991aaf3c","mcp_get_code":{"code_sha256":"2def3130991aaf3c"}},{"arxiv_id":"2207.13298","arxiv_id_is_arxiv":true,"paper":"/paper/is-attention-all-nerf-needs","title":"Is Attention All That NeRF Needs?","date":"2022-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/gnt","path":"gnt/transformer_network.py","file_url":"https://github.com/vita-group/gnt/blob/HEAD/gnt/transformer_network.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":"274e943335de6884","code_sha256_prefix":"274e943335de6884","mcp_get_code":{"code_sha256":"274e943335de6884"}},{"arxiv_id":"2207.08625","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-event-detection-and-captioning-as","title":"Unifying Event Detection and Captioning as Sequence Generation via Pre-Training","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QiQAng/UEDVC","path":"modules/transformer.py","file_url":"https://github.com/QiQAng/UEDVC/blob/HEAD/modules/transformer.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, QiQAng/UEDVC when it was checked","code_sha256":"b3dcd70203b0bd3e","code_sha256_prefix":"b3dcd70203b0bd3e","mcp_get_code":{"code_sha256":"b3dcd70203b0bd3e"}},{"arxiv_id":"2206.15448","arxiv_id_is_arxiv":true,"paper":"/paper/learning-iterative-reasoning-through-energy","title":"Learning Iterative Reasoning through Energy Minimization","date":"2022-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yilundu/irem_code_release","path":"models.py","file_url":"https://github.com/yilundu/irem_code_release/blob/HEAD/models.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":"c3a78b27f549248b","code_sha256_prefix":"c3a78b27f549248b","mcp_get_code":{"code_sha256":"c3a78b27f549248b"}},{"arxiv_id":"2206.07850","arxiv_id_is_arxiv":true,"paper":"/paper/improved-surface-reconstruction-using-high","title":"HF-NeuS: Improved Surface Reconstruction Using High-Frequency Details","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiqun-wang/hfs","path":"models/fields_high.py","file_url":"https://github.com/yiqun-wang/hfs/blob/HEAD/models/fields_high.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":"2a2978806df71fa8","code_sha256_prefix":"2a2978806df71fa8","mcp_get_code":{"code_sha256":"2a2978806df71fa8"}},{"arxiv_id":"2204.01943","arxiv_id_is_arxiv":true,"paper":"/paper/unified-implicit-neural-stylization","title":"Unified Implicit Neural Stylization","date":"2022-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/ins","path":"models/nerf_mlp.py","file_url":"https://github.com/vita-group/ins/blob/HEAD/models/nerf_mlp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, vita-group/ins when it was checked","code_sha256":"2d6cbe10a4e1ab05","code_sha256_prefix":"2d6cbe10a4e1ab05","mcp_get_code":{"code_sha256":"2d6cbe10a4e1ab05"}},{"arxiv_id":"2203.12575","arxiv_id_is_arxiv":true,"paper":"/paper/neuman-neural-human-radiance-field-from-a","title":"NeuMan: Neural Human Radiance Field from a Single Video","date":"2022-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-neuman","path":"models/human_nerf.py","file_url":"https://github.com/apple/ml-neuman/blob/HEAD/models/human_nerf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, apple/ml-neuman (NOASSERTION)","code_sha256":"6f88c8aaafdd3e04","code_sha256_prefix":"6f88c8aaafdd3e04","mcp_get_code":{"code_sha256":"6f88c8aaafdd3e04"}},{"arxiv_id":"2104.10078","arxiv_id_is_arxiv":true,"paper":"/paper/unisurf-unifying-neural-implicit-surfaces-and","title":"UNISURF: Unifying Neural Implicit Surfaces and Radiance Fields for Multi-View Reconstruction","date":"2021-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ventusff/neurecon","path":"models/frameworks/unisurf.py","file_url":"https://github.com/ventusff/neurecon/blob/HEAD/models/frameworks/unisurf.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":"5ff7d0b0a8831972","code_sha256_prefix":"5ff7d0b0a8831972","mcp_get_code":{"code_sha256":"5ff7d0b0a8831972"}}],"record_sha256":"4cb0000cebfb0b1bef1a48e68279b8317a98aec8f63ee7a8e0db9452284a8581","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}