{"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/analyze","entry":"analyze","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":11,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":4,"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":10,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":4,"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":3,"ran_fixture":0,"ran":3,"unverified":4},"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":"2605.12370","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-12370","title":"Context Convergence Improves Answering Inferential Questions","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"DataScienceUIBK/Context-Convergence-Inferential-QA","path":"experiments/order.py","file_url":"https://github.com/DataScienceUIBK/Context-Convergence-Inferential-QA/blob/HEAD/experiments/order.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":"ccb09f79705369bd","code_sha256_prefix":"ccb09f79705369bd","mcp_get_code":{"code_sha256":"ccb09f79705369bd"}},{"arxiv_id":"2604.12016","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-12016","title":"Identity as Attractor: Geometric Evidence for Persistent Agent Architecture in LLM Activation Space","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"b102e/yar-attractor-experiment","path":"bootstrap_experiment/bootstrap_analysis.py","file_url":"https://github.com/b102e/yar-attractor-experiment/blob/HEAD/bootstrap_experiment/bootstrap_analysis.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, b102e/yar-attractor-experiment when it was checked","code_sha256":"6139c8c16a58411b","code_sha256_prefix":"6139c8c16a58411b","mcp_get_code":{"code_sha256":"6139c8c16a58411b"}},{"arxiv_id":"2602.16747","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-16747","title":"LIVECLIN: A Live CLINICAL BENCHMARK WITHOUT LEAKAGE","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"AQ-MedAI/LiveClin","path":"liveclin/analyzer.py","file_url":"https://github.com/AQ-MedAI/LiveClin/blob/HEAD/liveclin/analyzer.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":"18565766a3c280c4","code_sha256_prefix":"18565766a3c280c4","mcp_get_code":{"code_sha256":"18565766a3c280c4"}},{"arxiv_id":"2502.15805","arxiv_id_is_arxiv":true,"paper":"/paper/fragfm-efficient-fragment-based-molecular","title":"FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching","date":"2025-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"datamol-io/safe","path":"safe/_connect.py","file_url":"https://github.com/datamol-io/safe/blob/HEAD/safe/_connect.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":"520a0786e56b4db4","code_sha256_prefix":"520a0786e56b4db4","mcp_get_code":{"code_sha256":"520a0786e56b4db4"}},{"arxiv_id":"2407.14985","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-v-s-memorization-tracing","title":"Generalization v.s. Memorization: Tracing Language Models' Capabilities Back to Pretraining Data","date":"2024-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EleutherAI/the-pile","path":"processing_scripts/lang_len_analysis_pass1.py","file_url":"https://github.com/EleutherAI/the-pile/blob/HEAD/processing_scripts/lang_len_analysis_pass1.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":"fc867bf5f0532c70","code_sha256_prefix":"fc867bf5f0532c70","mcp_get_code":{"code_sha256":"fc867bf5f0532c70"}},{"arxiv_id":"2406.16708","arxiv_id_is_arxiv":true,"paper":"/paper/causalformer-an-interpretable-transformer-for","title":"CausalFormer: An Interpretable Transformer for Temporal Causal Discovery","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lingbai-kong/causalformer","path":"interpret.py","file_url":"https://github.com/lingbai-kong/causalformer/blob/HEAD/interpret.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, lingbai-kong/causalformer, is not in the permissive set Syntology serves inline","code_sha256":"0b0c090a1a2a5ec6","code_sha256_prefix":"0b0c090a1a2a5ec6","mcp_get_code":{"code_sha256":"0b0c090a1a2a5ec6"}},{"arxiv_id":"2406.03503","arxiv_id_is_arxiv":true,"paper":"/paper/position-rethinking-post-hoc-search-based","title":"Position: Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xyfffff/rethink_mcts_for_tsp","path":"default_mcts/summarize.py","file_url":"https://github.com/xyfffff/rethink_mcts_for_tsp/blob/HEAD/default_mcts/summarize.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, xyfffff/rethink_mcts_for_tsp when it was checked","code_sha256":"071321bfe70783a2","code_sha256_prefix":"071321bfe70783a2","mcp_get_code":{"code_sha256":"071321bfe70783a2"}},{"arxiv_id":"2402.11175","arxiv_id_is_arxiv":true,"paper":"/paper/m4gt-bench-evaluation-benchmark-for-black-box","title":"M4GT-Bench: Evaluation Benchmark for Black-Box Machine-Generated Text Detection","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbzuai-nlp/m4gt-bench","path":"src/GLTR/server.py","file_url":"https://github.com/mbzuai-nlp/m4gt-bench/blob/HEAD/src/GLTR/server.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, mbzuai-nlp/m4gt-bench when it was checked","code_sha256":"c3dfa77d1a3ca4e1","code_sha256_prefix":"c3dfa77d1a3ca4e1","mcp_get_code":{"code_sha256":"c3dfa77d1a3ca4e1"}},{"arxiv_id":"1906.04043","arxiv_id_is_arxiv":true,"paper":"/paper/gltr-statistical-detection-and-visualization","title":"GLTR: Statistical Detection and Visualization of Generated Text","date":"2019-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HendrikStrobelt/detecting-fake-text","path":"server.py","file_url":"https://github.com/HendrikStrobelt/detecting-fake-text/blob/HEAD/server.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c3dfa77d1a3ca4e1","code_sha256_prefix":"c3dfa77d1a3ca4e1","mcp_get_code":{"code_sha256":"c3dfa77d1a3ca4e1"}},{"arxiv_id":"1710.10766","arxiv_id_is_arxiv":true,"paper":"/paper/pixeldefend-leveraging-generative-models-to","title":"PixelDefend: Leveraging Generative Models to Understand and Defend against Adversarial Examples","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/PixelDefend","path":"utils.py","file_url":"https://github.com/Microsoft/PixelDefend/blob/HEAD/utils.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":"8444dfceccf614a8","code_sha256_prefix":"8444dfceccf614a8","mcp_get_code":{"code_sha256":"8444dfceccf614a8"}},{"arxiv_id":"1512.00727","arxiv_id_is_arxiv":true,"paper":"/paper/tinylfu-a-highly-efficient-cache-admission","title":"TinyLFU: A Highly Efficient Cache Admission Policy","date":null,"month_inferred_from_arxiv_id":"2015-12","title_source":"archive","repo":"ben-manes/caffeine","path":".claude/skills/climber-gate/blindlock.py","file_url":"https://github.com/ben-manes/caffeine/blob/HEAD/.claude/skills/climber-gate/blindlock.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":"7c4d4500251649a1","code_sha256_prefix":"7c4d4500251649a1","mcp_get_code":{"code_sha256":"7c4d4500251649a1"}}],"record_sha256":"70f39f22d3ff99de5a009b2a23aae379159fa4cbb9b253f38a554554b6dfb558","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}