{"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/refine-predictions","entry":"refine_predictions","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":6,"n_papers_ran_no_instrument_failure":4,"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":4,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":7,"n_places_pointer_only_link_open":2,"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":1,"ran":1,"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":"2609.02507","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-02507","title":"Rethinking the Teacher-Student Framework for Test-Time Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"dmn-sjk/intransigent_teacher","path":"methods/adacontrast.py","file_url":"https://github.com/dmn-sjk/intransigent_teacher/blob/HEAD/methods/adacontrast.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, dmn-sjk/intransigent_teacher when it was checked","code_sha256":"6c5a8d4a69a975c2","code_sha256_prefix":"6c5a8d4a69a975c2","mcp_get_code":{"code_sha256":"6c5a8d4a69a975c2"}},{"arxiv_id":"2608.05900","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-05900","title":"CohortHijack: Robustness of Single Cell Annotation to Companion Cell Removal","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"arashVsh/CohortHijack","path":"contextcell/audits.py","file_url":"https://github.com/arashVsh/CohortHijack/blob/HEAD/contextcell/audits.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, arashVsh/CohortHijack (NOASSERTION)","code_sha256":"58aa4c1c788d62c5","code_sha256_prefix":"58aa4c1c788d62c5","mcp_get_code":{"code_sha256":"58aa4c1c788d62c5"}},{"arxiv_id":"2603.21928","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-21928","title":"The Golden Subspace: Where Efficiency Meets Generalization in Continual Test-Time Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"AIGNLAI/GOLD","path":"classification/methods/adacontrast.py","file_url":"https://github.com/AIGNLAI/GOLD/blob/HEAD/classification/methods/adacontrast.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, AIGNLAI/GOLD when it was checked","code_sha256":"6c5a8d4a69a975c2","code_sha256_prefix":"6c5a8d4a69a975c2","mcp_get_code":{"code_sha256":"6c5a8d4a69a975c2"}},{"arxiv_id":"2310.20199","arxiv_id_is_arxiv":true,"paper":"/paper/in-search-of-lost-online-test-time-adaptation","title":"In Search of Lost Online Test-time Adaptation: A Survey","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jo-wang/otta_vit_survey","path":"classification/methods/adacontrast.py","file_url":"https://github.com/jo-wang/otta_vit_survey/blob/HEAD/classification/methods/adacontrast.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from AIGNLAI/GOLD, and GitHub detected no licence in that repository when it was checked","code_sha256":"6c5a8d4a69a975c2","code_sha256_prefix":"6c5a8d4a69a975c2","mcp_get_code":{"code_sha256":"6c5a8d4a69a975c2"}},{"arxiv_id":"2303.03770","arxiv_id_is_arxiv":true,"paper":"/paper/guiding-pseudo-labels-with-uncertainty","title":"Guiding Pseudo-labels with Uncertainty Estimation for Source-free Unsupervised Domain Adaptation","date":"2023-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mattialitrico/guiding-pseudo-labels-with-uncertainty-estimation-for-test-time-adaptation","path":"train_target.py","file_url":"https://github.com/mattialitrico/guiding-pseudo-labels-with-uncertainty-estimation-for-test-time-adaptation/blob/HEAD/train_target.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, mattialitrico/guiding-pseudo-labels-with-uncertainty-estimation-for-test-time-adaptation when it was checked","code_sha256":"4058f8bddeb370b9","code_sha256_prefix":"4058f8bddeb370b9","mcp_get_code":{"code_sha256":"4058f8bddeb370b9"}},{"arxiv_id":"2204.10377","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-test-time-adaptation","title":"Contrastive Test-Time Adaptation","date":"2022-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DianCh/AdaContrast","path":"target.py","file_url":"https://github.com/DianCh/AdaContrast/blob/HEAD/target.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, DianCh/AdaContrast when it was checked","code_sha256":"d974e249f37878d2","code_sha256_prefix":"d974e249f37878d2","mcp_get_code":{"code_sha256":"d974e249f37878d2"}},{"arxiv_id":"Ni_Maintaining_Consistent_Inter-Class_Topology_in_Continual_Test-Time_Adaptation_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ni_Maintaining_Consistent_Inter-Class_Topology_in_Continual_Test-Time_Adaptation_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Successybbdwm/TCA","path":"classification/methods/adacontrast.py","file_url":"https://github.com/Successybbdwm/TCA/blob/HEAD/classification/methods/adacontrast.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from AIGNLAI/GOLD, and GitHub detected no licence in that repository when it was checked","code_sha256":"6c5a8d4a69a975c2","code_sha256_prefix":"6c5a8d4a69a975c2","mcp_get_code":{"code_sha256":"6c5a8d4a69a975c2"}}],"record_sha256":"c73abd740cb9e92516f210752e351ff77539d2452047983e84c405ed31a8976a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}