{"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/decompose","entry":"decompose","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":4,"n_papers_ran_no_instrument_failure":2,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":7,"n_places_pointer_only":1,"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":1,"ran_fixture":1,"ran":3,"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":"2502.12018","arxiv_id_is_arxiv":true,"paper":"/paper/atom-of-thoughts-for-markov-llm-test-time","title":"Atom of Thoughts for Markov LLM Test-Time Scaling","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qixucen/atom","path":"experiment/module.py","file_url":"https://github.com/qixucen/atom/blob/HEAD/experiment/module.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":"2b8187ac5aea3e87","code_sha256_prefix":"2b8187ac5aea3e87","mcp_get_code":{"code_sha256":"2b8187ac5aea3e87"}},{"arxiv_id":"2406.04331","arxiv_id_is_arxiv":true,"paper":"/paper/pace-parsimonious-concept-engineering-for","title":"PaCE: Parsimonious Concept Engineering for Large Language Models","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peterljq/parsimonious-concept-engineering","path":"sparse_coding.py","file_url":"https://github.com/peterljq/parsimonious-concept-engineering/blob/HEAD/sparse_coding.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, peterljq/parsimonious-concept-engineering when it was checked","code_sha256":"e4d47767b43867ce","code_sha256_prefix":"e4d47767b43867ce","mcp_get_code":{"code_sha256":"e4d47767b43867ce"}},{"arxiv_id":"2303.02984","arxiv_id_is_arxiv":true,"paper":"/paper/learning-multi-scale-local-conditional","title":"Learning multi-scale local conditional probability models of images","date":"2023-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"labforcomputationalvision/local-probability-models-of-images","path":"code/wavelet_func.py","file_url":"https://github.com/labforcomputationalvision/local-probability-models-of-images/blob/HEAD/code/wavelet_func.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":"ed636e6ae81c20f6","code_sha256_prefix":"ed636e6ae81c20f6","mcp_get_code":{"code_sha256":"ed636e6ae81c20f6"}},{"arxiv_id":"1901.09458","arxiv_id_is_arxiv":true,"paper":"/paper/learning-transformation-synchronization","title":"Learning Transformation Synchronization","date":"2019-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiangruhuang/Learning2Sync","path":"util.py","file_url":"https://github.com/xiangruhuang/Learning2Sync/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e4351cfa4999bac","code_sha256_prefix":"2e4351cfa4999bac","mcp_get_code":{"code_sha256":"2e4351cfa4999bac"}},{"arxiv_id":"1601.07601","arxiv_id_is_arxiv":true,"paper":"/paper/improved-classical-simulation-of-quantum","title":"Improved classical simulation of quantum circuits dominated by Clifford gates","date":null,"month_inferred_from_arxiv_id":"2016-01","title_source":"archive","repo":"patrickrall/CircuitSimulator","path":"libcirc/probability.py","file_url":"https://github.com/patrickrall/CircuitSimulator/blob/HEAD/libcirc/probability.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b78680abcf1f2fbe","code_sha256_prefix":"b78680abcf1f2fbe","mcp_get_code":{"code_sha256":"b78680abcf1f2fbe"}},{"arxiv_id":"aaai_25588","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25588","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wdimmy/Var2Vec","path":"kbc/models.py","file_url":"https://github.com/wdimmy/Var2Vec/blob/HEAD/kbc/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"03779c726e7da376","code_sha256_prefix":"03779c726e7da376","mcp_get_code":{"code_sha256":"03779c726e7da376"}},{"arxiv_id":"aaai_25588","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25588","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wdimmy/Var2Vec","path":"kbc/models_copy.py","file_url":"https://github.com/wdimmy/Var2Vec/blob/HEAD/kbc/models_copy.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4e73d2c0d40d7cd7","code_sha256_prefix":"4e73d2c0d40d7cd7","mcp_get_code":{"code_sha256":"4e73d2c0d40d7cd7"}}],"record_sha256":"22e877b239e44e537fe9cebd87a182e9e44c385745f27bd4954c507e89e34988","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}