{"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/compute-correlation","entry":"compute_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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":6,"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":2,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"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":"2605.20670","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20670","title":"LT2: Linear-Time Looped Transformers","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"chili-lab/LT2","path":"apps/LT2/kernel/dsa/fp8_lighting_indexer.py","file_url":"https://github.com/chili-lab/LT2/blob/HEAD/apps/LT2/kernel/dsa/fp8_lighting_indexer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5552f9c3667da10b","code_sha256_prefix":"5552f9c3667da10b","mcp_get_code":{"code_sha256":"5552f9c3667da10b"}},{"arxiv_id":"2604.24942","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-24942","title":"Independent-Component-Based Encoding Models of Brain Activity During Story Comprehension","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"kamyahari/IC-Encoding-Models","path":"labeling/rank_ics.py","file_url":"https://github.com/kamyahari/IC-Encoding-Models/blob/HEAD/labeling/rank_ics.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, kamyahari/IC-Encoding-Models when it was checked","code_sha256":"0410f4531b020ad2","code_sha256_prefix":"0410f4531b020ad2","mcp_get_code":{"code_sha256":"0410f4531b020ad2"}},{"arxiv_id":"2506.15583","arxiv_id_is_arxiv":true,"paper":"/paper/discosg-towards-discourse-level-text-scene","title":"DiscoSG: Towards Discourse-Level Text Scene Graph Parsing through Iterative Graph Refinement","date":"2025-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShaoqLin/DiscoSG","path":"src/factual_scene_graph/eval_utils.py","file_url":"https://github.com/ShaoqLin/DiscoSG/blob/HEAD/src/factual_scene_graph/eval_utils.py","status":"ran","verification_level":1,"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, ShaoqLin/DiscoSG when it was checked","code_sha256":"8b28307b99f57703","code_sha256_prefix":"8b28307b99f57703","mcp_get_code":{"code_sha256":"8b28307b99f57703"}},{"arxiv_id":"2310.11616","arxiv_id_is_arxiv":true,"paper":"/paper/unveiling-the-general-intelligence-factor-in","title":"Evidence of interrelated cognitive-like capabilities in large language models: Indications of artificial general intelligence or achievement?","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davidilic/g-in-llms","path":"efa_corr_pca.py","file_url":"https://github.com/davidilic/g-in-llms/blob/HEAD/efa_corr_pca.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, davidilic/g-in-llms when it was checked","code_sha256":"aeae096082b080c3","code_sha256_prefix":"aeae096082b080c3","mcp_get_code":{"code_sha256":"aeae096082b080c3"}},{"arxiv_id":"2106.01098","arxiv_id_is_arxiv":true,"paper":"/paper/evaluation-metrics-for-graph-generative","title":"Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"borgwardtlab/ggme","path":"src/correlation.py","file_url":"https://github.com/borgwardtlab/ggme/blob/HEAD/src/correlation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"09d321100886c8b5","code_sha256_prefix":"09d321100886c8b5","mcp_get_code":{"code_sha256":"09d321100886c8b5"}},{"arxiv_id":"1711.03058","arxiv_id_is_arxiv":true,"paper":"/paper/matrix-normal-models-for-fmri-analysis","title":"Matrix-normal models for fMRI analysis","date":"2017-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brainiak/brainiak","path":"src/brainiak/fcma/util.py","file_url":"https://github.com/brainiak/brainiak/blob/HEAD/src/brainiak/fcma/util.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":"071d25088ed91789","code_sha256_prefix":"071d25088ed91789","mcp_get_code":{"code_sha256":"071d25088ed91789"}}],"record_sha256":"9a02b46e46b050d7214433fbec60f1b907d7331de3eeefb54653f472606bc348","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}