{"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/make-qid-to-has-ans","entry":"make_qid_to_has_ans","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":14,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":9,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":15,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":1,"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":"2608.08024","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-08024","title":"Prompt Embedding Probes (PEP): Hallucination Detection in LLMs from Hidden States","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"zazamrykh/internal_probing","path":"src/dataset/squad_eval.py","file_url":"https://github.com/zazamrykh/internal_probing/blob/HEAD/src/dataset/squad_eval.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":"e91c44f5680827e2","code_sha256_prefix":"e91c44f5680827e2","mcp_get_code":{"code_sha256":"e91c44f5680827e2"}},{"arxiv_id":"2311.09821","arxiv_id_is_arxiv":true,"paper":"/paper/towards-robust-temporal-reasoning-of-large","title":"Towards Robust Temporal Reasoning of Large Language Models via a Multi-Hop QA Dataset and Pseudo-Instruction Tuning","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nusnlp/complex-tr","path":"prompt_experiment/sem_metric/evaluate.py","file_url":"https://github.com/nusnlp/complex-tr/blob/HEAD/prompt_experiment/sem_metric/evaluate.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, nusnlp/complex-tr when it was checked","code_sha256":"41e5ac23be97994b","code_sha256_prefix":"41e5ac23be97994b","mcp_get_code":{"code_sha256":"41e5ac23be97994b"}},{"arxiv_id":"2308.16475","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-compression-via-subspace","title":"$\\rm SP^3$: Enhancing Structured Pruning via PCA Projection","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyx1999/sp3","path":"bert/metric/squad_v2.py","file_url":"https://github.com/hyx1999/sp3/blob/HEAD/bert/metric/squad_v2.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, hyx1999/sp3 when it was checked","code_sha256":"41e5ac23be97994b","code_sha256_prefix":"41e5ac23be97994b","mcp_get_code":{"code_sha256":"41e5ac23be97994b"}},{"arxiv_id":"2306.06191","arxiv_id_is_arxiv":true,"paper":"/paper/open-data-on-github-unlocking-the-potential","title":"Open Data on GitHub: Unlocking the Potential of AI","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rajpurkar/SQuAD-explorer","path":"evaluate-v2.0.py","file_url":"https://github.com/rajpurkar/SQuAD-explorer/blob/HEAD/evaluate-v2.0.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":"e91c44f5680827e2","code_sha256_prefix":"e91c44f5680827e2","mcp_get_code":{"code_sha256":"e91c44f5680827e2"}},{"arxiv_id":"2205.06435","arxiv_id_is_arxiv":true,"paper":"/paper/tie-topological-information-enhanced","title":"TIE: Topological Information Enhanced Structural Reading Comprehension on Web Pages","date":"2022-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"x-lance/tie","path":"src/utils_evaluate.py","file_url":"https://github.com/x-lance/tie/blob/HEAD/src/utils_evaluate.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":"3ff051538e6b183e","code_sha256_prefix":"3ff051538e6b183e","mcp_get_code":{"code_sha256":"3ff051538e6b183e"}},{"arxiv_id":"2010.08983","arxiv_id_is_arxiv":true,"paper":"/paper/towards-interpreting-bert-for-reading","title":"Towards Interpreting BERT for Reading Comprehension Based QA","date":"2020-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iitmnlp/BERT-Analysis-RCQA","path":"bert/evaluate-v2.0.py","file_url":"https://github.com/iitmnlp/BERT-Analysis-RCQA/blob/HEAD/bert/evaluate-v2.0.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":"e91c44f5680827e2","code_sha256_prefix":"e91c44f5680827e2","mcp_get_code":{"code_sha256":"e91c44f5680827e2"}},{"arxiv_id":"2006.12467","arxiv_id_is_arxiv":true,"paper":"/paper/limits-to-depth-efficiencies-of-self","title":"The Depth-to-Width Interplay in Self-Attention","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uf-hobi-informatics-lab/GatorTron","path":"finetuning/qa/evaluate-squad-v2.0.py","file_url":"https://github.com/uf-hobi-informatics-lab/GatorTron/blob/HEAD/finetuning/qa/evaluate-squad-v2.0.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":"e91c44f5680827e2","code_sha256_prefix":"e91c44f5680827e2","mcp_get_code":{"code_sha256":"e91c44f5680827e2"}},{"arxiv_id":"2004.13922","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-pre-trained-models-for-chinese","title":"Revisiting Pre-Trained Models for Chinese Natural Language Processing","date":"2020-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ymcui/Chinese-PreTrained-XLNet","path":"src/squad_utils.py","file_url":"https://github.com/ymcui/Chinese-PreTrained-XLNet/blob/HEAD/src/squad_utils.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":"e91c44f5680827e2","code_sha256_prefix":"e91c44f5680827e2","mcp_get_code":{"code_sha256":"e91c44f5680827e2"}},{"arxiv_id":"1911.02984","arxiv_id_is_arxiv":true,"paper":"/paper/the-techqa-dataset","title":"The TechQA Dataset","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/techqa","path":"techqa_evaluation.py","file_url":"https://github.com/ibm/techqa/blob/HEAD/techqa_evaluation.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":"b63023126d0278b8","code_sha256_prefix":"b63023126d0278b8","mcp_get_code":{"code_sha256":"b63023126d0278b8"}},{"arxiv_id":"1910.01244","arxiv_id_is_arxiv":true,"paper":"/paper/linking-artificial-and-human-neural","title":"Linking artificial and human neural representations of language","date":"2019-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hans/nn-decoding","path":"bin/eval_squad.py","file_url":"https://github.com/hans/nn-decoding/blob/HEAD/bin/eval_squad.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":"e91c44f5680827e2","code_sha256_prefix":"e91c44f5680827e2","mcp_get_code":{"code_sha256":"e91c44f5680827e2"}},{"arxiv_id":"1908.08962","arxiv_id_is_arxiv":true,"paper":"/paper/well-read-students-learn-better-the-impact-of","title":"Well-Read Students Learn Better: On the Importance of Pre-training Compact Models","date":"2019-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"somiltg/bert","path":"evaluate-v2.0.py","file_url":"https://github.com/somiltg/bert/blob/HEAD/evaluate-v2.0.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":"e91c44f5680827e2","code_sha256_prefix":"e91c44f5680827e2","mcp_get_code":{"code_sha256":"e91c44f5680827e2"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zehui127/SQUAD_BERT","path":"SQUAD/evaluate-v2.0.py","file_url":"https://github.com/Zehui127/SQUAD_BERT/blob/HEAD/SQUAD/evaluate-v2.0.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":"e91c44f5680827e2","code_sha256_prefix":"e91c44f5680827e2","mcp_get_code":{"code_sha256":"e91c44f5680827e2"}},{"arxiv_id":"aaai_16733","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16733","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"rajammanabrolu/WorldGeneration","path":"neural-based/KG-extraction/utils_squad_evaluate.py","file_url":"https://github.com/rajammanabrolu/WorldGeneration/blob/HEAD/neural-based/KG-extraction/utils_squad_evaluate.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":"e91c44f5680827e2","code_sha256_prefix":"e91c44f5680827e2","mcp_get_code":{"code_sha256":"e91c44f5680827e2"}},{"arxiv_id":"2024.findings-emnlp.365","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-emnlp.365","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"UKPLab/m2qa","path":"Experiments/M2QA_Metric/m2qa_metric_official_squad_v2_eval_script.py","file_url":"https://github.com/UKPLab/m2qa/blob/HEAD/Experiments/M2QA_Metric/m2qa_metric_official_squad_v2_eval_script.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":"e91c44f5680827e2","code_sha256_prefix":"e91c44f5680827e2","mcp_get_code":{"code_sha256":"e91c44f5680827e2"}},{"arxiv_id":"2024.findings-emnlp.365","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-emnlp.365","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"UKPLab/m2qa","path":"Experiments/M2QA_Metric/m2qa_metric.py","file_url":"https://github.com/UKPLab/m2qa/blob/HEAD/Experiments/M2QA_Metric/m2qa_metric.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from nusnlp/complex-tr, and GitHub detected no licence in that repository when it was checked","code_sha256":"41e5ac23be97994b","code_sha256_prefix":"41e5ac23be97994b","mcp_get_code":{"code_sha256":"41e5ac23be97994b"}}],"record_sha256":"790bbdf1265afdde3022e32ec414351fca085f0139ef626845a6256713bd4213","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}