{"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/make-network","entry":"make_network","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":7,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":1,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":3,"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":1,"ran_fixture":0,"ran":3,"unverified":4},"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":"2311.10090","arxiv_id_is_arxiv":true,"paper":"/paper/jaxmarl-multi-agent-rl-environments-in-jax","title":"JaxMARL: Multi-Agent RL Environments and Algorithms in JAX","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucl-dark/pax","path":"pax/agents/lola/network.py","file_url":"https://github.com/ucl-dark/pax/blob/HEAD/pax/agents/lola/network.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":"2cd8e496d080743d","code_sha256_prefix":"2cd8e496d080743d","mcp_get_code":{"code_sha256":"2cd8e496d080743d"}},{"arxiv_id":"2311.10090","arxiv_id_is_arxiv":true,"paper":"/paper/jaxmarl-multi-agent-rl-environments-in-jax","title":"JaxMARL: Multi-Agent RL Environments and Algorithms in JAX","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucl-dark/pax","path":"pax/agents/naive/network.py","file_url":"https://github.com/ucl-dark/pax/blob/HEAD/pax/agents/naive/network.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":"bd3555b465d1974f","code_sha256_prefix":"bd3555b465d1974f","mcp_get_code":{"code_sha256":"bd3555b465d1974f"}},{"arxiv_id":"2311.10090","arxiv_id_is_arxiv":true,"paper":"/paper/jaxmarl-multi-agent-rl-environments-in-jax","title":"JaxMARL: Multi-Agent RL Environments and Algorithms in JAX","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucl-dark/pax","path":"pax/agents/hyper/networks.py","file_url":"https://github.com/ucl-dark/pax/blob/HEAD/pax/agents/hyper/networks.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":"019e1da94cf6b12f","code_sha256_prefix":"019e1da94cf6b12f","mcp_get_code":{"code_sha256":"019e1da94cf6b12f"}},{"arxiv_id":"2306.00958","arxiv_id_is_arxiv":true,"paper":"/paper/liv-language-image-representations-and","title":"LIV: Language-Image Representations and Rewards for Robotic Control","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"penn-pal-lab/LIV","path":"liv/train_liv.py","file_url":"https://github.com/penn-pal-lab/LIV/blob/HEAD/liv/train_liv.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":"e7d71ee64d902d2e","code_sha256_prefix":"e7d71ee64d902d2e","mcp_get_code":{"code_sha256":"e7d71ee64d902d2e"}},{"arxiv_id":"2210.00030","arxiv_id_is_arxiv":true,"paper":"/paper/vip-towards-universal-visual-reward-and","title":"VIP: Towards Universal Visual Reward and Representation via Value-Implicit Pre-Training","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/vip","path":"vip/train_vip.py","file_url":"https://github.com/facebookresearch/vip/blob/HEAD/vip/train_vip.py","status":"unverified","verification_level":0,"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, facebookresearch/vip (NOASSERTION)","code_sha256":"f8a214d48c5442e3","code_sha256_prefix":"f8a214d48c5442e3","mcp_get_code":{"code_sha256":"f8a214d48c5442e3"}},{"arxiv_id":"2203.12601","arxiv_id_is_arxiv":true,"paper":"/paper/r3m-a-universal-visual-representation-for","title":"R3M: A Universal Visual Representation for Robot Manipulation","date":"2022-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/r3m","path":"r3m/train_representation.py","file_url":"https://github.com/facebookresearch/r3m/blob/HEAD/r3m/train_representation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, facebookresearch/r3m, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"f8a214d48c5442e3","code_sha256_prefix":"f8a214d48c5442e3","mcp_get_code":{"code_sha256":"f8a214d48c5442e3"}},{"arxiv_id":"2104.00633","arxiv_id_is_arxiv":true,"paper":"/paper/repose-real-time-iterative-rendering-and","title":"RePOSE: Fast 6D Object Pose Refinement via Deep Texture Rendering","date":"2021-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sh8/repose","path":"lib/networks/make_network.py","file_url":"https://github.com/sh8/repose/blob/HEAD/lib/networks/make_network.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":"e941a1cab31db49e","code_sha256_prefix":"e941a1cab31db49e","mcp_get_code":{"code_sha256":"e941a1cab31db49e"}},{"arxiv_id":"2012.15838","arxiv_id_is_arxiv":true,"paper":"/paper/neural-body-implicit-neural-representations","title":"Neural Body: Implicit Neural Representations with Structured Latent Codes for Novel View Synthesis of Dynamic Humans","date":"2020-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YoungJoongUNC/Neural_Human_Performer","path":"lib/networks/make_network.py","file_url":"https://github.com/YoungJoongUNC/Neural_Human_Performer/blob/HEAD/lib/networks/make_network.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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, YoungJoongUNC/Neural_Human_Performer (NOASSERTION)","code_sha256":"696593fb2054724f","code_sha256_prefix":"696593fb2054724f","mcp_get_code":{"code_sha256":"696593fb2054724f"}},{"arxiv_id":"1806.02215","arxiv_id_is_arxiv":true,"paper":"/paper/spectral-inference-networks-unifying-spectral","title":"Spectral Inference Networks: Unifying Deep and Spectral Learning","date":"2018-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/spectral_inference_networks","path":"spectral_inference_networks/src/util.py","file_url":"https://github.com/deepmind/spectral_inference_networks/blob/HEAD/spectral_inference_networks/src/util.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":"fcd9167a96ff8670","code_sha256_prefix":"fcd9167a96ff8670","mcp_get_code":{"code_sha256":"fcd9167a96ff8670"}}],"record_sha256":"d9b81a558e6618e30df473fc1c58222a95a1f5cf93649b07055b58748da39330","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}