{"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/configure-logger","entry":"configure_logger","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":4,"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":3,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":9,"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":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"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":"2603.15467","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-15467","title":"Evaluating Time Awareness and Cross-modal Active Perception of Large Models via 4D Escape Room Task","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"THUNLP-MT/EscapeCraft-4D","path":"src/log_config.py","file_url":"https://github.com/THUNLP-MT/EscapeCraft-4D/blob/HEAD/src/log_config.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2a2fd003bfd35764","code_sha256_prefix":"2a2fd003bfd35764","mcp_get_code":{"code_sha256":"2a2fd003bfd35764"}},{"arxiv_id":"2603.07402","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-07402","title":"Generalizing Linear Autoencoder Recommenders with Decoupled Expected Quadratic Loss","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"coderaBruce/DEQL","path":"utils/log_helper.py","file_url":"https://github.com/coderaBruce/DEQL/blob/HEAD/utils/log_helper.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"63e9ef83b30fb6fc","code_sha256_prefix":"63e9ef83b30fb6fc","mcp_get_code":{"code_sha256":"63e9ef83b30fb6fc"}},{"arxiv_id":"2407.07544","arxiv_id_is_arxiv":true,"paper":"/paper/disentangling-masked-autoencoders-for","title":"Disentangling Masked Autoencoders for Unsupervised Domain Generalization","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rookiehb/dismae","path":"logs/configuration.py","file_url":"https://github.com/rookiehb/dismae/blob/HEAD/logs/configuration.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, rookiehb/dismae when it was checked","code_sha256":"dbe4205f496b97ee","code_sha256_prefix":"dbe4205f496b97ee","mcp_get_code":{"code_sha256":"dbe4205f496b97ee"}},{"arxiv_id":"2404.02204","arxiv_id_is_arxiv":true,"paper":"/paper/emergent-abilities-in-reduced-scale","title":"Emergent Abilities in Reduced-Scale Generative Language Models","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"text-machine-lab/mini_gpt","path":"src/logging_config.py","file_url":"https://github.com/text-machine-lab/mini_gpt/blob/HEAD/src/logging_config.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, text-machine-lab/mini_gpt when it was checked","code_sha256":"060de65e98d13c2f","code_sha256_prefix":"060de65e98d13c2f","mcp_get_code":{"code_sha256":"060de65e98d13c2f"}},{"arxiv_id":"2311.06233","arxiv_id_is_arxiv":true,"paper":"/paper/data-contamination-quiz-a-tool-to-detect-and","title":"Data Contamination Quiz: A Tool to Detect and Estimate Contamination in Large Language Models","date":"2023-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shahriargolchin/dcq","path":"src/helpers/logging_config.py","file_url":"https://github.com/shahriargolchin/dcq/blob/HEAD/src/helpers/logging_config.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":"aa8eed3cb8bda704","code_sha256_prefix":"aa8eed3cb8bda704","mcp_get_code":{"code_sha256":"aa8eed3cb8bda704"}},{"arxiv_id":"2302.14534","arxiv_id_is_arxiv":true,"paper":"/paper/spacerini-plug-and-play-search-engines-with","title":"Spacerini: Plug-and-play Search Engines with Pyserini and Hugging Face","date":"2023-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cookiecutter/cookiecutter","path":"cookiecutter/log.py","file_url":"https://github.com/cookiecutter/cookiecutter/blob/HEAD/cookiecutter/log.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":"c6962210cf21de5d","code_sha256_prefix":"c6962210cf21de5d","mcp_get_code":{"code_sha256":"c6962210cf21de5d"}},{"arxiv_id":"2210.01776","arxiv_id_is_arxiv":true,"paper":"/paper/diffdock-diffusion-steps-twists-and-turns-for","title":"DiffDock: Diffusion Steps, Twists, and Turns for Molecular Docking","date":"2022-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gcorso/diffdock","path":"utils/sampling.py","file_url":"https://github.com/gcorso/diffdock/blob/HEAD/utils/sampling.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":"b5238b72be31068a","code_sha256_prefix":"b5238b72be31068a","mcp_get_code":{"code_sha256":"b5238b72be31068a"}},{"arxiv_id":"1904.02142","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-latent-tree-induction-with-deep","title":"Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Autoencoders","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rgalhama/diora","path":"pytorch/diora/logging/configuration.py","file_url":"https://github.com/rgalhama/diora/blob/HEAD/pytorch/diora/logging/configuration.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":"eafe1b97157e9ce2","code_sha256_prefix":"eafe1b97157e9ce2","mcp_get_code":{"code_sha256":"eafe1b97157e9ce2"}},{"arxiv_id":"Wang_How_Do_Multimodal_Large_Language_Models_Handle_Complex_Multimodal_Reasoning_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_How_Do_Multimodal_Large_Language_Models_Handle_Complex_Multimodal_Reasoning_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"THUNLP-MT/EscapeCraft","path":"src/log_config.py","file_url":"https://github.com/THUNLP-MT/EscapeCraft/blob/HEAD/src/log_config.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2a2fd003bfd35764","code_sha256_prefix":"2a2fd003bfd35764","mcp_get_code":{"code_sha256":"2a2fd003bfd35764"}}],"record_sha256":"b5357e72c74af1cbabadcc5a5569c17962cfc85cd8b485d7c59b214647ac4771","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}