{"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/binary-entropy","entry":"binary_entropy","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"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":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":6,"n_places":8,"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":1,"ran_violates":3,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":2},"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":"2606.16535","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-16535","title":"Assessing Reliability of Symbol Detection in Concept Bottleneck Models","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Fuminides/cbm_sanity","path":"src/symbol_sanity/multihead.py","file_url":"https://github.com/Fuminides/cbm_sanity/blob/HEAD/src/symbol_sanity/multihead.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":"ad6623bc2b9c1140","code_sha256_prefix":"ad6623bc2b9c1140","mcp_get_code":{"code_sha256":"ad6623bc2b9c1140"}},{"arxiv_id":"2606.15877","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-15877","title":"Free Energy Heuristics: Fast-And-Frugal Cognition as Active Inference Under Uncertain Precision","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Evolutionairy-AI/Free-Energy-Heuristics","path":"binary_toy_monte_carlo.py","file_url":"https://github.com/Evolutionairy-AI/Free-Energy-Heuristics/blob/HEAD/binary_toy_monte_carlo.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":"0596c5d2f6fcb7f7","code_sha256_prefix":"0596c5d2f6fcb7f7","mcp_get_code":{"code_sha256":"0596c5d2f6fcb7f7"}},{"arxiv_id":"2507.07236","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.07236","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"LARK-NLP-Lab/MUSE","path":"modeling/MUSE.py","file_url":"https://github.com/LARK-NLP-Lab/MUSE/blob/HEAD/modeling/MUSE.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, LARK-NLP-Lab/MUSE when it was checked","code_sha256":"b8513f97f67b0775","code_sha256_prefix":"b8513f97f67b0775","mcp_get_code":{"code_sha256":"b8513f97f67b0775"}},{"arxiv_id":"2411.02038","arxiv_id_is_arxiv":true,"paper":"/paper/addressing-representation-collapse-in-vector","title":"Addressing Representation Collapse in Vector Quantized Models with One Linear Layer","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucidrains/vector-quantize-pytorch","path":"vector_quantize_pytorch/binary_mapper.py","file_url":"https://github.com/lucidrains/vector-quantize-pytorch/blob/HEAD/vector_quantize_pytorch/binary_mapper.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":"0fb901bd154ce58f","code_sha256_prefix":"0fb901bd154ce58f","mcp_get_code":{"code_sha256":"0fb901bd154ce58f"}},{"arxiv_id":"2410.19750","arxiv_id_is_arxiv":true,"paper":"/paper/the-geometry-of-concepts-sparse-autoencoder","title":"The Geometry of Concepts: Sparse Autoencoder Feature Structure","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ejmichaud/feature-geometry","path":"brain/experiments/all-occurrences0/cluster_mi.py","file_url":"https://github.com/ejmichaud/feature-geometry/blob/HEAD/brain/experiments/all-occurrences0/cluster_mi.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ejmichaud/feature-geometry when it was checked","code_sha256":"02cad154e3ffa4a0","code_sha256_prefix":"02cad154e3ffa4a0","mcp_get_code":{"code_sha256":"02cad154e3ffa4a0"}},{"arxiv_id":"2105.15106","arxiv_id_is_arxiv":true,"paper":"/paper/a-survey-of-knowledge-tracing","title":"A Survey of Knowledge Tracing: Models, Variants, and Applications","date":"2021-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigdata-ustc/EduKTM","path":"EduKTM/AKT/AKT.py","file_url":"https://github.com/bigdata-ustc/EduKTM/blob/HEAD/EduKTM/AKT/AKT.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":"300ca17123147837","code_sha256_prefix":"300ca17123147837","mcp_get_code":{"code_sha256":"300ca17123147837"}},{"arxiv_id":"1408.5882","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"piyush2896/CNN-Text-Classifier","path":"nn/losses.py","file_url":"https://github.com/piyush2896/CNN-Text-Classifier/blob/HEAD/nn/losses.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":"d89fbd714915f9e7","code_sha256_prefix":"d89fbd714915f9e7","mcp_get_code":{"code_sha256":"d89fbd714915f9e7"}},{"arxiv_id":"1406.1222","arxiv_id_is_arxiv":true,"paper":"/paper/discovering-structure-in-high-dimensional","title":"Discovering Structure in High-Dimensional Data Through Correlation Explanation","date":"2014-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gregversteeg/corex_topic","path":"corextopic/corextopic.py","file_url":"https://github.com/gregversteeg/corex_topic/blob/HEAD/corextopic/corextopic.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"71aa163beb20ff2a","code_sha256_prefix":"71aa163beb20ff2a","mcp_get_code":{"code_sha256":"71aa163beb20ff2a"}}],"record_sha256":"803232f0a1589a0b4b873e190df17f1e5d83ae168c0b72e9b15b9482e4bdc079","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}