{"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/abstractmodel","entry":"AbstractModel","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":10,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":11,"n_samples_ran":6,"n_samples_constructed":6,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":11,"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":6,"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":"2605.13672","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-13672","title":"SpurAudio: A Benchmark for Studying Shortcut Learning in Few-Shot Audio Classification","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Jerryaa98/SpurAudio","path":"libfewshot_core/model/metric/feat.py","file_url":"https://github.com/Jerryaa98/SpurAudio/blob/HEAD/libfewshot_core/model/metric/feat.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":"56696393367f0720","code_sha256_prefix":"56696393367f0720","mcp_get_code":{"code_sha256":"56696393367f0720"}},{"arxiv_id":"2603.00056","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-00056","title":"How effective are VLMs in assisting humans in inferring the quality of mental models from Multimodal short answers?","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"psil123/MMGrader","path":"models.py","file_url":"https://github.com/psil123/MMGrader/blob/HEAD/models.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, psil123/MMGrader when it was checked","code_sha256":"7383a33664074bbb","code_sha256_prefix":"7383a33664074bbb","mcp_get_code":{"code_sha256":"7383a33664074bbb"}},{"arxiv_id":"2410.13117","arxiv_id_is_arxiv":true,"paper":"/paper/preference-diffusion-for-recommendation","title":"Preference Diffusion for Recommendation","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lswhim/preferdiff","path":"models/PreferDiff/_model.py","file_url":"https://github.com/lswhim/preferdiff/blob/HEAD/models/PreferDiff/_model.py","status":"ran","verification_level":1,"contract_check":null,"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, lswhim/preferdiff when it was checked","code_sha256":"9cee7b29292819c9","code_sha256_prefix":"9cee7b29292819c9","mcp_get_code":{"code_sha256":"9cee7b29292819c9"}},{"arxiv_id":"2403.01915","arxiv_id_is_arxiv":true,"paper":"/paper/xt-nested-tokenization-for-larger-context-in","title":"xT: Nested Tokenization for Larger Context in Large Images","date":"2024-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bair-climate-initiative/xT","path":"xt/models/decoders/decoder.py","file_url":"https://github.com/bair-climate-initiative/xT/blob/HEAD/xt/models/decoders/decoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d22a704c40119ed6","code_sha256_prefix":"d22a704c40119ed6","mcp_get_code":{"code_sha256":"d22a704c40119ed6"}},{"arxiv_id":"2301.07945","arxiv_id_is_arxiv":true,"paper":"/paper/pdformer-propagation-delay-aware-dynamic-long","title":"PDFormer: Propagation Delay-Aware Dynamic Long-Range Transformer for Traffic Flow Prediction","date":"2023-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BUAABIGSCity/PDFormer","path":"libcity/model/traffic_flow_prediction/PDFormer.py","file_url":"https://github.com/BUAABIGSCity/PDFormer/blob/HEAD/libcity/model/traffic_flow_prediction/PDFormer.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":"0e6afce580fb1502","code_sha256_prefix":"0e6afce580fb1502","mcp_get_code":{"code_sha256":"0e6afce580fb1502"}},{"arxiv_id":"2212.13005","arxiv_id_is_arxiv":true,"paper":"/paper/textbox-2-0-a-text-generation-library-with","title":"TextBox 2.0: A Text Generation Library with Pre-trained Language Models","date":"2022-12-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RUCAIBox/TextBox","path":"textbox/model/abstract_model.py","file_url":"https://github.com/RUCAIBox/TextBox/blob/HEAD/textbox/model/abstract_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"36d020284e254099","code_sha256_prefix":"36d020284e254099","mcp_get_code":{"code_sha256":"36d020284e254099"}},{"arxiv_id":"2002.06298","arxiv_id_is_arxiv":true,"paper":"/paper/extreme-classification-via-adversarial-1","title":"Extreme Classification via Adversarial Softmax Approximation","date":"2020-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mandt-lab/adversarial-negative-sampling","path":"main_model/supervised_nce_model.py","file_url":"https://github.com/mandt-lab/adversarial-negative-sampling/blob/HEAD/main_model/supervised_nce_model.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":"7d1d233de7618263","code_sha256_prefix":"7d1d233de7618263","mcp_get_code":{"code_sha256":"7d1d233de7618263"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EPFL-VILAB/XDEnsembles","path":"modules/unet.py","file_url":"https://github.com/EPFL-VILAB/XDEnsembles/blob/HEAD/modules/unet.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, EPFL-VILAB/XDEnsembles when it was checked","code_sha256":"40c22ac66e6254de","code_sha256_prefix":"40c22ac66e6254de","mcp_get_code":{"code_sha256":"40c22ac66e6254de"}},{"arxiv_id":"1505.04597","arxiv_id_is_arxiv":true,"paper":"/paper/u-net-convolutional-networks-for-biomedical","title":"U-Net: Convolutional Networks for Biomedical Image Segmentation","date":"2015-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EPFL-VILAB/3DCommonCorruptions","path":"models/unet.py","file_url":"https://github.com/EPFL-VILAB/3DCommonCorruptions/blob/HEAD/models/unet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"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, EPFL-VILAB/3DCommonCorruptions (NOASSERTION)","code_sha256":"82b82d7c4339e979","code_sha256_prefix":"82b82d7c4339e979","mcp_get_code":{"code_sha256":"82b82d7c4339e979"}},{"arxiv_id":"1301.3781","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-estimation-of-word-representations","title":"Efficient Estimation of Word Representations in Vector Space","date":"2013-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bigscity-VecCity/VecCity","path":"veccity/upstream/poi_representation/w2v.py","file_url":"https://github.com/Bigscity-VecCity/VecCity/blob/HEAD/veccity/upstream/poi_representation/w2v.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f531245c73ab5076","code_sha256_prefix":"f531245c73ab5076","mcp_get_code":{"code_sha256":"f531245c73ab5076"}},{"arxiv_id":"ijcai2025_0648","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0648","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"BW297/FACD","path":"model/FACD.py","file_url":"https://github.com/BW297/FACD/blob/HEAD/model/FACD.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":"157e733873a26483","code_sha256_prefix":"157e733873a26483","mcp_get_code":{"code_sha256":"157e733873a26483"}}],"record_sha256":"4967d772e369dc96ed559756e26fdb6bd24cbcdd74d28ae0501f15c6992f10e0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}