{"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/scores","entry":"scores","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":12,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":7,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":12,"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":0,"ran_violates":0,"ran_draft_wrong":4,"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":"2608.10008","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10008","title":"Do LLM Recommenders Know When They're Hallucinating? Auditing Confidence Calibration in Catalog Faithfulness","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"rsrijith/cikm26-catalog-faithfulness","path":"code/instrument_table.py","file_url":"https://github.com/rsrijith/cikm26-catalog-faithfulness/blob/HEAD/code/instrument_table.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, rsrijith/cikm26-catalog-faithfulness (NOASSERTION)","code_sha256":"038db614afac5183","code_sha256_prefix":"038db614afac5183","mcp_get_code":{"code_sha256":"038db614afac5183"}},{"arxiv_id":"2404.07544","arxiv_id_is_arxiv":true,"paper":"/paper/from-words-to-numbers-your-large-language","title":"From Words to Numbers: Your Large Language Model Is Secretly A Capable Regressor When Given In-Context Examples","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robertvacareanu/llm4regression","path":"src/score_utils.py","file_url":"https://github.com/robertvacareanu/llm4regression/blob/HEAD/src/score_utils.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, robertvacareanu/llm4regression when it was checked","code_sha256":"59d9b24f46648543","code_sha256_prefix":"59d9b24f46648543","mcp_get_code":{"code_sha256":"59d9b24f46648543"}},{"arxiv_id":"2310.18640","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2310.18640","date":null,"month_inferred_from_arxiv_id":"2023-10","title_source":null,"repo":"naver-ai/dual-teacher","path":"seg_core/eval_seg.py","file_url":"https://github.com/naver-ai/dual-teacher/blob/HEAD/seg_core/eval_seg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, naver-ai/dual-teacher (NOASSERTION)","code_sha256":"2f9f2b2c69abf093","code_sha256_prefix":"2f9f2b2c69abf093","mcp_get_code":{"code_sha256":"2f9f2b2c69abf093"}},{"arxiv_id":"2212.09506","arxiv_id_is_arxiv":true,"paper":"/paper/clip-is-also-an-efficient-segmenter-a-text","title":"CLIP is Also an Efficient Segmenter: A Text-Driven Approach for Weakly Supervised Semantic Segmentation","date":"2022-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linyq2117/clip-es","path":"eval_cam_with_crf.py","file_url":"https://github.com/linyq2117/clip-es/blob/HEAD/eval_cam_with_crf.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d8fbe9ff0f1714e","code_sha256_prefix":"4d8fbe9ff0f1714e","mcp_get_code":{"code_sha256":"4d8fbe9ff0f1714e"}},{"arxiv_id":"2203.11075","arxiv_id_is_arxiv":true,"paper":"/paper/dense-siamese-network","title":"Dense Siamese Network for Dense Unsupervised Learning","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZwwWayne/DenseSiam","path":"densesiam/core/evaluators/cluster_mIoU_evaluator.py","file_url":"https://github.com/ZwwWayne/DenseSiam/blob/HEAD/densesiam/core/evaluators/cluster_mIoU_evaluator.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":"0d954698d8107a2e","code_sha256_prefix":"0d954698d8107a2e","mcp_get_code":{"code_sha256":"0d954698d8107a2e"}},{"arxiv_id":"2105.15203","arxiv_id_is_arxiv":true,"paper":"/paper/segformer-simple-and-efficient-design-for","title":"SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformers","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rulixiang/segformer-pytorch","path":"utils/eval_seg.py","file_url":"https://github.com/rulixiang/segformer-pytorch/blob/HEAD/utils/eval_seg.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, rulixiang/segformer-pytorch when it was checked","code_sha256":"771525e476e6dcb2","code_sha256_prefix":"771525e476e6dcb2","mcp_get_code":{"code_sha256":"771525e476e6dcb2"}},{"arxiv_id":"2008.11406","arxiv_id_is_arxiv":true,"paper":"/paper/making-neural-networks-interpretable-with","title":"Making Neural Networks Interpretable with Attribution: Application to Implicit Signals Prediction","date":"2020-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deezer/interpretable_nn_attribution","path":"run_movielens.py","file_url":"https://github.com/deezer/interpretable_nn_attribution/blob/HEAD/run_movielens.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, deezer/interpretable_nn_attribution when it was checked","code_sha256":"567d60ddbf3ccf72","code_sha256_prefix":"567d60ddbf3ccf72","mcp_get_code":{"code_sha256":"567d60ddbf3ccf72"}},{"arxiv_id":"2008.01183","arxiv_id_is_arxiv":true,"paper":"/paper/weakly-supervised-semantic-segmentation-via-1","title":"Weakly-Supervised Semantic Segmentation via Sub-category Exploration","date":"2020-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Juliachang/SC-CAM","path":"tool/iouutils.py","file_url":"https://github.com/Juliachang/SC-CAM/blob/HEAD/tool/iouutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d8fbe9ff0f1714e","code_sha256_prefix":"4d8fbe9ff0f1714e","mcp_get_code":{"code_sha256":"4d8fbe9ff0f1714e"}},{"arxiv_id":"1612.01105","arxiv_id_is_arxiv":true,"paper":"/paper/pyramid-scene-parsing-network","title":"Pyramid Scene Parsing Network","date":"2016-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kazuto1011/pspnet-pytorch","path":"libs/utils/metric.py","file_url":"https://github.com/kazuto1011/pspnet-pytorch/blob/HEAD/libs/utils/metric.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":"a83c73332fef7d86","code_sha256_prefix":"a83c73332fef7d86","mcp_get_code":{"code_sha256":"a83c73332fef7d86"}},{"arxiv_id":"1507.06594","arxiv_id_is_arxiv":true,"paper":"/paper/neural-nilm-deep-neural-networks-applied-to","title":"Neural NILM: Deep Neural Networks Applied to Energy Disaggregation","date":"2015-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joseluis1061/neuralnilm","path":"neuralnilm/scores.py","file_url":"https://github.com/joseluis1061/neuralnilm/blob/HEAD/neuralnilm/scores.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":"7eed19a0c9917f3f","code_sha256_prefix":"7eed19a0c9917f3f","mcp_get_code":{"code_sha256":"7eed19a0c9917f3f"}},{"arxiv_id":"aaai_28139","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28139","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"linyq2117/TagCLIP","path":"CLIP-ES/eval_cam.py","file_url":"https://github.com/linyq2117/TagCLIP/blob/HEAD/CLIP-ES/eval_cam.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d8fbe9ff0f1714e","code_sha256_prefix":"4d8fbe9ff0f1714e","mcp_get_code":{"code_sha256":"4d8fbe9ff0f1714e"}},{"arxiv_id":"Lin_CLIP_Is_Also_an_Efficient_Segmenter_A_Text-Driven_Approach_for_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Lin_CLIP_Is_Also_an_Efficient_Segmenter_A_Text-Driven_Approach_for_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"linyq2117/CLIP-ES","path":"eval_cam.py","file_url":"https://github.com/linyq2117/CLIP-ES/blob/HEAD/eval_cam.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4d8fbe9ff0f1714e","code_sha256_prefix":"4d8fbe9ff0f1714e","mcp_get_code":{"code_sha256":"4d8fbe9ff0f1714e"}}],"record_sha256":"a96b4ca7459296d5225ae52c131a1d522223e26772be7b77bc96f92e9ee90752","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}