{"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/correlation","entry":"correlation","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":16,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":2,"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":16,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":2,"n_samples_unverified":6,"n_samples_fingerprinted":6,"n_places":16,"n_places_pointer_only":2,"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":1,"ran_fixture":1,"ran":5,"unverified":6},"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":"2605.30675","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30675","title":"Human-Alignment, Calibration, and Activation Patterns in Large Language Model Uncertainty","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"KyleAMoore/LLM-UQ-Align-and-Calibrate","path":"LinearProbing/10FoldLinearReg.py","file_url":"https://github.com/KyleAMoore/LLM-UQ-Align-and-Calibrate/blob/HEAD/LinearProbing/10FoldLinearReg.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"242647e19db97dcf","code_sha256_prefix":"242647e19db97dcf","mcp_get_code":{"code_sha256":"242647e19db97dcf"}},{"arxiv_id":"2604.22662","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-22662","title":"Rethinking XAI Evaluation: A Human-Centered Audit of Shapley Benchmarks in High-Stakes Settings","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"feedzai/SHAP-Value-Function-Evaluation","path":"benchmark/evaluation/amortiser_alignment_metrics.py","file_url":"https://github.com/feedzai/SHAP-Value-Function-Evaluation/blob/HEAD/benchmark/evaluation/amortiser_alignment_metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2cac50168029ee82","code_sha256_prefix":"2cac50168029ee82","mcp_get_code":{"code_sha256":"2cac50168029ee82"}},{"arxiv_id":"2602.10643","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10643","title":"Evaluation metrics for temporal preservation in synthetic longitudinal patient data","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Nic5472K/ScientificData2021_HealthGym","path":"Academic/mimic_III_sepsis/D004_WGAN_GP.py","file_url":"https://github.com/Nic5472K/ScientificData2021_HealthGym/blob/HEAD/Academic/mimic_III_sepsis/D004_WGAN_GP.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e95edf3eda6485ff","code_sha256_prefix":"e95edf3eda6485ff","mcp_get_code":{"code_sha256":"e95edf3eda6485ff"}},{"arxiv_id":"2409.03142","arxiv_id_is_arxiv":true,"paper":"/paper/causal-temporal-representation-learning-with","title":"Causal Temporal Representation Learning with Nonstationary Sparse Transition","date":"2024-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiangchensong/ctrlns","path":"models/metrics/correlation.py","file_url":"https://github.com/xiangchensong/ctrlns/blob/HEAD/models/metrics/correlation.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, xiangchensong/ctrlns when it was checked","code_sha256":"2eeae371f67211e4","code_sha256_prefix":"2eeae371f67211e4","mcp_get_code":{"code_sha256":"2eeae371f67211e4"}},{"arxiv_id":"2407.09100","arxiv_id_is_arxiv":true,"paper":"/paper/retrospective-for-the-dynamic-sensorium","title":"Retrospective for the Dynamic Sensorium Competition for predicting large-scale mouse primary visual cortex activity from videos","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bryanlimy/ViV1T","path":"src/viv1t/metrics.py","file_url":"https://github.com/bryanlimy/ViV1T/blob/HEAD/src/viv1t/metrics.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":"3bbc3729e03c6d6c","code_sha256_prefix":"3bbc3729e03c6d6c","mcp_get_code":{"code_sha256":"3bbc3729e03c6d6c"}},{"arxiv_id":"2312.00194","arxiv_id_is_arxiv":true,"paper":"/paper/robust-concept-erasure-via-kernelized-rate-1","title":"Robust Concept Erasure via Kernelized Rate-Distortion Maximization","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brcsomnath/KRaM","path":"src/evaluate.py","file_url":"https://github.com/brcsomnath/KRaM/blob/HEAD/src/evaluate.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":"8a14ef4db6394aa7","code_sha256_prefix":"8a14ef4db6394aa7","mcp_get_code":{"code_sha256":"8a14ef4db6394aa7"}},{"arxiv_id":"2311.18048","arxiv_id_is_arxiv":true,"paper":"/paper/an-interventional-perspective-on","title":"An Interventional Perspective on Identifiability in Gaussian LTI Systems with Independent Component Analysis","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rpatrik96/lti-ica","path":"lti_ica/mcc.py","file_url":"https://github.com/rpatrik96/lti-ica/blob/HEAD/lti_ica/mcc.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":"642112dac839e61a","code_sha256_prefix":"642112dac839e61a","mcp_get_code":{"code_sha256":"642112dac839e61a"}},{"arxiv_id":"2305.11475","arxiv_id_is_arxiv":true,"paper":"/paper/curve-your-enthusiasm-concurvity","title":"Curve Your Enthusiasm: Concurvity Regularization in Differentiable Generalized Additive Models","date":"2023-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"merantix-momentum/concurvity-regularization","path":"main/concurvity.py","file_url":"https://github.com/merantix-momentum/concurvity-regularization/blob/HEAD/main/concurvity.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dcd08f59ec2cdb87","code_sha256_prefix":"dcd08f59ec2cdb87","mcp_get_code":{"code_sha256":"dcd08f59ec2cdb87"}},{"arxiv_id":"2210.13647","arxiv_id_is_arxiv":true,"paper":"/paper/temporally-disentangled-representation","title":"Temporally Disentangled Representation Learning","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weirayao/tdrl","path":"LiLY/modules/modular.py","file_url":"https://github.com/weirayao/tdrl/blob/HEAD/LiLY/modules/modular.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":"228dbb5491c93115","code_sha256_prefix":"228dbb5491c93115","mcp_get_code":{"code_sha256":"228dbb5491c93115"}},{"arxiv_id":"2207.00735","arxiv_id_is_arxiv":true,"paper":"/paper/can-language-models-make-fun-a-case-study-in","title":"Can Language Models Make Fun? A Case Study in Chinese Comical Crosstalk","date":"2022-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonNo2/crosstalk-generation","path":"src/beta_code/indicator_correlation.py","file_url":"https://github.com/anonNo2/crosstalk-generation/blob/HEAD/src/beta_code/indicator_correlation.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":"0d27332b2704f923","code_sha256_prefix":"0d27332b2704f923","mcp_get_code":{"code_sha256":"0d27332b2704f923"}},{"arxiv_id":"2206.02416","arxiv_id_is_arxiv":true,"paper":"/paper/embrace-the-gap-vaes-perform-independent","title":"Embrace the Gap: VAEs Perform Independent Mechanism Analysis","date":"2022-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rpatrik96/ima-vae","path":"ima_vae/metrics/mcc.py","file_url":"https://github.com/rpatrik96/ima-vae/blob/HEAD/ima_vae/metrics/mcc.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":"0152ff71b8ba45fe","code_sha256_prefix":"0152ff71b8ba45fe","mcp_get_code":{"code_sha256":"0152ff71b8ba45fe"}},{"arxiv_id":"2007.05233","arxiv_id_is_arxiv":true,"paper":"/paper/continual-adaptation-for-deep-stereo","title":"Continual Adaptation for Deep Stereo","date":"2020-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CVLAB-Unibo/Real-time-self-adaptive-deep-stereo","path":"Nets/sharedLayers.py","file_url":"https://github.com/CVLAB-Unibo/Real-time-self-adaptive-deep-stereo/blob/HEAD/Nets/sharedLayers.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":"e0bb29258316c3e5","code_sha256_prefix":"e0bb29258316c3e5","mcp_get_code":{"code_sha256":"e0bb29258316c3e5"}},{"arxiv_id":"1911.11123","arxiv_id_is_arxiv":true,"paper":"/paper/pyxtal-a-python-library-for-crystal-structure","title":"PyXtal: a Python Library for Crystal Structure Generation and Symmetry Analysis","date":null,"month_inferred_from_arxiv_id":"2019-11","title_source":"archive","repo":"qzhu2017/PyXtal","path":"pyxtal/descriptor.py","file_url":"https://github.com/qzhu2017/PyXtal/blob/HEAD/pyxtal/descriptor.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":"bed3b4c651e30d7b","code_sha256_prefix":"bed3b4c651e30d7b","mcp_get_code":{"code_sha256":"bed3b4c651e30d7b"}},{"arxiv_id":"1904.02957","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-adapt-for-stereo","title":"Learning to Adapt for Stereo","date":"2019-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CVLAB-Unibo/Learning2AdaptForStereo","path":"Nets/sharedLayers.py","file_url":"https://github.com/CVLAB-Unibo/Learning2AdaptForStereo/blob/HEAD/Nets/sharedLayers.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":"a605840e0a151022","code_sha256_prefix":"a605840e0a151022","mcp_get_code":{"code_sha256":"a605840e0a151022"}},{"arxiv_id":"1808.10399","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-empathy-and-distress-in-reaction-to","title":"Modeling Empathy and Distress in Reaction to News Stories","date":"2018-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wwbp/empathic_reactions","path":"modeling/main/crossvalidation/experiment.py","file_url":"https://github.com/wwbp/empathic_reactions/blob/HEAD/modeling/main/crossvalidation/experiment.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, wwbp/empathic_reactions when it was checked","code_sha256":"393b6daaa1bd4fa7","code_sha256_prefix":"393b6daaa1bd4fa7","mcp_get_code":{"code_sha256":"393b6daaa1bd4fa7"}},{"arxiv_id":"1502.03044","arxiv_id_is_arxiv":true,"paper":"/paper/show-attend-and-tell-neural-image-caption","title":"Show, Attend and Tell: Neural Image Caption Generation with Visual Attention","date":"2015-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaox192/NeuralGuidance","path":"neural_guidance_training/model.py","file_url":"https://github.com/shaox192/NeuralGuidance/blob/HEAD/neural_guidance_training/model.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":"e9b0f77f1b690e9a","code_sha256_prefix":"e9b0f77f1b690e9a","mcp_get_code":{"code_sha256":"e9b0f77f1b690e9a"}}],"record_sha256":"585c7b95ef02182ea722443a5c3a4a826374e96e5b06335c7c37a20da3479457","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}