{"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/eval-metrics","entry":"eval_metrics","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":5,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":3,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":5,"n_samples_unverified":4,"n_samples_fingerprinted":3,"n_places":13,"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":3,"ran_fixture":2,"ran":2,"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":"2608.23468","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-23468","title":"RAD: Rule-Augmented Relational Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"noahd15/RAD_RelationalAnomalyDetection","path":"lanl/run_lanl_tabular_baselines.py","file_url":"https://github.com/noahd15/RAD_RelationalAnomalyDetection/blob/HEAD/lanl/run_lanl_tabular_baselines.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, noahd15/RAD_RelationalAnomalyDetection when it was checked","code_sha256":"7411ecbefbeea8c3","code_sha256_prefix":"7411ecbefbeea8c3","mcp_get_code":{"code_sha256":"7411ecbefbeea8c3"}},{"arxiv_id":"2510.02340","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-02340","title":"Can Prompts Rewind Time for LLMs? Evaluating the Effectiveness of Prompted Knowledge Cutoffs","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"gxx27/time_unlearn","path":"counterfactual/metrics.py","file_url":"https://github.com/gxx27/time_unlearn/blob/HEAD/counterfactual/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7743c1acf603d26a","code_sha256_prefix":"7743c1acf603d26a","mcp_get_code":{"code_sha256":"7743c1acf603d26a"}},{"arxiv_id":"2510.02340","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-02340","title":"Can Prompts Rewind Time for LLMs? Evaluating the Effectiveness of Prompted Knowledge Cutoffs","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"gxx27/time_unlearn","path":"factual/metrics.py","file_url":"https://github.com/gxx27/time_unlearn/blob/HEAD/factual/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1737b4f7160a815c","code_sha256_prefix":"1737b4f7160a815c","mcp_get_code":{"code_sha256":"1737b4f7160a815c"}},{"arxiv_id":"2510.02340","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-02340","title":"Can Prompts Rewind Time for LLMs? Evaluating the Effectiveness of Prompted Knowledge Cutoffs","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"gxx27/time_unlearn","path":"semantic/metrics.py","file_url":"https://github.com/gxx27/time_unlearn/blob/HEAD/semantic/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7aba4c8d2b8d5efd","code_sha256_prefix":"7aba4c8d2b8d5efd","mcp_get_code":{"code_sha256":"7aba4c8d2b8d5efd"}},{"arxiv_id":"2411.05403","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-distributional-alignment-of","title":"Benchmarking Distributional Alignment of Large Language Models","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicolemeister/benchmarking-distributional-alignment","path":"eval_utils.py","file_url":"https://github.com/nicolemeister/benchmarking-distributional-alignment/blob/HEAD/eval_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, nicolemeister/benchmarking-distributional-alignment when it was checked","code_sha256":"1bd55b35c9b4ee4f","code_sha256_prefix":"1bd55b35c9b4ee4f","mcp_get_code":{"code_sha256":"1bd55b35c9b4ee4f"}},{"arxiv_id":"2407.07307","arxiv_id_is_arxiv":true,"paper":"/paper/dual-stage-hyperspectral-image-classification","title":"Dual-stage Hyperspectral Image Classification Model with Spectral Supertoken","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"laprf/DSTC","path":"utils.py","file_url":"https://github.com/laprf/DSTC/blob/HEAD/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3bbee3fdbaa9a49c","code_sha256_prefix":"3bbee3fdbaa9a49c","mcp_get_code":{"code_sha256":"3bbee3fdbaa9a49c"}},{"arxiv_id":"2403.03532","arxiv_id_is_arxiv":true,"paper":"/paper/extend-your-own-correspondences-unsupervised","title":"Extend Your Own Correspondences: Unsupervised Distant Point Cloud Registration by Progressive Distance Extension","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuquan98/eyoc","path":"lib/metrics.py","file_url":"https://github.com/liuquan98/eyoc/blob/HEAD/lib/metrics.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":"876a2cfd6cb4e088","code_sha256_prefix":"876a2cfd6cb4e088","mcp_get_code":{"code_sha256":"876a2cfd6cb4e088"}},{"arxiv_id":"2305.02893","arxiv_id_is_arxiv":true,"paper":"/paper/apr-online-distant-point-cloud-registration","title":"APR: Online Distant Point Cloud Registration Through Aggregated Point Cloud Reconstruction","date":"2023-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuQuan98/APR","path":"FCGF_APR/lib/metrics.py","file_url":"https://github.com/liuQuan98/APR/blob/HEAD/FCGF_APR/lib/metrics.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":"876a2cfd6cb4e088","code_sha256_prefix":"876a2cfd6cb4e088","mcp_get_code":{"code_sha256":"876a2cfd6cb4e088"}},{"arxiv_id":"2204.00987","arxiv_id_is_arxiv":true,"paper":"/paper/binsformer-revisiting-adaptive-bins-for","title":"BinsFormer: Revisiting Adaptive Bins for Monocular Depth Estimation","date":"2022-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyever/monocular-depth-estimation-toolbox","path":"depth/core/evaluation/metrics.py","file_url":"https://github.com/zhyever/monocular-depth-estimation-toolbox/blob/HEAD/depth/core/evaluation/metrics.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":"568cbdbe2a7718a3","code_sha256_prefix":"568cbdbe2a7718a3","mcp_get_code":{"code_sha256":"568cbdbe2a7718a3"}},{"arxiv_id":"2102.09320","arxiv_id_is_arxiv":true,"paper":"/paper/combining-events-and-frames-using-recurrent","title":"Combining Events and Frames using Recurrent Asynchronous Multimodal Networks for Monocular Depth Prediction","date":"2021-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uzh-rpg/rpg_ramnet","path":"RAM_Net/evaluation.py","file_url":"https://github.com/uzh-rpg/rpg_ramnet/blob/HEAD/RAM_Net/evaluation.py","status":"unverified","verification_level":0,"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, uzh-rpg/rpg_ramnet, is not in the permissive set Syntology serves inline","code_sha256":"afac895121a47138","code_sha256_prefix":"afac895121a47138","mcp_get_code":{"code_sha256":"afac895121a47138"}},{"arxiv_id":"2004.11540","arxiv_id_is_arxiv":true,"paper":"/paper/deep-global-registration","title":"Deep Global Registration","date":"2020-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chrischoy/FCGF","path":"lib/metrics.py","file_url":"https://github.com/chrischoy/FCGF/blob/HEAD/lib/metrics.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":"876a2cfd6cb4e088","code_sha256_prefix":"876a2cfd6cb4e088","mcp_get_code":{"code_sha256":"876a2cfd6cb4e088"}},{"arxiv_id":"2003.06344","arxiv_id_is_arxiv":true,"paper":"/paper/automating-botnet-detection-with-graph-neural","title":"Automating Botnet Detection with Graph Neural Networks","date":"2020-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harvardnlp/botnet-detection","path":"botdet/eval/evaluation.py","file_url":"https://github.com/harvardnlp/botnet-detection/blob/HEAD/botdet/eval/evaluation.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":"6222330713f8e774","code_sha256_prefix":"6222330713f8e774","mcp_get_code":{"code_sha256":"6222330713f8e774"}},{"arxiv_id":"Seidenschwarz_Simple_Cues_Lead_to_a_Strong_Multi-Object_Tracker_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Seidenschwarz_Simple_Cues_Lead_to_a_Strong_Multi-Object_Tracker_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"dvl-tum/GHOST","path":"src/utils.py","file_url":"https://github.com/dvl-tum/GHOST/blob/HEAD/src/utils.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":"6e2e8574e5d7c4ae","code_sha256_prefix":"6e2e8574e5d7c4ae","mcp_get_code":{"code_sha256":"6e2e8574e5d7c4ae"}}],"record_sha256":"730445ceb4d8478e46d1eeb6cf8c4faef5c41102e3a02b31deee7927b93994cd","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}