{"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/teacher","entry":"Teacher","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":1,"n_papers_ran_no_instrument_failure":1,"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":6,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"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":1,"unverified":5},"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":"2501.10459","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-traffic-prediction-through-spatio","title":"Efficient Traffic Prediction Through Spatio-Temporal Distillation","date":"2025-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lizzyhku/TP","path":"model/Teacher.py","file_url":"https://github.com/lizzyhku/TP/blob/HEAD/model/Teacher.py","status":"unverified","verification_level":0,"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, lizzyhku/TP when it was checked","code_sha256":"9df45c1073f037a9","code_sha256_prefix":"9df45c1073f037a9","mcp_get_code":{"code_sha256":"9df45c1073f037a9"}},{"arxiv_id":"2407.20299","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-distillation-for-offline","title":"Dataset Distillation for Offline Reinforcement Learning","date":"2024-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ggflow123/ddrl","path":"src/data_distillation_training_offline.py","file_url":"https://github.com/ggflow123/ddrl/blob/HEAD/src/data_distillation_training_offline.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":"f36979f0b3c89a3e","code_sha256_prefix":"f36979f0b3c89a3e","mcp_get_code":{"code_sha256":"f36979f0b3c89a3e"}},{"arxiv_id":"2206.04546","arxiv_id_is_arxiv":true,"paper":"/paper/pragmatically-learning-from-pedagogical","title":"Pragmatically Learning from Pedagogical Demonstrations in Multi-Goal Environments","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"caselles/neurips22-demonstrations-pedagogy-pragmatism","path":"teacher/teacher.py","file_url":"https://github.com/caselles/neurips22-demonstrations-pedagogy-pragmatism/blob/HEAD/teacher/teacher.py","status":"unverified","verification_level":0,"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, caselles/neurips22-demonstrations-pedagogy-pragmatism when it was checked","code_sha256":"0b2e3cdef0d1febc","code_sha256_prefix":"0b2e3cdef0d1febc","mcp_get_code":{"code_sha256":"0b2e3cdef0d1febc"}},{"arxiv_id":"2202.01913","arxiv_id_is_arxiv":true,"paper":"/paper/time-constrained-learning","title":"Time-Constrained Learning","date":"2022-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sfilhofreitas/timeconstrainedlearning","path":"machine_teacher/Teachers/DoubleTeacher.py","file_url":"https://github.com/sfilhofreitas/timeconstrainedlearning/blob/HEAD/machine_teacher/Teachers/DoubleTeacher.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, sfilhofreitas/timeconstrainedlearning when it was checked","code_sha256":"1848fae7f23b329e","code_sha256_prefix":"1848fae7f23b329e","mcp_get_code":{"code_sha256":"1848fae7f23b329e"}},{"arxiv_id":"2106.09701","arxiv_id_is_arxiv":true,"paper":"/paper/always-be-dreaming-a-new-approach-for-data","title":"Always Be Dreaming: A New Approach for Data-Free Class-Incremental Learning","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-RIPL/AlwaysBeDreaming-DFCIL","path":"learners/datafree.py","file_url":"https://github.com/GT-RIPL/AlwaysBeDreaming-DFCIL/blob/HEAD/learners/datafree.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":"cb85f08759159ac2","code_sha256_prefix":"cb85f08759159ac2","mcp_get_code":{"code_sha256":"cb85f08759159ac2"}},{"arxiv_id":"2106.04696","arxiv_id_is_arxiv":true,"paper":"/paper/curriculum-design-for-teaching-via","title":"Curriculum Design for Teaching via Demonstrations: Theory and Applications","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adishs/neurips2021_curriculum-teaching-demonstrations_code","path":"code_cardriving/IRL/teacher.py","file_url":"https://github.com/adishs/neurips2021_curriculum-teaching-demonstrations_code/blob/HEAD/code_cardriving/IRL/teacher.py","status":"unverified","verification_level":0,"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, adishs/neurips2021_curriculum-teaching-demonstrations_code when it was checked","code_sha256":"21e86b1fb6ec104c","code_sha256_prefix":"21e86b1fb6ec104c","mcp_get_code":{"code_sha256":"21e86b1fb6ec104c"}}],"record_sha256":"55211a4f7e6cd534856baa8e4fb5d7864925b8c5930b04d5f0a87d8ef972f647","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}