{"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/process-question","entry":"process_question","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":8,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":6,"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":11,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":6,"n_samples_unverified":3,"n_samples_fingerprinted":3,"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":6,"ran_fixture":0,"ran":2,"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":"2606.21867","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-21867","title":"ForEx: A Formal Verification Framework for Explainable Reasoning in Logical Fallacy Detection and Annotation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"D3-Laboratory/ForEx","path":"src/experiment_processor.py","file_url":"https://github.com/D3-Laboratory/ForEx/blob/HEAD/src/experiment_processor.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, D3-Laboratory/ForEx when it was checked","code_sha256":"ad5b86651ffa4d6f","code_sha256_prefix":"ad5b86651ffa4d6f","mcp_get_code":{"code_sha256":"ad5b86651ffa4d6f"}},{"arxiv_id":"2604.27453","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-27453","title":"From Coarse to Fine: Benchmarking and Reward Modeling for Writing-Centric Generation Tasks","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Rainier-rq1/From_Coarse_to_Fine","path":"WEval/WritingBench-Critic.py","file_url":"https://github.com/Rainier-rq1/From_Coarse_to_Fine/blob/HEAD/WEval/WritingBench-Critic.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, Rainier-rq1/From_Coarse_to_Fine when it was checked","code_sha256":"35823a35719c0bdf","code_sha256_prefix":"35823a35719c0bdf","mcp_get_code":{"code_sha256":"35823a35719c0bdf"}},{"arxiv_id":"2604.08281","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-08281","title":"When to Trust Tools? Adaptive Tool Trust Calibration For Tool-Integrated Math Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"00Dreamer00/ATTC","path":"add_new_dataset.py","file_url":"https://github.com/00Dreamer00/ATTC/blob/HEAD/add_new_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"48fad3d8f7e025e9","code_sha256_prefix":"48fad3d8f7e025e9","mcp_get_code":{"code_sha256":"48fad3d8f7e025e9"}},{"arxiv_id":"2601.11047","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-11047","title":"CoG: Controllable Graph Reasoning via Relational Blueprints and Failure-Aware Refinement over Knowledge Graphs","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"zjukg/CoG","path":"CoG/main_freebase.py","file_url":"https://github.com/zjukg/CoG/blob/HEAD/CoG/main_freebase.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":"d1f04ebb317abd0e","code_sha256_prefix":"d1f04ebb317abd0e","mcp_get_code":{"code_sha256":"d1f04ebb317abd0e"}},{"arxiv_id":"2504.20965","arxiv_id_is_arxiv":true,"paper":"/paper/aegisllm-scaling-agentic-systems-for-self","title":"AegisLLM: Scaling Agentic Systems for Self-Reflective Defense in LLM Security","date":"2025-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zikuicai/aegisllm","path":"run_unlearning_mcq.py","file_url":"https://github.com/zikuicai/aegisllm/blob/HEAD/run_unlearning_mcq.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f362b0a173e63a2d","code_sha256_prefix":"f362b0a173e63a2d","mcp_get_code":{"code_sha256":"f362b0a173e63a2d"}},{"arxiv_id":"2503.08688","arxiv_id_is_arxiv":true,"paper":"/paper/randomness-not-representation-the","title":"Randomness, Not Representation: The Unreliability of Evaluating Cultural Alignment in LLMs","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":"archive","repo":"ariba-k/llm-cultural-alignment-evaluation","path":"steerability/run_steerability.py","file_url":"https://github.com/ariba-k/llm-cultural-alignment-evaluation/blob/HEAD/steerability/run_steerability.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, ariba-k/llm-cultural-alignment-evaluation when it was checked","code_sha256":"f8b212f56c3563ac","code_sha256_prefix":"f8b212f56c3563ac","mcp_get_code":{"code_sha256":"f8b212f56c3563ac"}},{"arxiv_id":"2410.18417","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-models-reflect-the-ideology-of","title":"Large Language Models Reflect the Ideology of their Creators","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aida-ugent/llm-ideology-analysis","path":"src/run_questions_through_unified_api.py","file_url":"https://github.com/aida-ugent/llm-ideology-analysis/blob/HEAD/src/run_questions_through_unified_api.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"efde6c9a51f02cd6","code_sha256_prefix":"efde6c9a51f02cd6","mcp_get_code":{"code_sha256":"efde6c9a51f02cd6"}},{"arxiv_id":"2312.17115","arxiv_id_is_arxiv":true,"paper":"/paper/how-far-are-we-from-believable-ai-agents-a","title":"How Far Are LLMs from Believable AI? A Benchmark for Evaluating the Believability of Human Behavior Simulation","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llmconference/emnlp_conference_2024","path":"benchmark/benchmark_class.py","file_url":"https://github.com/llmconference/emnlp_conference_2024/blob/HEAD/benchmark/benchmark_class.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, llmconference/emnlp_conference_2024 when it was checked","code_sha256":"dc5b4a64081c2586","code_sha256_prefix":"dc5b4a64081c2586","mcp_get_code":{"code_sha256":"dc5b4a64081c2586"}},{"arxiv_id":"2207.00383","arxiv_id_is_arxiv":true,"paper":"/paper/reler-zju-alibaba-submission-to-the-ego4d","title":"ReLER@ZJU-Alibaba Submission to the Ego4D Natural Language Queries Challenge 2022","date":"2022-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nnnnai/ego4d_nlq_2022_1st_place_solution","path":"ms_cm/vslnet_utils/prepare_ego4d_dataset.py","file_url":"https://github.com/nnnnai/ego4d_nlq_2022_1st_place_solution/blob/HEAD/ms_cm/vslnet_utils/prepare_ego4d_dataset.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":"eff6500b503388a1","code_sha256_prefix":"eff6500b503388a1","mcp_get_code":{"code_sha256":"eff6500b503388a1"}},{"arxiv_id":"1803.03067","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-attention-networks-for-machine","title":"Compositional Attention Networks for Machine Reasoning","date":"2018-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ceyzaguirre4/mac-network-pytorch","path":"preprocess.py","file_url":"https://github.com/ceyzaguirre4/mac-network-pytorch/blob/HEAD/preprocess.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":"928267eac64ad657","code_sha256_prefix":"928267eac64ad657","mcp_get_code":{"code_sha256":"928267eac64ad657"}},{"arxiv_id":"1803.03067","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-attention-networks-for-machine","title":"Compositional Attention Networks for Machine Reasoning","date":"2018-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rosinality/mac-network-pytorch","path":"preprocess.py","file_url":"https://github.com/rosinality/mac-network-pytorch/blob/HEAD/preprocess.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":"6490066d39c2eafd","code_sha256_prefix":"6490066d39c2eafd","mcp_get_code":{"code_sha256":"6490066d39c2eafd"}}],"record_sha256":"80ee1412e6b11ee0e71a57ee6cd931fea5ae3abd70c297bb2506552b8d191d6a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}