{"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/parse-list","entry":"parse_list","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":10,"n_papers_ran_no_instrument_failure":8,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":10,"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":0,"ran":5,"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":"2606.18986","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18986","title":"Beyond Tokenization: Direct Timestep Embedding and Contrastive Alignment for Time-Series Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"YafengWu/CADE","path":"CADE_wo_SupCon/merge.py","file_url":"https://github.com/YafengWu/CADE/blob/HEAD/CADE_wo_SupCon/merge.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, YafengWu/CADE when it was checked","code_sha256":"fcae13cf1128376a","code_sha256_prefix":"fcae13cf1128376a","mcp_get_code":{"code_sha256":"fcae13cf1128376a"}},{"arxiv_id":"2506.12860","arxiv_id_is_arxiv":true,"paper":"/paper/qfft-question-free-fine-tuning-for-adaptive","title":"QFFT, Question-Free Fine-Tuning for Adaptive Reasoning","date":"2025-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lwl-cpu/question-free-fine-tuning","path":"eval/eval_tp.py","file_url":"https://github.com/lwl-cpu/question-free-fine-tuning/blob/HEAD/eval/eval_tp.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":"c5b5032445c33c60","code_sha256_prefix":"c5b5032445c33c60","mcp_get_code":{"code_sha256":"c5b5032445c33c60"}},{"arxiv_id":"2504.02807","arxiv_id_is_arxiv":true,"paper":"/paper/megamath-pushing-the-limits-of-open-math","title":"MegaMath: Pushing the Limits of Open Math Corpora","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llm360/megamath","path":"web_pipeline/url_filtering/url_filter.py","file_url":"https://github.com/llm360/megamath/blob/HEAD/web_pipeline/url_filtering/url_filter.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":"32e16941520dc46f","code_sha256_prefix":"32e16941520dc46f","mcp_get_code":{"code_sha256":"32e16941520dc46f"}},{"arxiv_id":"2312.16983","arxiv_id_is_arxiv":true,"paper":"/paper/pg-lbo-enhancing-high-dimensional-bayesian","title":"PG-LBO: Enhancing High-Dimensional Bayesian Optimization with Pseudo-Label and Gaussian Process Guidance","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taicaichen/pg-lbo","path":"utils/utils_cmd.py","file_url":"https://github.com/taicaichen/pg-lbo/blob/HEAD/utils/utils_cmd.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":"c4ee8b7e136f578e","code_sha256_prefix":"c4ee8b7e136f578e","mcp_get_code":{"code_sha256":"c4ee8b7e136f578e"}},{"arxiv_id":"2311.07788","arxiv_id_is_arxiv":true,"paper":"/paper/cslp-ae-a-contrastive-split-latent-1","title":"CSLP-AE: A Contrastive Split-Latent Permutation Autoencoder Framework for Zero-Shot Electroencephalography Signal Conversion","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andersxa/cslp-ae","path":"data_preparation/create_dataset.py","file_url":"https://github.com/andersxa/cslp-ae/blob/HEAD/data_preparation/create_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, andersxa/cslp-ae when it was checked","code_sha256":"e1eaac14c2748c15","code_sha256_prefix":"e1eaac14c2748c15","mcp_get_code":{"code_sha256":"e1eaac14c2748c15"}},{"arxiv_id":"2311.01052","arxiv_id_is_arxiv":true,"paper":"/paper/resilient-multiple-choice-learning-a-learned","title":"Resilient Multiple Choice Learning: A learned scoring scheme with application to audio scene analysis","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"victorletzelter/code-rmcl","path":"toy-rMCL/utils.py","file_url":"https://github.com/victorletzelter/code-rmcl/blob/HEAD/toy-rMCL/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":"11d717137e56f958","code_sha256_prefix":"11d717137e56f958","mcp_get_code":{"code_sha256":"11d717137e56f958"}},{"arxiv_id":"2305.15581","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-semantic-correspondence-using","title":"Unsupervised Semantic Correspondence Using Stable Diffusion","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ubc-vision/LDM_correspondences","path":"utils/utils.py","file_url":"https://github.com/ubc-vision/LDM_correspondences/blob/HEAD/utils/utils.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":"7e8f8e2a3ea7f64e","code_sha256_prefix":"7e8f8e2a3ea7f64e","mcp_get_code":{"code_sha256":"7e8f8e2a3ea7f64e"}},{"arxiv_id":"2107.07432","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-graph-neural-nets-can-capture","title":"Hierarchical graph neural nets can capture long-range interactions","date":"2021-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rampasek/HGNet","path":"models/models.py","file_url":"https://github.com/rampasek/HGNet/blob/HEAD/models/models.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":"d4a0e9456a4b29e0","code_sha256_prefix":"d4a0e9456a4b29e0","mcp_get_code":{"code_sha256":"d4a0e9456a4b29e0"}},{"arxiv_id":"aaai_29018","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29018","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"TaicaiChen/PG-LBO","path":"utils/utils_cmd.py","file_url":"https://github.com/TaicaiChen/PG-LBO/blob/HEAD/utils/utils_cmd.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":"c4ee8b7e136f578e","code_sha256_prefix":"c4ee8b7e136f578e","mcp_get_code":{"code_sha256":"c4ee8b7e136f578e"}},{"arxiv_id":"Sun_Pixel-level_Semantic_Correspondence_through_Layout-aware_Representation_Learning_and_Multi-scale_Matching_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Sun_Pixel-level_Semantic_Correspondence_through_Layout-aware_Representation_Learning_and_Multi-scale_Matching_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"YXSUNMADMAX/LPMFlow","path":"utils_training/utils.py","file_url":"https://github.com/YXSUNMADMAX/LPMFlow/blob/HEAD/utils_training/utils.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":"7e8f8e2a3ea7f64e","code_sha256_prefix":"7e8f8e2a3ea7f64e","mcp_get_code":{"code_sha256":"7e8f8e2a3ea7f64e"}}],"record_sha256":"f2fbf80f7dc5c6a4e0ee6ca26e7795c0b064c06bb88afdf13083ffd57300831b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}