{"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-outputs","entry":"get_outputs","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":7,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":2,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":2,"unverified":2},"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":"2410.20724","arxiv_id_is_arxiv":true,"paper":"/paper/simple-is-effective-the-roles-of-graphs-and","title":"Simple Is Effective: The Roles of Graphs and Large Language Models in Knowledge-Graph-Based Retrieval-Augmented Generation","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-COM/SubgraphRAG","path":"reason/llm_utils.py","file_url":"https://github.com/Graph-COM/SubgraphRAG/blob/HEAD/reason/llm_utils.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":"d55e014013622a43","code_sha256_prefix":"d55e014013622a43","mcp_get_code":{"code_sha256":"d55e014013622a43"}},{"arxiv_id":"2402.13669","arxiv_id_is_arxiv":true,"paper":"/paper/self-distillation-bridges-distribution-gap-in","title":"Self-Distillation Bridges Distribution Gap in Language Model Fine-Tuning","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sail-sg/sdft","path":"eval/utils.py","file_url":"https://github.com/sail-sg/sdft/blob/HEAD/eval/utils.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, sail-sg/sdft when it was checked","code_sha256":"b193dd7920d260e3","code_sha256_prefix":"b193dd7920d260e3","mcp_get_code":{"code_sha256":"b193dd7920d260e3"}},{"arxiv_id":"2302.06885","arxiv_id_is_arxiv":true,"paper":"/paper/improving-interpretability-of-deep-sequential","title":"Improving Interpretability of Deep Sequential Knowledge Tracing Models with Question-centric Cognitive Representations","date":"2023-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pykt-team/pykt-toolkit","path":"pykt/models/qikt.py","file_url":"https://github.com/pykt-team/pykt-toolkit/blob/HEAD/pykt/models/qikt.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d64e5058e11fc74e","code_sha256_prefix":"d64e5058e11fc74e","mcp_get_code":{"code_sha256":"d64e5058e11fc74e"}},{"arxiv_id":"2212.02437","arxiv_id_is_arxiv":true,"paper":"/paper/in-context-examples-selection-for-machine","title":"In-context Examples Selection for Machine Translation","date":"2022-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sweta20/incontextmt","path":"run_metrics_eval.py","file_url":"https://github.com/sweta20/incontextmt/blob/HEAD/run_metrics_eval.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, sweta20/incontextmt when it was checked","code_sha256":"9213942ca8c46cb3","code_sha256_prefix":"9213942ca8c46cb3","mcp_get_code":{"code_sha256":"9213942ca8c46cb3"}},{"arxiv_id":"2205.15371","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-and-adaptive-monteiro-svaiter","title":"Optimal and Adaptive Monteiro-Svaiter Acceleration","date":null,"month_inferred_from_arxiv_id":"2022-05","title_source":"archive","repo":"danielle-hausler/ms-optimal","path":"algorithms/newton.py","file_url":"https://github.com/danielle-hausler/ms-optimal/blob/HEAD/algorithms/newton.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":"5ba46eacdbd891e9","code_sha256_prefix":"5ba46eacdbd891e9","mcp_get_code":{"code_sha256":"5ba46eacdbd891e9"}},{"arxiv_id":"2205.15371","arxiv_id_is_arxiv":true,"paper":"/paper/optimal-and-adaptive-monteiro-svaiter","title":"Optimal and Adaptive Monteiro-Svaiter Acceleration","date":null,"month_inferred_from_arxiv_id":"2022-05","title_source":"archive","repo":"danielle-hausler/ms-optimal","path":"algorithms/ms_algorithm.py","file_url":"https://github.com/danielle-hausler/ms-optimal/blob/HEAD/algorithms/ms_algorithm.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":"7498c1f486e35816","code_sha256_prefix":"7498c1f486e35816","mcp_get_code":{"code_sha256":"7498c1f486e35816"}},{"arxiv_id":"2108.07386","arxiv_id_is_arxiv":true,"paper":"/paper/bobcat-bilevel-optimization-based","title":"BOBCAT: Bilevel Optimization-Based Computerized Adaptive Testing","date":"2021-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arghosh/bobcat","path":"model.py","file_url":"https://github.com/arghosh/bobcat/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"98d34936f4d8072b","code_sha256_prefix":"98d34936f4d8072b","mcp_get_code":{"code_sha256":"98d34936f4d8072b"}},{"arxiv_id":"1908.10357","arxiv_id_is_arxiv":true,"paper":"/paper/bottom-up-higher-resolution-networks-for","title":"HigherHRNet: Scale-Aware Representation Learning for Bottom-Up Human Pose Estimation","date":"2019-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xn1997/HigherHRnet","path":"lib/core/inference.py","file_url":"https://github.com/xn1997/HigherHRnet/blob/HEAD/lib/core/inference.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":"9cf201ffe0770f4a","code_sha256_prefix":"9cf201ffe0770f4a","mcp_get_code":{"code_sha256":"9cf201ffe0770f4a"}}],"record_sha256":"2df2d5670e61387f79691ffad41b65d4f8f8813d544556d8bb278283f138348f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}