{"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/cumsum","entry":"cumsum","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":5,"n_papers_ran_no_instrument_failure":3,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":6,"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":1,"ran_draft_wrong":1,"ran_fixture":1,"ran":0,"unverified":1},"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":"2406.09031","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-graph-pooling-benchmark","title":"A Comprehensive Graph Pooling Benchmark: Effectiveness, Robustness and Generalizability","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goose315/graph_pooling_benchmark","path":"Regression/models/baseline.py","file_url":"https://github.com/goose315/graph_pooling_benchmark/blob/HEAD/Regression/models/baseline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, goose315/graph_pooling_benchmark when it was checked","code_sha256":"ddd7df1c4230b12d","code_sha256_prefix":"ddd7df1c4230b12d","mcp_get_code":{"code_sha256":"ddd7df1c4230b12d"}},{"arxiv_id":"2403.13795","arxiv_id_is_arxiv":true,"paper":"/paper/pyvrp-a-high-performance-vrp-solver-package","title":"PyVRP: a high-performance VRP solver package","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Valdecy/pyVRP","path":"tests/test_evaluate_distance.py","file_url":"https://github.com/Valdecy/pyVRP/blob/HEAD/tests/test_evaluate_distance.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","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, Valdecy/pyVRP when it was checked","code_sha256":"84c0d42a93002d4e","code_sha256_prefix":"84c0d42a93002d4e","mcp_get_code":{"code_sha256":"84c0d42a93002d4e"}},{"arxiv_id":"2311.07222","arxiv_id_is_arxiv":true,"paper":"/paper/neural-general-circulation-models","title":"Neural General Circulation Models for Weather and Climate","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/dinosaur","path":"dinosaur/jax_numpy_utils.py","file_url":"https://github.com/google-research/dinosaur/blob/HEAD/dinosaur/jax_numpy_utils.py","status":"unverified","verification_level":0,"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":"ace0bd2565da2c28","code_sha256_prefix":"ace0bd2565da2c28","mcp_get_code":{"code_sha256":"ace0bd2565da2c28"}},{"arxiv_id":"2307.01946","arxiv_id_is_arxiv":true,"paper":"/paper/a-synthetic-electrocardiogram-ecg-image","title":"ECG-Image-Kit: A Synthetic Image Generation Toolbox to Facilitate Deep Learning-Based Electrocardiogram Digitization","date":"2023-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alphanumericslab/ecg-image-kit","path":"codes/ecg-image-generator/HandwrittenText/generate.py","file_url":"https://github.com/alphanumericslab/ecg-image-kit/blob/HEAD/codes/ecg-image-generator/HandwrittenText/generate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9bafc68792a5453a","code_sha256_prefix":"9bafc68792a5453a","mcp_get_code":{"code_sha256":"9bafc68792a5453a"}},{"arxiv_id":"2304.06248","arxiv_id_is_arxiv":true,"paper":"/paper/lasuie-unifying-information-extraction-with","title":"LasUIE: Unifying Information Extraction with Latent Adaptive Structure-aware Generative Language Model","date":"2023-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chocowu/lasuie","path":"engine/module.py","file_url":"https://github.com/chocowu/lasuie/blob/HEAD/engine/module.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":"8e40a104d4067d24","code_sha256_prefix":"8e40a104d4067d24","mcp_get_code":{"code_sha256":"8e40a104d4067d24"}},{"arxiv_id":"1308.0850","arxiv_id_is_arxiv":true,"paper":"/paper/generating-sequences-with-recurrent-neural","title":"Generating Sequences With Recurrent Neural Networks","date":"2013-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grzego/handwriting-generation","path":"generate.py","file_url":"https://github.com/grzego/handwriting-generation/blob/HEAD/generate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9bafc68792a5453a","code_sha256_prefix":"9bafc68792a5453a","mcp_get_code":{"code_sha256":"9bafc68792a5453a"}}],"record_sha256":"0afe4a8080c93464a283d13d0a59e6fd9d6eeaece1e458257dda64e536b1edfd","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}