{"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/postprocess-qa-predictions","entry":"postprocess_qa_predictions","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":0,"n_papers_ran_no_instrument_failure":0,"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":7,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":4,"n_places_pointer_only_link_open":2,"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":0,"unverified":7},"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.31058","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-31058","title":"Improving Information Extraction with Learned Queries","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ZhaoyueSun/PHEE","path":"gen_qa/utils_qa.py","file_url":"https://github.com/ZhaoyueSun/PHEE/blob/HEAD/gen_qa/utils_qa.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":"91d01d763bcc6469","code_sha256_prefix":"91d01d763bcc6469","mcp_get_code":{"code_sha256":"91d01d763bcc6469"}},{"arxiv_id":"2605.21177","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-21177","title":"ChunkFT: Byte-Streamed Optimization for Memory-Efficient Full Fine-Tuning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"misonsky/chunk","path":"chnk/utils_qa.py","file_url":"https://github.com/misonsky/chunk/blob/HEAD/chnk/utils_qa.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, misonsky/chunk when it was checked","code_sha256":"ac56d3e7b79dbc18","code_sha256_prefix":"ac56d3e7b79dbc18","mcp_get_code":{"code_sha256":"ac56d3e7b79dbc18"}},{"arxiv_id":"2602.08351","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-08351","title":"The Chicken and Egg Dilemma: Co-optimizing Data and Model Configurations for LLMs","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ruz048/AutoLoRA","path":"finetune/utils_qa.py","file_url":"https://github.com/ruz048/AutoLoRA/blob/HEAD/finetune/utils_qa.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, ruz048/AutoLoRA when it was checked","code_sha256":"ac56d3e7b79dbc18","code_sha256_prefix":"ac56d3e7b79dbc18","mcp_get_code":{"code_sha256":"ac56d3e7b79dbc18"}},{"arxiv_id":"2310.14709","arxiv_id_is_arxiv":true,"paper":"/paper/once-upon-a-textit-time-in-textit-graph","title":"Once Upon a $\\textit{Time}$ in $\\textit{Graph}$: Relative-Time Pretraining for Complex Temporal Reasoning","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"damo-nlp-sg/rememo","path":"src/odqa_t5/utils_qa.py","file_url":"https://github.com/damo-nlp-sg/rememo/blob/HEAD/src/odqa_t5/utils_qa.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from misonsky/chunk, and GitHub detected no licence in that repository when it was checked","code_sha256":"ac56d3e7b79dbc18","code_sha256_prefix":"ac56d3e7b79dbc18","mcp_get_code":{"code_sha256":"ac56d3e7b79dbc18"}},{"arxiv_id":"2205.01068","arxiv_id_is_arxiv":true,"paper":"/paper/opt-open-pre-trained-transformer-language","title":"OPT: Open Pre-trained Transformer Language Models","date":"2022-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mthcom/hscore-dataset-pruning","path":"utils_qa.py","file_url":"https://github.com/mthcom/hscore-dataset-pruning/blob/HEAD/utils_qa.py","status":"unverified","verification_level":0,"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":"6eff2c131107723d","code_sha256_prefix":"6eff2c131107723d","mcp_get_code":{"code_sha256":"6eff2c131107723d"}},{"arxiv_id":"2203.15827","arxiv_id_is_arxiv":true,"paper":"/paper/linkbert-pretraining-language-models-with","title":"LinkBERT: Pretraining Language Models with Document Links","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michiyasunaga/LinkBERT","path":"src/qa/utils_qa.py","file_url":"https://github.com/michiyasunaga/LinkBERT/blob/HEAD/src/qa/utils_qa.py","status":"unverified","verification_level":0,"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":"3957d7cb42610910","code_sha256_prefix":"3957d7cb42610910","mcp_get_code":{"code_sha256":"3957d7cb42610910"}},{"arxiv_id":"2106.09685","arxiv_id_is_arxiv":true,"paper":"/paper/lora-low-rank-adaptation-of-large-language","title":"LoRA: Low-Rank Adaptation of Large Language Models","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenlicodebank/lora_on_analog_hardware","path":"hardware_aware_training/utils_qa.py","file_url":"https://github.com/chenlicodebank/lora_on_analog_hardware/blob/HEAD/hardware_aware_training/utils_qa.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from misonsky/chunk, and GitHub detected no licence in that repository when it was checked","code_sha256":"ac56d3e7b79dbc18","code_sha256_prefix":"ac56d3e7b79dbc18","mcp_get_code":{"code_sha256":"ac56d3e7b79dbc18"}},{"arxiv_id":"2106.03530","arxiv_id_is_arxiv":true,"paper":"/paper/caire-in-dialdoc21-data-augmentation-for","title":"CAiRE in DialDoc21: Data Augmentation for Information-Seeking Dialogue System","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HLTCHKUST/CAiRE_in_DialDoc21","path":"task1/utils_qa.py","file_url":"https://github.com/HLTCHKUST/CAiRE_in_DialDoc21/blob/HEAD/task1/utils_qa.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":"0ce9a974b3175422","code_sha256_prefix":"0ce9a974b3175422","mcp_get_code":{"code_sha256":"0ce9a974b3175422"}},{"arxiv_id":"1609.07061","arxiv_id_is_arxiv":true,"paper":"/paper/quantized-neural-networks-training-neural","title":"Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activations","date":"2016-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PIlotcnc/neural","path":"integrations/transformers/utils_qa.py","file_url":"https://github.com/PIlotcnc/neural/blob/HEAD/integrations/transformers/utils_qa.py","status":"unverified","verification_level":0,"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":"181ade20c4851e11","code_sha256_prefix":"181ade20c4851e11","mcp_get_code":{"code_sha256":"181ade20c4851e11"}},{"arxiv_id":"2023.acl-short.31","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.acl-short.31","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"JFChi/PLUE","path":"finetuning/qa/policyqa/utils_qa.py","file_url":"https://github.com/JFChi/PLUE/blob/HEAD/finetuning/qa/policyqa/utils_qa.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":"d4791eee529d6c54","code_sha256_prefix":"d4791eee529d6c54","mcp_get_code":{"code_sha256":"d4791eee529d6c54"}}],"record_sha256":"ae0f42df09c1d324a09fcbdd053c72e498b736b4541be7232f6eafd14076d392","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}