{"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/segment","entry":"segment","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":11,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":7,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":13,"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":0,"ran_violates":0,"ran_draft_wrong":3,"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":"2607.17765","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-17765","title":"FIFA World Cup 2026 as a Contamination-Free Benchmark for LLM Forecasting Agents: Four Models, a Bookmaker, and 104 Matches","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"graphuofm/FIFA2026LLM","path":"src/build_dataset.py","file_url":"https://github.com/graphuofm/FIFA2026LLM/blob/HEAD/src/build_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, graphuofm/FIFA2026LLM (NOASSERTION)","code_sha256":"6dbe8c9dd2853563","code_sha256_prefix":"6dbe8c9dd2853563","mcp_get_code":{"code_sha256":"6dbe8c9dd2853563"}},{"arxiv_id":"2606.29067","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-29067","title":"ThinkProbe: Beyond Accuracy -Structural Profiling of Open-Ended LLM Reasoning Traces via Non-Generative Thought Graphs *","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"kmamine/ThinkProb","path":"src/thinkbench/extract/segmenter.py","file_url":"https://github.com/kmamine/ThinkProb/blob/HEAD/src/thinkbench/extract/segmenter.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, kmamine/ThinkProb when it was checked","code_sha256":"dfd81d5834829083","code_sha256_prefix":"dfd81d5834829083","mcp_get_code":{"code_sha256":"dfd81d5834829083"}},{"arxiv_id":"2602.01951","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-01951","title":"Enabling Progressive Whole-slide Image Analysis with Multi-scale Pyramidal Network","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"mahmoodlab/CLAM","path":"create_patches.py","file_url":"https://github.com/mahmoodlab/CLAM/blob/HEAD/create_patches.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, mahmoodlab/CLAM, is not in the permissive set Syntology serves inline","code_sha256":"a63b7288bd08c89e","code_sha256_prefix":"a63b7288bd08c89e","mcp_get_code":{"code_sha256":"a63b7288bd08c89e"}},{"arxiv_id":"2602.01951","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-01951","title":"Enabling Progressive Whole-slide Image Analysis with Multi-scale Pyramidal Network","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"CraigMyles/SurGen-Dataset","path":"reproducibility/create_patches.py","file_url":"https://github.com/CraigMyles/SurGen-Dataset/blob/HEAD/reproducibility/create_patches.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, CraigMyles/SurGen-Dataset, is not in the permissive set Syntology serves inline","code_sha256":"2d44fb6699a9a708","code_sha256_prefix":"2d44fb6699a9a708","mcp_get_code":{"code_sha256":"2d44fb6699a9a708"}},{"arxiv_id":"2505.17982","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2505.17982","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":null,"repo":"bryanwong17/HiVE-MIL","path":"create_patches_fp.py","file_url":"https://github.com/bryanwong17/HiVE-MIL/blob/HEAD/create_patches_fp.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":"a63b7288bd08c89e","code_sha256_prefix":"a63b7288bd08c89e","mcp_get_code":{"code_sha256":"a63b7288bd08c89e"}},{"arxiv_id":"2406.15303","arxiv_id_is_arxiv":true,"paper":"/paper/adr-attention-diversification-regularization","title":"AEM: Attention Entropy Maximization for Multiple Instance Learning based Whole Slide Image Classification","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dazhangyu123/adr","path":"Step1_create_patches_fp.py","file_url":"https://github.com/dazhangyu123/adr/blob/HEAD/Step1_create_patches_fp.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, dazhangyu123/adr when it was checked","code_sha256":"a63b7288bd08c89e","code_sha256_prefix":"a63b7288bd08c89e","mcp_get_code":{"code_sha256":"a63b7288bd08c89e"}},{"arxiv_id":"2406.07502","arxiv_id_is_arxiv":true,"paper":"/paper/image-textualization-an-automatic-framework","title":"Image Textualization: An Automatic Framework for Creating Accurate and Detailed Image Descriptions","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sterzhang/image-textualization","path":"fg_annotation/mask_depth.py","file_url":"https://github.com/sterzhang/image-textualization/blob/HEAD/fg_annotation/mask_depth.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, sterzhang/image-textualization when it was checked","code_sha256":"f4b4c6887ee82c05","code_sha256_prefix":"f4b4c6887ee82c05","mcp_get_code":{"code_sha256":"f4b4c6887ee82c05"}},{"arxiv_id":"2404.13222","arxiv_id_is_arxiv":true,"paper":"/paper/vim4path-self-supervised-vision-mamba-for","title":"Vim4Path: Self-Supervised Vision Mamba for Histopathology Images","date":"2024-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"atlasanalyticslab/vim4path","path":"preprocess/create_patches_fp.py","file_url":"https://github.com/atlasanalyticslab/vim4path/blob/HEAD/preprocess/create_patches_fp.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":"2d44fb6699a9a708","code_sha256_prefix":"2d44fb6699a9a708","mcp_get_code":{"code_sha256":"2d44fb6699a9a708"}},{"arxiv_id":"2311.07125","arxiv_id_is_arxiv":true,"paper":"/paper/attention-challenging-multiple-instance","title":"Attention-Challenging Multiple Instance Learning for Whole Slide Image Classification","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dazhangyu123/acmil","path":"Step1_create_patches_fp.py","file_url":"https://github.com/dazhangyu123/acmil/blob/HEAD/Step1_create_patches_fp.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":"a63b7288bd08c89e","code_sha256_prefix":"a63b7288bd08c89e","mcp_get_code":{"code_sha256":"a63b7288bd08c89e"}},{"arxiv_id":"2106.10466","arxiv_id_is_arxiv":true,"paper":"/paper/learning-timestamp-level-representations-for","title":"TS2Vec: Towards Universal Representation of Time Series","date":"2021-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xingyu617/SimTS_Representation_Learning","path":"simts.py","file_url":"https://github.com/xingyu617/SimTS_Representation_Learning/blob/HEAD/simts.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c11f79ab12e7b749","code_sha256_prefix":"c11f79ab12e7b749","mcp_get_code":{"code_sha256":"c11f79ab12e7b749"}},{"arxiv_id":"2106.02039","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-as-one-big-sequence","title":"Offline Reinforcement Learning as One Big Sequence Modeling Problem","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JannerM/trajectory-transformer","path":"trajectory/datasets/sequence.py","file_url":"https://github.com/JannerM/trajectory-transformer/blob/HEAD/trajectory/datasets/sequence.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":"48bd963796baa6f4","code_sha256_prefix":"48bd963796baa6f4","mcp_get_code":{"code_sha256":"48bd963796baa6f4"}},{"arxiv_id":"2106.02039","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-as-one-big-sequence","title":"Offline Reinforcement Learning as One Big Sequence Modeling Problem","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"howuhh/faster-trajectory-transformer","path":"trajectory/datasets/d4rl_dataset.py","file_url":"https://github.com/howuhh/faster-trajectory-transformer/blob/HEAD/trajectory/datasets/d4rl_dataset.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":"53c137a7abd88735","code_sha256_prefix":"53c137a7abd88735","mcp_get_code":{"code_sha256":"53c137a7abd88735"}},{"arxiv_id":"1906.02762","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-improving-transformer-from","title":"Understanding and Improving Transformer From a Multi-Particle Dynamic System Point of View","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuohan123/macaron-net","path":"bert/macaron-scripts/bert/segment_sentence.py","file_url":"https://github.com/zhuohan123/macaron-net/blob/HEAD/bert/macaron-scripts/bert/segment_sentence.py","status":"unverified","verification_level":0,"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":"434459caeb5fdaf7","code_sha256_prefix":"434459caeb5fdaf7","mcp_get_code":{"code_sha256":"434459caeb5fdaf7"}}],"record_sha256":"a02746d82208ec09bb7ec7b4f54a6fc6c12998aa5719be15d0c953065e1aec8d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}