{"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-chunks","entry":"get_chunks","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":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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":7,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":3,"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":"2505.11315","arxiv_id_is_arxiv":true,"paper":"/paper/2505-11315","title":"Improving Inference-Time Optimisation for Vocal Effects Style Transfer with a Gaussian Prior","date":"2025-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SonyResearch/diffvox","path":"modules/utils.py","file_url":"https://github.com/SonyResearch/diffvox/blob/HEAD/modules/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":"6565cfd9b49e27c7","code_sha256_prefix":"6565cfd9b49e27c7","mcp_get_code":{"code_sha256":"6565cfd9b49e27c7"}},{"arxiv_id":"2503.10150","arxiv_id_is_arxiv":true,"paper":"/paper/retrieval-augmented-generation-with-1","title":"Retrieval-Augmented Generation with Hierarchical Knowledge","date":"2025-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhy-huang/HiRAG","path":"hirag/_op.py","file_url":"https://github.com/hhy-huang/HiRAG/blob/HEAD/hirag/_op.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":"903db7183e5ab2a8","code_sha256_prefix":"903db7183e5ab2a8","mcp_get_code":{"code_sha256":"903db7183e5ab2a8"}},{"arxiv_id":"2503.07358","arxiv_id_is_arxiv":true,"paper":"/paper/repost-scalable-repository-level-coding","title":"RepoST: Scalable Repository-Level Coding Environment Construction with Sandbox Testing","date":"2025-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yiqingxyq/RepoST","path":"CodeRAGBench_evaluation/chunk.py","file_url":"https://github.com/yiqingxyq/RepoST/blob/HEAD/CodeRAGBench_evaluation/chunk.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":"839e07f1bf52b601","code_sha256_prefix":"839e07f1bf52b601","mcp_get_code":{"code_sha256":"839e07f1bf52b601"}},{"arxiv_id":"2411.05338","arxiv_id_is_arxiv":true,"paper":"/paper/scidqa-a-deep-reading-comprehension-dataset","title":"SciDQA: A Deep Reading Comprehension Dataset over Scientific Papers","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yale-nlp/scidqa","path":"src/llm_generation/gpt_util_file_prep.py","file_url":"https://github.com/yale-nlp/scidqa/blob/HEAD/src/llm_generation/gpt_util_file_prep.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, yale-nlp/scidqa when it was checked","code_sha256":"beffd15799c043a1","code_sha256_prefix":"beffd15799c043a1","mcp_get_code":{"code_sha256":"beffd15799c043a1"}},{"arxiv_id":"2310.13189","arxiv_id_is_arxiv":true,"paper":"/paper/fast-and-accurate-factual-inconsistency","title":"Fast and Accurate Factual Inconsistency Detection Over Long Documents","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asappresearch/scale-score","path":"scale_score/scorer.py","file_url":"https://github.com/asappresearch/scale-score/blob/HEAD/scale_score/scorer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, asappresearch/scale-score when it was checked","code_sha256":"688e220c3f53cdd8","code_sha256_prefix":"688e220c3f53cdd8","mcp_get_code":{"code_sha256":"688e220c3f53cdd8"}},{"arxiv_id":"2210.10709","arxiv_id_is_arxiv":true,"paper":"/paper/schema-aware-reference-as-prompt-improves","title":"Schema-aware Reference as Prompt Improves Data-Efficient Knowledge Graph Construction","date":"2022-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/RAP","path":"BaseModel/PRGC/metrics.py","file_url":"https://github.com/zjunlp/RAP/blob/HEAD/BaseModel/PRGC/metrics.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":"68b3cc3a2577fbd6","code_sha256_prefix":"68b3cc3a2577fbd6","mcp_get_code":{"code_sha256":"68b3cc3a2577fbd6"}},{"arxiv_id":"2008.09470","arxiv_id_is_arxiv":true,"paper":"/paper/top2vec-distributed-representations-of-topics","title":"Top2Vec: Distributed Representations of Topics","date":"2020-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ddangelov/Top2Vec","path":"top2vec/top2vec.py","file_url":"https://github.com/ddangelov/Top2Vec/blob/HEAD/top2vec/top2vec.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90e687dd27967b6c","code_sha256_prefix":"90e687dd27967b6c","mcp_get_code":{"code_sha256":"90e687dd27967b6c"}}],"record_sha256":"b7516cfb3654e91b630685ac74add80dfe483281a1b7a5400255f20d6210058f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}