{"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/ensemble","entry":"ensemble","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":2,"n_papers_ran_no_instrument_failure":1,"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":7,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":1,"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":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":"2502.12018","arxiv_id_is_arxiv":true,"paper":"/paper/atom-of-thoughts-for-markov-llm-test-time","title":"Atom of Thoughts for Markov LLM Test-Time Scaling","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qixucen/atom","path":"experiment/module.py","file_url":"https://github.com/qixucen/atom/blob/HEAD/experiment/module.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ac893a0ca4c742c","code_sha256_prefix":"3ac893a0ca4c742c","mcp_get_code":{"code_sha256":"3ac893a0ca4c742c"}},{"arxiv_id":"2310.01717","arxiv_id_is_arxiv":true,"paper":"/paper/ensemble-distillation-for-unsupervised","title":"Ensemble Distillation for Unsupervised Constituency Parsing","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manga-uofa/ed4ucp","path":"library/ensemble.py","file_url":"https://github.com/manga-uofa/ed4ucp/blob/HEAD/library/ensemble.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, manga-uofa/ed4ucp when it was checked","code_sha256":"ca29ff79958717b6","code_sha256_prefix":"ca29ff79958717b6","mcp_get_code":{"code_sha256":"ca29ff79958717b6"}},{"arxiv_id":"2306.08328","arxiv_id_is_arxiv":true,"paper":"/paper/distribution-shift-inversion-for-out-of-1","title":"Distribution Shift Inversion for Out-of-Distribution Prediction","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yu-rp/distribution-shift-iverson","path":"DSI/Predictor/ensemble.py","file_url":"https://github.com/yu-rp/distribution-shift-iverson/blob/HEAD/DSI/Predictor/ensemble.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":"abee7dd03af97a09","code_sha256_prefix":"abee7dd03af97a09","mcp_get_code":{"code_sha256":"abee7dd03af97a09"}},{"arxiv_id":"2303.14307","arxiv_id_is_arxiv":true,"paper":"/paper/auto-avsr-audio-visual-speech-recognition","title":"Auto-AVSR: Audio-Visual Speech Recognition with Automatic Labels","date":"2023-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mpc001/auto_avsr","path":"average_checkpoints.py","file_url":"https://github.com/mpc001/auto_avsr/blob/HEAD/average_checkpoints.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":"eddc218242d34add","code_sha256_prefix":"eddc218242d34add","mcp_get_code":{"code_sha256":"eddc218242d34add"}},{"arxiv_id":"1904.09546","arxiv_id_is_arxiv":true,"paper":"/paper/deepcaps-going-deeper-with-capsule-networks","title":"DeepCaps: Going Deeper with Capsule Networks","date":"2019-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brjathu/deepcaps","path":"ensemble.py","file_url":"https://github.com/brjathu/deepcaps/blob/HEAD/ensemble.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":"318b1bac54fc918c","code_sha256_prefix":"318b1bac54fc918c","mcp_get_code":{"code_sha256":"318b1bac54fc918c"}},{"arxiv_id":"1606.04474","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-learn-by-gradient-descent-by","title":"Learning to learn by gradient descent by gradient descent","date":"2016-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/learning-to-learn","path":"problems.py","file_url":"https://github.com/deepmind/learning-to-learn/blob/HEAD/problems.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":"b69df76f969a0132","code_sha256_prefix":"b69df76f969a0132","mcp_get_code":{"code_sha256":"b69df76f969a0132"}},{"arxiv_id":"2025.acl-short.87","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.acl-short.87","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tti-kde/CVAE-NER","path":"src/ensemble.py","file_url":"https://github.com/tti-kde/CVAE-NER/blob/HEAD/src/ensemble.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":"a5afb1cd71ba6e64","code_sha256_prefix":"a5afb1cd71ba6e64","mcp_get_code":{"code_sha256":"a5afb1cd71ba6e64"}}],"record_sha256":"160a321c93156d9d845de63d24bfa7e10efe72d9929f431b0ceebf237fd55e58","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}