{"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/variable","entry":"variable","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":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":2,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":2,"n_places":12,"n_places_pointer_only":8,"n_places_pointer_only_link_open":3,"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":2,"ran_fixture":0,"ran":1,"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":"2411.16532","arxiv_id_is_arxiv":true,"paper":"/paper/continual-deep-reinforcement-learning-with","title":"Continual Deep Reinforcement Learning with Task-Agnostic Policy Distillation","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wabbajack1/tapd","path":"src/algo/a2c.py","file_url":"https://github.com/wabbajack1/tapd/blob/HEAD/src/algo/a2c.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, wabbajack1/tapd, is not in the permissive set Syntology serves inline","code_sha256":"e1b552cb2ce7b1f2","code_sha256_prefix":"e1b552cb2ce7b1f2","mcp_get_code":{"code_sha256":"e1b552cb2ce7b1f2"}},{"arxiv_id":"2410.04472","arxiv_id_is_arxiv":true,"paper":"/paper/collapsed-language-models-promote-fairness","title":"Collapsed Language Models Promote Fairness","date":"2024-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xujxyang/Fairness-NC-main","path":"ase/model.py","file_url":"https://github.com/Xujxyang/Fairness-NC-main/blob/HEAD/ase/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, Xujxyang/Fairness-NC-main when it was checked","code_sha256":"32967e6aa4441efb","code_sha256_prefix":"32967e6aa4441efb","mcp_get_code":{"code_sha256":"32967e6aa4441efb"}},{"arxiv_id":"2108.11005","arxiv_id_is_arxiv":true,"paper":"/paper/wanderlust-online-continual-object-detection","title":"Wanderlust: Online Continual Object Detection in the Real World","date":"2021-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oakdata/benchmark","path":"object_detection/detectron2/ewc/fix/ewc.py","file_url":"https://github.com/oakdata/benchmark/blob/HEAD/object_detection/detectron2/ewc/fix/ewc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, oakdata/benchmark when it was checked","code_sha256":"d95385178f502fa2","code_sha256_prefix":"d95385178f502fa2","mcp_get_code":{"code_sha256":"d95385178f502fa2"}},{"arxiv_id":"2103.12827","arxiv_id_is_arxiv":true,"paper":"/paper/neural-architecture-search-from-frechet-task","title":"Fisher Task Distance and Its Application in Neural Architecture Search","date":"2021-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d95385178f502fa2","code_sha256_prefix":"d95385178f502fa2","mcp_get_code":{"code_sha256":"d95385178f502fa2"}},{"arxiv_id":"2004.14366","arxiv_id_is_arxiv":true,"paper":"/paper/avoiding-catastrophic-forgetting-in","title":"Elastic weight consolidation for better bias inoculation","date":"2020-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"j6mes/eacl2021-debias-finetuning","path":"src/debias_finetuning/losses/util.py","file_url":"https://github.com/j6mes/eacl2021-debias-finetuning/blob/HEAD/src/debias_finetuning/losses/util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from Xujxyang/Fairness-NC-main, and GitHub detected no licence in that repository when it was checked","code_sha256":"32967e6aa4441efb","code_sha256_prefix":"32967e6aa4441efb","mcp_get_code":{"code_sha256":"32967e6aa4441efb"}},{"arxiv_id":"1905.05393","arxiv_id_is_arxiv":true,"paper":"/paper/190505393","title":"Population Based Augmentation: Efficient Learning of Augmentation Policy Schedules","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arcelien/pba","path":"autoaugment/custom_ops.py","file_url":"https://github.com/arcelien/pba/blob/HEAD/autoaugment/custom_ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, arcelien/pba, 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":"f6b18b79eccd8391","code_sha256_prefix":"f6b18b79eccd8391","mcp_get_code":{"code_sha256":"f6b18b79eccd8391"}},{"arxiv_id":"1904.12848","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-data-augmentation-1","title":"Unsupervised Data Augmentation for Consistency Training","date":"2019-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/uda","path":"image/randaugment/custom_ops.py","file_url":"https://github.com/google-research/uda/blob/HEAD/image/randaugment/custom_ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from arcelien/pba, and Apache-2.0, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","code_sha256":"f6b18b79eccd8391","code_sha256_prefix":"f6b18b79eccd8391","mcp_get_code":{"code_sha256":"f6b18b79eccd8391"}},{"arxiv_id":"1806.04965","arxiv_id_is_arxiv":true,"paper":"/paper/the-streaming-rollout-of-deep-networks","title":"The streaming rollout of deep networks - towards fully model-parallel execution","date":"2018-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/statestream","path":"statestream/backends/backend_tensorflow.py","file_url":"https://github.com/boschresearch/statestream/blob/HEAD/statestream/backends/backend_tensorflow.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":"c0eee06fb792d65d","code_sha256_prefix":"c0eee06fb792d65d","mcp_get_code":{"code_sha256":"c0eee06fb792d65d"}},{"arxiv_id":"1711.04436","arxiv_id_is_arxiv":true,"paper":"/paper/sqlnet-generating-structured-queries-from","title":"SQLNet: Generating Structured Queries From Natural Language Without Reinforcement Learning","date":"2017-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CX000/sqlnet_inference_py36","path":"ewc.py","file_url":"https://github.com/CX000/sqlnet_inference_py36/blob/HEAD/ewc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from oakdata/benchmark, and GitHub detected no licence in that repository when it was checked","code_sha256":"d95385178f502fa2","code_sha256_prefix":"d95385178f502fa2","mcp_get_code":{"code_sha256":"d95385178f502fa2"}},{"arxiv_id":"1512.03385","arxiv_id_is_arxiv":true,"paper":"/paper/deep-residual-learning-for-image-recognition","title":"Deep Residual Learning for Image Recognition","date":"2015-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rickyHong/tfRecord-Caltech256-repl2","path":"model.py","file_url":"https://github.com/rickyHong/tfRecord-Caltech256-repl2/blob/HEAD/model.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":"6f0645ad376b9a94","code_sha256_prefix":"6f0645ad376b9a94","mcp_get_code":{"code_sha256":"6f0645ad376b9a94"}},{"arxiv_id":"1503.03832","arxiv_id_is_arxiv":true,"paper":"/paper/facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"M155K4R4/facenet","path":"fr_utils.py","file_url":"https://github.com/M155K4R4/facenet/blob/HEAD/fr_utils.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":"584f6191f14390d8","code_sha256_prefix":"584f6191f14390d8","mcp_get_code":{"code_sha256":"584f6191f14390d8"}},{"arxiv_id":"1202.1056","arxiv_id_is_arxiv":true,"paper":"/paper/building-a-framework-for-predictive-science","title":"Building a Framework for Predictive Science","date":null,"month_inferred_from_arxiv_id":"2012-02","title_source":"archive","repo":"vdods/vorpy","path":"vorpy/symbolic.py","file_url":"https://github.com/vdods/vorpy/blob/HEAD/vorpy/symbolic.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":"df5dbaf5fee7d5c4","code_sha256_prefix":"df5dbaf5fee7d5c4","mcp_get_code":{"code_sha256":"df5dbaf5fee7d5c4"}}],"record_sha256":"d98d47bf42539029098e573f7eff4e1109847f31ed06c8681d3d3157d9951737","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}