{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/natural-key","entry":"natural_key","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":10,"n_papers_ran":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":6,"n_samples_fingerprinted":6,"n_places":11,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"unverified":3},"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":"2607.22987","paper":"/paper/arxiv-2607-22987","title":"Label-free Industrial Fault Detection via Adversarial Inverse Reinforcement Learning: A System for Run-to-Failure Prognostics","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"dhirajneupane/AIRL-MFD-DN","path":"AIRL_HUMS2023.py","file_url":"https://github.com/dhirajneupane/AIRL-MFD-DN/blob/HEAD/AIRL_HUMS2023.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9ddc2668cddbb726","mcp_get_code":{"code_sha256":"9ddc2668cddbb726"}},{"arxiv_id":"2606.16920","paper":"/paper/arxiv-2606-16920","title":"Demystifying Variance in Circuit Discovery of LLMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"LIONS-EPFL/Circuit-Variance","path":"visualization/plot_rephrasing_samplewise_variance.py","file_url":"https://github.com/LIONS-EPFL/Circuit-Variance/blob/HEAD/visualization/plot_rephrasing_samplewise_variance.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8cff6cdc74875cc7","mcp_get_code":{"code_sha256":"8cff6cdc74875cc7"}},{"arxiv_id":"2606.16920","paper":"/paper/arxiv-2606-16920","title":"Demystifying Variance in Circuit Discovery of LLMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"LIONS-EPFL/Circuit-Variance","path":"visualization/plot_resampling_variance.py","file_url":"https://github.com/LIONS-EPFL/Circuit-Variance/blob/HEAD/visualization/plot_resampling_variance.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6f859f08878f0484","mcp_get_code":{"code_sha256":"6f859f08878f0484"}},{"arxiv_id":"2412.09529","paper":"/paper/can-modern-llms-act-as-agent-cores-in","title":"Can Modern LLMs Act as Agent Cores in Radiology Environments?","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"magic-ai4med/radabench","path":"EvalPlat/AutoTB/run_synthetic.py","file_url":"https://github.com/magic-ai4med/radabench/blob/HEAD/EvalPlat/AutoTB/run_synthetic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"27063496ea99fdf9","mcp_get_code":{"code_sha256":"27063496ea99fdf9"}},{"arxiv_id":"2410.10034","paper":"/paper/tulip-token-length-upgraded-clip","title":"TULIP: Token-length Upgraded CLIP","date":"2024-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ivonajdenkoska/tulip","path":"eval_tulip.py","file_url":"https://github.com/ivonajdenkoska/tulip/blob/HEAD/eval_tulip.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a677092c48744688","mcp_get_code":{"code_sha256":"a677092c48744688"}},{"arxiv_id":"2407.11867","paper":"/paper/single-layer-single-gradient-unlearning","title":"Unlearning Targeted Information via Single Layer Unlearning Gradient","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CSIPlab/SLUG","path":"src/clip/unlearn_slug.py","file_url":"https://github.com/CSIPlab/SLUG/blob/HEAD/src/clip/unlearn_slug.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a677092c48744688","mcp_get_code":{"code_sha256":"a677092c48744688"}},{"arxiv_id":"2406.12837","paper":"/paper/layermerge-neural-network-depth-compression","title":"LayerMerge: Neural Network Depth Compression through Layer Pruning and Merging","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-mllab/LayerMerge","path":"layer_merge/aggregate_imp.py","file_url":"https://github.com/snu-mllab/LayerMerge/blob/HEAD/layer_merge/aggregate_imp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c5f7f81b1ed8389e","mcp_get_code":{"code_sha256":"c5f7f81b1ed8389e"}},{"arxiv_id":"2306.09200","paper":"/paper/chessgpt-bridging-policy-learning-and-1","title":"ChessGPT: Bridging Policy Learning and Language Modeling","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"waterhorse1/chessgpt","path":"chessclip/src/training/main_chess.py","file_url":"https://github.com/waterhorse1/chessgpt/blob/HEAD/chessclip/src/training/main_chess.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a677092c48744688","mcp_get_code":{"code_sha256":"a677092c48744688"}},{"arxiv_id":"2303.08231","paper":"/paper/rotation-invariant-transformer-for-point","title":"Rotation-Invariant Transformer for Point Cloud Matching","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoyu94/roitr","path":"lib/utils.py","file_url":"https://github.com/haoyu94/roitr/blob/HEAD/lib/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d39e8d00511fe418","mcp_get_code":{"code_sha256":"d39e8d00511fe418"}},{"arxiv_id":"2203.10977","paper":"/paper/improving-anatomical-plausibility-in-medical","title":"Improving anatomical plausibility in medical image segmentation via hybrid graph neural networks: applications to chest x-ray analysis","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ngaggion/HybridGNet","path":"utils/dataLoader.py","file_url":"https://github.com/ngaggion/HybridGNet/blob/HEAD/utils/dataLoader.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"cbcc123883e8340d","mcp_get_code":{"code_sha256":"cbcc123883e8340d"}},{"arxiv_id":"2109.12909","paper":"/paper/compressive-visual-representations","title":"Compressive Visual Representations","date":"2021-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/compressive-visual-representations","path":"compressive_visual_representations/model.py","file_url":"https://github.com/google-research/compressive-visual-representations/blob/HEAD/compressive_visual_representations/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"53256e57b7ff1522","mcp_get_code":{"code_sha256":"53256e57b7ff1522"}}]}