{"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/get-key","entry":"get_key","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":10,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":6,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":10,"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":6,"ran_fixture":0,"ran":4,"unverified":0},"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.17871","arxiv_id_is_arxiv":true,"paper":"/paper/blast-balanced-sampling-time-series-corpus","title":"BLAST: Balanced Sampling Time Series Corpus for Universal Forecasting Models","date":"2025-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gestaltcogteam/blast","path":"raw_data_construction/Chronos_read_and_save.py","file_url":"https://github.com/gestaltcogteam/blast/blob/HEAD/raw_data_construction/Chronos_read_and_save.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af44cc9be52e766c","code_sha256_prefix":"af44cc9be52e766c","mcp_get_code":{"code_sha256":"af44cc9be52e766c"}},{"arxiv_id":"2404.19287","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-the-adversarial-robustness-of","title":"Revisiting the Adversarial Robustness of Vision Language Models: a Multimodal Perspective","date":"2024-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ellezwq/mmcoa","path":"utils_2.py","file_url":"https://github.com/ellezwq/mmcoa/blob/HEAD/utils_2.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":"d121638ef1dea109","code_sha256_prefix":"d121638ef1dea109","mcp_get_code":{"code_sha256":"d121638ef1dea109"}},{"arxiv_id":"2404.14688","arxiv_id_is_arxiv":true,"paper":"/paper/fmint-bridging-human-designed-and-data","title":"FMint: Bridging Human Designed and Data Pretrained Models for Differential Equation Foundation Model","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"margotyjx/fmint","path":"FMint/analysis/analysis.py","file_url":"https://github.com/margotyjx/fmint/blob/HEAD/FMint/analysis/analysis.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, margotyjx/fmint when it was checked","code_sha256":"9069306ba3a7f4ff","code_sha256_prefix":"9069306ba3a7f4ff","mcp_get_code":{"code_sha256":"9069306ba3a7f4ff"}},{"arxiv_id":"2402.19470","arxiv_id_is_arxiv":true,"paper":"/paper/towards-generalizable-tumor-synthesis","title":"Towards Generalizable Tumor Synthesis","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mrgiovanni/difftumor","path":"STEP1.AutoencoderModel/dataset/dataloader.py","file_url":"https://github.com/mrgiovanni/difftumor/blob/HEAD/STEP1.AutoencoderModel/dataset/dataloader.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, mrgiovanni/difftumor (NOASSERTION)","code_sha256":"6559d70c3f313d85","code_sha256_prefix":"6559d70c3f313d85","mcp_get_code":{"code_sha256":"6559d70c3f313d85"}},{"arxiv_id":"2402.11199","arxiv_id_is_arxiv":true,"paper":"/paper/direct-evaluation-of-chain-of-thought-in","title":"Direct Evaluation of Chain-of-Thought in Multi-hop Reasoning with Knowledge Graphs","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minhvuong2000/llmreasoncert","path":"extract_subgraph/deal_cvt.py","file_url":"https://github.com/minhvuong2000/llmreasoncert/blob/HEAD/extract_subgraph/deal_cvt.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, minhvuong2000/llmreasoncert when it was checked","code_sha256":"2df04bc8e76254e2","code_sha256_prefix":"2df04bc8e76254e2","mcp_get_code":{"code_sha256":"2df04bc8e76254e2"}},{"arxiv_id":"2307.11661","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-clip-with-gpt-4-harnessing-visual","title":"Enhancing CLIP with GPT-4: Harnessing Visual Descriptions as Prompts","date":"2023-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mayug/vdt-adapter","path":"parse_test_res.py","file_url":"https://github.com/mayug/vdt-adapter/blob/HEAD/parse_test_res.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":"f4ae6aefa8f60b08","code_sha256_prefix":"f4ae6aefa8f60b08","mcp_get_code":{"code_sha256":"f4ae6aefa8f60b08"}},{"arxiv_id":"2304.01091","arxiv_id_is_arxiv":true,"paper":"/paper/changes-to-captions-an-attentive-network-for","title":"Changes to Captions: An Attentive Network for Remote Sensing Change Captioning","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sundongwei/sft_chag2cap","path":"caption.py","file_url":"https://github.com/sundongwei/sft_chag2cap/blob/HEAD/caption.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, sundongwei/sft_chag2cap when it was checked","code_sha256":"15a5993ad2cfe403","code_sha256_prefix":"15a5993ad2cfe403","mcp_get_code":{"code_sha256":"15a5993ad2cfe403"}},{"arxiv_id":"2303.12528","arxiv_id_is_arxiv":true,"paper":"/paper/mega-multilingual-evaluation-of-generative-ai","title":"MEGA: Multilingual Evaluation of Generative AI","date":"2023-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/Multilingual-Evaluation-of-Generative-AI-MEGA","path":"mega/XLSUM.py","file_url":"https://github.com/microsoft/Multilingual-Evaluation-of-Generative-AI-MEGA/blob/HEAD/mega/XLSUM.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":"f9bc748678a87d5f","code_sha256_prefix":"f9bc748678a87d5f","mcp_get_code":{"code_sha256":"f9bc748678a87d5f"}},{"arxiv_id":"2110.14243","arxiv_id_is_arxiv":true,"paper":"/paper/online-selective-classification-with-limited","title":"Online Selective Classification with Limited Feedback","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anilkagak2/online-selective-classification","path":"main_runner_varying_prob_p_theta_experiment.py","file_url":"https://github.com/anilkagak2/online-selective-classification/blob/HEAD/main_runner_varying_prob_p_theta_experiment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, anilkagak2/online-selective-classification when it was checked","code_sha256":"87c1c815b1b49f03","code_sha256_prefix":"87c1c815b1b49f03","mcp_get_code":{"code_sha256":"87c1c815b1b49f03"}},{"arxiv_id":"1503.03832","arxiv_id_is_arxiv":true,"paper":"/paper/facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BradNeuberg/personal-photos-model","path":"src/siamese_network_bw/siamese_utils.py","file_url":"https://github.com/BradNeuberg/personal-photos-model/blob/HEAD/src/siamese_network_bw/siamese_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"307515a5a0f9958f","code_sha256_prefix":"307515a5a0f9958f","mcp_get_code":{"code_sha256":"307515a5a0f9958f"}}],"record_sha256":"aecdbd8e796c66a45b1875c9ac217958558a20ed3a0354e4f1127132cba36847","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}