{"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/read-metadata","entry":"read_metadata","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":8,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":5,"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":3,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":1,"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":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":2,"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.11423","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-11423","title":"TOFU: A White-Box, Token-Efficient Agent Harness for Researchers","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"rangehow/overleaf-mcp","path":"src/overleaf_mcp/metadata.py","file_url":"https://github.com/rangehow/overleaf-mcp/blob/HEAD/src/overleaf_mcp/metadata.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7bb60ddee022c4f9","code_sha256_prefix":"7bb60ddee022c4f9","mcp_get_code":{"code_sha256":"7bb60ddee022c4f9"}},{"arxiv_id":"2601.10477","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-10477","title":"Urban Socio-Semantic Segmentation with Vision-Language Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"AMAP-ML/SocioReasoner","path":"mcore_adapter/src/mcore_adapter/checkpointing.py","file_url":"https://github.com/AMAP-ML/SocioReasoner/blob/HEAD/mcore_adapter/src/mcore_adapter/checkpointing.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ba3f7804e93d016e","code_sha256_prefix":"ba3f7804e93d016e","mcp_get_code":{"code_sha256":"ba3f7804e93d016e"}},{"arxiv_id":"2601.05051","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-05051","title":"Publishing FAIR and Machine-actionable Reviews in Materials Science: The Case for Symbolic Knowledge in Neuro-symbolic Artificial Intelligence","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"sciknoworg/ald-ale-orkg-review","path":"llm-experiments/nl_query_generator_csv_onetable.py","file_url":"https://github.com/sciknoworg/ald-ale-orkg-review/blob/HEAD/llm-experiments/nl_query_generator_csv_onetable.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":"e240e56048532d2e","code_sha256_prefix":"e240e56048532d2e","mcp_get_code":{"code_sha256":"e240e56048532d2e"}},{"arxiv_id":"2412.02967","arxiv_id_is_arxiv":true,"paper":"/paper/a-graph-neural-network-approach-to-dispersed","title":"A Graph Neural Network Simulation of Dispersed Systems","date":null,"month_inferred_from_arxiv_id":"2024-12","title_source":"archive","repo":"rfjd/GNS-DispersedSystems","path":"gns/reading_utils.py","file_url":"https://github.com/rfjd/GNS-DispersedSystems/blob/HEAD/gns/reading_utils.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, rfjd/GNS-DispersedSystems when it was checked","code_sha256":"a21c8d26e73666c4","code_sha256_prefix":"a21c8d26e73666c4","mcp_get_code":{"code_sha256":"a21c8d26e73666c4"}},{"arxiv_id":"2411.05361","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-superb-phase-2-a-collaboratively","title":"Dynamic-SUPERB Phase-2: A Collaboratively Expanding Benchmark for Measuring the Capabilities of Spoken Language Models with 180 Tasks","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dynamic-superb/dynamic-superb","path":"api/inference/utils.py","file_url":"https://github.com/dynamic-superb/dynamic-superb/blob/HEAD/api/inference/utils.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, dynamic-superb/dynamic-superb when it was checked","code_sha256":"57a3262c8df51fb4","code_sha256_prefix":"57a3262c8df51fb4","mcp_get_code":{"code_sha256":"57a3262c8df51fb4"}},{"arxiv_id":"2408.08926","arxiv_id_is_arxiv":true,"paper":"/paper/cybench-a-framework-for-evaluating","title":"Cybench: A Framework for Evaluating Cybersecurity Capabilities and Risks of Language Models","date":"2024-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andyzorigin/cyber-bench","path":"run_task.py","file_url":"https://github.com/andyzorigin/cyber-bench/blob/HEAD/run_task.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":"313007004d0ed238","code_sha256_prefix":"313007004d0ed238","mcp_get_code":{"code_sha256":"313007004d0ed238"}},{"arxiv_id":"2308.13418","arxiv_id_is_arxiv":true,"paper":"/paper/nougat-neural-optical-understanding-for","title":"Nougat: Neural Optical Understanding for Academic Documents","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/nougat","path":"nougat/dataset/create_index.py","file_url":"https://github.com/facebookresearch/nougat/blob/HEAD/nougat/dataset/create_index.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f21b5c9669b038e1","code_sha256_prefix":"f21b5c9669b038e1","mcp_get_code":{"code_sha256":"f21b5c9669b038e1"}},{"arxiv_id":"1609.04747","arxiv_id_is_arxiv":true,"paper":"/paper/an-overview-of-gradient-descent-optimization","title":"An overview of gradient descent optimization algorithms","date":"2016-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biocore/songbird","path":"songbird/util.py","file_url":"https://github.com/biocore/songbird/blob/HEAD/songbird/util.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":"34cfd615f5f453a1","code_sha256_prefix":"34cfd615f5f453a1","mcp_get_code":{"code_sha256":"34cfd615f5f453a1"}}],"record_sha256":"b005b85e2de29404026caa08feac2e16d13a43b86fcf82282f1b3bd7b14aef9d","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}