{"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/explained-variance","entry":"explained_variance","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":6,"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":0,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":1,"ran":2,"unverified":1},"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":"2606.15468","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-15468","title":"Analyzing Visual Aircraft Representations with Sparse Autoencoders","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"deepshiksharma/sae-aircraft","path":"3_train_SAE.py","file_url":"https://github.com/deepshiksharma/sae-aircraft/blob/HEAD/3_train_SAE.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dd31d9ad1a3ea110","code_sha256_prefix":"dd31d9ad1a3ea110","mcp_get_code":{"code_sha256":"dd31d9ad1a3ea110"}},{"arxiv_id":"2206.08853","arxiv_id_is_arxiv":true,"paper":"/paper/minedojo-building-open-ended-embodied-agents","title":"MineDojo: Building Open-Ended Embodied Agents with Internet-Scale Knowledge","date":"2022-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pku-rl/copl","path":"src/core/ppo.py","file_url":"https://github.com/pku-rl/copl/blob/HEAD/src/core/ppo.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"07902b0c59d65132","code_sha256_prefix":"07902b0c59d65132","mcp_get_code":{"code_sha256":"07902b0c59d65132"}},{"arxiv_id":"2101.08152","arxiv_id_is_arxiv":true,"paper":"/paper/rank-the-episodes-a-simple-approach-for-1","title":"Rank the Episodes: A Simple Approach for Exploration in Procedurally-Generated Environments","date":"2021-01-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aklein1995/exploration_sil_im","path":"rapid/rapid_agent.py","file_url":"https://github.com/aklein1995/exploration_sil_im/blob/HEAD/rapid/rapid_agent.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f9580f36835d52d","code_sha256_prefix":"6f9580f36835d52d","mcp_get_code":{"code_sha256":"6f9580f36835d52d"}},{"arxiv_id":"2010.07916","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-trust-region-policy-optimization","title":"Multi-Agent Trust Region Policy Optimization","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hepengli/matrpo","path":"matrpo/common/math_util.py","file_url":"https://github.com/hepengli/matrpo/blob/HEAD/matrpo/common/math_util.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":"4ddc13c7b29053c5","code_sha256_prefix":"4ddc13c7b29053c5","mcp_get_code":{"code_sha256":"4ddc13c7b29053c5"}},{"arxiv_id":"1811.05320","arxiv_id_is_arxiv":true,"paper":"/paper/t-gcn-a-temporal-graph-convolutionalnetwork","title":"T-GCN: A Temporal Graph ConvolutionalNetwork for Traffic Prediction","date":"2018-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martinwhl/T-GCN-PyTorch","path":"utils/metrics.py","file_url":"https://github.com/martinwhl/T-GCN-PyTorch/blob/HEAD/utils/metrics.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":"ce1537180e1d98a6","code_sha256_prefix":"ce1537180e1d98a6","mcp_get_code":{"code_sha256":"ce1537180e1d98a6"}},{"arxiv_id":"1408.5882","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"piyush2896/CNN-Text-Classifier","path":"nn/metrics.py","file_url":"https://github.com/piyush2896/CNN-Text-Classifier/blob/HEAD/nn/metrics.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":"c108960f22fe26aa","code_sha256_prefix":"c108960f22fe26aa","mcp_get_code":{"code_sha256":"c108960f22fe26aa"}}],"record_sha256":"70c1cbadeb0dab277f06a2917161b83deaf8b7f9564f85be02f6fd069d39349b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}