{"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/truncate-colormap","entry":"truncate_colormap","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":5,"n_papers_ran_no_instrument_failure":1,"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":5,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"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":1,"ran_fixture":0,"ran":1,"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.24970","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-24970","title":"Don't Go Breaking My LLM: The Impact of Pruning Attention Layers on Explanation Faithfulness and Confidence Calibration","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"pietrotrope/Dont_Go_Breaking_My_LLM","path":"experiment_effectiveness_pruned.py","file_url":"https://github.com/pietrotrope/Dont_Go_Breaking_My_LLM/blob/HEAD/experiment_effectiveness_pruned.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, pietrotrope/Dont_Go_Breaking_My_LLM when it was checked","code_sha256":"6f2e0f632c7ae2da","code_sha256_prefix":"6f2e0f632c7ae2da","mcp_get_code":{"code_sha256":"6f2e0f632c7ae2da"}},{"arxiv_id":"2412.03299","arxiv_id_is_arxiv":true,"paper":"/paper/gaussian-processes-for-probabilistic","title":"Gaussian Processes for Probabilistic Estimates of Earthquake Ground Shaking: A 1-D Proof-of-Concept","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sscivier/gp-prob-earthquake-shaking","path":"utils/plotting_utils.py","file_url":"https://github.com/sscivier/gp-prob-earthquake-shaking/blob/HEAD/utils/plotting_utils.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":"607f2448a2ac1a76","code_sha256_prefix":"607f2448a2ac1a76","mcp_get_code":{"code_sha256":"607f2448a2ac1a76"}},{"arxiv_id":"2410.20268","arxiv_id_is_arxiv":true,"paper":"/paper/centaur-a-foundation-model-of-human-cognition","title":"Centaur: a foundation model of human cognition","date":"2024-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marcelbinz/Llama-3.1-Centaur-70B","path":"camera_ready/fig2.py","file_url":"https://github.com/marcelbinz/Llama-3.1-Centaur-70B/blob/HEAD/camera_ready/fig2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f2e0f632c7ae2da","code_sha256_prefix":"6f2e0f632c7ae2da","mcp_get_code":{"code_sha256":"6f2e0f632c7ae2da"}},{"arxiv_id":"2406.03589","arxiv_id_is_arxiv":true,"paper":"/paper/ranking-manipulation-for-conversational","title":"Ranking Manipulation for Conversational Search Engines","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spfrommer/cse-ranking-manipulation","path":"adversarial.py","file_url":"https://github.com/spfrommer/cse-ranking-manipulation/blob/HEAD/adversarial.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, spfrommer/cse-ranking-manipulation when it was checked","code_sha256":"72daa2fee3baaf30","code_sha256_prefix":"72daa2fee3baaf30","mcp_get_code":{"code_sha256":"72daa2fee3baaf30"}},{"arxiv_id":"2405.07976","arxiv_id_is_arxiv":true,"paper":"/paper/localized-adaptive-risk-control","title":"Localized Adaptive Risk Control","date":"2024-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kclip/localized-adaptive-risk-control","path":"beam_selection/plot_SNR_maps.py","file_url":"https://github.com/kclip/localized-adaptive-risk-control/blob/HEAD/beam_selection/plot_SNR_maps.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, kclip/localized-adaptive-risk-control when it was checked","code_sha256":"6f2e0f632c7ae2da","code_sha256_prefix":"6f2e0f632c7ae2da","mcp_get_code":{"code_sha256":"6f2e0f632c7ae2da"}},{"arxiv_id":"2403.14606","arxiv_id_is_arxiv":true,"paper":"/paper/the-elements-of-differentiable-programming","title":"The Elements of Differentiable Programming","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diffprog/code","path":"differentiating_integration/plot_ode_regression.py","file_url":"https://github.com/diffprog/code/blob/HEAD/differentiating_integration/plot_ode_regression.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":"252ab259ff2634ab","code_sha256_prefix":"252ab259ff2634ab","mcp_get_code":{"code_sha256":"252ab259ff2634ab"}},{"arxiv_id":"2203.17150","arxiv_id_is_arxiv":true,"paper":"/paper/online-learning-for-traffic-routing-under","title":"Online Learning for Traffic Routing under Unknown Preferences","date":"2022-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanfordasl/online-tolls","path":"plots.py","file_url":"https://github.com/stanfordasl/online-tolls/blob/HEAD/plots.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":"6f2e0f632c7ae2da","code_sha256_prefix":"6f2e0f632c7ae2da","mcp_get_code":{"code_sha256":"6f2e0f632c7ae2da"}},{"arxiv_id":"astro-ph/0205436","arxiv_id_is_arxiv":true,"paper":"/paper/cosmological-parameters-from-cmb-and-other","title":"Cosmological parameters from CMB and other data: a Monte-Carlo approach","date":null,"month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sfu-cosmo/MagCosmoMC","path":"python/chainDumpPlot.py","file_url":"https://github.com/sfu-cosmo/MagCosmoMC/blob/HEAD/python/chainDumpPlot.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":"de55e0c67b4e4488","code_sha256_prefix":"de55e0c67b4e4488","mcp_get_code":{"code_sha256":"de55e0c67b4e4488"}}],"record_sha256":"4af27b79b8d19d04c2d98b2f2b14d5c6a37d147c6f58c3ead4955b98cbdb0459","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}