{"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/set-device","entry":"set_device","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":16,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":12,"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":13,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":10,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":16,"n_places_pointer_only":5,"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":9,"ran_fixture":1,"ran":2,"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":"2602.10541","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10541","title":"FASTLSQ: SOLVING PDES IN ONE SHOT VIA FOURIER FEATURES WITH EXACT ANALYTICAL DERIVATIVES","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"sulcantonin/FastLSQ","path":"fastlsq/device.py","file_url":"https://github.com/sulcantonin/FastLSQ/blob/HEAD/fastlsq/device.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":"2dfdb1e1b1adde16","code_sha256_prefix":"2dfdb1e1b1adde16","mcp_get_code":{"code_sha256":"2dfdb1e1b1adde16"}},{"arxiv_id":"2507.04976","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.04976","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"EsYoon7/UVQA","path":"data_generation/utils.py","file_url":"https://github.com/EsYoon7/UVQA/blob/HEAD/data_generation/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, EsYoon7/UVQA when it was checked","code_sha256":"167c8f10b0372c1e","code_sha256_prefix":"167c8f10b0372c1e","mcp_get_code":{"code_sha256":"167c8f10b0372c1e"}},{"arxiv_id":"2505.18909","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-role-of-label-noise-in-the-feature","title":"On the Role of Label Noise in the Feature Learning Process","date":"2025-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzp1012/label-noise-theory","path":"src/utils/utils.py","file_url":"https://github.com/zzp1012/label-noise-theory/blob/HEAD/src/utils/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":"3e7cb9bdaf2ede2d","code_sha256_prefix":"3e7cb9bdaf2ede2d","mcp_get_code":{"code_sha256":"3e7cb9bdaf2ede2d"}},{"arxiv_id":"2411.05172","arxiv_id_is_arxiv":true,"paper":"/paper/impscore-a-learnable-metric-for-quantifying","title":"ImpScore: A Learnable Metric For Quantifying The Implicitness Level of Language","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"audreycs/ImpScore","path":"utils.py","file_url":"https://github.com/audreycs/ImpScore/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, audreycs/ImpScore when it was checked","code_sha256":"b8a5ec84168326fb","code_sha256_prefix":"b8a5ec84168326fb","mcp_get_code":{"code_sha256":"b8a5ec84168326fb"}},{"arxiv_id":"2410.06581","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-legal-case-retrieval-via-scaling","title":"Enhancing Legal Case Retrieval via Scaling High-quality Synthetic Query-Candidate Pairs","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/DeepTHULAC","path":"deepthulac/utils.py","file_url":"https://github.com/thunlp/DeepTHULAC/blob/HEAD/deepthulac/utils.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":"b573a2abcfda8b28","code_sha256_prefix":"b573a2abcfda8b28","mcp_get_code":{"code_sha256":"b573a2abcfda8b28"}},{"arxiv_id":"2407.16802","arxiv_id_is_arxiv":true,"paper":"/paper/distribution-aware-robust-learning-from-long","title":"Distribution-Aware Robust Learning from Long-Tailed Data with Noisy Labels","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JaesoonBaik1213/DaSC","path":"settings/configs.py","file_url":"https://github.com/JaesoonBaik1213/DaSC/blob/HEAD/settings/configs.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":"1edaa58918fd8481","code_sha256_prefix":"1edaa58918fd8481","mcp_get_code":{"code_sha256":"1edaa58918fd8481"}},{"arxiv_id":"2405.14660","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-in-context-learning","title":"Implicit In-context Learning","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lzvv123456/i2cl","path":"utils.py","file_url":"https://github.com/lzvv123456/i2cl/blob/HEAD/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"39337f4c7d83dd47","code_sha256_prefix":"39337f4c7d83dd47","mcp_get_code":{"code_sha256":"39337f4c7d83dd47"}},{"arxiv_id":"2404.10980","arxiv_id_is_arxiv":true,"paper":"/paper/hyper-evidential-deep-learning-to-quantify","title":"Hyper Evidential Deep Learning to Quantify Composite Classification Uncertainty","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugo101/hyperevidentialnn","path":"loss.py","file_url":"https://github.com/hugo101/hyperevidentialnn/blob/HEAD/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, hugo101/hyperevidentialnn when it was checked","code_sha256":"738b6fd08eb730be","code_sha256_prefix":"738b6fd08eb730be","mcp_get_code":{"code_sha256":"738b6fd08eb730be"}},{"arxiv_id":"2403.03952","arxiv_id_is_arxiv":true,"paper":"/paper/bridging-language-and-items-for-retrieval-and","title":"Bridging Language and Items for Retrieval and Recommendation","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyp1231/amazonreviews2023","path":"product_search_results/eval_search.py","file_url":"https://github.com/hyp1231/amazonreviews2023/blob/HEAD/product_search_results/eval_search.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed35e0d4806e7255","code_sha256_prefix":"ed35e0d4806e7255","mcp_get_code":{"code_sha256":"ed35e0d4806e7255"}},{"arxiv_id":"2402.03660","arxiv_id_is_arxiv":true,"paper":"/paper/cross-task-linearity-emerges-in-the","title":"On the Emergence of Cross-Task Linearity in the Pretraining-Finetuning Paradigm","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzp1012/cross-task-linearity","path":"task_arithemetic_t5/utils.py","file_url":"https://github.com/zzp1012/cross-task-linearity/blob/HEAD/task_arithemetic_t5/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":"3e7cb9bdaf2ede2d","code_sha256_prefix":"3e7cb9bdaf2ede2d","mcp_get_code":{"code_sha256":"3e7cb9bdaf2ede2d"}},{"arxiv_id":"2310.04993","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-augmented-temporal-point-process-for","title":"Prompt-augmented Temporal Point Process for Streaming Event Sequence","date":"2023-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanyansann/prompttpp","path":"model_run/neural_tpp/model/torch_model/torch_pro_anhp.py","file_url":"https://github.com/yanyansann/prompttpp/blob/HEAD/model_run/neural_tpp/model/torch_model/torch_pro_anhp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e7ad66f463619d1","code_sha256_prefix":"2e7ad66f463619d1","mcp_get_code":{"code_sha256":"2e7ad66f463619d1"}},{"arxiv_id":"2211.13227","arxiv_id_is_arxiv":true,"paper":"/paper/paint-by-example-exemplar-based-image-editing","title":"Paint by Example: Exemplar-based Image Editing with Diffusion Models","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LonglongaaaGo/EXE-GAN","path":"fid_eval.py","file_url":"https://github.com/LonglongaaaGo/EXE-GAN/blob/HEAD/fid_eval.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":"1fdf42050ecd38e7","code_sha256_prefix":"1fdf42050ecd38e7","mcp_get_code":{"code_sha256":"1fdf42050ecd38e7"}},{"arxiv_id":"2211.00631","arxiv_id_is_arxiv":true,"paper":"/paper/composite-feature-selection-using-deep","title":"Composite Feature Selection using Deep Ensembles","date":"2022-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"a-norcliffe/composite-feature-selection","path":"experiments/run_experiment.py","file_url":"https://github.com/a-norcliffe/composite-feature-selection/blob/HEAD/experiments/run_experiment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4321a42df5ef22c5","code_sha256_prefix":"4321a42df5ef22c5","mcp_get_code":{"code_sha256":"4321a42df5ef22c5"}},{"arxiv_id":"1902.10909","arxiv_id_is_arxiv":true,"paper":"/paper/bert-for-joint-intent-classification-and-slot","title":"BERT for Joint Intent Classification and Slot Filling","date":"2019-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yinghao1019/Joint_learn","path":"predict.py","file_url":"https://github.com/yinghao1019/Joint_learn/blob/HEAD/predict.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, yinghao1019/Joint_learn when it was checked","code_sha256":"cfd666d38b923d90","code_sha256_prefix":"cfd666d38b923d90","mcp_get_code":{"code_sha256":"cfd666d38b923d90"}},{"arxiv_id":"1609.01454","arxiv_id_is_arxiv":true,"paper":"/paper/attention-based-recurrent-neural-network","title":"Attention-Based Recurrent Neural Network Models for Joint Intent Detection and Slot Filling","date":"2016-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"cfd666d38b923d90","code_sha256_prefix":"cfd666d38b923d90","mcp_get_code":{"code_sha256":"cfd666d38b923d90"}},{"arxiv_id":"2025.findings-acl.307","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.307","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"hyp1231/AmazonReviews2023","path":"product_search_results/eval_search.py","file_url":"https://github.com/hyp1231/AmazonReviews2023/blob/HEAD/product_search_results/eval_search.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed35e0d4806e7255","code_sha256_prefix":"ed35e0d4806e7255","mcp_get_code":{"code_sha256":"ed35e0d4806e7255"}}],"record_sha256":"cca244c4f7425ddf3da4ab9802ce488d74108b9b0ce6157ba7e8286432b7a915","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}