{"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/get-num","entry":"get_num","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":6,"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":2,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"unverified":0},"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":"2607.05095","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-05095","title":"FAST: A Holistic Framework for Optimizing Memory-I/O, Computation, and Sampling in Temporal GNN Training","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"NoneBone/FAST","path":"fast_util/slimCache.py","file_url":"https://github.com/NoneBone/FAST/blob/HEAD/fast_util/slimCache.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, NoneBone/FAST when it was checked","code_sha256":"eec25ad0af035d22","code_sha256_prefix":"eec25ad0af035d22","mcp_get_code":{"code_sha256":"eec25ad0af035d22"}},{"arxiv_id":"2509.23713","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-23713","title":"Text-to-Code Generation for Modular Building Layouts in Building Information Modeling","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"CI3LAB/Text2MBL","path":"Data_and_code/utils/fully_synthetic.py","file_url":"https://github.com/CI3LAB/Text2MBL/blob/HEAD/Data_and_code/utils/fully_synthetic.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CI3LAB/Text2MBL when it was checked","code_sha256":"4853296eefcf01c5","code_sha256_prefix":"4853296eefcf01c5","mcp_get_code":{"code_sha256":"4853296eefcf01c5"}},{"arxiv_id":"2507.01630","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.01630","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"YuxiaoWang-AI/P3HOT","path":"show_loss.py","file_url":"https://github.com/YuxiaoWang-AI/P3HOT/blob/HEAD/show_loss.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, YuxiaoWang-AI/P3HOT when it was checked","code_sha256":"ff028915ad364293","code_sha256_prefix":"ff028915ad364293","mcp_get_code":{"code_sha256":"ff028915ad364293"}},{"arxiv_id":"2503.07604","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-reasoning-in-transformers-is","title":"Implicit Reasoning in Transformers is Reasoning through Shortcuts","date":"2025-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TianheL/LM-Implicit-Reasoning","path":"src/testllm/gen_testdata.py","file_url":"https://github.com/TianheL/LM-Implicit-Reasoning/blob/HEAD/src/testllm/gen_testdata.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":"eb2b917ac6fc018f","code_sha256_prefix":"eb2b917ac6fc018f","mcp_get_code":{"code_sha256":"eb2b917ac6fc018f"}},{"arxiv_id":"2404.14355","arxiv_id_is_arxiv":true,"paper":"/paper/calc-cmu-at-semeval-2024-task-7-pre-calc","title":"Pre-Calc: Learning to Use the Calculator Improves Numeracy in Language Models","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"calc-cmu/pre-calc","path":"Encoder-Decoder/train_flanT5.py","file_url":"https://github.com/calc-cmu/pre-calc/blob/HEAD/Encoder-Decoder/train_flanT5.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, calc-cmu/pre-calc when it was checked","code_sha256":"6f7875da1c9943da","code_sha256_prefix":"6f7875da1c9943da","mcp_get_code":{"code_sha256":"6f7875da1c9943da"}},{"arxiv_id":"2402.01729","arxiv_id_is_arxiv":true,"paper":"/paper/contextualization-distillation-from-large","title":"Contextualization Distillation from Large Language Model for Knowledge Graph Completion","date":"2024-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"David-Li0406/Contextulization-Distillation","path":"CSProm-KG/helper.py","file_url":"https://github.com/David-Li0406/Contextulization-Distillation/blob/HEAD/CSProm-KG/helper.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, David-Li0406/Contextulization-Distillation when it was checked","code_sha256":"e74966ca8692821c","code_sha256_prefix":"e74966ca8692821c","mcp_get_code":{"code_sha256":"e74966ca8692821c"}},{"arxiv_id":"2402.01729","arxiv_id_is_arxiv":true,"paper":"/paper/contextualization-distillation-from-large","title":"Contextualization Distillation from Large Language Model for Knowledge Graph Completion","date":"2024-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"David-Li0406/Contextulization-Distillation","path":"KG-S2S/helper.py","file_url":"https://github.com/David-Li0406/Contextulization-Distillation/blob/HEAD/KG-S2S/helper.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, David-Li0406/Contextulization-Distillation when it was checked","code_sha256":"effa50b5db3f0b19","code_sha256_prefix":"effa50b5db3f0b19","mcp_get_code":{"code_sha256":"effa50b5db3f0b19"}},{"arxiv_id":"2106.03375","arxiv_id_is_arxiv":true,"paper":"/paper/commutative-lie-group-vae-for-disentanglement","title":"Commutative Lie Group VAE for Disentanglement Learning","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuxinqimac/CommutativeLieGroupVAE-Pytorch","path":"collect_results.py","file_url":"https://github.com/zhuxinqimac/CommutativeLieGroupVAE-Pytorch/blob/HEAD/collect_results.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":"049a2844665499ee","code_sha256_prefix":"049a2844665499ee","mcp_get_code":{"code_sha256":"049a2844665499ee"}}],"record_sha256":"a2f0bbb891fe9203f04d46890be3a772376170b18de3e2fac4503e927d0d4b8c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}