{"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/parse-file-name","entry":"parse_file_name","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":3,"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":3,"ran_fixture":0,"ran":3,"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":"2603.02422","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-02422","title":"A Directed Graph Model and Experimental Framework for Design and Study of Time-Dependent Text Visualisation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"SonghaiFan/gpt_storytale","path":"story_packer.py","file_url":"https://github.com/SonghaiFan/gpt_storytale/blob/HEAD/story_packer.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, SonghaiFan/gpt_storytale when it was checked","code_sha256":"2c29519d5c083987","code_sha256_prefix":"2c29519d5c083987","mcp_get_code":{"code_sha256":"2c29519d5c083987"}},{"arxiv_id":"2411.04425","arxiv_id_is_arxiv":true,"paper":"/paper/delift-data-efficient-language-model","title":"DELIFT: Data Efficient Language model Instruction Fine Tuning","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agarwalishika/delift","path":"visualization/folder_names.py","file_url":"https://github.com/agarwalishika/delift/blob/HEAD/visualization/folder_names.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":"b495e87e1ef43502","code_sha256_prefix":"b495e87e1ef43502","mcp_get_code":{"code_sha256":"b495e87e1ef43502"}},{"arxiv_id":"2406.07594","arxiv_id_is_arxiv":true,"paper":"/paper/mllmguard-a-multi-dimensional-safety","title":"MLLMGuard: A Multi-dimensional Safety Evaluation Suite for Multimodal Large Language Models","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Carol-gutianle/MLLMGuard","path":"guardrank/score.py","file_url":"https://github.com/Carol-gutianle/MLLMGuard/blob/HEAD/guardrank/score.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, Carol-gutianle/MLLMGuard when it was checked","code_sha256":"39fdd54f792402c2","code_sha256_prefix":"39fdd54f792402c2","mcp_get_code":{"code_sha256":"39fdd54f792402c2"}},{"arxiv_id":"2402.13213","arxiv_id_is_arxiv":true,"paper":"/paper/softmax-probabilities-mostly-predict-large","title":"Probabilities of Chat LLMs Are Miscalibrated but Still Predict Correctness on Multiple-Choice Q&A","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bplaut/softmax-probs-predict-llm-correctness","path":"utils.py","file_url":"https://github.com/bplaut/softmax-probs-predict-llm-correctness/blob/HEAD/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":"54531f830631efef","code_sha256_prefix":"54531f830631efef","mcp_get_code":{"code_sha256":"54531f830631efef"}},{"arxiv_id":"2402.08113","arxiv_id_is_arxiv":true,"paper":"/paper/addressing-cognitive-bias-in-medical-language","title":"Addressing cognitive bias in medical language models","date":"2024-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"carlwharris/cog-bias-med-llms","path":"evaluate_all_models.py","file_url":"https://github.com/carlwharris/cog-bias-med-llms/blob/HEAD/evaluate_all_models.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, carlwharris/cog-bias-med-llms when it was checked","code_sha256":"caee6ff1335a8be5","code_sha256_prefix":"caee6ff1335a8be5","mcp_get_code":{"code_sha256":"caee6ff1335a8be5"}},{"arxiv_id":"2203.01241","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-deletion-robust-coreset-for","title":"Coresets remembered and items forgotten: submodular maximization with deletions","date":null,"month_inferred_from_arxiv_id":"2022-03","title_source":"archive","repo":"guangyi-zhang/robust-subm-coreset","path":"data_scripts/face.py","file_url":"https://github.com/guangyi-zhang/robust-subm-coreset/blob/HEAD/data_scripts/face.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":"d5651103e31b3a50","code_sha256_prefix":"d5651103e31b3a50","mcp_get_code":{"code_sha256":"d5651103e31b3a50"}}],"record_sha256":"151bcfd3224b0b809e64c34e7291cc91a762ca55d790fce7532c60c367646ec3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}