{"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-prob","entry":"get_prob","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":5,"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":1,"ran_fixture":0,"ran":2,"unverified":1},"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":"2511.13223","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-13223","title":"TokenSqueeze: Performance-Preserving Compression for Reasoning LLMs","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"zhangyx1122/TokenSqueeze","path":"step4_cal_kl_for_rewrite_data.py","file_url":"https://github.com/zhangyx1122/TokenSqueeze/blob/HEAD/step4_cal_kl_for_rewrite_data.py","status":"ran","verification_level":1,"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, zhangyx1122/TokenSqueeze when it was checked","code_sha256":"58ad512ca891a50b","code_sha256_prefix":"58ad512ca891a50b","mcp_get_code":{"code_sha256":"58ad512ca891a50b"}},{"arxiv_id":"2502.19670","arxiv_id_is_arxiv":true,"paper":"/paper/training-robust-graph-neural-networks-by","title":"Training Robust Graph Neural Networks by Modeling Noise Dependencies","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WtaoZhao/GraphGLOW","path":"src/core/model_handler.py","file_url":"https://github.com/WtaoZhao/GraphGLOW/blob/HEAD/src/core/model_handler.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, WtaoZhao/GraphGLOW when it was checked","code_sha256":"0bc86955f61ae146","code_sha256_prefix":"0bc86955f61ae146","mcp_get_code":{"code_sha256":"0bc86955f61ae146"}},{"arxiv_id":"2411.07404","arxiv_id_is_arxiv":true,"paper":"/paper/controllable-context-sensitivity-and-the-knob","title":"Controllable Context Sensitivity and the Knob Behind It","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kdu4108/context-vs-prior-finetuning","path":"analysis/circuit_utils/decoding.py","file_url":"https://github.com/kdu4108/context-vs-prior-finetuning/blob/HEAD/analysis/circuit_utils/decoding.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, kdu4108/context-vs-prior-finetuning when it was checked","code_sha256":"d2c97c6a45243ce9","code_sha256_prefix":"d2c97c6a45243ce9","mcp_get_code":{"code_sha256":"d2c97c6a45243ce9"}},{"arxiv_id":"2406.11033","arxiv_id_is_arxiv":true,"paper":"/paper/haichart-human-and-ai-paired-visualization","title":"HAIChart: Human and AI Paired Visualization System","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkustdial/haichart","path":"user_model/mdp.py","file_url":"https://github.com/hkustdial/haichart/blob/HEAD/user_model/mdp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hkustdial/haichart when it was checked","code_sha256":"8c958dd87b768572","code_sha256_prefix":"8c958dd87b768572","mcp_get_code":{"code_sha256":"8c958dd87b768572"}},{"arxiv_id":"2006.06015","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-segmentation-networks-modelling","title":"Stochastic Segmentation Networks: Modelling Spatially Correlated Aleatoric Uncertainty","date":"2020-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biomedia-mira/stochastic_segmentation_networks","path":"ssn/toy_problem.py","file_url":"https://github.com/biomedia-mira/stochastic_segmentation_networks/blob/HEAD/ssn/toy_problem.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":"ccd439d403ad8012","code_sha256_prefix":"ccd439d403ad8012","mcp_get_code":{"code_sha256":"ccd439d403ad8012"}},{"arxiv_id":"1911.03845","arxiv_id_is_arxiv":true,"paper":"/paper/a-model-based-reinforcement-learning-with","title":"Model-Based Reinforcement Learning with Adversarial Training for Online Recommendation","date":"2019-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JianGuanTHU/IRecGAN","path":"src/mdp.py","file_url":"https://github.com/JianGuanTHU/IRecGAN/blob/HEAD/src/mdp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JianGuanTHU/IRecGAN when it was checked","code_sha256":"8c958dd87b768572","code_sha256_prefix":"8c958dd87b768572","mcp_get_code":{"code_sha256":"8c958dd87b768572"}}],"record_sha256":"fad035e0ace9c667fc5a604ccb89769159632e1063df6a37f71354571a486df0","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}