{"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/calculate-cost","entry":"calculate_cost","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":1,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"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":"2606.18237","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18237","title":"ReproRepo: Scaling Reproducibility Audits with GitHub Repository Issues","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"LithiumDA/ReproRepo","path":"utils/costs.py","file_url":"https://github.com/LithiumDA/ReproRepo/blob/HEAD/utils/costs.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":"720e9c0b565521a9","code_sha256_prefix":"720e9c0b565521a9","mcp_get_code":{"code_sha256":"720e9c0b565521a9"}},{"arxiv_id":"2603.03343","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-03343","title":"Neuro-Symbolic Decoding of Neural Activity","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"PPWangyc/neurona","path":"src/create_dataset/create_bold5000_scene_graph.py","file_url":"https://github.com/PPWangyc/neurona/blob/HEAD/src/create_dataset/create_bold5000_scene_graph.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":"450b9f98a21dfdcd","code_sha256_prefix":"450b9f98a21dfdcd","mcp_get_code":{"code_sha256":"450b9f98a21dfdcd"}},{"arxiv_id":"2602.07962","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-07962","title":"LOCA-bench: Benchmarking Language Agents Under Controllable and Extreme Context Growth","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"hkust-nlp/LOCA-bench","path":"inference/run_claude_api.py","file_url":"https://github.com/hkust-nlp/LOCA-bench/blob/HEAD/inference/run_claude_api.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":"f5d76f17417a4d71","code_sha256_prefix":"f5d76f17417a4d71","mcp_get_code":{"code_sha256":"f5d76f17417a4d71"}},{"arxiv_id":"2508.06361","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-06361","title":"Beyond Prompt-Induced Lies: Investigating LLM Deception on Benign Prompts","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"Xtra-Computing/LLM-Deception","path":"src/llm/ask_openai.py","file_url":"https://github.com/Xtra-Computing/LLM-Deception/blob/HEAD/src/llm/ask_openai.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":"2a77d7d73c34539e","code_sha256_prefix":"2a77d7d73c34539e","mcp_get_code":{"code_sha256":"2a77d7d73c34539e"}},{"arxiv_id":"2506.07972","arxiv_id_is_arxiv":true,"paper":"/paper/heurigym-an-agentic-benchmark-for-llm-crafted","title":"HeuriGym: An Agentic Benchmark for LLM-Crafted Heuristics in Combinatorial Optimization","date":"2025-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cornell-zhang/heurigym","path":"config.py","file_url":"https://github.com/cornell-zhang/heurigym/blob/HEAD/config.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":"6fcd80e8413e9b07","code_sha256_prefix":"6fcd80e8413e9b07","mcp_get_code":{"code_sha256":"6fcd80e8413e9b07"}},{"arxiv_id":"2505.17612","arxiv_id_is_arxiv":true,"paper":"/paper/distilling-llm-agent-into-small-models-with","title":"Distilling LLM Agent into Small Models with Retrieval and Code Tools","date":"2025-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nardien/agent-distillation","path":"exps_research/unified_framework/score_answers.py","file_url":"https://github.com/Nardien/agent-distillation/blob/HEAD/exps_research/unified_framework/score_answers.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":"e258c84c64bc8827","code_sha256_prefix":"e258c84c64bc8827","mcp_get_code":{"code_sha256":"e258c84c64bc8827"}},{"arxiv_id":"2412.14161","arxiv_id_is_arxiv":true,"paper":"/paper/theagentcompany-benchmarking-llm-agents-on","title":"TheAgentCompany: Benchmarking LLM Agents on Consequential Real World Tasks","date":"2024-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theagentcompany/theagentcompany","path":"evaluation/summarise_results.py","file_url":"https://github.com/theagentcompany/theagentcompany/blob/HEAD/evaluation/summarise_results.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":"202953d49725e03b","code_sha256_prefix":"202953d49725e03b","mcp_get_code":{"code_sha256":"202953d49725e03b"}},{"arxiv_id":"2308.13077","arxiv_id_is_arxiv":true,"paper":"/paper/preserving-modality-structure-improves-multi","title":"Preserving Modality Structure Improves Multi-Modal Learning","date":"2023-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swetha5/multi_sinkhorn_knopp","path":"everything_at_once/loss/combinatorial_loss.py","file_url":"https://github.com/swetha5/multi_sinkhorn_knopp/blob/HEAD/everything_at_once/loss/combinatorial_loss.py","status":"ran","verification_level":1,"contract_check":null,"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, swetha5/multi_sinkhorn_knopp when it was checked","code_sha256":"c2fec10380b11eb6","code_sha256_prefix":"c2fec10380b11eb6","mcp_get_code":{"code_sha256":"c2fec10380b11eb6"}}],"record_sha256":"e21f682ce4e7a4f52d6c1d141e2c09b30314a9b475b022bf46f78aa122a399fd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}