{"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/load-samples","entry":"load_samples","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":8,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":8,"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":2,"ran_fixture":0,"ran":3,"unverified":3},"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":"2609.01216","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-01216","title":"H2Table: Hierarchical Hypergraph-Enhanced Large Language Models for Complex Table Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"lila120/h2table","path":"aitqa_eval_by_depth.py","file_url":"https://github.com/lila120/h2table/blob/HEAD/aitqa_eval_by_depth.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, lila120/h2table when it was checked","code_sha256":"b672eb9827f9463f","code_sha256_prefix":"b672eb9827f9463f","mcp_get_code":{"code_sha256":"b672eb9827f9463f"}},{"arxiv_id":"2605.08587","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08587","title":"Kaczmarz Linear Attention","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"anonymous-kla-review/kla-anonymous","path":"long_context_task_benchmark.py","file_url":"https://github.com/anonymous-kla-review/kla-anonymous/blob/HEAD/long_context_task_benchmark.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, anonymous-kla-review/kla-anonymous (NOASSERTION)","code_sha256":"6ffb85ebe4c3c2ba","code_sha256_prefix":"6ffb85ebe4c3c2ba","mcp_get_code":{"code_sha256":"6ffb85ebe4c3c2ba"}},{"arxiv_id":"2601.22661","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-22661","title":"Evaluating and Rewarding LALMs for Expressive Role-Play TTS via Mean Continuation Log-Probability","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"y-ren16/MCLP","path":"compute_contination_score.py","file_url":"https://github.com/y-ren16/MCLP/blob/HEAD/compute_contination_score.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":"95500c687cd212f2","code_sha256_prefix":"95500c687cd212f2","mcp_get_code":{"code_sha256":"95500c687cd212f2"}},{"arxiv_id":"2410.20210","arxiv_id_is_arxiv":true,"paper":"/paper/looking-beyond-the-top-1-transformers","title":"Looking Beyond The Top-1: Transformers Determine Top Tokens In Order","date":"2024-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daria-lioubashevski/beyond_top1","path":"utils.py","file_url":"https://github.com/daria-lioubashevski/beyond_top1/blob/HEAD/utils.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, daria-lioubashevski/beyond_top1 when it was checked","code_sha256":"c8ae8abf0a896cb6","code_sha256_prefix":"c8ae8abf0a896cb6","mcp_get_code":{"code_sha256":"c8ae8abf0a896cb6"}},{"arxiv_id":"2404.11825","arxiv_id_is_arxiv":true,"paper":"/paper/hypergraph-self-supervised-learning-with","title":"Hypergraph Self-supervised Learning with Sampling-efficient Signals","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Coco-Hut/SE-HSSL","path":"SE-HSSL/utils.py","file_url":"https://github.com/Coco-Hut/SE-HSSL/blob/HEAD/SE-HSSL/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":"45fd7b9265862961","code_sha256_prefix":"45fd7b9265862961","mcp_get_code":{"code_sha256":"45fd7b9265862961"}},{"arxiv_id":"2104.00054","arxiv_id_is_arxiv":true,"paper":"/paper/a-statistical-analysis-of-summarization","title":"A Statistical Analysis of Summarization Evaluation Metrics using Resampling Methods","date":"2021-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CogComp/stat-analysis-experiments","path":"experiments/statistical-analysis/confidence-intervals/plot.py","file_url":"https://github.com/CogComp/stat-analysis-experiments/blob/HEAD/experiments/statistical-analysis/confidence-intervals/plot.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":"988371d1225d4fc9","code_sha256_prefix":"988371d1225d4fc9","mcp_get_code":{"code_sha256":"988371d1225d4fc9"}},{"arxiv_id":"2001.03985","arxiv_id_is_arxiv":true,"paper":"/paper/unbiased-and-efficient-log-likelihood","title":"Unbiased and Efficient Log-Likelihood Estimation with Inverse Binomial Sampling","date":"2020-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"basvanopheusden/ibs-development","path":"ibsfunctions.py","file_url":"https://github.com/basvanopheusden/ibs-development/blob/HEAD/ibsfunctions.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":"964b09b352035581","code_sha256_prefix":"964b09b352035581","mcp_get_code":{"code_sha256":"964b09b352035581"}},{"arxiv_id":"2023.acl-long.782","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.acl-long.782","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tenvence/ulra","path":"dataset.py","file_url":"https://github.com/tenvence/ulra/blob/HEAD/dataset.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":"26fbdfaa2c413292","code_sha256_prefix":"26fbdfaa2c413292","mcp_get_code":{"code_sha256":"26fbdfaa2c413292"}}],"record_sha256":"f595601c00acde7b4ee310b40745db260552aa7d8fb951c1656662bb59cec5aa","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}