{"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/reshape","entry":"reshape","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":14,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":4,"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":11,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":14,"n_places_pointer_only":5,"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":2,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":2,"ran":5,"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":"2505.18514","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-adaptation-with-binary-feedback","title":"Test-Time Adaptation with Binary Feedback","date":"2025-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taeckyung/BiTTA","path":"process_cifar.py","file_url":"https://github.com/taeckyung/BiTTA/blob/HEAD/process_cifar.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 dmn-sjk/ar-tta, and GitHub detected no licence in that repository when it was checked","code_sha256":"92bc8db96a48bcb0","code_sha256_prefix":"92bc8db96a48bcb0","mcp_get_code":{"code_sha256":"92bc8db96a48bcb0"}},{"arxiv_id":"2408.00677","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-backwards-minimal-synthetic-pre","title":"Scaling Backwards: Minimal Synthetic Pre-training?","date":"2024-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SUPER-TADORY/1p-frac","path":"1p-frac_generater/src/render_from_oneparam_mp.py","file_url":"https://github.com/SUPER-TADORY/1p-frac/blob/HEAD/1p-frac_generater/src/render_from_oneparam_mp.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":"6b023b60d9e509b4","code_sha256_prefix":"6b023b60d9e509b4","mcp_get_code":{"code_sha256":"6b023b60d9e509b4"}},{"arxiv_id":"2405.11724","arxiv_id_is_arxiv":true,"paper":"/paper/token-wise-influential-training-data","title":"Token-wise Influential Training Data Retrieval for Large Language Models","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huawei-lin/RapidIn","path":"RapidIn/calc_inner.py","file_url":"https://github.com/huawei-lin/RapidIn/blob/HEAD/RapidIn/calc_inner.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, huawei-lin/RapidIn (NOASSERTION)","code_sha256":"b357ed81d43c6083","code_sha256_prefix":"b357ed81d43c6083","mcp_get_code":{"code_sha256":"b357ed81d43c6083"}},{"arxiv_id":"2404.01351","arxiv_id_is_arxiv":true,"paper":"/paper/aetta-label-free-accuracy-estimation-for-test","title":"AETTA: Label-Free Accuracy Estimation for Test-Time Adaptation","date":"2024-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taeckyung/AETTA","path":"process_cifar.py","file_url":"https://github.com/taeckyung/AETTA/blob/HEAD/process_cifar.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 dmn-sjk/ar-tta, and GitHub detected no licence in that repository when it was checked","code_sha256":"92bc8db96a48bcb0","code_sha256_prefix":"92bc8db96a48bcb0","mcp_get_code":{"code_sha256":"92bc8db96a48bcb0"}},{"arxiv_id":"2309.10109","arxiv_id_is_arxiv":true,"paper":"/paper/ar-tta-a-simple-method-for-real-world","title":"AR-TTA: A Simple Method for Real-World Continual Test-Time Adaptation","date":"2023-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmn-sjk/ar-tta","path":"utils/process_cifar.py","file_url":"https://github.com/dmn-sjk/ar-tta/blob/HEAD/utils/process_cifar.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, dmn-sjk/ar-tta when it was checked","code_sha256":"92bc8db96a48bcb0","code_sha256_prefix":"92bc8db96a48bcb0","mcp_get_code":{"code_sha256":"92bc8db96a48bcb0"}},{"arxiv_id":"2303.01748","arxiv_id_is_arxiv":true,"paper":"/paper/generative-diffusions-in-augmented-spaces-a","title":"A Complete Recipe for Diffusion Generative Models","date":"2023-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mandt-lab/PSLD","path":"main/models/sde/psld.py","file_url":"https://github.com/mandt-lab/PSLD/blob/HEAD/main/models/sde/psld.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":"62c4665c28db4ae0","code_sha256_prefix":"62c4665c28db4ae0","mcp_get_code":{"code_sha256":"62c4665c28db4ae0"}},{"arxiv_id":"2106.09179","arxiv_id_is_arxiv":true,"paper":"/paper/amortized-auto-tuning-cost-efficient-transfer","title":"Amortized Auto-Tuning: Cost-Efficient Bayesian Transfer Optimization for Hyperparameter Recommendation","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaoyuxin1002/amortized-auto-tuning","path":"code/util.py","file_url":"https://github.com/xiaoyuxin1002/amortized-auto-tuning/blob/HEAD/code/util.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":"12641c59b869ffd3","code_sha256_prefix":"12641c59b869ffd3","mcp_get_code":{"code_sha256":"12641c59b869ffd3"}},{"arxiv_id":"1912.03478","arxiv_id_is_arxiv":true,"paper":"/paper/a-real-time-global-inference-network-for-one","title":"A Real-time Global Inference Network for One-stage Referring Expression Comprehension","date":"2019-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luogen1996/Real-time-Global-Inference-Network","path":"code/evaluator.py","file_url":"https://github.com/luogen1996/Real-time-Global-Inference-Network/blob/HEAD/code/evaluator.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":"fdb481756a08ea1e","code_sha256_prefix":"fdb481756a08ea1e","mcp_get_code":{"code_sha256":"fdb481756a08ea1e"}},{"arxiv_id":"1908.07129","arxiv_id_is_arxiv":true,"paper":"/paper/zero-shot-grounding-of-objects-from-natural","title":"Zero-Shot Grounding of Objects from Natural Language Queries","date":"2019-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TheShadow29/zsgnet-pytorch","path":"code/evaluator.py","file_url":"https://github.com/TheShadow29/zsgnet-pytorch/blob/HEAD/code/evaluator.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":"fdb481756a08ea1e","code_sha256_prefix":"fdb481756a08ea1e","mcp_get_code":{"code_sha256":"fdb481756a08ea1e"}},{"arxiv_id":"1907.01702","arxiv_id_is_arxiv":true,"paper":"/paper/time-series-anomaly-detection-with","title":"VELC: A New Variational AutoEncoder Based Model for Time Series Anomaly Detection","date":"2019-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vikrant7981/anomaly_detection","path":"velc.py","file_url":"https://github.com/Vikrant7981/anomaly_detection/blob/HEAD/velc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Vikrant7981/anomaly_detection when it was checked","code_sha256":"5f38c3354188653e","code_sha256_prefix":"5f38c3354188653e","mcp_get_code":{"code_sha256":"5f38c3354188653e"}},{"arxiv_id":"1905.02685","arxiv_id_is_arxiv":true,"paper":"/paper/knowing-the-what-but-not-the-where-in","title":"Knowing The What But Not The Where in Bayesian Optimization","date":"2019-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntienvu/KnownOptimum_BO","path":"bayes_opt/functions.py","file_url":"https://github.com/ntienvu/KnownOptimum_BO/blob/HEAD/bayes_opt/functions.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":"01f4ab62c87bb37c","code_sha256_prefix":"01f4ab62c87bb37c","mcp_get_code":{"code_sha256":"01f4ab62c87bb37c"}},{"arxiv_id":"1605.03795","arxiv_id_is_arxiv":true,"paper":"/paper/exponential-machines","title":"Exponential Machines","date":"2016-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bihaqo/exp-machines","path":"src/models/all_subsets.py","file_url":"https://github.com/Bihaqo/exp-machines/blob/HEAD/src/models/all_subsets.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":"d8167a9ebe9bdfe8","code_sha256_prefix":"d8167a9ebe9bdfe8","mcp_get_code":{"code_sha256":"d8167a9ebe9bdfe8"}},{"arxiv_id":"1406.2661","arxiv_id_is_arxiv":true,"paper":"/paper/generative-adversarial-networks","title":"Generative Adversarial Networks","date":"2014-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BYOGan/BYOGan","path":"byogan-api/utils.py","file_url":"https://github.com/BYOGan/BYOGan/blob/HEAD/byogan-api/utils.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":"3c66cc5a69a1dec2","code_sha256_prefix":"3c66cc5a69a1dec2","mcp_get_code":{"code_sha256":"3c66cc5a69a1dec2"}},{"arxiv_id":"aaai_33826","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_33826","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Lampertos/RSCR","path":"module/_rc_operations.py","file_url":"https://github.com/Lampertos/RSCR/blob/HEAD/module/_rc_operations.py","status":"ran","verification_level":1,"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":"83c6504d0c6a1068","code_sha256_prefix":"83c6504d0c6a1068","mcp_get_code":{"code_sha256":"83c6504d0c6a1068"}}],"record_sha256":"14778adc3eaf9e2d240505ec9722836ce3c33cace46030f8f1442148360a7ce7","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}